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.r512-smll-171654407300271.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 Peterson-PT-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407300271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 48K Apr 12 02:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 222K Apr 12 02:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 270K Apr 12 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 75K Apr 12 03:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 304K Apr 12 03:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 212K Apr 12 03:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 982K Apr 12 03:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 298K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-00
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-01
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-02
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-03
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-04
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-05
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-06
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-07
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-08
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-09
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-10
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-11
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-12
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-13
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-14
FORMULA_NAME Peterson-PT-4-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717272110281

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:01:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:01:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:01:52] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-06-01 20:01:52] [INFO ] Transformed 480 places.
[2024-06-01 20:01:52] [INFO ] Transformed 690 transitions.
[2024-06-01 20:01:52] [INFO ] Found NUPN structural information;
[2024-06-01 20:01:52] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 341 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 188 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-4-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2627 ms. (15 steps per ms) remains 7/13 properties
FORMULA Peterson-PT-4-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1705 ms. (23 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2563 ms. (15 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4389 ms. (9 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 7/7 properties
[2024-06-01 20:01:56] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-06-01 20:01:56] [INFO ] Computed 19 invariants in 21 ms
[2024-06-01 20:01:56] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 480/480 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 14/494 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 630/1110 variables, 480/979 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 116/1095 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/1110 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 1095 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2916 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Problem Peterson-PT-4-ReachabilityFireability-2024-01 is UNSAT
FORMULA Peterson-PT-4-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem Peterson-PT-4-ReachabilityFireability-2024-02 is UNSAT
FORMULA Peterson-PT-4-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 480/480 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem Peterson-PT-4-ReachabilityFireability-2024-08 is UNSAT
FORMULA Peterson-PT-4-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 14/494 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-01 20:02:02] [INFO ] Deduced a trap composed of 43 places in 398 ms of which 53 ms to minimize.
[2024-06-01 20:02:03] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 6 ms to minimize.
[2024-06-01 20:02:03] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 6 ms to minimize.
[2024-06-01 20:02:03] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 5 ms to minimize.
[2024-06-01 20:02:04] [INFO ] Deduced a trap composed of 10 places in 334 ms of which 4 ms to minimize.
[2024-06-01 20:02:04] [INFO ] Deduced a trap composed of 10 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:02:04] [INFO ] Deduced a trap composed of 55 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:02:04] [INFO ] Deduced a trap composed of 91 places in 233 ms of which 4 ms to minimize.
[2024-06-01 20:02:05] [INFO ] Deduced a trap composed of 137 places in 297 ms of which 5 ms to minimize.
[2024-06-01 20:02:05] [INFO ] Deduced a trap composed of 51 places in 323 ms of which 4 ms to minimize.
[2024-06-01 20:02:05] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 4 ms to minimize.
[2024-06-01 20:02:06] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 4 ms to minimize.
[2024-06-01 20:02:06] [INFO ] Deduced a trap composed of 39 places in 264 ms of which 4 ms to minimize.
[2024-06-01 20:02:06] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 4 ms to minimize.
[2024-06-01 20:02:06] [INFO ] Deduced a trap composed of 124 places in 251 ms of which 4 ms to minimize.
[2024-06-01 20:02:07] [INFO ] Deduced a trap composed of 69 places in 223 ms of which 4 ms to minimize.
SMT process timed out in 10837ms, After SMT, problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 192 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 480 transition count 603
Reduce places removed 87 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 94 rules applied. Total rules applied 181 place count 393 transition count 596
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 188 place count 386 transition count 596
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 188 place count 386 transition count 519
Deduced a syphon composed of 77 places in 3 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 342 place count 309 transition count 519
Applied a total of 342 rules in 141 ms. Remains 309 /480 variables (removed 171) and now considering 519/690 (removed 171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 309/480 places, 519/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 960 ms. (41 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1319 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 362526 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 4
Probabilistic random walk after 362526 steps, saw 65775 distinct states, run finished after 3013 ms. (steps per millisecond=120 ) properties seen :0
[2024-06-01 20:02:11] [INFO ] Flow matrix only has 459 transitions (discarded 60 similar events)
// Phase 1: matrix 459 rows 309 cols
[2024-06-01 20:02:11] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 20:02:11] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 5/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 117/309 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 117/324 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 4/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 459/768 variables, 309/637 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/768 variables, 116/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/768 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 753 constraints, problems are : Problem set: 0 solved, 4 unsolved in 756 ms.
Refiners :[Domain max(s): 309/309 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 309/309 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 5/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:02:12] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:02:12] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 117/309 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 117/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:02:12] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:02:12] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:02:13] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-06-01 20:02:13] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:02:13] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2024-06-01 20:02:13] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 2 ms to minimize.
[2024-06-01 20:02:13] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:02:14] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:02:14] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 3 ms to minimize.
[2024-06-01 20:02:14] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:02:14] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:02:14] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-06-01 20:02:15] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 2 ms to minimize.
[2024-06-01 20:02:15] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 3 ms to minimize.
[2024-06-01 20:02:15] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:02:15] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-06-01 20:02:15] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 6 ms to minimize.
[2024-06-01 20:02:16] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 4 ms to minimize.
[2024-06-01 20:02:16] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 4 ms to minimize.
[2024-06-01 20:02:16] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 20:02:16] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-06-01 20:02:16] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 4 ms to minimize.
[2024-06-01 20:02:16] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
[2024-06-01 20:02:17] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 3 ms to minimize.
[2024-06-01 20:02:17] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 3 ms to minimize.
[2024-06-01 20:02:17] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 3 ms to minimize.
[2024-06-01 20:02:17] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:02:17] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 3 ms to minimize.
[2024-06-01 20:02:18] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:02:18] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 3 ms to minimize.
[2024-06-01 20:02:18] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 3 ms to minimize.
[2024-06-01 20:02:18] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:02:18] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 3 ms to minimize.
[2024-06-01 20:02:19] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 3 ms to minimize.
[2024-06-01 20:02:19] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:02:19] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 3 ms to minimize.
[2024-06-01 20:02:19] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 3 ms to minimize.
[2024-06-01 20:02:20] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:02:20] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:02:20] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
Problem Peterson-PT-4-ReachabilityFireability-2024-15 is UNSAT
FORMULA Peterson-PT-4-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 20/370 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 20:02:21] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 2 ms to minimize.
[2024-06-01 20:02:21] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2024-06-01 20:02:21] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:02:21] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:02:22] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 3 ms to minimize.
[2024-06-01 20:02:22] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-06-01 20:02:22] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:02:23] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 3 ms to minimize.
[2024-06-01 20:02:23] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 3 ms to minimize.
[2024-06-01 20:02:23] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 3 ms to minimize.
[2024-06-01 20:02:24] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 2 ms to minimize.
[2024-06-01 20:02:24] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 3 ms to minimize.
[2024-06-01 20:02:24] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:02:24] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 3 ms to minimize.
[2024-06-01 20:02:25] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 3 ms to minimize.
[2024-06-01 20:02:25] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 3 ms to minimize.
[2024-06-01 20:02:27] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-06-01 20:02:27] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 3 ms to minimize.
[2024-06-01 20:02:27] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-06-01 20:02:27] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 20/390 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 20:02:28] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 2 ms to minimize.
[2024-06-01 20:02:29] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 3 ms to minimize.
[2024-06-01 20:02:30] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-06-01 20:02:31] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 2 ms to minimize.
Problem Peterson-PT-4-ReachabilityFireability-2024-00 is UNSAT
FORMULA Peterson-PT-4-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 20:02:33] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 3 ms to minimize.
[2024-06-01 20:02:33] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 6/396 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 20:02:34] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 3 ms to minimize.
[2024-06-01 20:02:34] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/309 variables, 2/398 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/309 variables, 0/398 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 459/768 variables, 309/707 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/768 variables, 116/823 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/768 variables, 2/825 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/768 variables, 0/825 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/768 variables, 0/825 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 825 constraints, problems are : Problem set: 2 solved, 2 unsolved in 22934 ms.
Refiners :[Domain max(s): 309/309 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 309/309 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 70/70 constraints]
After SMT, in 23945ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 265 ms.
Support contains 40 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 519/519 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 309 transition count 503
Reduce places removed 16 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 25 rules applied. Total rules applied 41 place count 293 transition count 494
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 50 place count 284 transition count 494
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 50 place count 284 transition count 423
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 192 place count 213 transition count 423
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 230 place count 194 transition count 404
Applied a total of 230 rules in 75 ms. Remains 194 /309 variables (removed 115) and now considering 404/519 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 194/309 places, 404/519 transitions.
RANDOM walk for 40000 steps (8 resets) in 213 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 775296 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 2
Probabilistic random walk after 775296 steps, saw 129807 distinct states, run finished after 3003 ms. (steps per millisecond=258 ) properties seen :0
[2024-06-01 20:02:38] [INFO ] Flow matrix only has 344 transitions (discarded 60 similar events)
// Phase 1: matrix 344 rows 194 cols
[2024-06-01 20:02:38] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 20:02:38] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 144/184 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 144/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/187 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/189 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 344/533 variables, 189/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 116/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/533 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 5/538 variables, 5/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/538 variables, 5/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/538 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/538 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/538 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 523 constraints, problems are : Problem set: 0 solved, 2 unsolved in 377 ms.
Refiners :[Domain max(s): 194/194 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 194/194 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 144/184 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 144/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/187 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:02:39] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:02:39] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:02:39] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:02:39] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:02:39] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:02:39] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2024-06-01 20:02:39] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-06-01 20:02:39] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:02:40] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-06-01 20:02:40] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:02:40] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:02:40] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-06-01 20:02:40] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-06-01 20:02:40] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:02:40] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:02:40] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 20:02:40] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 14/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/189 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/189 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:02:40] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:02:40] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-06-01 20:02:40] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:02:41] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-06-01 20:02:41] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:02:41] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-06-01 20:02:41] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/189 variables, 7/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:02:41] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-06-01 20:02:41] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/189 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/189 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 344/533 variables, 189/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/533 variables, 116/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/533 variables, 2/540 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/533 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 5/538 variables, 5/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/538 variables, 5/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/538 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:02:41] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-06-01 20:02:42] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-06-01 20:02:42] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:02:42] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 3 ms to minimize.
[2024-06-01 20:02:42] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/538 variables, 5/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 20:02:42] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/538 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/538 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/538 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 557 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3890 ms.
Refiners :[Domain max(s): 194/194 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 194/194 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 32/32 constraints]
After SMT, in 4291ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA Peterson-PT-4-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 105 ms.
Support contains 39 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 404/404 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 194 transition count 403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 193 transition count 403
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 193 transition count 402
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 192 transition count 402
Applied a total of 4 rules in 27 ms. Remains 192 /194 variables (removed 2) and now considering 402/404 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 192/194 places, 402/404 transitions.
RANDOM walk for 40000 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1114830 steps, run timeout after 3001 ms. (steps per millisecond=371 ) properties seen :0 out of 1
Probabilistic random walk after 1114830 steps, saw 185942 distinct states, run finished after 3001 ms. (steps per millisecond=371 ) properties seen :0
[2024-06-01 20:02:46] [INFO ] Flow matrix only has 342 transitions (discarded 60 similar events)
// Phase 1: matrix 342 rows 192 cols
[2024-06-01 20:02:46] [INFO ] Computed 19 invariants in 5 ms
[2024-06-01 20:02:46] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 143/182 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 143/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/185 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/187 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 342/529 variables, 187/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/529 variables, 116/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/534 variables, 5/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/534 variables, 5/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/534 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/534 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/534 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Domain max(s): 192/192 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 192/192 constraints, ReadFeed: 116/116 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/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 143/182 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 143/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:02:46] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2024-06-01 20:02:46] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:02:46] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:02:46] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:02:47] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-06-01 20:02:47] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 6/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:02:47] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-06-01 20:02:47] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/185 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:02:47] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/187 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:02:47] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-06-01 20:02:47] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:02:47] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-06-01 20:02:47] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 342/529 variables, 187/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/529 variables, 116/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/529 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/529 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 5/534 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/534 variables, 5/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/534 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:02:48] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-06-01 20:02:48] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-06-01 20:02:48] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-06-01 20:02:48] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/534 variables, 4/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/534 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/534 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 537 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2182 ms.
Refiners :[Domain max(s): 192/192 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 192/192 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 2528ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 39 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 402/402 transitions.
Applied a total of 0 rules in 15 ms. Remains 192 /192 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 192/192 places, 402/402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 402/402 transitions.
Applied a total of 0 rules in 13 ms. Remains 192 /192 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2024-06-01 20:02:48] [INFO ] Flow matrix only has 342 transitions (discarded 60 similar events)
[2024-06-01 20:02:48] [INFO ] Invariant cache hit.
[2024-06-01 20:02:48] [INFO ] Implicit Places using invariants in 239 ms returned [182, 184, 185, 186]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 260 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 188/192 places, 402/402 transitions.
Applied a total of 0 rules in 12 ms. Remains 188 /188 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 287 ms. Remains : 188/192 places, 402/402 transitions.
RANDOM walk for 40000 steps (8 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1147572 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :0 out of 1
Probabilistic random walk after 1147572 steps, saw 191385 distinct states, run finished after 3001 ms. (steps per millisecond=382 ) properties seen :0
[2024-06-01 20:02:52] [INFO ] Flow matrix only has 342 transitions (discarded 60 similar events)
// Phase 1: matrix 342 rows 188 cols
[2024-06-01 20:02:52] [INFO ] Computed 15 invariants in 3 ms
[2024-06-01 20:02:52] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 143/182 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 143/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/183 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 342/525 variables, 183/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 116/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/530 variables, 5/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 5/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/530 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Domain max(s): 188/188 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 116/116 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/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 143/182 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 143/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:02:52] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-06-01 20:02:52] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:02:52] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 3 ms to minimize.
[2024-06-01 20:02:52] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-06-01 20:02:53] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-06-01 20:02:53] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:02:53] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-06-01 20:02:53] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-01 20:02:53] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 9/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/183 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 342/525 variables, 183/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 116/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:02:53] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:02:53] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 2/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:02:53] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:02:54] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-06-01 20:02:54] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-06-01 20:02:54] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 4/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/525 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/530 variables, 5/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 5/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:02:54] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:02:54] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-06-01 20:02:54] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-06-01 20:02:54] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 4/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/530 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/530 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 527 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2600 ms.
Refiners :[Domain max(s): 188/188 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 2968ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 39 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 402/402 transitions.
Applied a total of 0 rules in 10 ms. Remains 188 /188 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 188/188 places, 402/402 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 402/402 transitions.
Applied a total of 0 rules in 8 ms. Remains 188 /188 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2024-06-01 20:02:55] [INFO ] Flow matrix only has 342 transitions (discarded 60 similar events)
[2024-06-01 20:02:55] [INFO ] Invariant cache hit.
[2024-06-01 20:02:55] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-06-01 20:02:55] [INFO ] Flow matrix only has 342 transitions (discarded 60 similar events)
[2024-06-01 20:02:55] [INFO ] Invariant cache hit.
[2024-06-01 20:02:55] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 20:02:55] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2024-06-01 20:02:55] [INFO ] Redundant transitions in 27 ms returned []
Running 397 sub problems to find dead transitions.
[2024-06-01 20:02:55] [INFO ] Flow matrix only has 342 transitions (discarded 60 similar events)
[2024-06-01 20:02:55] [INFO ] Invariant cache hit.
[2024-06-01 20:02:55] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 12/199 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 20:02:58] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:02:58] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-06-01 20:02:58] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:02:58] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:02:58] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-06-01 20:02:58] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-06-01 20:02:58] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:02:58] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:02:58] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:02:58] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:02:58] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:02:58] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-06-01 20:02:59] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:02:59] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:02:59] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-06-01 20:02:59] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-06-01 20:02:59] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:02:59] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-06-01 20:02:59] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:02:59] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 20:03:00] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:03:00] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:03:00] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:03:00] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:03:00] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:03:00] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-06-01 20:03:00] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-06-01 20:03:01] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:03:01] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:03:01] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-06-01 20:03:01] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-06-01 20:03:01] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-06-01 20:03:01] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:03:01] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-06-01 20:03:01] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:03:01] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:03:01] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:03:01] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:03:02] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:03:02] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 20:03:04] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:03:04] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:03:04] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:03:05] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-06-01 20:03:05] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-06-01 20:03:05] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-01 20:03:05] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:03:05] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:03:05] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:03:05] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:03:05] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:03:05] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:03:05] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:03:05] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:03:06] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:03:06] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 16/255 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 20:03:08] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-06-01 20:03:08] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:03:08] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 20:03:11] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 20:03:14] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 20:03:17] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-06-01 20:03:17] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-06-01 20:03:17] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-06-01 20:03:18] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 10 (OVERLAPS) 1/188 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-06-01 20:03:24] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-06-01 20:03:24] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:03:25] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-01 20:03:25] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-01 20:03:25] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-06-01 20:03:25] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:03:25] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:03:25] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-06-01 20:03:25] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-06-01 20:03:25] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:03:25] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-06-01 20:03:25] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 20:03:26] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
SMT process timed out in 30227ms, After SMT, problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 30239ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30988 ms. Remains : 188/188 places, 402/402 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 230 edges and 188 vertex of which 57 / 188 are part of one of the 16 SCC in 4 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 146 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 147 transition count 252
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 143 transition count 252
Performed 22 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 53 place count 121 transition count 222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 59 place count 121 transition count 216
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 23 rules applied. Total rules applied 82 place count 109 transition count 256
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 37 edges and 109 vertex of which 7 / 109 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 93 place count 103 transition count 246
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 102 place count 103 transition count 237
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 121 place count 103 transition count 218
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 103 transition count 216
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 5 rules applied. Total rules applied 128 place count 101 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 131 place count 98 transition count 213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 131 place count 98 transition count 212
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 133 place count 97 transition count 212
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 138 place count 97 transition count 207
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 143 place count 92 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 144 place count 92 transition count 206
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 157 place count 92 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 159 place count 92 transition count 204
Applied a total of 159 rules in 77 ms. Remains 92 /188 variables (removed 96) and now considering 204/402 (removed 198) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 204 rows 92 cols
[2024-06-01 20:03:26] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 20:03:26] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 20:03:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 20:03:26] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 20:03:26] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 20:03:26] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 20:03:26] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 423 ms.
[2024-06-01 20:03:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 20:03:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 188 places, 402 transitions and 1536 arcs took 7 ms.
[2024-06-01 20:03:26] [INFO ] Flatten gal took : 95 ms
Total runtime 94889 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Peterson-PT-4-ReachabilityFireability-2024-13

BK_STOP 1717272207336

--------------------
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 Peterson-PT-4-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/1268/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="Peterson-PT-4"
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 Peterson-PT-4, 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 r512-smll-171654407300271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;