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.r516-tajo-171654446800294.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 ltsminxred
Input is PolyORBLF-PT-S04J06T06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446800294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 19K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:07 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 8.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 90K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 427K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K 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 2.6M 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-S04J06T06-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717254605823

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:10:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:10:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:10:07] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-06-01 15:10:07] [INFO ] Transformed 618 places.
[2024-06-01 15:10:07] [INFO ] Transformed 3190 transitions.
[2024-06-01 15:10:07] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 367 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
RANDOM walk for 40002 steps (9 resets) in 1926 ms. (20 steps per ms) remains 11/16 properties
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 720 ms. (55 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 681 ms. (58 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 782 ms. (51 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 371 ms. (107 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (9 resets) in 172 ms. (231 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (9 resets) in 271 ms. (147 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (9 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (9 resets) in 223 ms. (178 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (9 resets) in 202 ms. (197 steps per ms) remains 11/11 properties
[2024-06-01 15:10:09] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 618 cols
[2024-06-01 15:10:09] [INFO ] Computed 54 invariants in 67 ms
[2024-06-01 15:10:09] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-06 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-07 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 55/558 variables, 8/26 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 4/30 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-05 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-12 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 60/618 variables, 24/54 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 0/54 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1540/2158 variables, 618/672 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2158 variables, 120/792 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2158 variables, 0/792 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/2158 variables, 0/792 constraints. Problems are: Problem set: 7 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2158/2158 variables, and 792 constraints, problems are : Problem set: 7 solved, 4 unsolved in 5045 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 618/618 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 11/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 192/234 variables, 8/8 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 21/255 variables, 6/14 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 345/600 variables, 27/41 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-06-01 15:10:15] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 15 ms to minimize.
[2024-06-01 15:10:15] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-06-01 15:10:16] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 2 ms to minimize.
[2024-06-01 15:10:16] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:10:16] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-11 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 5/46 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 0/46 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/606 variables, 3/49 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 0/49 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 10/616 variables, 9/58 constraints. Problems are: Problem set: 8 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/616 variables, 0/58 constraints. Problems are: Problem set: 8 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2156/2158 variables, and 674 constraints, problems are : Problem set: 8 solved, 3 unsolved in 4978 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 616/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 5/5 constraints]
After SMT, in 10504ms problems are : Problem set: 8 solved, 3 unsolved
Parikh walk visited 0 properties in 1323 ms.
Support contains 13 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 614 transition count 1513
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 563 transition count 1511
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 561 transition count 1511
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 110 place count 561 transition count 1440
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 252 place count 490 transition count 1440
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 354 place count 439 transition count 1389
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 364 place count 439 transition count 1379
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 374 place count 429 transition count 1379
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 375 place count 429 transition count 1379
Applied a total of 375 rules in 384 ms. Remains 429 /618 variables (removed 189) and now considering 1379/1564 (removed 185) transitions.
Running 1375 sub problems to find dead transitions.
[2024-06-01 15:10:22] [INFO ] Flow matrix only has 1355 transitions (discarded 24 similar events)
// Phase 1: matrix 1355 rows 429 cols
[2024-06-01 15:10:22] [INFO ] Computed 50 invariants in 57 ms
[2024-06-01 15:10:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
[2024-06-01 15:10:37] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 1 ms to minimize.
[2024-06-01 15:10:37] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 2 ms to minimize.
[2024-06-01 15:10:37] [INFO ] Deduced a trap composed of 34 places in 360 ms of which 3 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 56 places in 332 ms of which 9 ms to minimize.
[2024-06-01 15:10:38] [INFO ] Deduced a trap composed of 55 places in 333 ms of which 3 ms to minimize.
[2024-06-01 15:10:40] [INFO ] Deduced a trap composed of 141 places in 362 ms of which 3 ms to minimize.
[2024-06-01 15:10:40] [INFO ] Deduced a trap composed of 135 places in 237 ms of which 3 ms to minimize.
[2024-06-01 15:10:43] [INFO ] Deduced a trap composed of 34 places in 171 ms of which 2 ms to minimize.
[2024-06-01 15:10:43] [INFO ] Deduced a trap composed of 63 places in 236 ms of which 3 ms to minimize.
[2024-06-01 15:10:48] [INFO ] Deduced a trap composed of 134 places in 227 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1784 variables, and 55 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/33 constraints, State Equation: 0/429 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1375/1375 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
[2024-06-01 15:10:51] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 2 ms to minimize.
[2024-06-01 15:10:51] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:10:51] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:10:52] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:10:52] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:10:53] [INFO ] Deduced a trap composed of 53 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:10:55] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 1375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/1784 variables, and 62 constraints, problems are : Problem set: 0 solved, 1375 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/33 constraints, State Equation: 0/429 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1375 constraints, Known Traps: 17/17 constraints]
After SMT, in 46604ms problems are : Problem set: 0 solved, 1375 unsolved
Search for dead transitions found 0 dead transitions in 46628ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47044 ms. Remains : 429/618 places, 1379/1564 transitions.
RANDOM walk for 40000 steps (9 resets) in 788 ms. (50 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 331 ms. (120 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 319 ms. (125 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 140006 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 3
Probabilistic random walk after 140006 steps, saw 99186 distinct states, run finished after 3004 ms. (steps per millisecond=46 ) properties seen :0
[2024-06-01 15:11:12] [INFO ] Flow matrix only has 1355 transitions (discarded 24 similar events)
[2024-06-01 15:11:12] [INFO ] Invariant cache hit.
[2024-06-01 15:11:12] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/63 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 323/386 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/402 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 25/427 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1355/1782 variables, 427/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1782 variables, 120/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1782 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1784 variables, 2/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1784 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1784 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1784 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1784/1784 variables, and 599 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2773 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 429/429 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 42/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/63 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 323/386 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/402 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 25/427 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 15:11:15] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-06-01 15:11:15] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 0 ms to minimize.
[2024-06-01 15:11:15] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:11:15] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:11:15] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1782/1784 variables, and 481 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 427/429 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 47812ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1379/1379 transitions.
Applied a total of 0 rules in 69 ms. Remains 429 /429 variables (removed 0) and now considering 1379/1379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 429/429 places, 1379/1379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 1379/1379 transitions.
Applied a total of 0 rules in 50 ms. Remains 429 /429 variables (removed 0) and now considering 1379/1379 (removed 0) transitions.
[2024-06-01 15:12:00] [INFO ] Flow matrix only has 1355 transitions (discarded 24 similar events)
[2024-06-01 15:12:00] [INFO ] Invariant cache hit.
[2024-06-01 15:12:00] [INFO ] Implicit Places using invariants in 686 ms returned [97, 139, 230, 253, 336, 384]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 696 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 423/429 places, 1379/1379 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 420 transition count 1376
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 420 transition count 1376
Applied a total of 6 rules in 51 ms. Remains 420 /423 variables (removed 3) and now considering 1376/1379 (removed 3) transitions.
[2024-06-01 15:12:00] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
// Phase 1: matrix 1352 rows 420 cols
[2024-06-01 15:12:00] [INFO ] Computed 44 invariants in 52 ms
[2024-06-01 15:12:01] [INFO ] Implicit Places using invariants in 836 ms returned []
[2024-06-01 15:12:01] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
[2024-06-01 15:12:01] [INFO ] Invariant cache hit.
[2024-06-01 15:12:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:12:08] [INFO ] Implicit Places using invariants and state equation in 7008 ms returned []
Implicit Place search using SMT with State Equation took 7858 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 420/429 places, 1376/1379 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8656 ms. Remains : 420/429 places, 1376/1379 transitions.
RANDOM walk for 40000 steps (9 resets) in 767 ms. (52 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (9 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 164433 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 3
Probabilistic random walk after 164433 steps, saw 113238 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
[2024-06-01 15:12:12] [INFO ] Flow matrix only has 1352 transitions (discarded 24 similar events)
[2024-06-01 15:12:12] [INFO ] Invariant cache hit.
[2024-06-01 15:12:12] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/85 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 306/391 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/403 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 15/418 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1352/1770 variables, 418/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1770 variables, 120/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1770 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1772 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1772 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1772 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1772 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1772/1772 variables, and 584 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9505 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 420/420 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 64/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/85 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 306/391 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 12/403 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 15/418 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 15:12:22] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:12:22] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:12:22] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1352/1770 variables, 418/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1770 variables, 120/584 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1770 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 15:12:36] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
Problem PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-10 is UNSAT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 15:12:37] [INFO ] Deduced a trap composed of 175 places in 386 ms of which 4 ms to minimize.
[2024-06-01 15:12:38] [INFO ] Deduced a trap composed of 141 places in 389 ms of which 4 ms to minimize.
[2024-06-01 15:12:38] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1770 variables, 4/591 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1770 variables, 0/591 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/1772 variables, 2/593 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1772 variables, 1/594 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1772 variables, 0/594 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1772 variables, 0/594 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1772/1772 variables, and 594 constraints, problems are : Problem set: 1 solved, 2 unsolved in 19062 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 420/420 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 28584ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 521 ms.
Support contains 12 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1376/1376 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 418 transition count 1374
Applied a total of 4 rules in 42 ms. Remains 418 /420 variables (removed 2) and now considering 1374/1376 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 418/420 places, 1374/1376 transitions.
RANDOM walk for 40000 steps (13 resets) in 955 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 168326 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 2
Probabilistic random walk after 168326 steps, saw 115938 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-06-01 15:12:44] [INFO ] Flow matrix only has 1350 transitions (discarded 24 similar events)
// Phase 1: matrix 1350 rows 418 cols
[2024-06-01 15:12:44] [INFO ] Computed 44 invariants in 19 ms
[2024-06-01 15:12:44] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 171/183 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 45/228 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/240 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 163/403 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/408 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/416 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1350/1766 variables, 416/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1766 variables, 120/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1766 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/1768 variables, 2/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1768 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1768 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1768 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1768/1768 variables, and 582 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1605 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 418/418 constraints, ReadFeed: 120/120 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 171/183 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 45/228 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 12/240 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 163/403 variables, 22/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/408 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/416 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:12:46] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 6 ms to minimize.
[2024-06-01 15:12:46] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 1 ms to minimize.
[2024-06-01 15:12:47] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:12:47] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1350/1766 variables, 416/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1766 variables, 120/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1766 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1766 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1768 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1768 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1768 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1768 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1768/1768 variables, and 588 constraints, problems are : Problem set: 0 solved, 2 unsolved in 84530 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 418/418 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 86167ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 906 ms.
Support contains 12 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 1374/1374 transitions.
Applied a total of 0 rules in 22 ms. Remains 418 /418 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 418/418 places, 1374/1374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 1374/1374 transitions.
Applied a total of 0 rules in 22 ms. Remains 418 /418 variables (removed 0) and now considering 1374/1374 (removed 0) transitions.
[2024-06-01 15:14:11] [INFO ] Flow matrix only has 1350 transitions (discarded 24 similar events)
[2024-06-01 15:14:11] [INFO ] Invariant cache hit.
[2024-06-01 15:14:12] [INFO ] Implicit Places using invariants in 589 ms returned []
[2024-06-01 15:14:12] [INFO ] Flow matrix only has 1350 transitions (discarded 24 similar events)
[2024-06-01 15:14:12] [INFO ] Invariant cache hit.
[2024-06-01 15:14:13] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:14:21] [INFO ] Implicit Places using invariants and state equation in 8903 ms returned []
Implicit Place search using SMT with State Equation took 9501 ms to find 0 implicit places.
[2024-06-01 15:14:21] [INFO ] Redundant transitions in 94 ms returned []
Running 1370 sub problems to find dead transitions.
[2024-06-01 15:14:21] [INFO ] Flow matrix only has 1350 transitions (discarded 24 similar events)
[2024-06-01 15:14:21] [INFO ] Invariant cache hit.
[2024-06-01 15:14:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-06-01 15:14:36] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:14:36] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-06-01 15:14:36] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 0 ms to minimize.
[2024-06-01 15:14:36] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:14:37] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:14:37] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:14:37] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 0 ms to minimize.
[2024-06-01 15:14:37] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:14:37] [INFO ] Deduced a trap composed of 59 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:14:38] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 2 ms to minimize.
[2024-06-01 15:14:38] [INFO ] Deduced a trap composed of 37 places in 302 ms of which 4 ms to minimize.
[2024-06-01 15:14:39] [INFO ] Deduced a trap composed of 139 places in 339 ms of which 3 ms to minimize.
[2024-06-01 15:14:40] [INFO ] Deduced a trap composed of 133 places in 241 ms of which 3 ms to minimize.
[2024-06-01 15:14:44] [INFO ] Deduced a trap composed of 220 places in 237 ms of which 2 ms to minimize.
[2024-06-01 15:14:44] [INFO ] Deduced a trap composed of 238 places in 217 ms of which 2 ms to minimize.
[2024-06-01 15:14:44] [INFO ] Deduced a trap composed of 215 places in 208 ms of which 2 ms to minimize.
[2024-06-01 15:14:46] [INFO ] Deduced a trap composed of 158 places in 239 ms of which 2 ms to minimize.
[2024-06-01 15:14:46] [INFO ] Deduced a trap composed of 142 places in 200 ms of which 2 ms to minimize.
[2024-06-01 15:14:46] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 12 ms to minimize.
[2024-06-01 15:14:47] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-06-01 15:14:55] [INFO ] Deduced a trap composed of 154 places in 317 ms of which 3 ms to minimize.
[2024-06-01 15:14:56] [INFO ] Deduced a trap composed of 205 places in 402 ms of which 3 ms to minimize.
[2024-06-01 15:14:57] [INFO ] Deduced a trap composed of 207 places in 299 ms of which 3 ms to minimize.
[2024-06-01 15:14:57] [INFO ] Deduced a trap composed of 215 places in 283 ms of which 2 ms to minimize.
[2024-06-01 15:14:57] [INFO ] Deduced a trap composed of 206 places in 277 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1768 variables, and 65 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1370/1370 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
[2024-06-01 15:15:10] [INFO ] Deduced a trap composed of 198 places in 354 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/1768 variables, and 66 constraints, problems are : Problem set: 0 solved, 1370 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/418 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1370 constraints, Known Traps: 26/26 constraints]
After SMT, in 67036ms problems are : Problem set: 0 solved, 1370 unsolved
Search for dead transitions found 0 dead transitions in 67054ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76684 ms. Remains : 418/418 places, 1374/1374 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 418 transition count 1350
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 412 transition count 1398
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 1 with 42 rules applied. Total rules applied 78 place count 412 transition count 1356
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 412 transition count 1350
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 406 transition count 1350
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 96 place count 406 transition count 1344
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 102 place count 400 transition count 1344
Applied a total of 102 rules in 187 ms. Remains 400 /418 variables (removed 18) and now considering 1344/1374 (removed 30) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1344 rows 400 cols
[2024-06-01 15:15:28] [INFO ] Computed 44 invariants in 17 ms
[2024-06-01 15:15:28] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 15:15:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-06-01 15:15:29] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 35 ms returned sat
[2024-06-01 15:15:30] [INFO ] After 1714ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 15:15:31] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-06-01 15:15:31] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:15:32] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:15:32] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:15:32] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-01 15:15:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1620 ms
TRAPS : Iteration 1
[2024-06-01 15:15:34] [INFO ] After 5308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 15:15:35] [INFO ] After 6022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 6429 ms.
[2024-06-01 15:15:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-01 15:15:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 418 places, 1374 transitions and 7949 arcs took 22 ms.
[2024-06-01 15:15:35] [INFO ] Flatten gal took : 164 ms
Total runtime 328343 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-14
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-15

BK_STOP 1717254935899

--------------------
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
mcc2024
rfs formula name PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/817/inv_0_
rfs formula name PolyORBLF-PT-S04J06T06-ReachabilityCardinality-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/817/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-S04J06T06"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-PT-S04J06T06, 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 r516-tajo-171654446800294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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