About the Execution of GreatSPN+red for PolyORBLF-PT-S04J06T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10336.144 | 3600000.00 | 13718740.00 | 163.20 | TTFFFFT?FFTFTFFF | 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-171654445600302.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-S04J06T08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445600302
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 22K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 570K Apr 11 16:50 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 13K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 205K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 138K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 670K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 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 3.5M 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-S04J06T08-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716867452439
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 03:37:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 03:37:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:37:34] [INFO ] Load time of PNML (sax parser for PT used): 283 ms
[2024-05-28 03:37:34] [INFO ] Transformed 792 places.
[2024-05-28 03:37:34] [INFO ] Transformed 4268 transitions.
[2024-05-28 03:37:34] [INFO ] Parsed PT model containing 792 places and 4268 transitions and 28832 arcs in 462 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
RANDOM walk for 40000 steps (10 resets) in 3138 ms. (12 steps per ms) remains 12/16 properties
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 509 ms. (78 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 776 ms. (51 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 549 ms. (72 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 406 ms. (98 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 219 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 479 ms. (83 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 339 ms. (117 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (9 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 332 ms. (120 steps per ms) remains 12/12 properties
[2024-05-28 03:37:36] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2024-05-28 03:37:37] [INFO ] Computed 58 invariants in 136 ms
[2024-05-28 03:37:37] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/636 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 45/681 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/681 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 8/689 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-01 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-02 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-03 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-12 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-15 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 100/789 variables, 33/55 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/789 variables, 0/55 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/792 variables, 3/58 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/792 variables, 0/58 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2068/2860 variables, 792/850 constraints. Problems are: Problem set: 9 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2860/2860 variables, and 1010 constraints, problems are : Problem set: 9 solved, 3 unsolved in 5051 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 792/792 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 12/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 3 unsolved
[2024-05-28 03:37:42] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 1/2 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 98/412 variables, 8/10 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 0/10 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/420 variables, 2/12 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/12 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 367/787 variables, 42/54 constraints. Problems are: Problem set: 9 solved, 3 unsolved
[2024-05-28 03:37:43] [INFO ] Deduced a trap composed of 83 places in 462 ms of which 7 ms to minimize.
[2024-05-28 03:37:44] [INFO ] Deduced a trap composed of 83 places in 467 ms of which 6 ms to minimize.
[2024-05-28 03:37:44] [INFO ] Deduced a trap composed of 84 places in 513 ms of which 5 ms to minimize.
[2024-05-28 03:37:45] [INFO ] Deduced a trap composed of 83 places in 547 ms of which 6 ms to minimize.
[2024-05-28 03:37:45] [INFO ] Deduced a trap composed of 83 places in 556 ms of which 6 ms to minimize.
[2024-05-28 03:37:46] [INFO ] Deduced a trap composed of 155 places in 529 ms of which 6 ms to minimize.
[2024-05-28 03:37:46] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 2 ms to minimize.
[2024-05-28 03:37:46] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-28 03:37:47] [INFO ] Deduced a trap composed of 83 places in 562 ms of which 6 ms to minimize.
[2024-05-28 03:37:47] [INFO ] Deduced a trap composed of 445 places in 583 ms of which 5 ms to minimize.
SMT process timed out in 10940ms, After SMT, problems are : Problem set: 9 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 314 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 788 transition count 2076
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 52 place count 764 transition count 2076
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 52 place count 764 transition count 2013
Deduced a syphon composed of 63 places in 4 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 178 place count 701 transition count 2013
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 194 place count 693 transition count 2005
Applied a total of 194 rules in 298 ms. Remains 693 /792 variables (removed 99) and now considering 2005/2100 (removed 95) transitions.
Running 2001 sub problems to find dead transitions.
[2024-05-28 03:37:48] [INFO ] Flow matrix only has 1973 transitions (discarded 32 similar events)
// Phase 1: matrix 1973 rows 693 cols
[2024-05-28 03:37:48] [INFO ] Computed 54 invariants in 61 ms
[2024-05-28 03:37:48] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/689 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2001 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/689 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 2001 unsolved
[2024-05-28 03:38:16] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 689/2666 variables, and 46 constraints, problems are : Problem set: 0 solved, 2001 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/693 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2001/2001 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2001 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/689 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2001 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/689 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 2001 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/689 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2001 unsolved
[2024-05-28 03:38:24] [INFO ] Deduced a trap composed of 123 places in 174 ms of which 3 ms to minimize.
[2024-05-28 03:38:29] [INFO ] Deduced a trap composed of 41 places in 454 ms of which 5 ms to minimize.
[2024-05-28 03:38:29] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-05-28 03:38:29] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2024-05-28 03:38:29] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-05-28 03:38:29] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 1 ms to minimize.
[2024-05-28 03:38:30] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/2666 variables, and 53 constraints, problems are : Problem set: 0 solved, 2001 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/693 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2001 constraints, Known Traps: 8/8 constraints]
After SMT, in 49892ms problems are : Problem set: 0 solved, 2001 unsolved
Search for dead transitions found 0 dead transitions in 49927ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50253 ms. Remains : 693/792 places, 2005/2100 transitions.
RANDOM walk for 40000 steps (9 resets) in 796 ms. (50 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 629 ms. (63 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (10 resets) in 196 ms. (203 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 84609 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :1 out of 3
Probabilistic random walk after 84609 steps, saw 57200 distinct states, run finished after 3005 ms. (steps per millisecond=28 ) properties seen :1
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-28 03:38:41] [INFO ] Flow matrix only has 1973 transitions (discarded 32 similar events)
[2024-05-28 03:38:41] [INFO ] Invariant cache hit.
[2024-05-28 03:38:41] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 82/395 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 8/403 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 275/678 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/678 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/685 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/685 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/693 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/693 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1973/2666 variables, 693/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2666 variables, 160/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2666 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2666 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2666/2666 variables, and 907 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7082 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 693/693 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 03:38:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/395 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/403 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 275/678 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 03:38:49] [INFO ] Deduced a trap composed of 72 places in 409 ms of which 4 ms to minimize.
[2024-05-28 03:38:50] [INFO ] Deduced a trap composed of 73 places in 468 ms of which 6 ms to minimize.
[2024-05-28 03:38:50] [INFO ] Deduced a trap composed of 73 places in 415 ms of which 4 ms to minimize.
[2024-05-28 03:38:51] [INFO ] Deduced a trap composed of 72 places in 400 ms of which 4 ms to minimize.
[2024-05-28 03:38:51] [INFO ] Deduced a trap composed of 72 places in 402 ms of which 4 ms to minimize.
[2024-05-28 03:38:51] [INFO ] Deduced a trap composed of 72 places in 387 ms of which 4 ms to minimize.
[2024-05-28 03:38:52] [INFO ] Deduced a trap composed of 379 places in 456 ms of which 4 ms to minimize.
[2024-05-28 03:38:52] [INFO ] Deduced a trap composed of 71 places in 471 ms of which 5 ms to minimize.
[2024-05-28 03:38:53] [INFO ] Deduced a trap composed of 327 places in 458 ms of which 5 ms to minimize.
Problem PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-08 is UNSAT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (INCLUDED_ONLY) 0/678 variables, 9/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 03:38:53] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/678 variables, 1/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/678 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/685 variables, 5/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 03:38:54] [INFO ] Deduced a trap composed of 389 places in 474 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/685 variables, 1/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/685 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/693 variables, 8/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/693 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2666/2666 variables, and 759 constraints, problems are : Problem set: 1 solved, 1 unsolved in 10969 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 693/693 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 18121ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 312 out of 693 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 693/693 places, 2005/2005 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 693 transition count 2004
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 692 transition count 2004
Applied a total of 2 rules in 87 ms. Remains 692 /693 variables (removed 1) and now considering 2004/2005 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 692/693 places, 2004/2005 transitions.
RANDOM walk for 40000 steps (9 resets) in 402 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 622 ms. (64 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 103035 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 1
Probabilistic random walk after 103035 steps, saw 69121 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-28 03:39:03] [INFO ] Flow matrix only has 1972 transitions (discarded 32 similar events)
// Phase 1: matrix 1972 rows 692 cols
[2024-05-28 03:39:03] [INFO ] Computed 54 invariants in 85 ms
[2024-05-28 03:39:03] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 70/382 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/394 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 282/676 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/676 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/684 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/684 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/692 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/692 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1972/2664 variables, 692/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2664 variables, 160/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2664 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2664 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2664/2664 variables, and 906 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2146 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 692/692 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 03:39:05] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/382 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/394 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 282/676 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 03:39:06] [INFO ] Deduced a trap composed of 72 places in 450 ms of which 4 ms to minimize.
[2024-05-28 03:39:06] [INFO ] Deduced a trap composed of 72 places in 459 ms of which 5 ms to minimize.
[2024-05-28 03:39:07] [INFO ] Deduced a trap composed of 71 places in 471 ms of which 7 ms to minimize.
[2024-05-28 03:39:07] [INFO ] Deduced a trap composed of 71 places in 458 ms of which 5 ms to minimize.
[2024-05-28 03:39:08] [INFO ] Deduced a trap composed of 72 places in 463 ms of which 4 ms to minimize.
[2024-05-28 03:39:08] [INFO ] Deduced a trap composed of 391 places in 431 ms of which 4 ms to minimize.
[2024-05-28 03:39:09] [INFO ] Deduced a trap composed of 360 places in 432 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/684 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/692 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 03:39:09] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/692 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/692 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1972/2664 variables, 692/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2664 variables, 160/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 03:39:18] [INFO ] Deduced a trap composed of 19 places in 500 ms of which 6 ms to minimize.
[2024-05-28 03:39:19] [INFO ] Deduced a trap composed of 367 places in 539 ms of which 5 ms to minimize.
[2024-05-28 03:39:20] [INFO ] Deduced a trap composed of 395 places in 383 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2664 variables, 3/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2664 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2664 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2664/2664 variables, and 918 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15269 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 692/692 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 12/12 constraints]
After SMT, in 17570ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 312 out of 692 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 692/692 places, 2004/2004 transitions.
Applied a total of 0 rules in 55 ms. Remains 692 /692 variables (removed 0) and now considering 2004/2004 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 692/692 places, 2004/2004 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 692/692 places, 2004/2004 transitions.
Applied a total of 0 rules in 55 ms. Remains 692 /692 variables (removed 0) and now considering 2004/2004 (removed 0) transitions.
[2024-05-28 03:39:21] [INFO ] Flow matrix only has 1972 transitions (discarded 32 similar events)
[2024-05-28 03:39:21] [INFO ] Invariant cache hit.
[2024-05-28 03:39:21] [INFO ] Implicit Places using invariants in 710 ms returned [2, 117, 128, 189, 258, 305, 338, 507]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 722 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 684/692 places, 2004/2004 transitions.
Applied a total of 0 rules in 47 ms. Remains 684 /684 variables (removed 0) and now considering 2004/2004 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 827 ms. Remains : 684/692 places, 2004/2004 transitions.
RANDOM walk for 40000 steps (8 resets) in 421 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 445 ms. (89 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 114394 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 114394 steps, saw 76652 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-28 03:39:25] [INFO ] Flow matrix only has 1972 transitions (discarded 32 similar events)
// Phase 1: matrix 1972 rows 684 cols
[2024-05-28 03:39:25] [INFO ] Computed 46 invariants in 70 ms
[2024-05-28 03:39:25] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 134/446 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/459 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 222/681 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/681 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/684 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/684 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1972/2656 variables, 684/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2656 variables, 160/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2656 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2656 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2656/2656 variables, and 890 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3226 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 684/684 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 03:39:28] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/312 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 134/446 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/459 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 222/681 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 03:39:29] [INFO ] Deduced a trap composed of 72 places in 522 ms of which 10 ms to minimize.
[2024-05-28 03:39:30] [INFO ] Deduced a trap composed of 72 places in 505 ms of which 6 ms to minimize.
[2024-05-28 03:39:30] [INFO ] Deduced a trap composed of 72 places in 443 ms of which 5 ms to minimize.
[2024-05-28 03:39:31] [INFO ] Deduced a trap composed of 72 places in 409 ms of which 4 ms to minimize.
[2024-05-28 03:39:31] [INFO ] Deduced a trap composed of 72 places in 425 ms of which 4 ms to minimize.
[2024-05-28 03:39:31] [INFO ] Deduced a trap composed of 214 places in 447 ms of which 5 ms to minimize.
[2024-05-28 03:39:32] [INFO ] Deduced a trap composed of 399 places in 412 ms of which 6 ms to minimize.
[2024-05-28 03:39:32] [INFO ] Deduced a trap composed of 501 places in 442 ms of which 5 ms to minimize.
[2024-05-28 03:39:33] [INFO ] Deduced a trap composed of 508 places in 405 ms of which 5 ms to minimize.
[2024-05-28 03:39:33] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/684 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1972/2656 variables, 684/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2656 variables, 160/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2656 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2656 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2656/2656 variables, and 901 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10549 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 684/684 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 11/11 constraints]
After SMT, in 13968ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 312 out of 684 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 684/684 places, 2004/2004 transitions.
Applied a total of 0 rules in 52 ms. Remains 684 /684 variables (removed 0) and now considering 2004/2004 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 684/684 places, 2004/2004 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 684/684 places, 2004/2004 transitions.
Applied a total of 0 rules in 46 ms. Remains 684 /684 variables (removed 0) and now considering 2004/2004 (removed 0) transitions.
[2024-05-28 03:39:39] [INFO ] Flow matrix only has 1972 transitions (discarded 32 similar events)
[2024-05-28 03:39:39] [INFO ] Invariant cache hit.
[2024-05-28 03:39:39] [INFO ] Implicit Places using invariants in 640 ms returned []
[2024-05-28 03:39:39] [INFO ] Flow matrix only has 1972 transitions (discarded 32 similar events)
[2024-05-28 03:39:39] [INFO ] Invariant cache hit.
[2024-05-28 03:39:42] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 03:40:13] [INFO ] Performed 624/684 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 03:40:14] [INFO ] Implicit Places using invariants and state equation in 34448 ms returned []
Implicit Place search using SMT with State Equation took 35091 ms to find 0 implicit places.
[2024-05-28 03:40:14] [INFO ] Redundant transitions in 135 ms returned []
Running 2000 sub problems to find dead transitions.
[2024-05-28 03:40:14] [INFO ] Flow matrix only has 1972 transitions (discarded 32 similar events)
[2024-05-28 03:40:14] [INFO ] Invariant cache hit.
[2024-05-28 03:40:14] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-28 03:40:42] [INFO ] Deduced a trap composed of 316 places in 267 ms of which 3 ms to minimize.
[2024-05-28 03:40:42] [INFO ] Deduced a trap composed of 310 places in 246 ms of which 3 ms to minimize.
[2024-05-28 03:40:43] [INFO ] Deduced a trap composed of 122 places in 291 ms of which 5 ms to minimize.
[2024-05-28 03:40:44] [INFO ] Deduced a trap composed of 180 places in 392 ms of which 4 ms to minimize.
[2024-05-28 03:40:44] [INFO ] Deduced a trap composed of 175 places in 352 ms of which 3 ms to minimize.
[2024-05-28 03:40:45] [INFO ] Deduced a trap composed of 310 places in 356 ms of which 4 ms to minimize.
[2024-05-28 03:40:45] [INFO ] Deduced a trap composed of 303 places in 264 ms of which 3 ms to minimize.
[2024-05-28 03:40:46] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 3 ms to minimize.
[2024-05-28 03:40:49] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 2 ms to minimize.
[2024-05-28 03:40:52] [INFO ] Deduced a trap composed of 320 places in 271 ms of which 4 ms to minimize.
[2024-05-28 03:40:52] [INFO ] Deduced a trap composed of 314 places in 354 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/2656 variables, and 52 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2000/2000 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 2000 unsolved
[2024-05-28 03:41:09] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 2 ms to minimize.
[2024-05-28 03:41:09] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 1 ms to minimize.
[2024-05-28 03:41:10] [INFO ] Deduced a trap composed of 295 places in 354 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 680/2656 variables, and 55 constraints, problems are : Problem set: 0 solved, 2000 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 22/26 constraints, State Equation: 0/684 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2000 constraints, Known Traps: 14/14 constraints]
After SMT, in 69354ms problems are : Problem set: 0 solved, 2000 unsolved
Search for dead transitions found 0 dead transitions in 69374ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104664 ms. Remains : 684/684 places, 2004/2004 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 684 transition count 1972
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 48 place count 676 transition count 1988
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 80 place count 676 transition count 1956
Applied a total of 80 rules in 90 ms. Remains 676 /684 variables (removed 8) and now considering 1956/2004 (removed 48) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1956 rows 676 cols
[2024-05-28 03:41:24] [INFO ] Computed 46 invariants in 65 ms
[2024-05-28 03:41:24] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 03:41:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-28 03:41:24] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 66 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-28 03:41:26] [INFO ] After 1825ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :1
[2024-05-28 03:41:26] [INFO ] After 2127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2508 ms.
[2024-05-28 03:41:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-28 03:41:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 684 places, 2004 transitions and 10244 arcs took 26 ms.
[2024-05-28 03:41:27] [INFO ] Flatten gal took : 376 ms
Total runtime 233290 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBLF-PT-S04J06T08
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 684
TRANSITIONS: 2004
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.048s, Sys 0.003s]
SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.006s, 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: 842
MODEL NAME: /home/mcc/execution/419/model
684 places, 2004 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J06T08"
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 PolyORBLF-PT-S04J06T08, 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 r289-tajo-171654445600302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T08.tgz
mv PolyORBLF-PT-S04J06T08 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 ;