About the Execution of GreatSPN+red for FireWire-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 520.296 | 69019.00 | 108677.00 | 256.70 | FFTFFTFFTTTTTFTT | 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.r549-tall-171734898100238.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 FireWire-PT-09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898100238
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 100K Jun 2 16:33 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 FireWire-PT-09-ReachabilityCardinality-2024-00
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-01
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-02
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-03
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-04
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-05
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-06
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-07
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-08
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-09
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-10
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-11
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-12
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-13
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-14
FORMULA_NAME FireWire-PT-09-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717366937135
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:22:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:22:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:22:18] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 22:22:18] [INFO ] Transformed 130 places.
[2024-06-02 22:22:18] [INFO ] Transformed 408 transitions.
[2024-06-02 22:22:18] [INFO ] Found NUPN structural information;
[2024-06-02 22:22:18] [INFO ] Parsed PT model containing 130 places and 408 transitions and 1525 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2247 resets) in 1963 ms. (20 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (15 resets) in 340 ms. (117 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (571 resets) in 199 ms. (200 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 533 ms. (74 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (574 resets) in 288 ms. (138 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 190 ms. (209 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (578 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (597 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 220 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (510 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (566 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (687 resets) in 73 ms. (540 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (587 resets) in 112 ms. (354 steps per ms) remains 11/13 properties
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (591 resets) in 255 ms. (156 steps per ms) remains 11/11 properties
[2024-06-02 22:22:20] [INFO ] Flow matrix only has 320 transitions (discarded 32 similar events)
// Phase 1: matrix 320 rows 130 cols
[2024-06-02 22:22:20] [INFO ] Computed 8 invariants in 13 ms
[2024-06-02 22:22:20] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem FireWire-PT-09-ReachabilityCardinality-2024-00 is UNSAT
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 30/129 variables, 6/107 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 30/137 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 319/448 variables, 129/266 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 44/310 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/449 variables, 1/311 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 1/312 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 0/312 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 1/450 variables, 1/313 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/450 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 313 constraints, problems are : Problem set: 1 solved, 10 unsolved in 1014 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/90 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem FireWire-PT-09-ReachabilityCardinality-2024-02 is UNSAT
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-09-ReachabilityCardinality-2024-05 is UNSAT
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-09-ReachabilityCardinality-2024-08 is UNSAT
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem FireWire-PT-09-ReachabilityCardinality-2024-12 is UNSAT
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 40/129 variables, 7/97 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 40/137 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-06-02 22:22:21] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 18 ms to minimize.
[2024-06-02 22:22:21] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 2 ms to minimize.
[2024-06-02 22:22:21] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:22:21] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2024-06-02 22:22:21] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:22:21] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:22:22] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:22:22] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:22:22] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 9/146 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/146 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 319/448 variables, 129/275 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 44/319 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 5/324 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/324 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/449 variables, 1/325 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 1/326 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 1/327 constraints. Problems are: Problem set: 5 solved, 6 unsolved
[2024-06-02 22:22:22] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/449 variables, 1/328 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 0/328 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1/450 variables, 1/329 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 0/329 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/450 variables, 0/329 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 329 constraints, problems are : Problem set: 5 solved, 6 unsolved in 1806 ms.
Refiners :[Domain max(s): 130/130 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 6/11 constraints, Known Traps: 10/10 constraints]
After SMT, in 3025ms problems are : Problem set: 5 solved, 6 unsolved
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 2288 ms.
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 352/352 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 130 transition count 349
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 126 transition count 341
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 126 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 126 transition count 338
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 125 transition count 337
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 122 transition count 343
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 28 place count 122 transition count 337
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 37 place count 122 transition count 328
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 122 transition count 330
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 41 place count 121 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 121 transition count 326
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 120 transition count 325
Applied a total of 44 rules in 104 ms. Remains 120 /130 variables (removed 10) and now considering 325/352 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 120/130 places, 325/352 transitions.
RANDOM walk for 40000 steps (2252 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (585 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (527 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 895674 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :0 out of 3
Probabilistic random walk after 895674 steps, saw 192481 distinct states, run finished after 3004 ms. (steps per millisecond=298 ) properties seen :0
[2024-06-02 22:22:28] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
// Phase 1: matrix 296 rows 120 cols
[2024-06-02 22:22:28] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:22:28] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 119/318 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 23/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/320 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 92/412 variables, 46/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 22/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 4/416 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/416 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/416 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/416 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 119/318 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 23/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/320 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 92/412 variables, 46/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 22/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/416 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/416 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/416 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/416 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 501ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 732 ms.
Support contains 5 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 325/325 transitions.
Applied a total of 0 rules in 25 ms. Remains 120 /120 variables (removed 0) and now considering 325/325 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 120/120 places, 325/325 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 325/325 transitions.
Applied a total of 0 rules in 9 ms. Remains 120 /120 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-06-02 22:22:30] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
[2024-06-02 22:22:30] [INFO ] Invariant cache hit.
[2024-06-02 22:22:30] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 22:22:30] [INFO ] Flow matrix only has 296 transitions (discarded 29 similar events)
[2024-06-02 22:22:30] [INFO ] Invariant cache hit.
[2024-06-02 22:22:30] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:22:30] [INFO ] Implicit Places using invariants and state equation in 288 ms returned [12, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 373 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 118/120 places, 325/325 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 118 transition count 323
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 323
Applied a total of 4 rules in 17 ms. Remains 116 /118 variables (removed 2) and now considering 323/325 (removed 2) transitions.
[2024-06-02 22:22:30] [INFO ] Flow matrix only has 294 transitions (discarded 29 similar events)
// Phase 1: matrix 294 rows 116 cols
[2024-06-02 22:22:30] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 22:22:30] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 22:22:30] [INFO ] Flow matrix only has 294 transitions (discarded 29 similar events)
[2024-06-02 22:22:30] [INFO ] Invariant cache hit.
[2024-06-02 22:22:30] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:22:30] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 116/120 places, 323/325 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 661 ms. Remains : 116/120 places, 323/325 transitions.
RANDOM walk for 40000 steps (2318 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (621 resets) in 28 ms. (1379 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (588 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 988471 steps, run timeout after 3001 ms. (steps per millisecond=329 ) properties seen :0 out of 3
Probabilistic random walk after 988471 steps, saw 214352 distinct states, run finished after 3001 ms. (steps per millisecond=329 ) properties seen :0
[2024-06-02 22:22:33] [INFO ] Flow matrix only has 294 transitions (discarded 29 similar events)
[2024-06-02 22:22:33] [INFO ] Invariant cache hit.
[2024-06-02 22:22:33] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 119/318 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 23/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/320 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 90/410 variables, 46/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 22/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/410 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/410 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 167 constraints, problems are : Problem set: 0 solved, 3 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 46/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 148/199 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 119/318 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 23/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/320 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 90/410 variables, 46/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/410 variables, 22/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/410 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/410 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 450ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 152 ms.
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 323/323 transitions.
Applied a total of 0 rules in 6 ms. Remains 116 /116 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 116/116 places, 323/323 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 323/323 transitions.
Applied a total of 0 rules in 6 ms. Remains 116 /116 variables (removed 0) and now considering 323/323 (removed 0) transitions.
[2024-06-02 22:22:34] [INFO ] Flow matrix only has 294 transitions (discarded 29 similar events)
[2024-06-02 22:22:34] [INFO ] Invariant cache hit.
[2024-06-02 22:22:34] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:22:34] [INFO ] Flow matrix only has 294 transitions (discarded 29 similar events)
[2024-06-02 22:22:34] [INFO ] Invariant cache hit.
[2024-06-02 22:22:34] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 22:22:34] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-06-02 22:22:34] [INFO ] Redundant transitions in 19 ms returned []
Running 321 sub problems to find dead transitions.
[2024-06-02 22:22:34] [INFO ] Flow matrix only has 294 transitions (discarded 29 similar events)
[2024-06-02 22:22:34] [INFO ] Invariant cache hit.
[2024-06-02 22:22:34] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-06-02 22:22:35] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:22:36] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:22:36] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:22:36] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:22:36] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:22:36] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2024-06-02 22:22:36] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:22:37] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 294/409 variables, 115/129 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 45/174 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-06-02 22:22:40] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:22:41] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 177 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16573 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (OVERLAPS) 294/409 variables, 115/131 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 45/176 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 321/497 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-06-02 22:22:55] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 1/410 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-06-02 22:23:11] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 6 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/410 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/410 variables, and 500 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 12/12 constraints]
After SMT, in 46855ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 46860ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47145 ms. Remains : 116/116 places, 323/323 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 110 edges and 116 vertex of which 29 / 116 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 90 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 89 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 89 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 88 transition count 190
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 87 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 87 transition count 157
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 87 transition count 152
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 84 transition count 151
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 84 transition count 151
Applied a total of 22 rules in 38 ms. Remains 84 /116 variables (removed 32) and now considering 151/323 (removed 172) transitions.
Running SMT prover for 3 properties.
[2024-06-02 22:23:21] [INFO ] Flow matrix only has 149 transitions (discarded 2 similar events)
// Phase 1: matrix 149 rows 84 cols
[2024-06-02 22:23:21] [INFO ] Computed 6 invariants in 0 ms
[2024-06-02 22:23:21] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:23:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-02 22:23:21] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-02 22:23:21] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:23:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
TRAPS : Iteration 1
[2024-06-02 22:23:21] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-02 22:23:21] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 269 ms.
[2024-06-02 22:23:21] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-02 22:23:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 116 places, 323 transitions and 1215 arcs took 5 ms.
[2024-06-02 22:23:22] [INFO ] Flatten gal took : 58 ms
Total runtime 63921 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FireWire-PT-09
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: 116
TRANSITIONS: 323
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 667
MODEL NAME: /home/mcc/execution/412/model
116 places, 323 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...
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-09-ReachabilityCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717367006154
--------------------
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="FireWire-PT-09"
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 FireWire-PT-09, 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 r549-tall-171734898100238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-09.tgz
mv FireWire-PT-09 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 ;