About the Execution of LTSMin+red for PolyORBLF-PT-S02J06T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5105.176 | 161763.00 | 214349.00 | 84.80 | FFTT?TTTTTTFTTFT | 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-171654446700263.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-PT-S02J06T10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700263
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 34K Apr 11 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Apr 11 17:07 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 14K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 223K Apr 11 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M 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-PT-S02J06T10-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717253465834
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:51:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:51:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:51:07] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-06-01 14:51:07] [INFO ] Transformed 844 places.
[2024-06-01 14:51:07] [INFO ] Transformed 1812 transitions.
[2024-06-01 14:51:07] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 14:51:07] [INFO ] Reduced 10 identical enabling conditions.
[2024-06-01 14:51:07] [INFO ] Reduced 110 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
RANDOM walk for 40000 steps (9 resets) in 1654 ms. (24 steps per ms) remains 5/16 properties
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (9 resets) in 1014 ms. (39 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (11 resets) in 1496 ms. (26 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 1562 ms. (25 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 732 ms. (54 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (10 resets) in 404 ms. (98 steps per ms) remains 5/5 properties
[2024-06-01 14:51:09] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-06-01 14:51:09] [INFO ] Computed 58 invariants in 73 ms
[2024-06-01 14:51:09] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 91/642 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/642 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 13/655 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/655 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-01 is UNSAT
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-07 is UNSAT
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-10 is UNSAT
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 189/844 variables, 34/58 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 0/58 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2476/2476 variables, and 902 constraints, problems are : Problem set: 3 solved, 2 unsolved in 5056 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 844/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 158/541 variables, 10/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/541 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 13/554 variables, 2/13 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 1/14 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 290/844 variables, 44/58 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-06-01 14:51:17] [INFO ] Deduced a trap composed of 73 places in 202 ms of which 39 ms to minimize.
[2024-06-01 14:51:17] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 2/60 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2476/2476 variables, and 904 constraints, problems are : Problem set: 3 solved, 2 unsolved in 4693 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 844/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 11459ms problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 383 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 842 transition count 1642
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 22 place count 832 transition count 1572
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 162 place count 762 transition count 1572
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 752 transition count 1562
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 202 place count 742 transition count 1552
Applied a total of 202 rules in 425 ms. Remains 742 /844 variables (removed 102) and now considering 1552/1652 (removed 100) transitions.
Running 1550 sub problems to find dead transitions.
[2024-06-01 14:51:21] [INFO ] Flow matrix only has 1532 transitions (discarded 20 similar events)
// Phase 1: matrix 1532 rows 742 cols
[2024-06-01 14:51:21] [INFO ] Computed 56 invariants in 63 ms
[2024-06-01 14:51:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 1550 unsolved
[2024-06-01 14:51:39] [INFO ] Deduced a trap composed of 63 places in 227 ms of which 3 ms to minimize.
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 4 ms to minimize.
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 2 ms to minimize.
[2024-06-01 14:51:40] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:51:41] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:51:41] [INFO ] Deduced a trap composed of 317 places in 418 ms of which 5 ms to minimize.
[2024-06-01 14:51:41] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:51:41] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:51:42] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:51:43] [INFO ] Deduced a trap composed of 204 places in 449 ms of which 5 ms to minimize.
[2024-06-01 14:51:43] [INFO ] Deduced a trap composed of 193 places in 462 ms of which 5 ms to minimize.
[2024-06-01 14:51:45] [INFO ] Deduced a trap composed of 326 places in 490 ms of which 5 ms to minimize.
SMT process timed out in 23289ms, After SMT, problems are : Problem set: 0 solved, 1550 unsolved
Search for dead transitions found 0 dead transitions in 23330ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23801 ms. Remains : 742/844 places, 1552/1652 transitions.
RANDOM walk for 40000 steps (10 resets) in 837 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 898 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 993 ms. (40 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 70327 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 70327 steps, saw 43438 distinct states, run finished after 3012 ms. (steps per millisecond=23 ) properties seen :0
[2024-06-01 14:51:49] [INFO ] Flow matrix only has 1532 transitions (discarded 20 similar events)
[2024-06-01 14:51:49] [INFO ] Invariant cache hit.
[2024-06-01 14:51:49] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/383 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/383 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 117/500 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/515 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-00 is UNSAT
FORMULA PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 226/741 variables, 39/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/742 variables, 1/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/742 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1532/2274 variables, 742/798 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2274 variables, 120/918 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2274 variables, 0/918 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2274 variables, 0/918 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2274/2274 variables, and 918 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5067 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 742/742 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 187/321 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/325 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 401/726 variables, 38/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/730 variables, 4/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/730 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/742 variables, 3/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1532/2274 variables, 742/798 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2274 variables, 120/918 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2274 variables, 1/919 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2274 variables, 0/919 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2274 variables, 0/919 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2274/2274 variables, and 919 constraints, problems are : Problem set: 1 solved, 1 unsolved in 8811 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 742/742 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 14408ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 238 ms.
Support contains 134 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1552/1552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 742 transition count 1532
Reduce places removed 20 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 40 rules applied. Total rules applied 60 place count 722 transition count 1512
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 80 place count 702 transition count 1512
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 80 place count 702 transition count 1472
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 160 place count 662 transition count 1472
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 240 place count 622 transition count 1432
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 250 place count 622 transition count 1422
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 260 place count 612 transition count 1422
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 270 place count 612 transition count 1422
Applied a total of 270 rules in 225 ms. Remains 612 /742 variables (removed 130) and now considering 1422/1552 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 612/742 places, 1422/1552 transitions.
RANDOM walk for 40000 steps (12 resets) in 513 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1290 ms. (30 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 125268 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 1
Probabilistic random walk after 125268 steps, saw 79049 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
[2024-06-01 14:52:07] [INFO ] Flow matrix only has 1402 transitions (discarded 20 similar events)
// Phase 1: matrix 1402 rows 612 cols
[2024-06-01 14:52:07] [INFO ] Computed 56 invariants in 49 ms
[2024-06-01 14:52:07] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 180/314 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/318 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 278/596 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/600 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/612 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/612 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1402/2014 variables, 612/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2014 variables, 120/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2014 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2014 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2014/2014 variables, and 788 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4647 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 612/612 constraints, ReadFeed: 120/120 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/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 180/314 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/318 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 278/596 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/600 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/612 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:52:13] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:52:14] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:52:14] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:52:14] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:52:14] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/612 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/612 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1402/2014 variables, 612/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2014 variables, 120/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2014 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:52:21] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2014 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2014 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/2014 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2014/2014 variables, and 795 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11912 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 612/612 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 16849ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1251 ms.
Support contains 134 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1422/1422 transitions.
Applied a total of 0 rules in 23 ms. Remains 612 /612 variables (removed 0) and now considering 1422/1422 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 612/612 places, 1422/1422 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1422/1422 transitions.
Applied a total of 0 rules in 25 ms. Remains 612 /612 variables (removed 0) and now considering 1422/1422 (removed 0) transitions.
[2024-06-01 14:52:25] [INFO ] Flow matrix only has 1402 transitions (discarded 20 similar events)
[2024-06-01 14:52:25] [INFO ] Invariant cache hit.
[2024-06-01 14:52:26] [INFO ] Implicit Places using invariants in 598 ms returned [72, 148, 183, 327, 380, 412, 415, 457, 578, 610]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 604 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 602/612 places, 1422/1422 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 593 transition count 1413
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 593 transition count 1413
Applied a total of 18 rules in 52 ms. Remains 593 /602 variables (removed 9) and now considering 1413/1422 (removed 9) transitions.
[2024-06-01 14:52:26] [INFO ] Flow matrix only has 1393 transitions (discarded 20 similar events)
// Phase 1: matrix 1393 rows 593 cols
[2024-06-01 14:52:26] [INFO ] Computed 46 invariants in 18 ms
[2024-06-01 14:52:26] [INFO ] Implicit Places using invariants in 626 ms returned []
[2024-06-01 14:52:26] [INFO ] Flow matrix only has 1393 transitions (discarded 20 similar events)
[2024-06-01 14:52:26] [INFO ] Invariant cache hit.
[2024-06-01 14:52:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:52:36] [INFO ] Implicit Places using invariants and state equation in 10086 ms returned []
Implicit Place search using SMT with State Equation took 10715 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 593/612 places, 1413/1422 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11397 ms. Remains : 593/612 places, 1413/1422 transitions.
RANDOM walk for 40001 steps (18 resets) in 398 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (10 resets) in 797 ms. (50 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 148237 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 1
Probabilistic random walk after 148237 steps, saw 91455 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-06-01 14:52:40] [INFO ] Flow matrix only has 1393 transitions (discarded 20 similar events)
[2024-06-01 14:52:40] [INFO ] Invariant cache hit.
[2024-06-01 14:52:40] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 157/291 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/297 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 281/578 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/581 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/593 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1393/1986 variables, 593/639 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1986 variables, 120/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1986 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1986 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1986/1986 variables, and 759 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2858 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 593/593 constraints, ReadFeed: 120/120 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/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 157/291 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/297 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 281/578 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/581 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/593 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:52:44] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1393/1986 variables, 593/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1986 variables, 120/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1986 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1986 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1986 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1986/1986 variables, and 761 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8164 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 593/593 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 11214ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 782 ms.
Support contains 134 out of 593 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1413/1413 transitions.
Applied a total of 0 rules in 30 ms. Remains 593 /593 variables (removed 0) and now considering 1413/1413 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 593/593 places, 1413/1413 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 593/593 places, 1413/1413 transitions.
Applied a total of 0 rules in 24 ms. Remains 593 /593 variables (removed 0) and now considering 1413/1413 (removed 0) transitions.
[2024-06-01 14:52:52] [INFO ] Flow matrix only has 1393 transitions (discarded 20 similar events)
[2024-06-01 14:52:52] [INFO ] Invariant cache hit.
[2024-06-01 14:52:53] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-06-01 14:52:53] [INFO ] Flow matrix only has 1393 transitions (discarded 20 similar events)
[2024-06-01 14:52:53] [INFO ] Invariant cache hit.
[2024-06-01 14:52:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:53:03] [INFO ] Implicit Places using invariants and state equation in 10028 ms returned []
Implicit Place search using SMT with State Equation took 10695 ms to find 0 implicit places.
[2024-06-01 14:53:03] [INFO ] Redundant transitions in 105 ms returned []
Running 1411 sub problems to find dead transitions.
[2024-06-01 14:53:03] [INFO ] Flow matrix only has 1393 transitions (discarded 20 similar events)
[2024-06-01 14:53:03] [INFO ] Invariant cache hit.
[2024-06-01 14:53:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/591 variables, 29/44 constraints. Problems are: Problem set: 0 solved, 1411 unsolved
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2024-06-01 14:53:16] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:53:17] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:53:17] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:53:17] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:53:17] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:53:17] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:53:17] [INFO ] Deduced a trap composed of 50 places in 375 ms of which 5 ms to minimize.
[2024-06-01 14:53:18] [INFO ] Deduced a trap composed of 216 places in 372 ms of which 7 ms to minimize.
[2024-06-01 14:53:18] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 2 ms to minimize.
[2024-06-01 14:53:19] [INFO ] Deduced a trap composed of 228 places in 405 ms of which 4 ms to minimize.
[2024-06-01 14:53:20] [INFO ] Deduced a trap composed of 72 places in 365 ms of which 4 ms to minimize.
[2024-06-01 14:53:20] [INFO ] Deduced a trap composed of 89 places in 307 ms of which 5 ms to minimize.
[2024-06-01 14:53:22] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 4 ms to minimize.
[2024-06-01 14:53:26] [INFO ] Deduced a trap composed of 242 places in 296 ms of which 3 ms to minimize.
[2024-06-01 14:53:30] [INFO ] Deduced a trap composed of 392 places in 360 ms of which 4 ms to minimize.
[2024-06-01 14:53:36] [INFO ] Deduced a trap composed of 267 places in 358 ms of which 4 ms to minimize.
SMT process timed out in 32834ms, After SMT, problems are : Problem set: 0 solved, 1411 unsolved
Search for dead transitions found 0 dead transitions in 32850ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43689 ms. Remains : 593/593 places, 1413/1413 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 593 transition count 1393
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 593 transition count 1373
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 60 place count 593 transition count 1353
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 80 place count 573 transition count 1353
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 90 place count 573 transition count 1343
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 100 place count 563 transition count 1343
Applied a total of 100 rules in 95 ms. Remains 563 /593 variables (removed 30) and now considering 1343/1413 (removed 70) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1343 rows 563 cols
[2024-06-01 14:53:36] [INFO ] Computed 46 invariants in 40 ms
[2024-06-01 14:53:36] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-06-01 14:53:36] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 31 ms returned sat
[2024-06-01 14:53:36] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 14:53:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-06-01 14:53:36] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 27 ms returned sat
[2024-06-01 14:53:40] [INFO ] After 3800ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 14:53:43] [INFO ] After 6980ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 14:53:46] [INFO ] After 10276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 10765 ms.
[2024-06-01 14:53:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2024-06-01 14:53:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 593 places, 1413 transitions and 6733 arcs took 22 ms.
[2024-06-01 14:53:47] [INFO ] Flatten gal took : 213 ms
Total runtime 160118 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 : PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-04
BK_STOP 1717253627597
--------------------
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 PolyORBLF-PT-S02J06T10-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/729/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J06T10"
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-PT-S02J06T10, 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-171654446700263"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T10.tgz
mv PolyORBLF-PT-S02J06T10 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 ;