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.r528-tall-171683761600655.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 ShieldPPPt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761600655
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 569K 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 ShieldPPPt-PT-030B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717258484130

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:14:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:14:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:14:45] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-06-01 16:14:45] [INFO ] Transformed 2343 places.
[2024-06-01 16:14:45] [INFO ] Transformed 2133 transitions.
[2024-06-01 16:14:45] [INFO ] Found NUPN structural information;
[2024-06-01 16:14:45] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 367 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1817 ms. (22 steps per ms) remains 8/16 properties
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 934 ms. (42 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
// Phase 1: matrix 2133 rows 2343 cols
[2024-06-01 16:14:47] [INFO ] Computed 331 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1806/1928 variables, 261/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1928 variables, 1806/2189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1928 variables, 0/2189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 415/2343 variables, 70/2259 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2343 variables, 415/2674 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2343 variables, 0/2674 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2133/4476 variables, 2343/5017 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4476 variables, 0/5017 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/4476 variables, 0/5017 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4476/4476 variables, and 5017 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3031 ms.
Refiners :[Domain max(s): 2343/2343 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 2343/2343 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1806/1928 variables, 261/383 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1928 variables, 1806/2189 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 16:14:51] [INFO ] Deduced a trap composed of 23 places in 502 ms of which 78 ms to minimize.
[2024-06-01 16:14:51] [INFO ] Deduced a trap composed of 33 places in 453 ms of which 12 ms to minimize.
[2024-06-01 16:14:52] [INFO ] Deduced a trap composed of 13 places in 391 ms of which 7 ms to minimize.
[2024-06-01 16:14:52] [INFO ] Deduced a trap composed of 22 places in 484 ms of which 5 ms to minimize.
[2024-06-01 16:14:53] [INFO ] Deduced a trap composed of 40 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:14:53] [INFO ] Deduced a trap composed of 34 places in 285 ms of which 5 ms to minimize.
[2024-06-01 16:14:53] [INFO ] Deduced a trap composed of 32 places in 290 ms of which 6 ms to minimize.
[2024-06-01 16:14:54] [INFO ] Deduced a trap composed of 33 places in 237 ms of which 5 ms to minimize.
[2024-06-01 16:14:54] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 5 ms to minimize.
[2024-06-01 16:14:54] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 5 ms to minimize.
[2024-06-01 16:14:54] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 4 ms to minimize.
[2024-06-01 16:14:55] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 5 ms to minimize.
[2024-06-01 16:14:55] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 4 ms to minimize.
SMT process timed out in 8379ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 122 out of 2343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 471 transitions
Trivial Post-agglo rules discarded 471 transitions
Performed 471 trivial Post agglomeration. Transition count delta: 471
Iterating post reduction 0 with 471 rules applied. Total rules applied 471 place count 2343 transition count 1662
Reduce places removed 471 places and 0 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 1 with 509 rules applied. Total rules applied 980 place count 1872 transition count 1624
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1018 place count 1834 transition count 1624
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 125 Pre rules applied. Total rules applied 1018 place count 1834 transition count 1499
Deduced a syphon composed of 125 places in 20 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 1268 place count 1709 transition count 1499
Discarding 194 places :
Symmetric choice reduction at 3 with 194 rule applications. Total rules 1462 place count 1515 transition count 1305
Iterating global reduction 3 with 194 rules applied. Total rules applied 1656 place count 1515 transition count 1305
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 1656 place count 1515 transition count 1231
Deduced a syphon composed of 74 places in 7 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 1804 place count 1441 transition count 1231
Performed 454 Post agglomeration using F-continuation condition.Transition count delta: 454
Deduced a syphon composed of 454 places in 3 ms
Reduce places removed 454 places and 0 transitions.
Iterating global reduction 3 with 908 rules applied. Total rules applied 2712 place count 987 transition count 777
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
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 2854 place count 916 transition count 777
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2855 place count 916 transition count 776
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 2862 place count 916 transition count 769
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 2869 place count 909 transition count 769
Partial Free-agglomeration rule applied 79 times.
Drop transitions (Partial Free agglomeration) removed 79 transitions
Iterating global reduction 4 with 79 rules applied. Total rules applied 2948 place count 909 transition count 769
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2949 place count 908 transition count 768
Applied a total of 2949 rules in 1239 ms. Remains 908 /2343 variables (removed 1435) and now considering 768/2133 (removed 1365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1267 ms. Remains : 908/2343 places, 768/2133 transitions.
RANDOM walk for 40000 steps (8 resets) in 478 ms. (83 steps per ms) remains 6/8 properties
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 225 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
// Phase 1: matrix 768 rows 908 cols
[2024-06-01 16:14:57] [INFO ] Computed 331 invariants in 4 ms
[2024-06-01 16:14:57] [INFO ] State equation strengthened by 103 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 629/747 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/747 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 35/782 variables, 15/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/782 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 702/1484 variables, 782/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1484 variables, 97/1155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1484 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 132/1616 variables, 83/1238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1616 variables, 29/1267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1616 variables, 6/1273 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1616 variables, 0/1273 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 8/1624 variables, 9/1282 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1624 variables, 8/1290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1624 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 14/1638 variables, 7/1297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1638 variables, 0/1297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 35/1673 variables, 33/1330 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1673 variables, 9/1339 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1673 variables, 0/1339 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 3/1676 variables, 2/1341 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1676 variables, 1/1342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1676 variables, 0/1342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/1676 variables, 0/1342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1676/1676 variables, and 1342 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2206 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 908/908 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 629/747 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:14:59] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 16:14:59] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:15:00] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 8 ms to minimize.
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 3 ms to minimize.
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/747 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:15:01] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:15:02] [INFO ] Deduced a trap composed of 9 places in 375 ms of which 1 ms to minimize.
[2024-06-01 16:15:02] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 16:15:02] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-06-01 16:15:02] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 3 ms to minimize.
[2024-06-01 16:15:02] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 16:15:02] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:15:03] [INFO ] Deduced a trap composed of 8 places in 501 ms of which 14 ms to minimize.
[2024-06-01 16:15:03] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2024-06-01 16:15:03] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 16:15:03] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/747 variables, 11/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:15:03] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/747 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/747 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 35/782 variables, 15/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 702/1484 variables, 782/1090 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1484 variables, 97/1187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1484 variables, 3/1190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:15:05] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 16:15:06] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1484 variables, 2/1192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1484 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 132/1616 variables, 83/1275 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1616 variables, 29/1304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1616 variables, 6/1310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1616 variables, 3/1313 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:15:07] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:15:07] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 ms to minimize.
[2024-06-01 16:15:07] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:15:07] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-06-01 16:15:07] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:15:07] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-06-01 16:15:07] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:15:08] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:15:08] [INFO ] Deduced a trap composed of 7 places in 765 ms of which 20 ms to minimize.
[2024-06-01 16:15:08] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:15:09] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:15:09] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-06-01 16:15:09] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:15:09] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2024-06-01 16:15:09] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-06-01 16:15:09] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-06-01 16:15:10] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-06-01 16:15:10] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:15:10] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1616 variables, 19/1332 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:15:11] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1616 variables, 1/1333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:15:11] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1616 variables, 1/1334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1616 variables, 0/1334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 8/1624 variables, 9/1343 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1624 variables, 8/1351 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1624 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 14/1638 variables, 7/1358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:15:13] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1638 variables, 1/1359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1638 variables, 0/1359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 35/1673 variables, 33/1392 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1673 variables, 9/1401 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 16:15:14] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1673 variables, 1/1402 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1673 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 3/1676 variables, 2/1404 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1676 variables, 1/1405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1676 variables, 0/1405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 0/1676 variables, 0/1405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 1405 constraints, problems are : Problem set: 0 solved, 6 unsolved in 17170 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 908/908 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 57/57 constraints]
After SMT, in 19462ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5672 ms.
Support contains 118 out of 908 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 908/908 places, 768/768 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 908 transition count 766
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 906 transition count 766
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 906 transition count 766
Applied a total of 7 rules in 71 ms. Remains 906 /908 variables (removed 2) and now considering 766/768 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 906/908 places, 766/768 transitions.
RANDOM walk for 40000 steps (8 resets) in 548 ms. (72 steps per ms) remains 5/6 properties
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 345 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 5/5 properties
// Phase 1: matrix 766 rows 906 cols
[2024-06-01 16:15:23] [INFO ] Computed 331 invariants in 12 ms
[2024-06-01 16:15:23] [INFO ] State equation strengthened by 103 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 629/745 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/745 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 35/780 variables, 15/276 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/780 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 700/1480 variables, 780/1056 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1480 variables, 97/1153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1480 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 132/1612 variables, 83/1236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1612 variables, 29/1265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1612 variables, 6/1271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1612 variables, 0/1271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 8/1620 variables, 9/1280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1620 variables, 8/1288 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1620 variables, 0/1288 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 14/1634 variables, 7/1295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1634 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 35/1669 variables, 33/1328 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1669 variables, 9/1337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1669 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 3/1672 variables, 2/1339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1672 variables, 1/1340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1672 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/1672 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1672/1672 variables, and 1340 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1853 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 906/906 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 629/745 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 16:15:25] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-06-01 16:15:25] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:15:25] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:15:25] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:15:25] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:15:25] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-06-01 16:15:25] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-06-01 16:15:25] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 16:15:25] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/745 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 16:15:26] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 16:15:27] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 16:15:27] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 16:15:27] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/745 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 16:15:27] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/745 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/745 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 35/780 variables, 15/305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/780 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 700/1480 variables, 780/1085 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1480 variables, 97/1182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1480 variables, 2/1184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 16:15:28] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:15:28] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-06-01 16:15:28] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-06-01 16:15:28] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-06-01 16:15:28] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:15:28] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:15:28] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:15:28] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1480 variables, 8/1192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 16:15:29] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1480 variables, 1/1193 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1480 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 132/1612 variables, 83/1276 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1612 variables, 29/1305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1612 variables, 6/1311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1612 variables, 3/1314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 16:15:30] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:15:30] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:15:30] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:15:30] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:15:30] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-06-01 16:15:30] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2024-06-01 16:15:30] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:15:31] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1612 variables, 8/1322 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1612 variables, 0/1322 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 8/1620 variables, 9/1331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1620 variables, 8/1339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1620 variables, 0/1339 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 14/1634 variables, 7/1346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1634 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 35/1669 variables, 33/1379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1669 variables, 9/1388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 16:15:33] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1669 variables, 1/1389 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1669 variables, 0/1389 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 3/1672 variables, 2/1391 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1672 variables, 1/1392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1672 variables, 0/1392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 0/1672 variables, 0/1392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1672/1672 variables, and 1392 constraints, problems are : Problem set: 0 solved, 5 unsolved in 10815 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 906/906 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 47/47 constraints]
After SMT, in 12708ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 8558 ms.
Support contains 116 out of 906 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 906/906 places, 766/766 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 906 transition count 765
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 905 transition count 765
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 904 transition count 764
Applied a total of 4 rules in 39 ms. Remains 904 /906 variables (removed 2) and now considering 764/766 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 904/906 places, 764/766 transitions.
RANDOM walk for 40000 steps (8 resets) in 425 ms. (93 steps per ms) remains 4/5 properties
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
// Phase 1: matrix 764 rows 904 cols
[2024-06-01 16:15:44] [INFO ] Computed 331 invariants in 2 ms
[2024-06-01 16:15:44] [INFO ] State equation strengthened by 105 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 627/743 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/743 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 35/778 variables, 15/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/778 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 698/1476 variables, 778/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1476 variables, 99/1153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1476 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 132/1608 variables, 83/1236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1608 variables, 29/1265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1608 variables, 6/1271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1608 variables, 0/1271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 8/1616 variables, 9/1280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1616 variables, 8/1288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1616 variables, 0/1288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/1630 variables, 7/1295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1630 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 35/1665 variables, 33/1328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1665 variables, 9/1337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1665 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 3/1668 variables, 2/1339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1668 variables, 1/1340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1668 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1668 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1668/1668 variables, and 1340 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1693 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 904/904 constraints, ReadFeed: 105/105 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/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 627/743 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:15:46] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:15:47] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:15:47] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:15:47] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:15:47] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:15:47] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:15:47] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:15:47] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:15:47] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:15:47] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:15:47] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:15:48] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:15:48] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:15:48] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:15:48] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-06-01 16:15:48] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-06-01 16:15:48] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:15:48] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:15:48] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:15:48] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/743 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:15:48] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:15:48] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:15:49] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-06-01 16:15:49] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-06-01 16:15:49] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 3 ms to minimize.
[2024-06-01 16:15:49] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-06-01 16:15:49] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-01 16:15:49] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-06-01 16:15:49] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:15:49] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-06-01 16:15:49] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 16:15:49] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-06-01 16:15:49] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 16:15:49] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-06-01 16:15:50] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/743 variables, 15/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:15:50] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:15:50] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:15:50] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/743 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:15:50] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/743 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 35/778 variables, 15/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:15:50] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/778 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/778 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 698/1476 variables, 778/1094 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1476 variables, 99/1193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1476 variables, 1/1194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:15:51] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:15:51] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 3 ms to minimize.
[2024-06-01 16:15:51] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 3 ms to minimize.
[2024-06-01 16:15:51] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:15:51] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 3 ms to minimize.
[2024-06-01 16:15:51] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 3 ms to minimize.
[2024-06-01 16:15:52] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:15:52] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-06-01 16:15:52] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1476 variables, 9/1203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:15:52] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1476 variables, 1/1204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1476 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 132/1608 variables, 83/1287 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1608 variables, 29/1316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1608 variables, 6/1322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1608 variables, 3/1325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:15:54] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:15:54] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:15:54] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:15:55] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:15:55] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:15:55] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:15:55] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-06-01 16:15:55] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-06-01 16:15:55] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:15:56] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-06-01 16:15:56] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:15:56] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-06-01 16:15:56] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:15:56] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-06-01 16:15:56] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1608 variables, 15/1340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1608 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 8/1616 variables, 9/1349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1616 variables, 8/1357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1616 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 14/1630 variables, 7/1364 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:15:58] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-01 16:15:58] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2024-06-01 16:15:58] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1630 variables, 3/1367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1630 variables, 0/1367 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 35/1665 variables, 33/1400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1665 variables, 9/1409 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:15:59] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:15:59] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1665 variables, 2/1411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1665 variables, 0/1411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 3/1668 variables, 2/1413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1668 variables, 1/1414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1668 variables, 0/1414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 0/1668 variables, 0/1414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1668/1668 variables, and 1414 constraints, problems are : Problem set: 0 solved, 4 unsolved in 14307 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 904/904 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 70/70 constraints]
After SMT, in 16023ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 5792 ms.
Support contains 116 out of 904 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 904/904 places, 764/764 transitions.
Applied a total of 0 rules in 37 ms. Remains 904 /904 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 904/904 places, 764/764 transitions.
RANDOM walk for 40000 steps (8 resets) in 363 ms. (109 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 138970 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 4
Probabilistic random walk after 138970 steps, saw 112857 distinct states, run finished after 3007 ms. (steps per millisecond=46 ) properties seen :0
[2024-06-01 16:16:10] [INFO ] Invariant cache hit.
[2024-06-01 16:16:10] [INFO ] State equation strengthened by 105 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 627/743 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/743 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 35/778 variables, 15/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/778 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 698/1476 variables, 778/1054 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1476 variables, 99/1153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1476 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 132/1608 variables, 83/1236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1608 variables, 29/1265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1608 variables, 6/1271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1608 variables, 0/1271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 8/1616 variables, 9/1280 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1616 variables, 8/1288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1616 variables, 0/1288 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/1630 variables, 7/1295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1630 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 35/1665 variables, 33/1328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1665 variables, 9/1337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1665 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 3/1668 variables, 2/1339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1668 variables, 1/1340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1668 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1668 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1668/1668 variables, and 1340 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1655 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 904/904 constraints, ReadFeed: 105/105 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/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 627/743 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:16:12] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:16:12] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:16:12] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:16:12] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:16:12] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-06-01 16:16:12] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:16:12] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-06-01 16:16:12] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:16:12] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:16:13] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:16:13] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:16:13] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:16:13] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:16:13] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:16:13] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-06-01 16:16:13] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 16:16:13] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-06-01 16:16:13] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-06-01 16:16:13] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-06-01 16:16:13] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/743 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:16:13] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-06-01 16:16:14] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 16:16:14] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/743 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/743 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 35/778 variables, 15/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/778 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 698/1476 variables, 778/1077 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 99/1176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1476 variables, 1/1177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:16:14] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 3 ms to minimize.
[2024-06-01 16:16:14] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 3 ms to minimize.
[2024-06-01 16:16:15] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-06-01 16:16:15] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1476 variables, 4/1181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:16:15] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-06-01 16:16:15] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1476 variables, 2/1183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:16:16] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-06-01 16:16:16] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1476 variables, 2/1185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1476 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 132/1608 variables, 83/1268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1608 variables, 29/1297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1608 variables, 6/1303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1608 variables, 3/1306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:16:17] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-06-01 16:16:17] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:16:18] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:16:18] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-06-01 16:16:19] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-06-01 16:16:19] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:16:19] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 16:16:19] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 16:16:19] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-06-01 16:16:19] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
[2024-06-01 16:16:19] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-06-01 16:16:19] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-06-01 16:16:20] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-06-01 16:16:20] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:16:20] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-06-01 16:16:20] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1608 variables, 16/1322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1608 variables, 0/1322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 8/1616 variables, 9/1331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1616 variables, 8/1339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1616 variables, 0/1339 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 14/1630 variables, 7/1346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1630 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 35/1665 variables, 33/1379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1665 variables, 9/1388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 16:16:22] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1665 variables, 1/1389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1665 variables, 0/1389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 3/1668 variables, 2/1391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1668 variables, 1/1392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1668 variables, 0/1392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 0/1668 variables, 0/1392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1668/1668 variables, and 1392 constraints, problems are : Problem set: 0 solved, 4 unsolved in 12345 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 904/904 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 48/48 constraints]
After SMT, in 14025ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3192 ms.
Support contains 116 out of 904 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 904/904 places, 764/764 transitions.
Applied a total of 0 rules in 27 ms. Remains 904 /904 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 904/904 places, 764/764 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 904/904 places, 764/764 transitions.
Applied a total of 0 rules in 16 ms. Remains 904 /904 variables (removed 0) and now considering 764/764 (removed 0) transitions.
[2024-06-01 16:16:27] [INFO ] Invariant cache hit.
[2024-06-01 16:16:27] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-06-01 16:16:27] [INFO ] Invariant cache hit.
[2024-06-01 16:16:28] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-01 16:16:29] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
[2024-06-01 16:16:29] [INFO ] Redundant transitions in 40 ms returned []
Running 750 sub problems to find dead transitions.
[2024-06-01 16:16:29] [INFO ] Invariant cache hit.
[2024-06-01 16:16:29] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/892 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 750 unsolved
[2024-06-01 16:16:47] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 16:16:47] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 16:16:48] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/892 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 750 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/892 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 750 unsolved
SMT process timed out in 30174ms, After SMT, problems are : Problem set: 0 solved, 750 unsolved
Search for dead transitions found 0 dead transitions in 30184ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32267 ms. Remains : 904/904 places, 764/764 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 139 times.
Drop transitions (Partial Free agglomeration) removed 139 transitions
Iterating global reduction 0 with 139 rules applied. Total rules applied 139 place count 904 transition count 764
Applied a total of 139 rules in 49 ms. Remains 904 /904 variables (removed 0) and now considering 764/764 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 764 rows 904 cols
[2024-06-01 16:16:59] [INFO ] Computed 331 invariants in 4 ms
[2024-06-01 16:16:59] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 16:17:00] [INFO ] [Nat]Absence check using 331 positive place invariants in 59 ms returned sat
[2024-06-01 16:17:00] [INFO ] After 619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 16:17:00] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-06-01 16:17:01] [INFO ] After 461ms SMT Verify possible using 122 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 16:17:01] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:17:01] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 4 ms to minimize.
[2024-06-01 16:17:02] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 5 ms to minimize.
[2024-06-01 16:17:02] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 5 ms to minimize.
[2024-06-01 16:17:02] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 3 ms to minimize.
[2024-06-01 16:17:02] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 2 ms to minimize.
[2024-06-01 16:17:03] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 3 ms to minimize.
[2024-06-01 16:17:03] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:17:03] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:17:03] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 3 ms to minimize.
[2024-06-01 16:17:03] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 3 ms to minimize.
[2024-06-01 16:17:03] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
[2024-06-01 16:17:04] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:17:04] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 3 ms to minimize.
[2024-06-01 16:17:04] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 2 ms to minimize.
[2024-06-01 16:17:04] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 3 ms to minimize.
[2024-06-01 16:17:04] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 4 ms to minimize.
[2024-06-01 16:17:05] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 10 ms to minimize.
[2024-06-01 16:17:05] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
[2024-06-01 16:17:05] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 3 ms to minimize.
[2024-06-01 16:17:05] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:17:05] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:17:05] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-06-01 16:17:06] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 2 ms to minimize.
[2024-06-01 16:17:06] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2024-06-01 16:17:06] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 3 ms to minimize.
[2024-06-01 16:17:06] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-06-01 16:17:06] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:17:06] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:17:07] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-06-01 16:17:07] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-06-01 16:17:07] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-01 16:17:07] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-06-01 16:17:07] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 6138 ms
[2024-06-01 16:17:07] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:17:08] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:17:08] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:17:08] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:17:08] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:17:08] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:17:08] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-06-01 16:17:08] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:17:09] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 2 ms to minimize.
[2024-06-01 16:17:09] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:17:09] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:17:09] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:17:09] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-06-01 16:17:09] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 3 ms to minimize.
[2024-06-01 16:17:09] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-06-01 16:17:09] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:17:10] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-06-01 16:17:10] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-06-01 16:17:10] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-06-01 16:17:10] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:17:10] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:17:10] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 16:17:10] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:17:11] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-06-01 16:17:11] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3327 ms
[2024-06-01 16:17:11] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 2 ms to minimize.
[2024-06-01 16:17:11] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:17:11] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-06-01 16:17:11] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-06-01 16:17:11] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:17:11] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-06-01 16:17:12] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:17:12] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 16:17:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1044 ms
[2024-06-01 16:17:12] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:17:12] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-06-01 16:17:12] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-06-01 16:17:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 366 ms
TRAPS : Iteration 1
[2024-06-01 16:17:12] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:17:13] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:17:13] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 3 ms to minimize.
[2024-06-01 16:17:13] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 3 ms to minimize.
[2024-06-01 16:17:13] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:17:13] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-06-01 16:17:13] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 3 ms to minimize.
[2024-06-01 16:17:14] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 3 ms to minimize.
[2024-06-01 16:17:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1395 ms
[2024-06-01 16:17:14] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-06-01 16:17:14] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-06-01 16:17:14] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-06-01 16:17:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 412 ms
TRAPS : Iteration 2
[2024-06-01 16:17:15] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 4 ms to minimize.
[2024-06-01 16:17:15] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 4 ms to minimize.
[2024-06-01 16:17:15] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:17:16] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 3 ms to minimize.
[2024-06-01 16:17:16] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:17:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1056 ms
[2024-06-01 16:17:16] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 4 ms to minimize.
[2024-06-01 16:17:17] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 3 ms to minimize.
[2024-06-01 16:17:17] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:17:17] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 3 ms to minimize.
[2024-06-01 16:17:17] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 2 ms to minimize.
[2024-06-01 16:17:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 971 ms
[2024-06-01 16:17:17] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-06-01 16:17:18] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-06-01 16:17:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 353 ms
TRAPS : Iteration 3
[2024-06-01 16:17:18] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:17:18] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
[2024-06-01 16:17:18] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-06-01 16:17:19] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:17:19] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-06-01 16:17:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 834 ms
[2024-06-01 16:17:19] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2024-06-01 16:17:19] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 2 ms to minimize.
[2024-06-01 16:17:19] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-06-01 16:17:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 518 ms
[2024-06-01 16:17:20] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-06-01 16:17:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
TRAPS : Iteration 4
[2024-06-01 16:17:20] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 3 ms to minimize.
[2024-06-01 16:17:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2024-06-01 16:17:21] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 3 ms to minimize.
[2024-06-01 16:17:21] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
[2024-06-01 16:17:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 413 ms
[2024-06-01 16:17:21] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 2 ms to minimize.
[2024-06-01 16:17:21] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:17:22] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-06-01 16:17:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 543 ms
TRAPS : Iteration 5
[2024-06-01 16:17:22] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 3 ms to minimize.
[2024-06-01 16:17:23] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 3 ms to minimize.
[2024-06-01 16:17:23] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 3 ms to minimize.
[2024-06-01 16:17:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 536 ms
[2024-06-01 16:17:23] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 2 ms to minimize.
[2024-06-01 16:17:23] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 3 ms to minimize.
[2024-06-01 16:17:23] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-06-01 16:17:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 532 ms
[2024-06-01 16:17:24] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-06-01 16:17:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
TRAPS : Iteration 6
[2024-06-01 16:17:24] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 3 ms to minimize.
[2024-06-01 16:17:24] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 3 ms to minimize.
[2024-06-01 16:17:24] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 3 ms to minimize.
[2024-06-01 16:17:25] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 3 ms to minimize.
[2024-06-01 16:17:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 746 ms
[2024-06-01 16:17:25] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 3 ms to minimize.
[2024-06-01 16:17:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2024-06-01 16:17:25] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
[2024-06-01 16:17:26] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 3 ms to minimize.
[2024-06-01 16:17:26] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 2 ms to minimize.
[2024-06-01 16:17:26] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 3 ms to minimize.
[2024-06-01 16:17:26] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 3 ms to minimize.
[2024-06-01 16:17:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1020 ms
TRAPS : Iteration 7
[2024-06-01 16:17:28] [INFO ] After 27580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 16:17:29] [INFO ] After 29200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 29459 ms.
[2024-06-01 16:17:29] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 16:17:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 904 places, 764 transitions and 3092 arcs took 8 ms.
[2024-06-01 16:17:29] [INFO ] Flatten gal took : 102 ms
Total runtime 164199 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 : ShieldPPPt-PT-030B-ReachabilityFireability-2024-01
Could not compute solution for formula : ShieldPPPt-PT-030B-ReachabilityFireability-2024-08
Could not compute solution for formula : ShieldPPPt-PT-030B-ReachabilityFireability-2024-09
Could not compute solution for formula : ShieldPPPt-PT-030B-ReachabilityFireability-2024-14

BK_STOP 1717258649784

--------------------
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 ShieldPPPt-PT-030B-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/1697/inv_0_
rfs formula name ShieldPPPt-PT-030B-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/1697/inv_1_
rfs formula name ShieldPPPt-PT-030B-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/1697/inv_2_
rfs formula name ShieldPPPt-PT-030B-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/1697/inv_3_
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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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 r528-tall-171683761600655"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B 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 ;