About the Execution of GreatSPN+red for EisenbergMcGuire-PT-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12290.447 | 3600000.00 | 14158168.00 | 462.40 | FTFFFT?TFTFFT?TF | 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.r157-smll-171636265200182.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 EisenbergMcGuire-PT-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265200182
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-00
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-01
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-02
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-03
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-04
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-05
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-06
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-07
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-08
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-09
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-10
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-11
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-12
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-13
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-14
FORMULA_NAME EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716504321526
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 22:45:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 22:45:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 22:45:23] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2024-05-23 22:45:23] [INFO ] Transformed 553 places.
[2024-05-23 22:45:23] [INFO ] Transformed 1960 transitions.
[2024-05-23 22:45:23] [INFO ] Found NUPN structural information;
[2024-05-23 22:45:23] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 499 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1985 ms. (20 steps per ms) remains 8/15 properties
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 687 ms. (58 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 880 ms. (45 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 8/8 properties
[2024-05-23 22:45:25] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2024-05-23 22:45:25] [INFO ] Computed 22 invariants in 35 ms
[2024-05-23 22:45:25] [INFO ] State equation strengthened by 472 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-00 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-15 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 408/539 variables, 14/145 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/539 variables, 408/553 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/539 variables, 1/554 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/539 variables, 0/554 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 7/546 variables, 6/560 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 7/567 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/567 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1001/1547 variables, 546/1113 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1547 variables, 472/1585 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1547 variables, 0/1585 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 7/1554 variables, 7/1592 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1554 variables, 7/1599 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1554 variables, 1/1600 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1554 variables, 0/1600 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/1554 variables, 0/1600 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1554/1554 variables, and 1600 constraints, problems are : Problem set: 2 solved, 6 unsolved in 2542 ms.
Refiners :[Domain max(s): 553/553 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 553/553 constraints, ReadFeed: 472/472 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 446/537 variables, 14/105 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 446/551 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-23 22:45:28] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 1/552 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 0/552 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 9/546 variables, 7/559 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 9/568 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-23 22:45:29] [INFO ] Deduced a trap composed of 3 places in 464 ms of which 8 ms to minimize.
[2024-05-23 22:45:29] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 4 ms to minimize.
[2024-05-23 22:45:30] [INFO ] Deduced a trap composed of 3 places in 347 ms of which 5 ms to minimize.
[2024-05-23 22:45:30] [INFO ] Deduced a trap composed of 3 places in 347 ms of which 5 ms to minimize.
[2024-05-23 22:45:30] [INFO ] Deduced a trap composed of 78 places in 325 ms of which 5 ms to minimize.
[2024-05-23 22:45:31] [INFO ] Deduced a trap composed of 26 places in 299 ms of which 4 ms to minimize.
[2024-05-23 22:45:31] [INFO ] Deduced a trap composed of 35 places in 401 ms of which 5 ms to minimize.
[2024-05-23 22:45:32] [INFO ] Deduced a trap composed of 32 places in 317 ms of which 4 ms to minimize.
[2024-05-23 22:45:32] [INFO ] Deduced a trap composed of 48 places in 411 ms of which 4 ms to minimize.
[2024-05-23 22:45:32] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 2 ms to minimize.
[2024-05-23 22:45:32] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 3 ms to minimize.
[2024-05-23 22:45:32] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-01 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2023-01 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-23 22:45:33] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 2 ms to minimize.
[2024-05-23 22:45:33] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
SMT process timed out in 7840ms, After SMT, problems are : Problem set: 2 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 66 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 553 transition count 1955
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 548 transition count 1954
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 547 transition count 1954
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 12 place count 547 transition count 1839
Deduced a syphon composed of 115 places in 6 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 242 place count 432 transition count 1839
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 280 place count 394 transition count 1573
Iterating global reduction 3 with 38 rules applied. Total rules applied 318 place count 394 transition count 1573
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 4 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 390 place count 358 transition count 1537
Applied a total of 390 rules in 316 ms. Remains 358 /553 variables (removed 195) and now considering 1537/1960 (removed 423) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 358/553 places, 1537/1960 transitions.
RANDOM walk for 40000 steps (8 resets) in 1022 ms. (39 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 167880 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :2 out of 5
Probabilistic random walk after 167880 steps, saw 97322 distinct states, run finished after 3012 ms. (steps per millisecond=55 ) properties seen :2
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-23 22:45:37] [INFO ] Flow matrix only has 578 transitions (discarded 959 similar events)
// Phase 1: matrix 578 rows 358 cols
[2024-05-23 22:45:37] [INFO ] Computed 22 invariants in 4 ms
[2024-05-23 22:45:37] [INFO ] State equation strengthened by 244 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 291/341 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/351 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 578/929 variables, 351/372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/929 variables, 244/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/929 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 7/936 variables, 7/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/936 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/936 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/936 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 936/936 variables, and 624 constraints, problems are : Problem set: 0 solved, 3 unsolved in 883 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 358/358 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 291/341 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 22:45:38] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 10/351 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 22:45:38] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-05-23 22:45:38] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-05-23 22:45:38] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 2 ms to minimize.
[2024-05-23 22:45:39] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 3 ms to minimize.
[2024-05-23 22:45:39] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-23 22:45:39] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2024-05-23 22:45:39] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-05-23 22:45:39] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 1 ms to minimize.
[2024-05-23 22:45:39] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
Problem EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-09 is UNSAT
FORMULA EisenbergMcGuire-PT-07-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-23 22:45:39] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 3 ms to minimize.
[2024-05-23 22:45:40] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 2 ms to minimize.
[2024-05-23 22:45:40] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 2 ms to minimize.
[2024-05-23 22:45:40] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 13/35 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-23 22:45:40] [INFO ] Deduced a trap composed of 22 places in 343 ms of which 4 ms to minimize.
[2024-05-23 22:45:41] [INFO ] Deduced a trap composed of 16 places in 228 ms of which 3 ms to minimize.
[2024-05-23 22:45:41] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 3 ms to minimize.
[2024-05-23 22:45:41] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 4/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 578/929 variables, 351/390 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/929 variables, 244/634 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/929 variables, 0/634 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 7/936 variables, 7/641 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/936 variables, 1/642 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/936 variables, 2/644 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/936 variables, 0/644 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-23 22:45:42] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 3 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/936 variables, 1/645 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/645 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/936 variables, 0/645 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 936/936 variables, and 645 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4451 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 358/358 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 19/19 constraints]
After SMT, in 5389ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 993 ms.
Support contains 42 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 1537/1537 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 358 transition count 1523
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 344 transition count 1523
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 342 transition count 1509
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 342 transition count 1509
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 341 transition count 1508
Applied a total of 34 rules in 159 ms. Remains 341 /358 variables (removed 17) and now considering 1508/1537 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 341/358 places, 1508/1537 transitions.
RANDOM walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 275856 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 2
Probabilistic random walk after 275856 steps, saw 146781 distinct states, run finished after 3005 ms. (steps per millisecond=91 ) properties seen :0
[2024-05-23 22:45:46] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
// Phase 1: matrix 549 rows 341 cols
[2024-05-23 22:45:46] [INFO ] Computed 22 invariants in 13 ms
[2024-05-23 22:45:47] [INFO ] State equation strengthened by 232 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 282/324 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/334 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 549/883 variables, 334/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 232/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/890 variables, 7/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/890 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/890 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/890 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 890/890 variables, and 595 constraints, problems are : Problem set: 0 solved, 2 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 341/341 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 282/324 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/334 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 22:45:48] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 11 ms to minimize.
[2024-05-23 22:45:48] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 2 ms to minimize.
[2024-05-23 22:45:48] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-23 22:45:48] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 4 ms to minimize.
[2024-05-23 22:45:48] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-05-23 22:45:48] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 4 ms to minimize.
[2024-05-23 22:45:49] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 2 ms to minimize.
[2024-05-23 22:45:49] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 22:45:49] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 3 ms to minimize.
[2024-05-23 22:45:49] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 3 ms to minimize.
[2024-05-23 22:45:49] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 22:45:49] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 1 ms to minimize.
[2024-05-23 22:45:50] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2024-05-23 22:45:50] [INFO ] Deduced a trap composed of 53 places in 236 ms of which 4 ms to minimize.
[2024-05-23 22:45:50] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 22:45:50] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 3 ms to minimize.
[2024-05-23 22:45:50] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 3 ms to minimize.
[2024-05-23 22:45:51] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 2 ms to minimize.
[2024-05-23 22:45:51] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2024-05-23 22:45:51] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 549/883 variables, 334/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/883 variables, 232/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/883 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 7/890 variables, 7/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/890 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/890 variables, 2/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/890 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 22:45:52] [INFO ] Deduced a trap composed of 55 places in 415 ms of which 5 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/890 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/890 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 22:45:53] [INFO ] Deduced a trap composed of 75 places in 345 ms of which 5 ms to minimize.
[2024-05-23 22:45:53] [INFO ] Deduced a trap composed of 50 places in 380 ms of which 6 ms to minimize.
[2024-05-23 22:45:53] [INFO ] Deduced a trap composed of 99 places in 381 ms of which 5 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/890 variables, 3/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 22:45:54] [INFO ] Deduced a trap composed of 87 places in 373 ms of which 5 ms to minimize.
[2024-05-23 22:45:54] [INFO ] Deduced a trap composed of 64 places in 386 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/890 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 22:45:55] [INFO ] Deduced a trap composed of 42 places in 382 ms of which 5 ms to minimize.
[2024-05-23 22:45:55] [INFO ] Deduced a trap composed of 75 places in 324 ms of which 5 ms to minimize.
[2024-05-23 22:45:56] [INFO ] Deduced a trap composed of 56 places in 391 ms of which 5 ms to minimize.
[2024-05-23 22:45:56] [INFO ] Deduced a trap composed of 79 places in 394 ms of which 6 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/890 variables, 4/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 22:45:57] [INFO ] Deduced a trap composed of 74 places in 404 ms of which 8 ms to minimize.
[2024-05-23 22:45:57] [INFO ] Deduced a trap composed of 65 places in 396 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/890 variables, 2/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/890 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/890 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 890/890 variables, and 629 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10310 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 341/341 constraints, ReadFeed: 232/232 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 32/32 constraints]
After SMT, in 11033ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 701 ms.
Support contains 42 out of 341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 1508/1508 transitions.
Applied a total of 0 rules in 115 ms. Remains 341 /341 variables (removed 0) and now considering 1508/1508 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 341/341 places, 1508/1508 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 1508/1508 transitions.
Applied a total of 0 rules in 62 ms. Remains 341 /341 variables (removed 0) and now considering 1508/1508 (removed 0) transitions.
[2024-05-23 22:45:58] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2024-05-23 22:45:58] [INFO ] Invariant cache hit.
[2024-05-23 22:45:59] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-05-23 22:45:59] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2024-05-23 22:45:59] [INFO ] Invariant cache hit.
[2024-05-23 22:45:59] [INFO ] State equation strengthened by 232 read => feed constraints.
[2024-05-23 22:46:01] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2405 ms to find 0 implicit places.
[2024-05-23 22:46:01] [INFO ] Redundant transitions in 112 ms returned []
Running 1501 sub problems to find dead transitions.
[2024-05-23 22:46:01] [INFO ] Flow matrix only has 549 transitions (discarded 959 similar events)
[2024-05-23 22:46:01] [INFO ] Invariant cache hit.
[2024-05-23 22:46:01] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/341 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
[2024-05-23 22:46:19] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 4 ms to minimize.
[2024-05-23 22:46:19] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 3 ms to minimize.
[2024-05-23 22:46:19] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 2 ms to minimize.
[2024-05-23 22:46:19] [INFO ] Deduced a trap composed of 25 places in 358 ms of which 3 ms to minimize.
[2024-05-23 22:46:22] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 3 ms to minimize.
[2024-05-23 22:46:23] [INFO ] Deduced a trap composed of 15 places in 354 ms of which 4 ms to minimize.
[2024-05-23 22:46:23] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2024-05-23 22:46:23] [INFO ] Deduced a trap composed of 78 places in 346 ms of which 5 ms to minimize.
[2024-05-23 22:46:23] [INFO ] Deduced a trap composed of 66 places in 409 ms of which 5 ms to minimize.
[2024-05-23 22:46:24] [INFO ] Deduced a trap composed of 87 places in 356 ms of which 5 ms to minimize.
[2024-05-23 22:46:24] [INFO ] Deduced a trap composed of 74 places in 354 ms of which 5 ms to minimize.
[2024-05-23 22:46:25] [INFO ] Deduced a trap composed of 17 places in 335 ms of which 5 ms to minimize.
[2024-05-23 22:46:25] [INFO ] Deduced a trap composed of 51 places in 480 ms of which 6 ms to minimize.
[2024-05-23 22:46:26] [INFO ] Deduced a trap composed of 61 places in 446 ms of which 9 ms to minimize.
[2024-05-23 22:46:26] [INFO ] Deduced a trap composed of 60 places in 473 ms of which 6 ms to minimize.
[2024-05-23 22:46:27] [INFO ] Deduced a trap composed of 57 places in 441 ms of which 6 ms to minimize.
[2024-05-23 22:46:27] [INFO ] Deduced a trap composed of 53 places in 486 ms of which 5 ms to minimize.
[2024-05-23 22:46:28] [INFO ] Deduced a trap composed of 52 places in 476 ms of which 5 ms to minimize.
[2024-05-23 22:46:28] [INFO ] Deduced a trap composed of 44 places in 438 ms of which 5 ms to minimize.
[2024-05-23 22:46:29] [INFO ] Deduced a trap composed of 41 places in 440 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1501 unsolved
[2024-05-23 22:46:31] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-05-23 22:46:32] [INFO ] Deduced a trap composed of 63 places in 397 ms of which 5 ms to minimize.
[2024-05-23 22:46:32] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 2 ms to minimize.
[2024-05-23 22:46:32] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2024-05-23 22:46:32] [INFO ] Deduced a trap composed of 3 places in 398 ms of which 5 ms to minimize.
SMT process timed out in 31523ms, After SMT, problems are : Problem set: 0 solved, 1501 unsolved
Search for dead transitions found 0 dead transitions in 31557ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34166 ms. Remains : 341/341 places, 1508/1508 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1230 edges and 341 vertex of which 42 / 341 are part of one of the 7 SCC in 9 ms
Free SCC test removed 35 places
Drop transitions (Empty/Sink Transition effects.) removed 125 transitions
Ensure Unique test removed 946 transitions
Reduce isomorphic transitions removed 1071 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 306 transition count 385
Reduce places removed 52 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 59 rules applied. Total rules applied 112 place count 254 transition count 378
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 119 place count 247 transition count 378
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 119 place count 247 transition count 370
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 136 place count 238 transition count 370
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 270 place count 171 transition count 303
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 295 place count 171 transition count 278
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 301 place count 168 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 317 place count 168 transition count 273
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 319 place count 167 transition count 275
Free-agglomeration rule applied 37 times.
Iterating global reduction 4 with 37 rules applied. Total rules applied 356 place count 167 transition count 238
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 393 place count 130 transition count 238
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 398 place count 130 transition count 238
Applied a total of 398 rules in 194 ms. Remains 130 /341 variables (removed 211) and now considering 238/1508 (removed 1270) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 238 rows 130 cols
[2024-05-23 22:46:33] [INFO ] Computed 21 invariants in 2 ms
[2024-05-23 22:46:33] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 22:46:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-23 22:46:33] [INFO ] [Nat]Absence check using 15 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-23 22:46:33] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 22:46:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 22:46:33] [INFO ] After 61ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 22:46:33] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-23 22:46:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 22:46:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
TRAPS : Iteration 1
[2024-05-23 22:46:34] [INFO ] After 340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 22:46:34] [INFO ] After 836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1186 ms.
[2024-05-23 22:46:34] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-05-23 22:46:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 341 places, 1508 transitions and 7748 arcs took 34 ms.
[2024-05-23 22:46:35] [INFO ] Flatten gal took : 341 ms
Total runtime 71752 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running EisenbergMcGuire-PT-07
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 341
TRANSITIONS: 1508
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.088s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.011s, 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: 865
MODEL NAME: /home/mcc/execution/412/model
341 places, 1508 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.
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="EisenbergMcGuire-PT-07"
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 EisenbergMcGuire-PT-07, 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 r157-smll-171636265200182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-07.tgz
mv EisenbergMcGuire-PT-07 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;