About the Execution of LTSMin+red for AutonomousCar-PT-09b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15197.403 | 193687.00 | 260406.00 | 583.30 | TF?TTFTTFTFTTTTF | 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.r468-smll-171620167500359.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 AutonomousCar-PT-09b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500359
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K 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 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 865K 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 AutonomousCar-PT-09b-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717224494371
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:48:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:48:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:48:16] [INFO ] Load time of PNML (sax parser for PT used): 343 ms
[2024-06-01 06:48:16] [INFO ] Transformed 391 places.
[2024-06-01 06:48:16] [INFO ] Transformed 1554 transitions.
[2024-06-01 06:48:16] [INFO ] Found NUPN structural information;
[2024-06-01 06:48:16] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 539 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 139 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (301 resets) in 3323 ms. (12 steps per ms) remains 9/16 properties
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (58 resets) in 318 ms. (125 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (62 resets) in 762 ms. (52 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (45 resets) in 187 ms. (212 steps per ms) remains 8/9 properties
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (43 resets) in 195 ms. (204 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (64 resets) in 153 ms. (259 steps per ms) remains 7/8 properties
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (61 resets) in 222 ms. (179 steps per ms) remains 6/7 properties
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (51 resets) in 536 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (56 resets) in 132 ms. (300 steps per ms) remains 5/6 properties
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1554 rows 391 cols
[2024-06-01 06:48:18] [INFO ] Computed 14 invariants in 50 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AutonomousCar-PT-09b-ReachabilityFireability-2024-01 is UNSAT
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 300/352 variables, 12/64 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 300/364 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/364 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 39/391 variables, 2/366 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 39/405 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1554/1945 variables, 391/796 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1945 variables, 0/796 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1945 variables, 0/796 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1945/1945 variables, and 796 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1765 ms.
Refiners :[Domain max(s): 391/391 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 309/352 variables, 12/55 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 309/364 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/364 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 39/391 variables, 2/366 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 39/405 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1554/1945 variables, 391/796 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1945 variables, 1/797 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1945 variables, 0/797 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1945 variables, 0/797 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1945/1945 variables, and 797 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1838 ms.
Refiners :[Domain max(s): 391/391 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 4301ms problems are : Problem set: 1 solved, 4 unsolved
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2828 ms.
Support contains 43 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Graph (trivial) has 288 edges and 391 vertex of which 4 / 391 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1699 edges and 389 vertex of which 382 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.29 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 145 rules applied. Total rules applied 147 place count 382 transition count 1400
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 187 rules applied. Total rules applied 334 place count 239 transition count 1356
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 359 place count 215 transition count 1355
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 360 place count 214 transition count 1355
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 360 place count 214 transition count 1327
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 416 place count 186 transition count 1327
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 451 place count 151 transition count 1292
Iterating global reduction 4 with 35 rules applied. Total rules applied 486 place count 151 transition count 1292
Ensure Unique test removed 326 transitions
Reduce isomorphic transitions removed 326 transitions.
Iterating post reduction 4 with 326 rules applied. Total rules applied 812 place count 151 transition count 966
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 817 place count 146 transition count 929
Iterating global reduction 5 with 5 rules applied. Total rules applied 822 place count 146 transition count 929
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 8 rules applied. Total rules applied 830 place count 146 transition count 921
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 834 place count 142 transition count 921
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 890 place count 114 transition count 893
Free-agglomeration rule applied 23 times.
Iterating global reduction 7 with 23 rules applied. Total rules applied 913 place count 114 transition count 870
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 936 place count 91 transition count 870
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 937 place count 91 transition count 869
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 944 place count 91 transition count 869
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 945 place count 90 transition count 868
Applied a total of 945 rules in 648 ms. Remains 90 /391 variables (removed 301) and now considering 868/1554 (removed 686) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 668 ms. Remains : 90/391 places, 868/1554 transitions.
RANDOM walk for 40000 steps (965 resets) in 758 ms. (52 steps per ms) remains 1/3 properties
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (93 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
// Phase 1: matrix 868 rows 90 cols
[2024-06-01 06:48:26] [INFO ] Computed 14 invariants in 8 ms
[2024-06-01 06:48:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 813/838 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/838 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/954 variables, 62/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/954 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/954 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:48:28] [INFO ] Deduced a trap composed of 8 places in 582 ms of which 19 ms to minimize.
[2024-06-01 06:48:28] [INFO ] Deduced a trap composed of 6 places in 669 ms of which 2 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 7 places in 570 ms of which 2 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 9 places in 552 ms of which 1 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 7 places in 556 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/954 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/954 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/957 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/957 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:48:31] [INFO ] Deduced a trap composed of 9 places in 567 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/957 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/957 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/958 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/958 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/958 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 958/958 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4115 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 813/838 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/838 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/954 variables, 62/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/954 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/954 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/954 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/954 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/954 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/957 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/957 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/957 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/957 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/958 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/958 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/958 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 958/958 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 90/90 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 5208ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 868/868 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 90 transition count 865
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 87 transition count 865
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 87 transition count 864
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 86 transition count 864
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 84 transition count 854
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 84 transition count 854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 84 transition count 853
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 33 place count 74 transition count 843
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 35 place count 72 transition count 823
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 72 transition count 823
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 55 place count 63 transition count 814
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 60 place count 63 transition count 809
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 41 rules applied. Total rules applied 101 place count 58 transition count 773
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 57 transition count 772
Applied a total of 102 rules in 257 ms. Remains 57 /90 variables (removed 33) and now considering 772/868 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 57/90 places, 772/868 transitions.
RANDOM walk for 40000 steps (190 resets) in 696 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (181 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 928846 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :0 out of 1
Probabilistic random walk after 928846 steps, saw 126868 distinct states, run finished after 3021 ms. (steps per millisecond=307 ) properties seen :0
// Phase 1: matrix 772 rows 57 cols
[2024-06-01 06:48:35] [INFO ] Computed 14 invariants in 8 ms
[2024-06-01 06:48:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 745/765 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/829 variables, 37/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/829 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/829 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/829 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/829 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 829/829 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 745/765 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/829 variables, 37/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/829 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/829 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/829 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/829 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/829 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 829/829 variables, and 73 constraints, problems are : Problem set: 0 solved, 1 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 968ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 772/772 transitions.
Applied a total of 0 rules in 42 ms. Remains 57 /57 variables (removed 0) and now considering 772/772 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 57/57 places, 772/772 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 772/772 transitions.
Applied a total of 0 rules in 41 ms. Remains 57 /57 variables (removed 0) and now considering 772/772 (removed 0) transitions.
[2024-06-01 06:48:36] [INFO ] Invariant cache hit.
[2024-06-01 06:48:37] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-06-01 06:48:37] [INFO ] Invariant cache hit.
[2024-06-01 06:48:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:48:37] [INFO ] Implicit Places using invariants and state equation in 587 ms returned [52, 56]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 976 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 55/57 places, 771/772 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 770
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 54 transition count 769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 53 transition count 769
Applied a total of 4 rules in 90 ms. Remains 53 /55 variables (removed 2) and now considering 769/771 (removed 2) transitions.
// Phase 1: matrix 769 rows 53 cols
[2024-06-01 06:48:38] [INFO ] Computed 12 invariants in 7 ms
[2024-06-01 06:48:38] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-06-01 06:48:38] [INFO ] Invariant cache hit.
[2024-06-01 06:48:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:48:38] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 53/57 places, 769/772 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2006 ms. Remains : 53/57 places, 769/772 transitions.
RANDOM walk for 40000 steps (56 resets) in 1280 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (178 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 953068 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :0 out of 1
Probabilistic random walk after 953068 steps, saw 131579 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
[2024-06-01 06:48:42] [INFO ] Invariant cache hit.
[2024-06-01 06:48:42] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 745/764 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/764 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 58/822 variables, 34/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/822 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/822 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 53/53 constraints, ReadFeed: 2/2 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 745/764 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/764 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 58/822 variables, 34/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/822 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/822 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 822/822 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 53/53 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 887ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 769/769 transitions.
Applied a total of 0 rules in 42 ms. Remains 53 /53 variables (removed 0) and now considering 769/769 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 53/53 places, 769/769 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 769/769 transitions.
Applied a total of 0 rules in 40 ms. Remains 53 /53 variables (removed 0) and now considering 769/769 (removed 0) transitions.
[2024-06-01 06:48:43] [INFO ] Invariant cache hit.
[2024-06-01 06:48:43] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-01 06:48:43] [INFO ] Invariant cache hit.
[2024-06-01 06:48:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:48:44] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
[2024-06-01 06:48:44] [INFO ] Redundant transitions in 68 ms returned []
Running 767 sub problems to find dead transitions.
[2024-06-01 06:48:44] [INFO ] Invariant cache hit.
[2024-06-01 06:48:44] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Problem TDEAD768 is UNSAT
At refinement iteration 4 (OVERLAPS) 769/822 variables, 53/65 constraints. Problems are: Problem set: 1 solved, 766 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/822 variables, 2/67 constraints. Problems are: Problem set: 1 solved, 766 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 766 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 822/822 variables, and 67 constraints, problems are : Problem set: 1 solved, 766 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 53/53 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 766 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 766 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 766 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 766 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 766 unsolved
At refinement iteration 4 (OVERLAPS) 769/822 variables, 53/65 constraints. Problems are: Problem set: 1 solved, 766 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/822 variables, 2/67 constraints. Problems are: Problem set: 1 solved, 766 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 822/822 variables, and 833 constraints, problems are : Problem set: 1 solved, 766 unsolved in 31637 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 53/53 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 766/767 constraints, Known Traps: 0/0 constraints]
After SMT, in 78434ms problems are : Problem set: 1 solved, 766 unsolved
Search for dead transitions found 1 dead transitions in 78453ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 53/53 places, 768/769 transitions.
Applied a total of 0 rules in 48 ms. Remains 53 /53 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-06-01 06:50:02] [INFO ] Redundant transitions in 132 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 79633 ms. Remains : 53/53 places, 768/769 transitions.
RANDOM walk for 40000 steps (65 resets) in 669 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (177 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 903388 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 1
Probabilistic random walk after 903388 steps, saw 123824 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
// Phase 1: matrix 768 rows 53 cols
[2024-06-01 06:50:06] [INFO ] Computed 13 invariants in 11 ms
[2024-06-01 06:50:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 744/763 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 58/821 variables, 34/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/821 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/821 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/821 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 821/821 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 53/53 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 744/763 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 58/821 variables, 34/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/821 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/821 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/821 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/821 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 821/821 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 923ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 768/768 transitions.
Applied a total of 0 rules in 48 ms. Remains 53 /53 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 53/53 places, 768/768 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 768/768 transitions.
Applied a total of 0 rules in 48 ms. Remains 53 /53 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-06-01 06:50:07] [INFO ] Invariant cache hit.
[2024-06-01 06:50:07] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-06-01 06:50:07] [INFO ] Invariant cache hit.
[2024-06-01 06:50:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:50:08] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
[2024-06-01 06:50:08] [INFO ] Redundant transitions in 14 ms returned []
Running 766 sub problems to find dead transitions.
[2024-06-01 06:50:08] [INFO ] Invariant cache hit.
[2024-06-01 06:50:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 4 (OVERLAPS) 768/821 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/821 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 766 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 821/821 variables, and 67 constraints, problems are : Problem set: 0 solved, 766 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 766/766 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 766 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 4 (OVERLAPS) 768/821 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 766 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/821 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 766 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 821/821 variables, and 833 constraints, problems are : Problem set: 0 solved, 766 unsolved in 31151 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 766/766 constraints, Known Traps: 0/0 constraints]
After SMT, in 77664ms problems are : Problem set: 0 solved, 766 unsolved
Search for dead transitions found 0 dead transitions in 77676ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78645 ms. Remains : 53/53 places, 768/768 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 840 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 42 ms. Remains 52 /53 variables (removed 1) and now considering 768/768 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 768 rows 52 cols
[2024-06-01 06:51:25] [INFO ] Computed 12 invariants in 4 ms
[2024-06-01 06:51:25] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 06:51:26] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:51:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-01 06:51:26] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:51:26] [INFO ] After 458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:51:26] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1066 ms.
[2024-06-01 06:51:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 06:51:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 53 places, 768 transitions and 12114 arcs took 22 ms.
[2024-06-01 06:51:27] [INFO ] Flatten gal took : 466 ms
Total runtime 191508 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : AutonomousCar-PT-09b-ReachabilityFireability-2024-02
BK_STOP 1717224688058
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name AutonomousCar-PT-09b-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/634/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-09b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-09b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167500359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09b.tgz
mv AutonomousCar-PT-09b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;