About the Execution of LTSMin+red for ASLink-PT-02b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 756.995 | 164148.00 | 222422.00 | 466.90 | TTTTTFFFFFFTTTFF | 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-171620117700038.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-02b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117700038
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.2K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 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 417K 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-02b-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-02b-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717187918119
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-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:38:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:38:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:38:40] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2024-05-31 20:38:40] [INFO ] Transformed 1242 places.
[2024-05-31 20:38:40] [INFO ] Transformed 1621 transitions.
[2024-05-31 20:38:40] [INFO ] Found NUPN structural information;
[2024-05-31 20:38:40] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 522 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (168 resets) in 1721 ms. (23 steps per ms) remains 5/13 properties
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (29 resets) in 689 ms. (57 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (31 resets) in 375 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (32 resets) in 404 ms. (98 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (34 resets) in 235 ms. (169 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (34 resets) in 186 ms. (213 steps per ms) remains 5/5 properties
// Phase 1: matrix 1621 rows 1242 cols
[2024-05-31 20:38:41] [INFO ] Computed 121 invariants in 144 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 245/312 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 245/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 62/374 variables, 7/339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 62/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem ASLink-PT-02b-ReachabilityCardinality-2024-05 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityCardinality-2024-07 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 851/1225 variables, 88/489 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1225 variables, 851/1340 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1225 variables, 0/1340 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 17/1242 variables, 6/1346 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1242 variables, 17/1363 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1242 variables, 0/1363 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1621/2863 variables, 1242/2605 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2863 variables, 0/2605 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/2863 variables, 0/2605 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2863/2863 variables, and 2605 constraints, problems are : Problem set: 2 solved, 3 unsolved in 2709 ms.
Refiners :[Domain max(s): 1242/1242 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 1242/1242 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 235/272 variables, 16/53 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 235/288 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/288 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 82/354 variables, 11/299 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 82/381 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/381 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem ASLink-PT-02b-ReachabilityCardinality-2024-01 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 871/1225 variables, 88/469 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1225 variables, 871/1340 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-31 20:38:46] [INFO ] Deduced a trap composed of 15 places in 842 ms of which 126 ms to minimize.
[2024-05-31 20:38:47] [INFO ] Deduced a trap composed of 22 places in 812 ms of which 11 ms to minimize.
[2024-05-31 20:38:48] [INFO ] Deduced a trap composed of 58 places in 923 ms of which 10 ms to minimize.
[2024-05-31 20:38:48] [INFO ] Deduced a trap composed of 51 places in 727 ms of which 10 ms to minimize.
[2024-05-31 20:38:49] [INFO ] Deduced a trap composed of 33 places in 766 ms of which 10 ms to minimize.
[2024-05-31 20:38:50] [INFO ] Deduced a trap composed of 61 places in 895 ms of which 14 ms to minimize.
SMT process timed out in 8814ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 266 rules applied. Total rules applied 266 place count 1242 transition count 1355
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 1 with 276 rules applied. Total rules applied 542 place count 976 transition count 1345
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 549 place count 973 transition count 1341
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 553 place count 969 transition count 1341
Performed 277 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 277 Pre rules applied. Total rules applied 553 place count 969 transition count 1064
Deduced a syphon composed of 277 places in 6 ms
Ensure Unique test removed 20 places
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 4 with 574 rules applied. Total rules applied 1127 place count 672 transition count 1064
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 4 with 17 rules applied. Total rules applied 1144 place count 670 transition count 1049
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1159 place count 655 transition count 1049
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 1159 place count 655 transition count 1043
Deduced a syphon composed of 6 places in 8 ms
Ensure Unique test removed 6 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1177 place count 643 transition count 1043
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 1177 place count 643 transition count 1037
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1189 place count 637 transition count 1037
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 1228 place count 598 transition count 998
Iterating global reduction 6 with 39 rules applied. Total rules applied 1267 place count 598 transition count 998
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 6 with 6 rules applied. Total rules applied 1273 place count 597 transition count 993
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 1275 place count 596 transition count 992
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1276 place count 595 transition count 992
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 13 Pre rules applied. Total rules applied 1276 place count 595 transition count 979
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 9 with 27 rules applied. Total rules applied 1303 place count 581 transition count 979
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1303 place count 581 transition count 978
Deduced a syphon composed of 1 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1306 place count 579 transition count 978
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1309 place count 576 transition count 957
Iterating global reduction 9 with 3 rules applied. Total rules applied 1312 place count 576 transition count 957
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 1312 place count 576 transition count 955
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1316 place count 574 transition count 955
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1317 place count 573 transition count 947
Iterating global reduction 9 with 1 rules applied. Total rules applied 1318 place count 573 transition count 947
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1319 place count 572 transition count 939
Iterating global reduction 9 with 1 rules applied. Total rules applied 1320 place count 572 transition count 939
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1321 place count 571 transition count 931
Iterating global reduction 9 with 1 rules applied. Total rules applied 1322 place count 571 transition count 931
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1323 place count 570 transition count 923
Iterating global reduction 9 with 1 rules applied. Total rules applied 1324 place count 570 transition count 923
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 9 with 135 rules applied. Total rules applied 1459 place count 502 transition count 856
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1460 place count 501 transition count 855
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 1462 place count 500 transition count 855
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1463 place count 499 transition count 854
Iterating global reduction 9 with 1 rules applied. Total rules applied 1464 place count 499 transition count 854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 9 with 2 rules applied. Total rules applied 1466 place count 499 transition count 852
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1467 place count 498 transition count 852
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1469 place count 497 transition count 861
Free-agglomeration rule applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1473 place count 497 transition count 857
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 1477 place count 493 transition count 857
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1479 place count 493 transition count 855
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1481 place count 491 transition count 855
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1482 place count 490 transition count 854
Reduce places removed 3 places and 0 transitions.
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 13 with 4 rules applied. Total rules applied 1486 place count 487 transition count 853
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1487 place count 486 transition count 853
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 5 Pre rules applied. Total rules applied 1487 place count 486 transition count 848
Deduced a syphon composed of 5 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 15 with 11 rules applied. Total rules applied 1498 place count 480 transition count 848
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 15 with 2 rules applied. Total rules applied 1500 place count 478 transition count 848
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 1500 place count 478 transition count 847
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 1502 place count 477 transition count 847
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 16 with 6 rules applied. Total rules applied 1508 place count 474 transition count 844
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 1509 place count 473 transition count 843
Iterating global reduction 16 with 1 rules applied. Total rules applied 1510 place count 473 transition count 843
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1511 place count 473 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1512 place count 472 transition count 842
Applied a total of 1512 rules in 941 ms. Remains 472 /1242 variables (removed 770) and now considering 842/1621 (removed 779) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 961 ms. Remains : 472/1242 places, 842/1621 transitions.
RANDOM walk for 40000 steps (538 resets) in 363 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (124 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (185 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 303983 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :0 out of 2
Probabilistic random walk after 303983 steps, saw 86021 distinct states, run finished after 3008 ms. (steps per millisecond=101 ) properties seen :0
// Phase 1: matrix 842 rows 472 cols
[2024-05-31 20:38:54] [INFO ] Computed 82 invariants in 49 ms
[2024-05-31 20:38:54] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/164 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/181 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 288/469 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/471 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/472 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 842/1314 variables, 472/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1314 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1314 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1314 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 555 constraints, problems are : Problem set: 0 solved, 2 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 472/472 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/164 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/181 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 288/469 variables, 59/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/471 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/472 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 842/1314 variables, 472/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1314 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1314 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:38:56] [INFO ] Deduced a trap composed of 105 places in 220 ms of which 4 ms to minimize.
[2024-05-31 20:38:57] [INFO ] Deduced a trap composed of 73 places in 300 ms of which 5 ms to minimize.
[2024-05-31 20:38:57] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1314 variables, 3/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:38:57] [INFO ] Deduced a trap composed of 114 places in 267 ms of which 4 ms to minimize.
[2024-05-31 20:38:58] [INFO ] Deduced a trap composed of 90 places in 266 ms of which 4 ms to minimize.
[2024-05-31 20:38:58] [INFO ] Deduced a trap composed of 112 places in 267 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1314 variables, 3/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1314 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1314 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 563 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3526 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 60/60 constraints, State Equation: 472/472 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 4320ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1437 ms.
Support contains 18 out of 472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 842/842 transitions.
Applied a total of 0 rules in 28 ms. Remains 472 /472 variables (removed 0) and now considering 842/842 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 472/472 places, 842/842 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 472/472 places, 842/842 transitions.
Applied a total of 0 rules in 23 ms. Remains 472 /472 variables (removed 0) and now considering 842/842 (removed 0) transitions.
[2024-05-31 20:39:00] [INFO ] Invariant cache hit.
[2024-05-31 20:39:01] [INFO ] Implicit Places using invariants in 638 ms returned [1, 18, 19, 31, 51, 107, 110, 145, 161, 162, 164, 181, 199, 270, 278, 282, 283, 286, 298, 299, 300, 301, 332, 334, 338, 356, 357, 359, 375, 381, 387, 393, 399, 405, 411, 417, 423, 429, 435]
[2024-05-31 20:39:01] [INFO ] Actually due to overlaps returned [332, 301, 51, 164, 181, 338, 31, 161, 299, 356, 162, 300, 334, 357, 1, 18, 282, 283, 199, 298, 405, 423, 435, 19, 286, 359, 375, 381, 387, 393, 399, 411, 417, 429]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 655 ms to find 34 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 438/472 places, 842/842 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 435 transition count 782
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 375 transition count 778
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 130 place count 372 transition count 778
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 130 place count 372 transition count 765
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 156 place count 359 transition count 765
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 161 place count 356 transition count 763
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 5 rules applied. Total rules applied 166 place count 354 transition count 760
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 169 place count 351 transition count 760
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 183 place count 337 transition count 746
Iterating global reduction 6 with 14 rules applied. Total rules applied 197 place count 337 transition count 746
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 198 place count 337 transition count 745
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 198 place count 337 transition count 744
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 200 place count 336 transition count 744
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 204 place count 332 transition count 737
Iterating global reduction 7 with 4 rules applied. Total rules applied 208 place count 332 transition count 737
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 210 place count 330 transition count 735
Iterating global reduction 7 with 2 rules applied. Total rules applied 212 place count 330 transition count 735
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 213 place count 330 transition count 734
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 214 place count 329 transition count 732
Iterating global reduction 8 with 1 rules applied. Total rules applied 215 place count 329 transition count 732
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 259 place count 307 transition count 710
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 260 place count 306 transition count 709
Iterating global reduction 8 with 1 rules applied. Total rules applied 261 place count 306 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 262 place count 306 transition count 708
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 266 place count 304 transition count 709
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 272 place count 304 transition count 703
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 280 place count 296 transition count 703
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 286 place count 296 transition count 703
Applied a total of 286 rules in 151 ms. Remains 296 /438 variables (removed 142) and now considering 703/842 (removed 139) transitions.
// Phase 1: matrix 703 rows 296 cols
[2024-05-31 20:39:01] [INFO ] Computed 40 invariants in 10 ms
[2024-05-31 20:39:01] [INFO ] Implicit Places using invariants in 333 ms returned [78, 88, 91, 99, 105, 108, 111, 117, 171, 188, 198, 290]
[2024-05-31 20:39:01] [INFO ] Actually due to overlaps returned [117, 99, 105, 111, 188, 78, 88, 171, 198, 290]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 336 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 286/472 places, 703/842 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 285 transition count 702
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 6 place count 281 transition count 698
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 281 transition count 698
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 280 transition count 697
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 280 transition count 697
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 277 transition count 694
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 277 transition count 690
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 273 transition count 690
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 273 transition count 688
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 271 transition count 688
Applied a total of 30 rules in 72 ms. Remains 271 /286 variables (removed 15) and now considering 688/703 (removed 15) transitions.
// Phase 1: matrix 688 rows 271 cols
[2024-05-31 20:39:01] [INFO ] Computed 30 invariants in 7 ms
[2024-05-31 20:39:02] [INFO ] Implicit Places using invariants in 312 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 314 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 270/472 places, 688/842 transitions.
Applied a total of 0 rules in 14 ms. Remains 270 /270 variables (removed 0) and now considering 688/688 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1566 ms. Remains : 270/472 places, 688/842 transitions.
RANDOM walk for 40000 steps (924 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (212 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (293 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 296213 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 2
Probabilistic random walk after 296213 steps, saw 126205 distinct states, run finished after 3006 ms. (steps per millisecond=98 ) properties seen :0
// Phase 1: matrix 688 rows 270 cols
[2024-05-31 20:39:05] [INFO ] Computed 29 invariants in 6 ms
[2024-05-31 20:39:05] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/121 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 148/269 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/270 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 688/958 variables, 270/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/958 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/958 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/958 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 958/958 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 270/270 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/117 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/121 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 148/269 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/270 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 688/958 variables, 270/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/958 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/958 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:39:06] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/958 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/958 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/958 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 958/958 variables, and 303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1254 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 270/270 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1714ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1189 ms.
Support contains 18 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 688/688 transitions.
Applied a total of 0 rules in 13 ms. Remains 270 /270 variables (removed 0) and now considering 688/688 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 270/270 places, 688/688 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 688/688 transitions.
Applied a total of 0 rules in 12 ms. Remains 270 /270 variables (removed 0) and now considering 688/688 (removed 0) transitions.
[2024-05-31 20:39:08] [INFO ] Invariant cache hit.
[2024-05-31 20:39:08] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-31 20:39:08] [INFO ] Invariant cache hit.
[2024-05-31 20:39:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 20:39:09] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2024-05-31 20:39:09] [INFO ] Redundant transitions in 43 ms returned []
Running 671 sub problems to find dead transitions.
[2024-05-31 20:39:09] [INFO ] Invariant cache hit.
[2024-05-31 20:39:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-31 20:39:14] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:39:16] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 3 ms to minimize.
[2024-05-31 20:39:16] [INFO ] Deduced a trap composed of 49 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:39:17] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-31 20:39:17] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 5 ms to minimize.
[2024-05-31 20:39:19] [INFO ] Deduced a trap composed of 76 places in 212 ms of which 3 ms to minimize.
[2024-05-31 20:39:19] [INFO ] Deduced a trap composed of 73 places in 225 ms of which 3 ms to minimize.
[2024-05-31 20:39:20] [INFO ] Deduced a trap composed of 74 places in 220 ms of which 3 ms to minimize.
[2024-05-31 20:39:20] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 3 ms to minimize.
[2024-05-31 20:39:21] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-05-31 20:39:22] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 3 ms to minimize.
[2024-05-31 20:39:22] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 3 ms to minimize.
[2024-05-31 20:39:23] [INFO ] Deduced a trap composed of 109 places in 222 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 4 (OVERLAPS) 1/270 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 270/958 variables, and 42 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/270 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 4 (OVERLAPS) 1/270 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
At refinement iteration 6 (OVERLAPS) 688/958 variables, 270/312 constraints. Problems are: Problem set: 109 solved, 562 unsolved
SMT process timed out in 60668ms, After SMT, problems are : Problem set: 109 solved, 562 unsolved
Search for dead transitions found 109 dead transitions in 60681ms
Found 109 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 109 transitions
Dead transitions reduction (with SMT) removed 109 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 270/270 places, 579/688 transitions.
Applied a total of 0 rules in 11 ms. Remains 270 /270 variables (removed 0) and now considering 579/579 (removed 0) transitions.
[2024-05-31 20:40:10] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61793 ms. Remains : 270/270 places, 579/688 transitions.
RANDOM walk for 40000 steps (891 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (202 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (282 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 276476 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 2
Probabilistic random walk after 276476 steps, saw 118150 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
// Phase 1: matrix 579 rows 270 cols
[2024-05-31 20:40:13] [INFO ] Computed 29 invariants in 5 ms
[2024-05-31 20:40:13] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 104/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 127/253 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 9/262 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/270 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 579/849 variables, 270/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/849 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/849 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/849 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 849/849 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 270/270 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 104/122 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 127/253 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:40:13] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
[2024-05-31 20:40:13] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:40:14] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/262 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/270 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 20:40:14] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:40:14] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:40:14] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/270 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 579/849 variables, 270/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/849 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/849 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/849 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/849 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 849/849 variables, and 308 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1559 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 270/270 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 2008ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 778 ms.
Support contains 18 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 579/579 transitions.
Applied a total of 0 rules in 8 ms. Remains 270 /270 variables (removed 0) and now considering 579/579 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 270/270 places, 579/579 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 579/579 transitions.
Applied a total of 0 rules in 17 ms. Remains 270 /270 variables (removed 0) and now considering 579/579 (removed 0) transitions.
[2024-05-31 20:40:16] [INFO ] Invariant cache hit.
[2024-05-31 20:40:16] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-31 20:40:16] [INFO ] Invariant cache hit.
[2024-05-31 20:40:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 20:40:17] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
[2024-05-31 20:40:17] [INFO ] Redundant transitions in 7 ms returned []
Running 562 sub problems to find dead transitions.
[2024-05-31 20:40:17] [INFO ] Invariant cache hit.
[2024-05-31 20:40:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2024-05-31 20:40:21] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-31 20:40:21] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 3 ms to minimize.
[2024-05-31 20:40:21] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 3 ms to minimize.
[2024-05-31 20:40:21] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 3 ms to minimize.
[2024-05-31 20:40:22] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 3 ms to minimize.
[2024-05-31 20:40:22] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
[2024-05-31 20:40:22] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
[2024-05-31 20:40:23] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 3 ms to minimize.
[2024-05-31 20:40:23] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:40:23] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-31 20:40:23] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-31 20:40:24] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2024-05-31 20:40:24] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
[2024-05-31 20:40:24] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
[2024-05-31 20:40:24] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
[2024-05-31 20:40:24] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 3 ms to minimize.
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
[2024-05-31 20:40:25] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 3 ms to minimize.
Problem TDEAD167 is UNSAT
[2024-05-31 20:40:25] [INFO ] Deduced a trap composed of 29 places in 208 ms of which 3 ms to minimize.
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
[2024-05-31 20:40:25] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 3 ms to minimize.
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
[2024-05-31 20:40:25] [INFO ] Deduced a trap composed of 81 places in 172 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD555 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/48 constraints. Problems are: Problem set: 102 solved, 460 unsolved
[2024-05-31 20:40:27] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 3 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
[2024-05-31 20:40:28] [INFO ] Deduced a trap composed of 87 places in 221 ms of which 3 ms to minimize.
[2024-05-31 20:40:28] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 3 ms to minimize.
[2024-05-31 20:40:28] [INFO ] Deduced a trap composed of 113 places in 204 ms of which 2 ms to minimize.
[2024-05-31 20:40:28] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 2 ms to minimize.
Problem TDEAD224 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
[2024-05-31 20:40:28] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 3 ms to minimize.
Problem TDEAD238 is UNSAT
[2024-05-31 20:40:29] [INFO ] Deduced a trap composed of 37 places in 222 ms of which 3 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-05-31 20:40:29] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 3 ms to minimize.
[2024-05-31 20:40:29] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 3 ms to minimize.
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
[2024-05-31 20:40:29] [INFO ] Deduced a trap composed of 73 places in 205 ms of which 2 ms to minimize.
[2024-05-31 20:40:30] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 2 ms to minimize.
[2024-05-31 20:40:30] [INFO ] Deduced a trap composed of 72 places in 210 ms of which 4 ms to minimize.
[2024-05-31 20:40:30] [INFO ] Deduced a trap composed of 70 places in 215 ms of which 2 ms to minimize.
[2024-05-31 20:40:31] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 3 ms to minimize.
[2024-05-31 20:40:31] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-05-31 20:40:31] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 3 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD383 is UNSAT
[2024-05-31 20:40:32] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
[2024-05-31 20:40:32] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
Problem TDEAD409 is UNSAT
Problem TDEAD426 is UNSAT
[2024-05-31 20:40:32] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2024-05-31 20:40:32] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD577 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 20/68 constraints. Problems are: Problem set: 131 solved, 431 unsolved
[2024-05-31 20:40:38] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
Problem TDEAD372 is UNSAT
[2024-05-31 20:40:38] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 3 ms to minimize.
[2024-05-31 20:40:38] [INFO ] Deduced a trap composed of 66 places in 212 ms of which 3 ms to minimize.
[2024-05-31 20:40:39] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 3 ms to minimize.
[2024-05-31 20:40:40] [INFO ] Deduced a trap composed of 86 places in 180 ms of which 2 ms to minimize.
[2024-05-31 20:40:40] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
[2024-05-31 20:40:40] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
[2024-05-31 20:40:40] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
Problem TDEAD569 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 8/76 constraints. Problems are: Problem set: 142 solved, 420 unsolved
[2024-05-31 20:40:42] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 1/77 constraints. Problems are: Problem set: 142 solved, 420 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/849 variables, and 77 constraints, problems are : Problem set: 142 solved, 420 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 20/21 constraints, State Equation: 0/270 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 142 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 142 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 20/28 constraints. Problems are: Problem set: 142 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 49/77 constraints. Problems are: Problem set: 142 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/77 constraints. Problems are: Problem set: 142 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 1/270 variables, 1/78 constraints. Problems are: Problem set: 142 solved, 420 unsolved
[2024-05-31 20:40:55] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/79 constraints. Problems are: Problem set: 142 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/79 constraints. Problems are: Problem set: 142 solved, 420 unsolved
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD571 is UNSAT
At refinement iteration 7 (OVERLAPS) 579/849 variables, 270/349 constraints. Problems are: Problem set: 311 solved, 251 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/849 variables, 1/350 constraints. Problems are: Problem set: 311 solved, 251 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 251/601 constraints. Problems are: Problem set: 311 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 849/849 variables, and 601 constraints, problems are : Problem set: 311 solved, 251 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 270/270 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 251/562 constraints, Known Traps: 50/50 constraints]
After SMT, in 60418ms problems are : Problem set: 311 solved, 251 unsolved
Search for dead transitions found 311 dead transitions in 60426ms
Found 311 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 311 transitions
Dead transitions reduction (with SMT) removed 311 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 270/270 places, 268/579 transitions.
Ensure Unique test removed 32 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 236 transition count 241
Reduce places removed 27 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 30 rules applied. Total rules applied 91 place count 209 transition count 238
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 206 transition count 238
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 3 with 2 rules applied. Total rules applied 96 place count 205 transition count 237
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 205 transition count 235
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 203 transition count 235
Applied a total of 100 rules in 33 ms. Remains 203 /270 variables (removed 67) and now considering 235/268 (removed 33) transitions.
// Phase 1: matrix 235 rows 203 cols
[2024-05-31 20:41:17] [INFO ] Computed 37 invariants in 3 ms
[2024-05-31 20:41:17] [INFO ] Implicit Places using invariants in 355 ms returned [61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 358 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 192/270 places, 235/579 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 192 transition count 214
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 171 transition count 214
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 171 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 170 transition count 213
Applied a total of 44 rules in 17 ms. Remains 170 /192 variables (removed 22) and now considering 213/235 (removed 22) transitions.
// Phase 1: matrix 213 rows 170 cols
[2024-05-31 20:41:17] [INFO ] Computed 26 invariants in 3 ms
[2024-05-31 20:41:18] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-31 20:41:18] [INFO ] Invariant cache hit.
[2024-05-31 20:41:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 20:41:18] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 170/270 places, 213/579 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62587 ms. Remains : 170/270 places, 213/579 transitions.
RANDOM walk for 40000 steps (933 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (225 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (291 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 924234 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :1 out of 2
Probabilistic random walk after 924234 steps, saw 284215 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :1
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-31 20:41:21] [INFO ] Invariant cache hit.
[2024-05-31 20:41:21] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/85 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/169 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/170 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 213/383 variables, 170/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 170/170 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/85 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:41:21] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/89 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 80/169 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/170 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 213/383 variables, 170/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/383 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 170/170 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 444ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3616 steps, including 311 resets, run visited all 1 properties in 8 ms. (steps per millisecond=452 )
FORMULA ASLink-PT-02b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 16 ms.
All properties solved without resorting to model-checking.
Total runtime 162384 ms.
ITS solved all properties within timeout
BK_STOP 1717188082267
--------------------
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
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-02b"
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-02b, 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-171620117700038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02b.tgz
mv ASLink-PT-02b 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 ;