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-171654446600223.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-S02J04T06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446600223
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Apr 11 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 11 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 862K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717252229530

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:30:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:30:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:30:31] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-06-01 14:30:31] [INFO ] Transformed 476 places.
[2024-06-01 14:30:31] [INFO ] Transformed 920 transitions.
[2024-06-01 14:30:31] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
RANDOM walk for 40000 steps (14 resets) in 2016 ms. (19 steps per ms) remains 7/16 properties
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (12 resets) in 398 ms. (100 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 581 ms. (68 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (13 resets) in 587 ms. (68 steps per ms) remains 6/7 properties
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (11 resets) in 528 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 234 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (14 resets) in 434 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 271 ms. (147 steps per ms) remains 6/6 properties
[2024-06-01 14:30:33] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2024-06-01 14:30:33] [INFO ] Computed 46 invariants in 36 ms
[2024-06-01 14:30:33] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 102/240 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-02 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-14 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-15 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 217/457 variables, 22/33 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 5/462 variables, 1/34 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-12 is UNSAT
FORMULA PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 14/476 variables, 12/46 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/46 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 812/1288 variables, 476/522 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1288 variables, 72/594 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1288 variables, 0/594 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1288 variables, 0/594 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1288/1288 variables, and 594 constraints, problems are : Problem set: 4 solved, 2 unsolved in 1639 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 476/476 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 83/105 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 343/448 variables, 20/25 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-06-01 14:30:35] [INFO ] Deduced a trap composed of 65 places in 342 ms of which 37 ms to minimize.
[2024-06-01 14:30:35] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 4 ms to minimize.
[2024-06-01 14:30:36] [INFO ] Deduced a trap composed of 260 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:30:36] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:30:36] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 5/30 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 11/459 variables, 6/36 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/36 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 17/476 variables, 15/51 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-06-01 14:30:36] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 1/52 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/52 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 812/1288 variables, 476/528 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1288/1288 variables, and 600 constraints, problems are : Problem set: 4 solved, 2 unsolved in 2909 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 476/476 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 4882ms problems are : Problem set: 4 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 168 ms.
Support contains 22 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 474 transition count 782
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 432 transition count 782
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 86 place count 432 transition count 735
Deduced a syphon composed of 47 places in 8 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 180 place count 385 transition count 735
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 276 place count 337 transition count 687
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 286 place count 337 transition count 677
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 296 place count 327 transition count 677
Applied a total of 296 rules in 262 ms. Remains 327 /476 variables (removed 149) and now considering 677/824 (removed 147) transitions.
Running 675 sub problems to find dead transitions.
[2024-06-01 14:30:38] [INFO ] Flow matrix only has 665 transitions (discarded 12 similar events)
// Phase 1: matrix 665 rows 327 cols
[2024-06-01 14:30:38] [INFO ] Computed 44 invariants in 18 ms
[2024-06-01 14:30:38] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-06-01 14:30:43] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:30:43] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:30:43] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:30:44] [INFO ] Deduced a trap composed of 41 places in 27 ms of which 1 ms to minimize.
[2024-06-01 14:30:44] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 0 ms to minimize.
[2024-06-01 14:30:44] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2024-06-01 14:30:44] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:30:45] [INFO ] Deduced a trap composed of 111 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:30:45] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:30:45] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:30:46] [INFO ] Deduced a trap composed of 119 places in 195 ms of which 2 ms to minimize.
[2024-06-01 14:30:47] [INFO ] Deduced a trap composed of 111 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:30:48] [INFO ] Deduced a trap composed of 105 places in 151 ms of which 3 ms to minimize.
[2024-06-01 14:30:48] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 2 ms to minimize.
[2024-06-01 14:30:48] [INFO ] Deduced a trap composed of 134 places in 143 ms of which 2 ms to minimize.
[2024-06-01 14:30:48] [INFO ] Deduced a trap composed of 116 places in 183 ms of which 2 ms to minimize.
[2024-06-01 14:30:50] [INFO ] Deduced a trap composed of 154 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:30:50] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-06-01 14:30:54] [INFO ] Deduced a trap composed of 125 places in 191 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 325/992 variables, and 61 constraints, problems are : Problem set: 0 solved, 675 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/327 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 675/675 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 675 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2024-06-01 14:31:02] [INFO ] Deduced a trap composed of 181 places in 187 ms of which 2 ms to minimize.
[2024-06-01 14:31:06] [INFO ] Deduced a trap composed of 195 places in 158 ms of which 3 ms to minimize.
[2024-06-01 14:31:07] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 2 ms to minimize.
[2024-06-01 14:31:08] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Problem TDEAD24 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD122 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/327 variables, 2/67 constraints. Problems are: Problem set: 8 solved, 667 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 327/992 variables, and 67 constraints, problems are : Problem set: 8 solved, 667 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/327 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/675 constraints, Known Traps: 23/23 constraints]
After SMT, in 41165ms problems are : Problem set: 8 solved, 667 unsolved
Search for dead transitions found 8 dead transitions in 41179ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 327/476 places, 669/824 transitions.
Applied a total of 0 rules in 19 ms. Remains 327 /327 variables (removed 0) and now considering 669/669 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41488 ms. Remains : 327/476 places, 669/824 transitions.
RANDOM walk for 40000 steps (25 resets) in 717 ms. (55 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 258 ms. (154 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (17 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 206475 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 206475 steps, saw 117499 distinct states, run finished after 3006 ms. (steps per millisecond=68 ) properties seen :0
[2024-06-01 14:31:23] [INFO ] Flow matrix only has 657 transitions (discarded 12 similar events)
// Phase 1: matrix 657 rows 327 cols
[2024-06-01 14:31:23] [INFO ] Computed 44 invariants in 13 ms
[2024-06-01 14:31:23] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 158/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/221 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/223 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 103/326 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/327 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 657/984 variables, 327/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/984 variables, 72/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/984 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/984 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 984/984 variables, and 443 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1114 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 327/327 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 158/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 41/221 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/223 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 103/326 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:31:24] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:31:24] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:31:24] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 2 ms to minimize.
[2024-06-01 14:31:24] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/327 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 657/984 variables, 327/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/984 variables, 72/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/984 variables, 2/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/984 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/984 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 984/984 variables, and 449 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7284 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 327/327 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 8436ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2211 ms.
Support contains 22 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 669/669 transitions.
Applied a total of 0 rules in 15 ms. Remains 327 /327 variables (removed 0) and now considering 669/669 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 327/327 places, 669/669 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 669/669 transitions.
Applied a total of 0 rules in 14 ms. Remains 327 /327 variables (removed 0) and now considering 669/669 (removed 0) transitions.
[2024-06-01 14:31:33] [INFO ] Flow matrix only has 657 transitions (discarded 12 similar events)
[2024-06-01 14:31:33] [INFO ] Invariant cache hit.
[2024-06-01 14:31:34] [INFO ] Implicit Places using invariants in 351 ms returned [83, 166, 190, 192, 288, 300]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 358 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 321/327 places, 669/669 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 317 transition count 665
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 317 transition count 665
Applied a total of 8 rules in 24 ms. Remains 317 /321 variables (removed 4) and now considering 665/669 (removed 4) transitions.
[2024-06-01 14:31:34] [INFO ] Flow matrix only has 653 transitions (discarded 12 similar events)
// Phase 1: matrix 653 rows 317 cols
[2024-06-01 14:31:34] [INFO ] Computed 38 invariants in 25 ms
[2024-06-01 14:31:34] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-06-01 14:31:34] [INFO ] Flow matrix only has 653 transitions (discarded 12 similar events)
[2024-06-01 14:31:34] [INFO ] Invariant cache hit.
[2024-06-01 14:31:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:31:38] [INFO ] Implicit Places using invariants and state equation in 3750 ms returned []
Implicit Place search using SMT with State Equation took 4119 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 317/327 places, 665/669 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4517 ms. Remains : 317/327 places, 665/669 transitions.
RANDOM walk for 40000 steps (26 resets) in 381 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (15 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (15 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 208205 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 208205 steps, saw 112699 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-06-01 14:31:41] [INFO ] Flow matrix only has 653 transitions (discarded 12 similar events)
[2024-06-01 14:31:41] [INFO ] Invariant cache hit.
[2024-06-01 14:31:41] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/297 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/303 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/317 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 653/970 variables, 317/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/970 variables, 72/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/970 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/970 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 970/970 variables, and 427 constraints, problems are : Problem set: 0 solved, 2 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 317/317 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/90 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/297 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:31:42] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:31:42] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:31:42] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:31:42] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/303 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/317 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 14:31:43] [INFO ] Deduced a trap composed of 96 places in 186 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 653/970 variables, 317/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/970 variables, 72/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/970 variables, 2/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/970 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/970 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 970/970 variables, and 434 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8162 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 317/317 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 8974ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1603 ms.
Support contains 22 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 665/665 transitions.
Applied a total of 0 rules in 13 ms. Remains 317 /317 variables (removed 0) and now considering 665/665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 317/317 places, 665/665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 665/665 transitions.
Applied a total of 0 rules in 11 ms. Remains 317 /317 variables (removed 0) and now considering 665/665 (removed 0) transitions.
[2024-06-01 14:31:52] [INFO ] Flow matrix only has 653 transitions (discarded 12 similar events)
[2024-06-01 14:31:52] [INFO ] Invariant cache hit.
[2024-06-01 14:31:52] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-06-01 14:31:52] [INFO ] Flow matrix only has 653 transitions (discarded 12 similar events)
[2024-06-01 14:31:52] [INFO ] Invariant cache hit.
[2024-06-01 14:31:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:31:55] [INFO ] Implicit Places using invariants and state equation in 3294 ms returned []
Implicit Place search using SMT with State Equation took 3529 ms to find 0 implicit places.
[2024-06-01 14:31:55] [INFO ] Redundant transitions in 72 ms returned []
Running 663 sub problems to find dead transitions.
[2024-06-01 14:31:55] [INFO ] Flow matrix only has 653 transitions (discarded 12 similar events)
[2024-06-01 14:31:55] [INFO ] Invariant cache hit.
[2024-06-01 14:31:55] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-01 14:31:59] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 4 ms to minimize.
[2024-06-01 14:31:59] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-06-01 14:31:59] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:32:00] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:32:00] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:32:00] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:32:00] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:32:00] [INFO ] Deduced a trap composed of 111 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:32:01] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:32:01] [INFO ] Deduced a trap composed of 106 places in 174 ms of which 2 ms to minimize.
[2024-06-01 14:32:01] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 2 ms to minimize.
[2024-06-01 14:32:02] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:32:03] [INFO ] Deduced a trap composed of 123 places in 185 ms of which 3 ms to minimize.
[2024-06-01 14:32:04] [INFO ] Deduced a trap composed of 169 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:32:04] [INFO ] Deduced a trap composed of 165 places in 108 ms of which 2 ms to minimize.
[2024-06-01 14:32:05] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:32:05] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:32:05] [INFO ] Deduced a trap composed of 171 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:32:05] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 2 ms to minimize.
[2024-06-01 14:32:05] [INFO ] Deduced a trap composed of 158 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-01 14:32:06] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:32:09] [INFO ] Deduced a trap composed of 161 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:32:10] [INFO ] Deduced a trap composed of 157 places in 182 ms of which 3 ms to minimize.
[2024-06-01 14:32:10] [INFO ] Deduced a trap composed of 173 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:32:10] [INFO ] Deduced a trap composed of 175 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:32:10] [INFO ] Deduced a trap composed of 83 places in 174 ms of which 3 ms to minimize.
[2024-06-01 14:32:10] [INFO ] Deduced a trap composed of 123 places in 135 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-01 14:32:17] [INFO ] Deduced a trap composed of 120 places in 160 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-01 14:32:21] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:32:22] [INFO ] Deduced a trap composed of 131 places in 195 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-01 14:32:26] [INFO ] Deduced a trap composed of 169 places in 174 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 315/970 variables, and 67 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/317 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 663/663 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 663 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 663 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 31/67 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-01 14:32:34] [INFO ] Deduced a trap composed of 157 places in 202 ms of which 3 ms to minimize.
[2024-06-01 14:32:35] [INFO ] Deduced a trap composed of 171 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:32:35] [INFO ] Deduced a trap composed of 158 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:32:35] [INFO ] Deduced a trap composed of 175 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:32:35] [INFO ] Deduced a trap composed of 197 places in 181 ms of which 5 ms to minimize.
[2024-06-01 14:32:36] [INFO ] Deduced a trap composed of 171 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:32:36] [INFO ] Deduced a trap composed of 171 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:32:36] [INFO ] Deduced a trap composed of 180 places in 179 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 663 unsolved
[2024-06-01 14:32:46] [INFO ] Deduced a trap composed of 181 places in 204 ms of which 3 ms to minimize.
[2024-06-01 14:32:50] [INFO ] Deduced a trap composed of 160 places in 153 ms of which 1 ms to minimize.
[2024-06-01 14:32:50] [INFO ] Deduced a trap composed of 177 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:32:50] [INFO ] Deduced a trap composed of 161 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:32:51] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:32:52] [INFO ] Deduced a trap composed of 167 places in 155 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 663 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 315/970 variables, and 81 constraints, problems are : Problem set: 0 solved, 663 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/317 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/663 constraints, Known Traps: 45/45 constraints]
After SMT, in 60960ms problems are : Problem set: 0 solved, 663 unsolved
Search for dead transitions found 0 dead transitions in 60970ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64596 ms. Remains : 317/317 places, 665/665 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 317 transition count 653
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
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 24 place count 311 transition count 677
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 48 place count 311 transition count 653
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 311 transition count 647
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 60 place count 305 transition count 647
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 305 transition count 641
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 299 transition count 641
Applied a total of 72 rules in 104 ms. Remains 299 /317 variables (removed 18) and now considering 641/665 (removed 24) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 641 rows 299 cols
[2024-06-01 14:32:56] [INFO ] Computed 38 invariants in 7 ms
[2024-06-01 14:32:57] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-06-01 14:32:57] [INFO ] [Real]Absence check using 14 positive and 24 generalized place invariants in 16 ms returned sat
[2024-06-01 14:32:57] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 14:32:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-06-01 14:32:57] [INFO ] [Nat]Absence check using 14 positive and 24 generalized place invariants in 17 ms returned sat
[2024-06-01 14:33:22] [INFO ] After 25014ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 14:33:23] [INFO ] Deduced a trap composed of 125 places in 194 ms of which 3 ms to minimize.
[2024-06-01 14:33:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 427 ms
TRAPS : Iteration 1
[2024-06-01 14:33:24] [INFO ] Deduced a trap composed of 121 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:33:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
TRAPS : Iteration 2
[2024-06-01 14:33:28] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 2 ms to minimize.
[2024-06-01 14:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 670 ms
TRAPS : Iteration 3
[2024-06-01 14:33:30] [INFO ] After 32929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 14:33:32] [INFO ] After 35357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 35597 ms.
[2024-06-01 14:33:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-01 14:33:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 317 places, 665 transitions and 3380 arcs took 10 ms.
[2024-06-01 14:33:32] [INFO ] Flatten gal took : 92 ms
Total runtime 181609 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-S02J04T06-ReachabilityFireability-2024-01
Could not compute solution for formula : PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-13

BK_STOP 1717252412960

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/851/inv_0_
rfs formula name PolyORBLF-PT-S02J04T06-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/851/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-S02J04T06"
export BK_EXAMINATION="ReachabilityFireability"
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-S02J04T06, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446600223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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