About the Execution of LTSMin+red for ASLink-PT-02a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 746.304 | 322917.00 | 492559.00 | 738.20 | TFTTTF?F?TTF?FTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r464-smll-171620117700030.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-02a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117700030
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 279K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717183217983
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:20:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:20:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:20:20] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2024-05-31 19:20:20] [INFO ] Transformed 626 places.
[2024-05-31 19:20:20] [INFO ] Transformed 1008 transitions.
[2024-05-31 19:20:20] [INFO ] Found NUPN structural information;
[2024-05-31 19:20:20] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 510 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (471 resets) in 2656 ms. (15 steps per ms) remains 8/12 properties
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (125 resets) in 621 ms. (64 steps per ms) remains 6/8 properties
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (118 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (108 resets) in 283 ms. (140 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (149 resets) in 554 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (99 resets) in 205 ms. (194 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (152 resets) in 327 ms. (121 steps per ms) remains 6/6 properties
// Phase 1: matrix 998 rows 626 cols
[2024-05-31 19:20:22] [INFO ] Computed 118 invariants in 120 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 97/224 variables, 21/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 97/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 11/235 variables, 7/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 11/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 386/621 variables, 84/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 386/736 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 5/626 variables, 3/739 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/626 variables, 5/744 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 998/1624 variables, 626/1370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1624 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1624 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1624/1624 variables, and 1370 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3298 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 97/224 variables, 21/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 97/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 11/235 variables, 7/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 11/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem ASLink-PT-02a-ReachabilityCardinality-2024-00 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityCardinality-2024-14 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 386/621 variables, 84/350 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 386/736 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-31 19:20:27] [INFO ] Deduced a trap composed of 30 places in 295 ms of which 41 ms to minimize.
[2024-05-31 19:20:27] [INFO ] Deduced a trap composed of 125 places in 591 ms of which 6 ms to minimize.
[2024-05-31 19:20:28] [INFO ] Deduced a trap composed of 91 places in 336 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/621 variables, 3/739 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 0/739 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/626 variables, 3/742 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 5/747 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-31 19:20:29] [INFO ] Deduced a trap composed of 25 places in 343 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/626 variables, 1/748 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/626 variables, 0/748 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 998/1624 variables, 626/1374 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1624/1624 variables, and 1378 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5009 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 8713ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 93 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 614 transition count 970
Reduce places removed 28 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 33 rules applied. Total rules applied 73 place count 586 transition count 965
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 581 transition count 965
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 78 place count 581 transition count 927
Deduced a syphon composed of 38 places in 4 ms
Ensure Unique test removed 10 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 164 place count 533 transition count 927
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 165 place count 533 transition count 926
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 166 place count 532 transition count 926
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 170 place count 528 transition count 909
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 175 place count 527 transition count 909
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 179 place count 526 transition count 906
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 181 place count 525 transition count 905
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 182 place count 524 transition count 905
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 183 place count 523 transition count 897
Iterating global reduction 8 with 1 rules applied. Total rules applied 184 place count 523 transition count 897
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 8 with 20 rules applied. Total rules applied 204 place count 513 transition count 887
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 206 place count 513 transition count 885
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 208 place count 511 transition count 885
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 211 place count 511 transition count 885
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 213 place count 511 transition count 885
Applied a total of 213 rules in 455 ms. Remains 511 /626 variables (removed 115) and now considering 885/998 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 511/626 places, 885/998 transitions.
RANDOM walk for 40000 steps (578 resets) in 691 ms. (57 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (176 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (173 resets) in 250 ms. (159 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (184 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (201 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 168883 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 4
Probabilistic random walk after 168883 steps, saw 76183 distinct states, run finished after 3008 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 885 rows 511 cols
[2024-05-31 19:20:35] [INFO ] Computed 94 invariants in 23 ms
[2024-05-31 19:20:35] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 123/216 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 13/229 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 282/511 variables, 64/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 885/1396 variables, 511/605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1396 variables, 9/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1396 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1396 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1396/1396 variables, and 614 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1349 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 511/511 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 123/216 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 13/229 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 282/511 variables, 64/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:20:37] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 885/1396 variables, 511/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1396 variables, 9/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1396 variables, 4/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:20:42] [INFO ] Deduced a trap composed of 122 places in 411 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1396 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1396 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:20:49] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 5 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/1396 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1396 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1396 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1396/1396 variables, and 621 constraints, problems are : Problem set: 0 solved, 4 unsolved in 13971 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 511/511 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 15429ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 33670 ms.
Support contains 93 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 885/885 transitions.
Applied a total of 0 rules in 44 ms. Remains 511 /511 variables (removed 0) and now considering 885/885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 511/511 places, 885/885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 885/885 transitions.
Applied a total of 0 rules in 26 ms. Remains 511 /511 variables (removed 0) and now considering 885/885 (removed 0) transitions.
[2024-05-31 19:21:24] [INFO ] Invariant cache hit.
[2024-05-31 19:21:25] [INFO ] Implicit Places using invariants in 796 ms returned [1, 19, 20, 22, 32, 50, 68, 104, 128, 151, 164, 181, 182, 220, 259, 279, 302, 314, 320, 331, 334, 335, 336, 371, 374, 394, 395, 410, 416, 423, 429, 435, 441, 447, 460, 466, 472]
[2024-05-31 19:21:25] [INFO ] Actually due to overlaps returned [336, 32, 50, 374, 182, 335, 181, 334, 371, 1, 314, 19, 20, 68, 220, 331, 395, 441, 460, 472, 22, 164, 320, 394, 410, 416, 423, 429, 435, 447, 466]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 813 ms to find 31 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 480/511 places, 885/885 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 477 transition count 863
Reduce places removed 22 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 455 transition count 859
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 55 place count 451 transition count 859
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 55 place count 451 transition count 848
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 77 place count 440 transition count 848
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 435 transition count 843
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 435 transition count 843
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 434 transition count 842
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 434 transition count 842
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 121 place count 418 transition count 826
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 418 transition count 825
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 417 transition count 825
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 130 place count 417 transition count 818
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 137 place count 410 transition count 818
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 139 place count 410 transition count 818
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 410 transition count 818
Applied a total of 140 rules in 221 ms. Remains 410 /480 variables (removed 70) and now considering 818/885 (removed 67) transitions.
// Phase 1: matrix 818 rows 410 cols
[2024-05-31 19:21:25] [INFO ] Computed 60 invariants in 25 ms
[2024-05-31 19:21:26] [INFO ] Implicit Places using invariants in 564 ms returned [84, 105, 111, 130, 138, 236, 246, 256, 262, 382, 392, 396, 408]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 566 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 397/511 places, 818/885 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 394 transition count 815
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 394 transition count 815
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 392 transition count 813
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 392 transition count 813
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 390 transition count 811
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 390 transition count 811
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 390 transition count 810
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 389 transition count 809
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 389 transition count 808
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 388 transition count 808
Applied a total of 19 rules in 65 ms. Remains 388 /397 variables (removed 9) and now considering 808/818 (removed 10) transitions.
// Phase 1: matrix 808 rows 388 cols
[2024-05-31 19:21:26] [INFO ] Computed 47 invariants in 14 ms
[2024-05-31 19:21:26] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-31 19:21:26] [INFO ] Invariant cache hit.
[2024-05-31 19:21:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 19:21:27] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 388/511 places, 808/885 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3421 ms. Remains : 388/511 places, 808/885 transitions.
RANDOM walk for 40000 steps (693 resets) in 340 ms. (117 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (227 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (224 resets) in 329 ms. (121 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (235 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (269 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 346651 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 4
Probabilistic random walk after 346651 steps, saw 86670 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2024-05-31 19:21:31] [INFO ] Invariant cache hit.
[2024-05-31 19:21:31] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 171/264 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 124/388 variables, 27/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 808/1196 variables, 388/435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1196 variables, 4/439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1196 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1196 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1196/1196 variables, and 439 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1006 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 388/388 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 171/264 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:21:32] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 124/388 variables, 27/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:21:33] [INFO ] Deduced a trap composed of 67 places in 383 ms of which 3 ms to minimize.
[2024-05-31 19:21:33] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 3 ms to minimize.
[2024-05-31 19:21:33] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 4 ms to minimize.
[2024-05-31 19:21:33] [INFO ] Deduced a trap composed of 43 places in 331 ms of which 4 ms to minimize.
[2024-05-31 19:21:34] [INFO ] Deduced a trap composed of 45 places in 222 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:21:34] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:21:34] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 808/1196 variables, 388/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1196 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1196 variables, 4/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1196 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1196 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1196/1196 variables, and 451 constraints, problems are : Problem set: 0 solved, 4 unsolved in 16332 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 388/388 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 17377ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 13941 ms.
Support contains 93 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 808/808 transitions.
Applied a total of 0 rules in 15 ms. Remains 388 /388 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 388/388 places, 808/808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 808/808 transitions.
Applied a total of 0 rules in 14 ms. Remains 388 /388 variables (removed 0) and now considering 808/808 (removed 0) transitions.
[2024-05-31 19:22:02] [INFO ] Invariant cache hit.
[2024-05-31 19:22:02] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-31 19:22:02] [INFO ] Invariant cache hit.
[2024-05-31 19:22:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 19:22:04] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
[2024-05-31 19:22:04] [INFO ] Redundant transitions in 69 ms returned []
Running 807 sub problems to find dead transitions.
[2024-05-31 19:22:04] [INFO ] Invariant cache hit.
[2024-05-31 19:22:04] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/387 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 2 (OVERLAPS) 1/388 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 807 unsolved
[2024-05-31 19:22:32] [INFO ] Deduced a trap composed of 44 places in 521 ms of which 6 ms to minimize.
[2024-05-31 19:22:33] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1196 variables, and 49 constraints, problems are : Problem set: 0 solved, 807 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/388 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 807/807 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 807 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/387 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 2 (OVERLAPS) 1/388 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 807 unsolved
Problem TDEAD674 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 2/49 constraints. Problems are: Problem set: 1 solved, 806 unsolved
[2024-05-31 19:22:46] [INFO ] Deduced a trap composed of 60 places in 223 ms of which 4 ms to minimize.
[2024-05-31 19:22:48] [INFO ] Deduced a trap composed of 94 places in 479 ms of which 5 ms to minimize.
[2024-05-31 19:22:48] [INFO ] Deduced a trap composed of 95 places in 427 ms of which 5 ms to minimize.
[2024-05-31 19:22:49] [INFO ] Deduced a trap composed of 94 places in 448 ms of which 6 ms to minimize.
[2024-05-31 19:22:49] [INFO ] Deduced a trap composed of 94 places in 446 ms of which 5 ms to minimize.
[2024-05-31 19:22:50] [INFO ] Deduced a trap composed of 97 places in 395 ms of which 5 ms to minimize.
[2024-05-31 19:22:53] [INFO ] Deduced a trap composed of 99 places in 474 ms of which 6 ms to minimize.
[2024-05-31 19:22:53] [INFO ] Deduced a trap composed of 96 places in 474 ms of which 6 ms to minimize.
[2024-05-31 19:22:54] [INFO ] Deduced a trap composed of 96 places in 402 ms of which 5 ms to minimize.
[2024-05-31 19:22:54] [INFO ] Deduced a trap composed of 101 places in 429 ms of which 5 ms to minimize.
[2024-05-31 19:22:57] [INFO ] Deduced a trap composed of 38 places in 442 ms of which 5 ms to minimize.
[2024-05-31 19:22:57] [INFO ] Deduced a trap composed of 39 places in 447 ms of which 6 ms to minimize.
[2024-05-31 19:22:58] [INFO ] Deduced a trap composed of 76 places in 403 ms of which 5 ms to minimize.
[2024-05-31 19:22:58] [INFO ] Deduced a trap composed of 55 places in 461 ms of which 6 ms to minimize.
[2024-05-31 19:22:59] [INFO ] Deduced a trap composed of 46 places in 391 ms of which 6 ms to minimize.
[2024-05-31 19:22:59] [INFO ] Deduced a trap composed of 52 places in 355 ms of which 4 ms to minimize.
[2024-05-31 19:22:59] [INFO ] Deduced a trap composed of 46 places in 298 ms of which 3 ms to minimize.
[2024-05-31 19:23:00] [INFO ] Deduced a trap composed of 49 places in 288 ms of which 3 ms to minimize.
[2024-05-31 19:23:01] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 3 ms to minimize.
Problem TDEAD647 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD656 is UNSAT
[2024-05-31 19:23:02] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 3 ms to minimize.
Problem TDEAD647 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD746 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 20/69 constraints. Problems are: Problem set: 6 solved, 801 unsolved
[2024-05-31 19:23:02] [INFO ] Deduced a trap composed of 62 places in 286 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/1196 variables, and 70 constraints, problems are : Problem set: 6 solved, 801 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/388 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/807 constraints, Known Traps: 23/23 constraints]
After SMT, in 60974ms problems are : Problem set: 6 solved, 801 unsolved
Search for dead transitions found 6 dead transitions in 60994ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 388/388 places, 802/808 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 388 transition count 802
Applied a total of 1 rules in 42 ms. Remains 388 /388 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 388 cols
[2024-05-31 19:23:05] [INFO ] Computed 48 invariants in 16 ms
[2024-05-31 19:23:05] [INFO ] Implicit Places using invariants in 528 ms returned [138]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 533 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 387/388 places, 802/808 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 387 transition count 799
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 384 transition count 799
Applied a total of 6 rules in 45 ms. Remains 384 /387 variables (removed 3) and now considering 799/802 (removed 3) transitions.
// Phase 1: matrix 799 rows 384 cols
[2024-05-31 19:23:05] [INFO ] Computed 47 invariants in 16 ms
[2024-05-31 19:23:07] [INFO ] Implicit Places using invariants in 1355 ms returned []
[2024-05-31 19:23:07] [INFO ] Invariant cache hit.
[2024-05-31 19:23:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 19:23:08] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 2796 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 384/388 places, 799/808 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 65992 ms. Remains : 384/388 places, 799/808 transitions.
RANDOM walk for 40000 steps (718 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (214 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (219 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (224 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (243 resets) in 136 ms. (291 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 337920 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 4
Probabilistic random walk after 337920 steps, saw 84833 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-31 19:23:11] [INFO ] Invariant cache hit.
[2024-05-31 19:23:11] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 157/250 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 134/384 variables, 26/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 799/1183 variables, 384/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1183 variables, 4/435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1183 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1183 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1183/1183 variables, and 435 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 384/384 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 157/250 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:23:13] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-31 19:23:13] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-31 19:23:13] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-31 19:23:13] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 2 ms to minimize.
[2024-05-31 19:23:13] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 134/384 variables, 26/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:23:14] [INFO ] Deduced a trap composed of 87 places in 448 ms of which 5 ms to minimize.
[2024-05-31 19:23:14] [INFO ] Deduced a trap composed of 62 places in 351 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 799/1183 variables, 384/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1183 variables, 4/442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1183 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1183 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 19:23:18] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/1183 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1183 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1183 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1183/1183 variables, and 447 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8052 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 384/384 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 9294ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA ASLink-PT-02a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 36578 ms.
Support contains 70 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 799/799 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 384 transition count 796
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 381 transition count 794
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 379 transition count 794
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 379 transition count 791
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 376 transition count 791
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 374 transition count 789
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 374 transition count 789
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 374 transition count 789
Applied a total of 21 rules in 53 ms. Remains 374 /384 variables (removed 10) and now considering 789/799 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 374/384 places, 789/799 transitions.
RANDOM walk for 40000 steps (709 resets) in 184 ms. (216 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (245 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (234 resets) in 200 ms. (199 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (239 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 355734 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 3
Probabilistic random walk after 355734 steps, saw 90822 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
// Phase 1: matrix 789 rows 374 cols
[2024-05-31 19:24:00] [INFO ] Computed 47 invariants in 8 ms
[2024-05-31 19:24:00] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 97/167 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/168 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 206/374 variables, 31/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 789/1163 variables, 374/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1163 variables, 5/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1163 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1163 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 426 constraints, problems are : Problem set: 0 solved, 3 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 374/374 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 97/167 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:24:01] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 2 ms to minimize.
[2024-05-31 19:24:01] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 2 ms to minimize.
[2024-05-31 19:24:02] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/168 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 206/374 variables, 31/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 789/1163 variables, 374/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1163 variables, 5/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1163 variables, 3/432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1163 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1163 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 432 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5148 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 374/374 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 5951ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 5787 ms.
Support contains 70 out of 374 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 374/374 places, 789/789 transitions.
Applied a total of 0 rules in 11 ms. Remains 374 /374 variables (removed 0) and now considering 789/789 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 374/374 places, 789/789 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 374/374 places, 789/789 transitions.
Applied a total of 0 rules in 11 ms. Remains 374 /374 variables (removed 0) and now considering 789/789 (removed 0) transitions.
[2024-05-31 19:24:12] [INFO ] Invariant cache hit.
[2024-05-31 19:24:13] [INFO ] Implicit Places using invariants in 386 ms returned [102, 134, 135, 237]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 388 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 370/374 places, 789/789 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 370 transition count 788
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 369 transition count 788
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 368 transition count 787
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 368 transition count 787
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 367 transition count 786
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 367 transition count 785
Applied a total of 7 rules in 35 ms. Remains 367 /370 variables (removed 3) and now considering 785/789 (removed 4) transitions.
// Phase 1: matrix 785 rows 367 cols
[2024-05-31 19:24:13] [INFO ] Computed 43 invariants in 7 ms
[2024-05-31 19:24:13] [INFO ] Implicit Places using invariants in 298 ms returned [73, 122]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 301 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 365/374 places, 785/789 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 364 transition count 784
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 364 transition count 784
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 363 transition count 783
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 363 transition count 782
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 362 transition count 782
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 362 transition count 782
Applied a total of 7 rules in 48 ms. Remains 362 /365 variables (removed 3) and now considering 782/785 (removed 3) transitions.
// Phase 1: matrix 782 rows 362 cols
[2024-05-31 19:24:13] [INFO ] Computed 41 invariants in 10 ms
[2024-05-31 19:24:13] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-31 19:24:13] [INFO ] Invariant cache hit.
[2024-05-31 19:24:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 19:24:14] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 362/374 places, 782/789 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2279 ms. Remains : 362/374 places, 782/789 transitions.
RANDOM walk for 40000 steps (706 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (212 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (221 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (234 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 315132 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 3
Probabilistic random walk after 315132 steps, saw 119536 distinct states, run finished after 3005 ms. (steps per millisecond=104 ) properties seen :0
[2024-05-31 19:24:18] [INFO ] Invariant cache hit.
[2024-05-31 19:24:18] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 143/213 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 149/362 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 782/1144 variables, 362/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1144 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1144 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1144 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1144/1144 variables, and 405 constraints, problems are : Problem set: 0 solved, 3 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 362/362 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 143/213 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:24:18] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 149/362 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:24:19] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 3 ms to minimize.
[2024-05-31 19:24:19] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:24:19] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 2 ms to minimize.
[2024-05-31 19:24:19] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:24:20] [INFO ] Deduced a trap composed of 141 places in 397 ms of which 4 ms to minimize.
[2024-05-31 19:24:20] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2024-05-31 19:24:20] [INFO ] Deduced a trap composed of 122 places in 483 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:24:21] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2024-05-31 19:24:21] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 19:24:21] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 782/1144 variables, 362/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1144 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1144 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1144 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1144 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 419 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9944 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 362/362 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 10571ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 6573 ms.
Support contains 70 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 782/782 transitions.
Applied a total of 0 rules in 10 ms. Remains 362 /362 variables (removed 0) and now considering 782/782 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 362/362 places, 782/782 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 782/782 transitions.
Applied a total of 0 rules in 23 ms. Remains 362 /362 variables (removed 0) and now considering 782/782 (removed 0) transitions.
[2024-05-31 19:24:35] [INFO ] Invariant cache hit.
[2024-05-31 19:24:35] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-31 19:24:35] [INFO ] Invariant cache hit.
[2024-05-31 19:24:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 19:24:36] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
[2024-05-31 19:24:36] [INFO ] Redundant transitions in 18 ms returned []
Running 781 sub problems to find dead transitions.
[2024-05-31 19:24:36] [INFO ] Invariant cache hit.
[2024-05-31 19:24:36] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (OVERLAPS) 1/362 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-31 19:25:00] [INFO ] Deduced a trap composed of 63 places in 359 ms of which 5 ms to minimize.
[2024-05-31 19:25:00] [INFO ] Deduced a trap composed of 64 places in 402 ms of which 5 ms to minimize.
[2024-05-31 19:25:01] [INFO ] Deduced a trap composed of 65 places in 387 ms of which 5 ms to minimize.
[2024-05-31 19:25:07] [INFO ] Deduced a trap composed of 40 places in 397 ms of which 5 ms to minimize.
SMT process timed out in 30810ms, After SMT, problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 30823ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32199 ms. Remains : 362/362 places, 782/782 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 361 transition count 781
Applied a total of 2 rules in 26 ms. Remains 361 /362 variables (removed 1) and now considering 781/782 (removed 1) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 781 rows 361 cols
[2024-05-31 19:25:07] [INFO ] Computed 41 invariants in 12 ms
[2024-05-31 19:25:07] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 19:25:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 13 ms returned sat
[2024-05-31 19:25:07] [INFO ] [Nat]Absence check using 12 positive and 29 generalized place invariants in 33 ms returned sat
[2024-05-31 19:25:10] [INFO ] After 2631ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-31 19:25:16] [INFO ] Deduced a trap composed of 38 places in 236 ms of which 3 ms to minimize.
[2024-05-31 19:25:16] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 3 ms to minimize.
[2024-05-31 19:25:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 566 ms
TRAPS : Iteration 1
[2024-05-31 19:25:23] [INFO ] Deduced a trap composed of 72 places in 165 ms of which 3 ms to minimize.
[2024-05-31 19:25:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
TRAPS : Iteration 2
[2024-05-31 19:25:28] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 3 ms to minimize.
[2024-05-31 19:25:28] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 3 ms to minimize.
[2024-05-31 19:25:28] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 3 ms to minimize.
[2024-05-31 19:25:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1214 ms
TRAPS : Iteration 3
[2024-05-31 19:25:31] [INFO ] Deduced a trap composed of 67 places in 326 ms of which 5 ms to minimize.
[2024-05-31 19:25:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
TRAPS : Iteration 4
[2024-05-31 19:25:36] [INFO ] After 28321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-31 19:25:39] [INFO ] After 31960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 32214 ms.
[2024-05-31 19:25:39] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-05-31 19:25:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 362 places, 782 transitions and 3061 arcs took 15 ms.
[2024-05-31 19:25:40] [INFO ] Flatten gal took : 257 ms
Total runtime 320313 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 : ASLink-PT-02a-ReachabilityCardinality-2024-06
Could not compute solution for formula : ASLink-PT-02a-ReachabilityCardinality-2024-08
Could not compute solution for formula : ASLink-PT-02a-ReachabilityCardinality-2024-12
BK_STOP 1717183540900
--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name ASLink-PT-02a-ReachabilityCardinality-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/860/inv_0_
rfs formula name ASLink-PT-02a-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/860/inv_1_
rfs formula name ASLink-PT-02a-ReachabilityCardinality-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/860/inv_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-02a"
export BK_EXAMINATION="ReachabilityCardinality"
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 ASLink-PT-02a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117700030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;