fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r355-tall-171683760101038
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for ShieldRVt-PT-050B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12776.659 3600000.00 13989456.00 468.30 ??TFTF??F?FTFT?F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r355-tall-171683760101038.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 greatspnxred
Input is ShieldRVt-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760101038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 11 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 614K 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 ShieldRVt-PT-050B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717087984107

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 16:53:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 16:53:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 16:53:05] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-05-30 16:53:05] [INFO ] Transformed 2503 places.
[2024-05-30 16:53:05] [INFO ] Transformed 2503 transitions.
[2024-05-30 16:53:05] [INFO ] Found NUPN structural information;
[2024-05-30 16:53:05] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 351 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1520 ms. (26 steps per ms) remains 7/13 properties
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 978 ms. (40 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
// Phase 1: matrix 2503 rows 2503 cols
[2024-05-30 16:53:07] [INFO ] Computed 201 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1681/1805 variables, 140/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1805 variables, 1681/1945 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1805 variables, 0/1945 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 698/2503 variables, 61/2006 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 698/2704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/2704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2503/5006 variables, 2503/5207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5006 variables, 0/5207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/5006 variables, 0/5207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5006/5006 variables, and 5207 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3398 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1681/1805 variables, 140/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1805 variables, 1681/1945 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-30 16:53:11] [INFO ] Deduced a trap composed of 32 places in 480 ms of which 75 ms to minimize.
[2024-05-30 16:53:12] [INFO ] Deduced a trap composed of 39 places in 413 ms of which 8 ms to minimize.
[2024-05-30 16:53:12] [INFO ] Deduced a trap composed of 61 places in 368 ms of which 7 ms to minimize.
[2024-05-30 16:53:12] [INFO ] Deduced a trap composed of 27 places in 353 ms of which 7 ms to minimize.
[2024-05-30 16:53:13] [INFO ] Deduced a trap composed of 27 places in 326 ms of which 7 ms to minimize.
[2024-05-30 16:53:13] [INFO ] Deduced a trap composed of 46 places in 318 ms of which 6 ms to minimize.
[2024-05-30 16:53:14] [INFO ] Deduced a trap composed of 51 places in 335 ms of which 6 ms to minimize.
[2024-05-30 16:53:14] [INFO ] Deduced a trap composed of 38 places in 327 ms of which 6 ms to minimize.
[2024-05-30 16:53:14] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 5 ms to minimize.
[2024-05-30 16:53:15] [INFO ] Deduced a trap composed of 56 places in 303 ms of which 6 ms to minimize.
[2024-05-30 16:53:15] [INFO ] Deduced a trap composed of 29 places in 294 ms of which 6 ms to minimize.
[2024-05-30 16:53:15] [INFO ] Deduced a trap composed of 47 places in 282 ms of which 6 ms to minimize.
[2024-05-30 16:53:16] [INFO ] Deduced a trap composed of 62 places in 295 ms of which 6 ms to minimize.
SMT process timed out in 8932ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 124 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 691 transitions
Trivial Post-agglo rules discarded 691 transitions
Performed 691 trivial Post agglomeration. Transition count delta: 691
Iterating post reduction 0 with 691 rules applied. Total rules applied 691 place count 2503 transition count 1812
Reduce places removed 691 places and 0 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Iterating post reduction 1 with 729 rules applied. Total rules applied 1420 place count 1812 transition count 1774
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1458 place count 1774 transition count 1774
Performed 194 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 194 Pre rules applied. Total rules applied 1458 place count 1774 transition count 1580
Deduced a syphon composed of 194 places in 4 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 3 with 388 rules applied. Total rules applied 1846 place count 1580 transition count 1580
Discarding 303 places :
Symmetric choice reduction at 3 with 303 rule applications. Total rules 2149 place count 1277 transition count 1277
Iterating global reduction 3 with 303 rules applied. Total rules applied 2452 place count 1277 transition count 1277
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 2452 place count 1277 transition count 1155
Deduced a syphon composed of 122 places in 6 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 2696 place count 1155 transition count 1155
Performed 432 Post agglomeration using F-continuation condition.Transition count delta: 432
Deduced a syphon composed of 432 places in 2 ms
Reduce places removed 432 places and 0 transitions.
Iterating global reduction 3 with 864 rules applied. Total rules applied 3560 place count 723 transition count 723
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3762 place count 622 transition count 804
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 3808 place count 599 transition count 819
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3809 place count 599 transition count 818
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 3810 place count 599 transition count 817
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3812 place count 599 transition count 815
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3814 place count 597 transition count 815
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3815 place count 597 transition count 814
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3816 place count 597 transition count 814
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3817 place count 596 transition count 813
Applied a total of 3817 rules in 680 ms. Remains 596 /2503 variables (removed 1907) and now considering 813/2503 (removed 1690) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 689 ms. Remains : 596/2503 places, 813/2503 transitions.
RANDOM walk for 40000 steps (25 resets) in 933 ms. (42 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 156 ms. (254 steps per ms) remains 6/7 properties
FORMULA ShieldRVt-PT-050B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
// Phase 1: matrix 813 rows 596 cols
[2024-05-30 16:53:17] [INFO ] Computed 201 invariants in 7 ms
[2024-05-30 16:53:17] [INFO ] State equation strengthened by 347 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 338/447 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 132/579 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 795/1374 variables, 579/772 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1374 variables, 346/1118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1374 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 22/1396 variables, 10/1128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1396 variables, 5/1133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1396 variables, 1/1134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1396 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 12/1408 variables, 6/1140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1408 variables, 2/1142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1408 variables, 0/1142 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/1409 variables, 1/1143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1409 variables, 1/1144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1409 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1409 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1409/1409 variables, and 1144 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1818 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 596/596 constraints, ReadFeed: 347/347 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/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 338/447 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:53:19] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-30 16:53:19] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 3 ms to minimize.
[2024-05-30 16:53:19] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-30 16:53:19] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-30 16:53:19] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/447 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:53:19] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-30 16:53:19] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 132/579 variables, 61/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:53:20] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-05-30 16:53:20] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-30 16:53:20] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-30 16:53:20] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2024-05-30 16:53:20] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-30 16:53:20] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:53:20] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 795/1374 variables, 579/786 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1374 variables, 346/1132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1374 variables, 4/1136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:53:22] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-30 16:53:22] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-30 16:53:22] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-30 16:53:23] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-30 16:53:23] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-30 16:53:23] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-30 16:53:23] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-30 16:53:23] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1374 variables, 8/1144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1374 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 22/1396 variables, 10/1154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1396 variables, 5/1159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1396 variables, 1/1160 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1396 variables, 2/1162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1396 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 12/1408 variables, 6/1168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1408 variables, 2/1170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1408 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 1/1409 variables, 1/1171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1409 variables, 1/1172 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:53:27] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-30 16:53:27] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-30 16:53:27] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-30 16:53:27] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-30 16:53:28] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 4 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1409 variables, 5/1177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1409 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/1409 variables, 0/1177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1409/1409 variables, and 1177 constraints, problems are : Problem set: 0 solved, 6 unsolved in 10864 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 596/596 constraints, ReadFeed: 347/347 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 27/27 constraints]
After SMT, in 12730ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4288 ms.
Support contains 109 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 813/813 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 596 transition count 809
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 592 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 592 transition count 808
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 591 transition count 808
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 39 place count 576 transition count 794
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 47 place count 572 transition count 796
Applied a total of 47 rules in 50 ms. Remains 572 /596 variables (removed 24) and now considering 796/813 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 572/596 places, 796/813 transitions.
RANDOM walk for 40000 steps (13 resets) in 482 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 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 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 142351 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 6
Probabilistic random walk after 142351 steps, saw 98717 distinct states, run finished after 3007 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 796 rows 572 cols
[2024-05-30 16:53:38] [INFO ] Computed 200 invariants in 3 ms
[2024-05-30 16:53:38] [INFO ] State equation strengthened by 357 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 327/436 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 122/558 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 780/1338 variables, 558/751 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1338 variables, 356/1107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1338 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 22/1360 variables, 10/1117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1360 variables, 5/1122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1360 variables, 1/1123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1360 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 8/1368 variables, 4/1127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1368 variables, 2/1129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1368 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/1368 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1368/1368 variables, and 1129 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1622 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 572/572 constraints, ReadFeed: 357/357 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/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 327/436 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:53:39] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-30 16:53:39] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-30 16:53:40] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:53:40] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 122/558 variables, 61/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:53:40] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-30 16:53:40] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-30 16:53:40] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-30 16:53:40] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:53:40] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 780/1338 variables, 558/760 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1338 variables, 356/1116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1338 variables, 4/1120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:53:42] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-30 16:53:42] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-30 16:53:42] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 2 ms to minimize.
[2024-05-30 16:53:42] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-30 16:53:42] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-30 16:53:42] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-30 16:53:42] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 4 ms to minimize.
[2024-05-30 16:53:43] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-30 16:53:43] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1338 variables, 9/1129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1338 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 22/1360 variables, 10/1139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1360 variables, 5/1144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1360 variables, 1/1145 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1360 variables, 2/1147 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:53:45] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1360 variables, 1/1148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1360 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 8/1368 variables, 4/1152 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1368 variables, 2/1154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1368 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/1368 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1368/1368 variables, and 1154 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7852 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 572/572 constraints, ReadFeed: 357/357 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 19/19 constraints]
After SMT, in 9505ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3588 ms.
Support contains 109 out of 572 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 796/796 transitions.
Applied a total of 0 rules in 18 ms. Remains 572 /572 variables (removed 0) and now considering 796/796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 572/572 places, 796/796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 572/572 places, 796/796 transitions.
Applied a total of 0 rules in 16 ms. Remains 572 /572 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2024-05-30 16:53:51] [INFO ] Invariant cache hit.
[2024-05-30 16:53:51] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-30 16:53:51] [INFO ] Invariant cache hit.
[2024-05-30 16:53:51] [INFO ] State equation strengthened by 357 read => feed constraints.
[2024-05-30 16:53:53] [INFO ] Implicit Places using invariants and state equation in 1866 ms returned []
Implicit Place search using SMT with State Equation took 2137 ms to find 0 implicit places.
[2024-05-30 16:53:53] [INFO ] Redundant transitions in 49 ms returned []
Running 791 sub problems to find dead transitions.
[2024-05-30 16:53:53] [INFO ] Invariant cache hit.
[2024-05-30 16:53:53] [INFO ] State equation strengthened by 357 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 2 (OVERLAPS) 2/572 variables, 189/200 constraints. Problems are: Problem set: 0 solved, 791 unsolved
[2024-05-30 16:54:08] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-30 16:54:08] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-30 16:54:08] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-30 16:54:08] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2024-05-30 16:54:09] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2024-05-30 16:54:09] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-30 16:54:09] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2024-05-30 16:54:09] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-30 16:54:09] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-30 16:54:10] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-30 16:54:10] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-30 16:54:11] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2024-05-30 16:54:11] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 2 ms to minimize.
[2024-05-30 16:54:11] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2024-05-30 16:54:12] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 1 ms to minimize.
[2024-05-30 16:54:12] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-30 16:54:12] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 17/217 constraints. Problems are: Problem set: 0 solved, 791 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/1368 variables, and 217 constraints, problems are : Problem set: 0 solved, 791 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/572 constraints, ReadFeed: 0/357 constraints, PredecessorRefiner: 791/791 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 791 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 2 (OVERLAPS) 2/572 variables, 189/200 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 17/217 constraints. Problems are: Problem set: 0 solved, 791 unsolved
[2024-05-30 16:54:32] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-30 16:54:32] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-30 16:54:37] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/572 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 791 unsolved
[2024-05-30 16:54:42] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 791 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/1368 variables, and 221 constraints, problems are : Problem set: 0 solved, 791 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/572 constraints, ReadFeed: 0/357 constraints, PredecessorRefiner: 0/791 constraints, Known Traps: 21/21 constraints]
After SMT, in 60479ms problems are : Problem set: 0 solved, 791 unsolved
Search for dead transitions found 0 dead transitions in 60497ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62729 ms. Remains : 572/572 places, 796/796 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 130 edges and 572 vertex of which 4 / 572 are part of one of the 2 SCC in 12 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1803 edges and 570 vertex of which 568 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 566 transition count 787
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 564 transition count 786
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 14 place count 564 transition count 782
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 46 place count 564 transition count 750
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 2 with 31 rules applied. Total rules applied 77 place count 564 transition count 750
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 99 place count 564 transition count 728
Applied a total of 99 rules in 131 ms. Remains 564 /572 variables (removed 8) and now considering 728/796 (removed 68) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 728 rows 564 cols
[2024-05-30 16:54:54] [INFO ] Computed 196 invariants in 3 ms
[2024-05-30 16:54:54] [INFO ] After 517ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-30 16:54:54] [INFO ] [Nat]Absence check using 196 positive place invariants in 29 ms returned sat
[2024-05-30 16:54:55] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-30 16:54:55] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 11 ms to minimize.
[2024-05-30 16:54:55] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 1 ms to minimize.
[2024-05-30 16:54:55] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-30 16:54:56] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-30 16:54:56] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-30 16:54:56] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-30 16:54:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 802 ms
[2024-05-30 16:54:56] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-30 16:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-05-30 16:54:57] [INFO ] Deduced a trap composed of 14 places in 487 ms of which 1 ms to minimize.
[2024-05-30 16:54:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 546 ms
[2024-05-30 16:54:57] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-05-30 16:54:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
TRAPS : Iteration 1
[2024-05-30 16:54:57] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-05-30 16:54:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2024-05-30 16:54:57] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-30 16:54:57] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2024-05-30 16:54:58] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-30 16:54:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 412 ms
TRAPS : Iteration 2
[2024-05-30 16:54:58] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-05-30 16:54:58] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-30 16:54:58] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-30 16:54:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 364 ms
TRAPS : Iteration 3
[2024-05-30 16:54:59] [INFO ] After 4482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-30 16:54:59] [INFO ] After 5037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 5757 ms.
[2024-05-30 16:54:59] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 18 ms.
[2024-05-30 16:54:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 572 places, 796 transitions and 3913 arcs took 23 ms.
[2024-05-30 16:55:00] [INFO ] Flatten gal took : 174 ms
Total runtime 114995 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-050B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 572
TRANSITIONS: 796
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.023s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 885
MODEL NAME: /home/mcc/execution/413/model
572 places, 796 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldRVt-PT-050B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683760101038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050B.tgz
mv ShieldRVt-PT-050B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;