About the Execution of GreatSPN+red for PolyORBLF-PT-S02J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1251.703 | 150451.00 | 209608.00 | 165.00 | TFFTTTTTFTTFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445400223.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S02J04T06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445400223
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 862K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716859380618
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 01:23:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 01:23:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:23:04] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2024-05-28 01:23:04] [INFO ] Transformed 476 places.
[2024-05-28 01:23:04] [INFO ] Transformed 920 transitions.
[2024-05-28 01:23:04] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 477 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 53 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
RANDOM walk for 40000 steps (11 resets) in 2213 ms. (18 steps per ms) remains 7/16 properties
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (12 resets) in 470 ms. (84 steps per ms) remains 6/7 properties
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 629 ms. (63 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 400 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 507 ms. (78 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (18 resets) in 585 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 748 ms. (53 steps per ms) remains 6/6 properties
[2024-05-28 01:23:06] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-05-28 01:23:06] [INFO ] Computed 46 invariants in 69 ms
[2024-05-28 01:23:06] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 102/240 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-02 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-14 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-15 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 217/457 variables, 22/33 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 5/462 variables, 1/34 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-12 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 14/476 variables, 12/46 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/46 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 812/1288 variables, 476/522 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1288 variables, 72/594 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1288 variables, 0/594 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1288 variables, 0/594 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1288/1288 variables, and 594 constraints, problems are : Problem set: 4 solved, 2 unsolved in 1883 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 476/476 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 83/105 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 343/448 variables, 20/25 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-28 01:23:09] [INFO ] Deduced a trap composed of 65 places in 848 ms of which 45 ms to minimize.
[2024-05-28 01:23:10] [INFO ] Deduced a trap composed of 65 places in 397 ms of which 4 ms to minimize.
[2024-05-28 01:23:10] [INFO ] Deduced a trap composed of 260 places in 339 ms of which 4 ms to minimize.
[2024-05-28 01:23:10] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 2 ms to minimize.
[2024-05-28 01:23:10] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 5/30 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/459 variables, 6/36 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/36 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 17/476 variables, 15/51 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-28 01:23:10] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 1/52 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/52 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 812/1288 variables, 476/528 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1288/1288 variables, and 600 constraints, problems are : Problem set: 4 solved, 2 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 476/476 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 7339ms problems are : Problem set: 4 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 474 transition count 782
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 432 transition count 782
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 86 place count 432 transition count 735
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 180 place count 385 transition count 735
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 276 place count 337 transition count 687
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 286 place count 337 transition count 677
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 296 place count 327 transition count 677
Applied a total of 296 rules in 244 ms. Remains 327 /476 variables (removed 149) and now considering 677/824 (removed 147) transitions.
Running 675 sub problems to find dead transitions.
[2024-05-28 01:23:13] [INFO ] Flow matrix only has 665 transitions (discarded 12 similar events)
// Phase 1: matrix 665 rows 327 cols
[2024-05-28 01:23:13] [INFO ] Computed 44 invariants in 12 ms
[2024-05-28 01:23:13] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-05-28 01:23:19] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 2 ms to minimize.
[2024-05-28 01:23:19] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
[2024-05-28 01:23:19] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:23:19] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:23:19] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:23:19] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:23:20] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-28 01:23:21] [INFO ] Deduced a trap composed of 111 places in 144 ms of which 2 ms to minimize.
[2024-05-28 01:23:21] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 3 ms to minimize.
[2024-05-28 01:23:21] [INFO ] Deduced a trap composed of 57 places in 252 ms of which 3 ms to minimize.
[2024-05-28 01:23:23] [INFO ] Deduced a trap composed of 119 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:23:24] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 2 ms to minimize.
[2024-05-28 01:23:24] [INFO ] Deduced a trap composed of 105 places in 223 ms of which 2 ms to minimize.
[2024-05-28 01:23:25] [INFO ] Deduced a trap composed of 94 places in 202 ms of which 3 ms to minimize.
[2024-05-28 01:23:25] [INFO ] Deduced a trap composed of 134 places in 190 ms of which 3 ms to minimize.
[2024-05-28 01:23:25] [INFO ] Deduced a trap composed of 116 places in 208 ms of which 3 ms to minimize.
[2024-05-28 01:23:27] [INFO ] Deduced a trap composed of 154 places in 208 ms of which 3 ms to minimize.
[2024-05-28 01:23:27] [INFO ] Deduced a trap composed of 131 places in 211 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 325/992 variables, and 60 constraints, problems are : Problem set: 0 solved, 675 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/327 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 675/675 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 675 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-05-28 01:23:45] [INFO ] Deduced a trap composed of 134 places in 223 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-05-28 01:23:50] [INFO ] Deduced a trap composed of 181 places in 158 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/992 variables, and 62 constraints, problems are : Problem set: 0 solved, 675 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/327 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/675 constraints, Known Traps: 20/20 constraints]
After SMT, in 41177ms problems are : Problem set: 0 solved, 675 unsolved
Search for dead transitions found 0 dead transitions in 41193ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41463 ms. Remains : 327/476 places, 677/824 transitions.
RANDOM walk for 40000 steps (22 resets) in 668 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (13 resets) in 282 ms. (141 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 141039 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 2
Probabilistic random walk after 141039 steps, saw 81491 distinct states, run finished after 3016 ms. (steps per millisecond=46 ) properties seen :0
[2024-05-28 01:23:58] [INFO ] Flow matrix only has 665 transitions (discarded 12 similar events)
[2024-05-28 01:23:58] [INFO ] Invariant cache hit.
[2024-05-28 01:23:58] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 158/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/221 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/223 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 103/326 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/327 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 665/992 variables, 327/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/992 variables, 72/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/992 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/992 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 992/992 variables, and 443 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1143 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 327/327 constraints, ReadFeed: 72/72 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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 158/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/221 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/223 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 103/326 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 01:23:59] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 6 ms to minimize.
[2024-05-28 01:24:00] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 3 ms to minimize.
[2024-05-28 01:24:00] [INFO ] Deduced a trap composed of 124 places in 137 ms of which 2 ms to minimize.
[2024-05-28 01:24:00] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 2 ms to minimize.
[2024-05-28 01:24:00] [INFO ] Deduced a trap composed of 122 places in 239 ms of which 3 ms to minimize.
[2024-05-28 01:24:00] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/327 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 665/992 variables, 327/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/992 variables, 72/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/992 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/992 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/992 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 992/992 variables, and 451 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5279 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 327/327 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 6451ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1064 ms.
Support contains 22 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 677/677 transitions.
Applied a total of 0 rules in 69 ms. Remains 327 /327 variables (removed 0) and now considering 677/677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 327/327 places, 677/677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 677/677 transitions.
Applied a total of 0 rules in 30 ms. Remains 327 /327 variables (removed 0) and now considering 677/677 (removed 0) transitions.
[2024-05-28 01:24:06] [INFO ] Flow matrix only has 665 transitions (discarded 12 similar events)
[2024-05-28 01:24:06] [INFO ] Invariant cache hit.
[2024-05-28 01:24:06] [INFO ] Implicit Places using invariants in 626 ms returned [83, 166, 190, 192, 288, 300]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 649 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 321/327 places, 677/677 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 317 transition count 673
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 317 transition count 673
Applied a total of 8 rules in 51 ms. Remains 317 /321 variables (removed 4) and now considering 673/677 (removed 4) transitions.
[2024-05-28 01:24:06] [INFO ] Flow matrix only has 661 transitions (discarded 12 similar events)
// Phase 1: matrix 661 rows 317 cols
[2024-05-28 01:24:06] [INFO ] Computed 38 invariants in 12 ms
[2024-05-28 01:24:07] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-05-28 01:24:07] [INFO ] Flow matrix only has 661 transitions (discarded 12 similar events)
[2024-05-28 01:24:07] [INFO ] Invariant cache hit.
[2024-05-28 01:24:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 01:24:11] [INFO ] Implicit Places using invariants and state equation in 3922 ms returned []
Implicit Place search using SMT with State Equation took 4552 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 317/327 places, 673/677 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5284 ms. Remains : 317/327 places, 673/677 transitions.
RANDOM walk for 40000 steps (32 resets) in 513 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (12 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (15 resets) in 258 ms. (154 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 174026 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 174026 steps, saw 95511 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-28 01:24:14] [INFO ] Flow matrix only has 661 transitions (discarded 12 similar events)
[2024-05-28 01:24:14] [INFO ] Invariant cache hit.
[2024-05-28 01:24:14] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/297 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/303 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/317 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 661/978 variables, 317/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/978 variables, 72/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/978 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/978 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 978/978 variables, and 427 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1217 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 317/317 constraints, ReadFeed: 72/72 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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/297 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 01:24:16] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 3 ms to minimize.
[2024-05-28 01:24:16] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-28 01:24:16] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 6 ms to minimize.
[2024-05-28 01:24:16] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/303 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/317 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 661/978 variables, 317/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/978 variables, 72/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/978 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/978 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/978 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 978/978 variables, and 433 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2762 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 317/317 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 4031ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 346 ms.
Support contains 22 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 673/673 transitions.
Applied a total of 0 rules in 17 ms. Remains 317 /317 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 317/317 places, 673/673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 673/673 transitions.
Applied a total of 0 rules in 14 ms. Remains 317 /317 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2024-05-28 01:24:19] [INFO ] Flow matrix only has 661 transitions (discarded 12 similar events)
[2024-05-28 01:24:19] [INFO ] Invariant cache hit.
[2024-05-28 01:24:19] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-28 01:24:19] [INFO ] Flow matrix only has 661 transitions (discarded 12 similar events)
[2024-05-28 01:24:19] [INFO ] Invariant cache hit.
[2024-05-28 01:24:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 01:24:22] [INFO ] Implicit Places using invariants and state equation in 3633 ms returned []
Implicit Place search using SMT with State Equation took 3927 ms to find 0 implicit places.
[2024-05-28 01:24:23] [INFO ] Redundant transitions in 39 ms returned []
Running 671 sub problems to find dead transitions.
[2024-05-28 01:24:23] [INFO ] Flow matrix only has 661 transitions (discarded 12 similar events)
[2024-05-28 01:24:23] [INFO ] Invariant cache hit.
[2024-05-28 01:24:23] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 01:24:27] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-28 01:24:27] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-28 01:24:27] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:24:27] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
[2024-05-28 01:24:27] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-28 01:24:27] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:24:27] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 0 ms to minimize.
[2024-05-28 01:24:28] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:24:28] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 2 ms to minimize.
[2024-05-28 01:24:29] [INFO ] Deduced a trap composed of 61 places in 160 ms of which 2 ms to minimize.
[2024-05-28 01:24:31] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2024-05-28 01:24:31] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 2 ms to minimize.
[2024-05-28 01:24:31] [INFO ] Deduced a trap composed of 111 places in 157 ms of which 2 ms to minimize.
[2024-05-28 01:24:32] [INFO ] Deduced a trap composed of 128 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-28 01:24:36] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 3 ms to minimize.
[2024-05-28 01:24:37] [INFO ] Deduced a trap composed of 139 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Problem TDEAD24 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/317 variables, 2/54 constraints. Problems are: Problem set: 66 solved, 605 unsolved
[2024-05-28 01:24:45] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 3 ms to minimize.
[2024-05-28 01:24:46] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 2 ms to minimize.
[2024-05-28 01:24:46] [INFO ] Deduced a trap composed of 110 places in 171 ms of which 2 ms to minimize.
[2024-05-28 01:24:48] [INFO ] Deduced a trap composed of 109 places in 160 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 4/58 constraints. Problems are: Problem set: 66 solved, 605 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 9.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/978 variables, and 58 constraints, problems are : Problem set: 66 solved, 605 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/317 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 66 solved, 605 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 12/12 constraints. Problems are: Problem set: 66 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 24/36 constraints. Problems are: Problem set: 66 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 16/52 constraints. Problems are: Problem set: 66 solved, 605 unsolved
[2024-05-28 01:24:57] [INFO ] Deduced a trap composed of 117 places in 160 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 1/53 constraints. Problems are: Problem set: 66 solved, 605 unsolved
[2024-05-28 01:25:12] [INFO ] Deduced a trap composed of 181 places in 160 ms of which 2 ms to minimize.
[2024-05-28 01:25:16] [INFO ] Deduced a trap composed of 120 places in 143 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 2/55 constraints. Problems are: Problem set: 66 solved, 605 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/978 variables, and 55 constraints, problems are : Problem set: 66 solved, 605 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/317 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 19/23 constraints]
After SMT, in 61000ms problems are : Problem set: 66 solved, 605 unsolved
Search for dead transitions found 66 dead transitions in 61009ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 317/317 places, 607/673 transitions.
Reduce places removed 1 places and 12 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 316 transition count 595
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 13 place count 304 transition count 583
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 13 rules in 34 ms. Remains 304 /317 variables (removed 13) and now considering 583/607 (removed 24) transitions.
[2024-05-28 01:25:24] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
// Phase 1: matrix 571 rows 304 cols
[2024-05-28 01:25:24] [INFO ] Computed 39 invariants in 6 ms
[2024-05-28 01:25:24] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-05-28 01:25:24] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
[2024-05-28 01:25:24] [INFO ] Invariant cache hit.
[2024-05-28 01:25:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 01:25:26] [INFO ] Implicit Places using invariants and state equation in 1869 ms returned []
Implicit Place search using SMT with State Equation took 2444 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 304/317 places, 583/673 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 67481 ms. Remains : 304/317 places, 583/673 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (22 resets) in 320 ms. (124 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (15 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 318825 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 318825 steps, saw 166784 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2024-05-28 01:25:29] [INFO ] Flow matrix only has 571 transitions (discarded 12 similar events)
// Phase 1: matrix 571 rows 303 cols
[2024-05-28 01:25:29] [INFO ] Computed 38 invariants in 15 ms
[2024-05-28 01:25:29] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/81 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/85 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/289 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/294 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/303 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 571/874 variables, 303/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/874 variables, 72/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/874 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/874 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 874/874 variables, and 413 constraints, problems are : Problem set: 0 solved, 1 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 303/303 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/81 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/85 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/289 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 01:25:30] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-28 01:25:30] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/294 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/303 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 01:25:30] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 3 ms to minimize.
[2024-05-28 01:25:30] [INFO ] Deduced a trap composed of 117 places in 164 ms of which 2 ms to minimize.
[2024-05-28 01:25:30] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
Problem PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-13 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 303/874 variables, and 43 constraints, problems are : Problem set: 1 solved, 0 unsolved in 786 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/303 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1290ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 147386 ms.
ITS solved all properties within timeout
BK_STOP 1716859531069
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
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="PolyORBLF-PT-S02J04T06"
export BK_EXAMINATION="ReachabilityFireability"
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 PolyORBLF-PT-S02J04T06, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445400223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T06.tgz
mv PolyORBLF-PT-S02J04T06 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;