Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654446000469.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-PT-S05J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654446000469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716888186527

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:23:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 09:23:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:23:08] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-05-28 09:23:08] [INFO ] Transformed 909 places.
[2024-05-28 09:23:08] [INFO ] Transformed 1970 transitions.
[2024-05-28 09:23:08] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 342 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 61, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 61, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 09:23:08] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-28 09:23:08] [INFO ] Computed 142 invariants in 102 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 61, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 10] Max Struct:[245, 87, 262, 61, 1399, 245, 262, 305, 245, 364, 1, 25, 65, 245, 10]
FORMULA PolyORBNT-PT-S05J60-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-UpperBounds-03 61 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (697 resets) in 198 ms. (50 steps per ms)
BEST_FIRST walk for 130010 steps (1800 resets) in 536 ms. (242 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 4, 1, 3, 4, 1, 1, 0, 1, 1, 1] Max Struct:[245, 87, 262, 1399, 245, 262, 305, 245, 364, 1, 25, 65, 245]
[2024-05-28 09:23:09] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 09:23:09] [INFO ] Invariant cache hit.
[2024-05-28 09:23:09] [INFO ] [Real]Absence check using 111 positive place invariants in 42 ms returned sat
[2024-05-28 09:23:10] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 42 ms returned unsat
[2024-05-28 09:23:10] [INFO ] [Real]Absence check using 111 positive place invariants in 31 ms returned sat
[2024-05-28 09:23:10] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 40 ms returned unsat
[2024-05-28 09:23:10] [INFO ] [Real]Absence check using 111 positive place invariants in 25 ms returned sat
[2024-05-28 09:23:10] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 32 ms returned unsat
[2024-05-28 09:23:10] [INFO ] [Real]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-28 09:23:10] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 31 ms returned unsat
[2024-05-28 09:23:10] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-28 09:23:10] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 36 ms returned unsat
[2024-05-28 09:23:10] [INFO ] [Real]Absence check using 111 positive place invariants in 23 ms returned sat
[2024-05-28 09:23:10] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 34 ms returned sat
[2024-05-28 09:23:11] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2024-05-28 09:23:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:23:11] [INFO ] [Nat]Absence check using 111 positive place invariants in 25 ms returned sat
[2024-05-28 09:23:11] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 33 ms returned sat
[2024-05-28 09:23:12] [INFO ] [Nat]Absence check using state equation in 827 ms returned sat
[2024-05-28 09:23:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:23:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 381 ms returned sat
[2024-05-28 09:23:13] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 126 ms.
[2024-05-28 09:23:13] [INFO ] Added : 16 causal constraints over 4 iterations in 774 ms. Result :sat
Minimization took 624 ms.
[2024-05-28 09:23:14] [INFO ] [Real]Absence check using 111 positive place invariants in 34 ms returned sat
[2024-05-28 09:23:14] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 39 ms returned sat
[2024-05-28 09:23:15] [INFO ] [Real]Absence check using state equation in 842 ms returned sat
[2024-05-28 09:23:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:23:15] [INFO ] [Nat]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-28 09:23:15] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 42 ms returned sat
[2024-05-28 09:23:17] [INFO ] [Nat]Absence check using state equation in 1768 ms returned unsat
[2024-05-28 09:23:17] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-28 09:23:17] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 42 ms returned unsat
[2024-05-28 09:23:18] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-28 09:23:18] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 42 ms returned unsat
[2024-05-28 09:23:18] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-28 09:23:18] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 41 ms returned sat
[2024-05-28 09:23:19] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2024-05-28 09:23:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:23:19] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-28 09:23:19] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 33 ms returned sat
[2024-05-28 09:23:20] [INFO ] [Nat]Absence check using state equation in 762 ms returned sat
[2024-05-28 09:23:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 96 ms returned sat
[2024-05-28 09:23:20] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 139 ms.
[2024-05-28 09:23:21] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 26 ms to minimize.
[2024-05-28 09:23:21] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 750 ms
Maximisation of solution failed !
Minimization took 5 ms.
[2024-05-28 09:23:24] [INFO ] [Real]Absence check using 111 positive place invariants in 33 ms returned sat
[2024-05-28 09:23:24] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 21 ms returned unsat
[2024-05-28 09:23:24] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-28 09:23:24] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 40 ms returned unsat
[2024-05-28 09:23:24] [INFO ] [Real]Absence check using 111 positive place invariants in 31 ms returned sat
[2024-05-28 09:23:24] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 66 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 4, 1, 3, 4, 1, 1, 0, 1, 1, 1] Max Struct:[1, 1, 1, 4, 1, 262, 4, 1, 1, 1, 1, 1, 1]
FORMULA PolyORBNT-PT-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 0] Max Struct:[262, 1]
Support contains 2 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 3 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
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 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 372 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
Running 1175 sub problems to find dead transitions.
[2024-05-28 09:23:25] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2024-05-28 09:23:25] [INFO ] Computed 137 invariants in 42 ms
[2024-05-28 09:23:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1947 variables, and 132 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-05-28 09:23:51] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 2 ms to minimize.
[2024-05-28 09:24:03] [INFO ] Deduced a trap composed of 13 places in 413 ms of which 6 ms to minimize.
[2024-05-28 09:24:07] [INFO ] Deduced a trap composed of 195 places in 405 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 135 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 3/3 constraints]
After SMT, in 43605ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 43649ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44059 ms. Remains : 770/909 places, 1181/1315 transitions.
[2024-05-28 09:24:08] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 09:24:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 0] Max Struct:[136, 1]
RANDOM walk for 1000000 steps (51991 resets) in 7971 ms. (125 steps per ms)
FORMULA PolyORBNT-PT-S05J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (3392 resets) in 1595 ms. (626 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-05-28 09:24:18] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 09:24:18] [INFO ] Invariant cache hit.
[2024-05-28 09:24:18] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-28 09:24:18] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 34 ms returned sat
[2024-05-28 09:24:19] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2024-05-28 09:24:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:24:19] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-28 09:24:19] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 33 ms returned sat
[2024-05-28 09:24:20] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2024-05-28 09:24:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:24:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 147 ms returned sat
[2024-05-28 09:24:20] [INFO ] Deduced a trap composed of 214 places in 444 ms of which 6 ms to minimize.
[2024-05-28 09:24:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 557 ms
[2024-05-28 09:24:20] [INFO ] Computed and/alt/rep : 616/2116/616 causal constraints (skipped 555 transitions) in 96 ms.
[2024-05-28 09:24:21] [INFO ] Added : 9 causal constraints over 2 iterations in 453 ms. Result :sat
Minimization took 3602 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 75 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 770/770 places, 1181/1181 transitions.
[2024-05-28 09:24:25] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 09:24:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[136]
RANDOM walk for 1000000 steps (52087 resets) in 7782 ms. (128 steps per ms)
BEST_FIRST walk for 1000001 steps (3449 resets) in 1676 ms. (596 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-05-28 09:24:34] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 09:24:34] [INFO ] Invariant cache hit.
[2024-05-28 09:24:34] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2024-05-28 09:24:34] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 34 ms returned sat
[2024-05-28 09:24:35] [INFO ] [Real]Absence check using state equation in 919 ms returned sat
[2024-05-28 09:24:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:24:35] [INFO ] [Nat]Absence check using 111 positive place invariants in 28 ms returned sat
[2024-05-28 09:24:35] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 34 ms returned sat
[2024-05-28 09:24:36] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2024-05-28 09:24:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:24:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 190 ms returned sat
[2024-05-28 09:24:37] [INFO ] Deduced a trap composed of 214 places in 371 ms of which 5 ms to minimize.
[2024-05-28 09:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2024-05-28 09:24:37] [INFO ] Computed and/alt/rep : 616/2116/616 causal constraints (skipped 555 transitions) in 102 ms.
[2024-05-28 09:24:37] [INFO ] Added : 9 causal constraints over 2 iterations in 358 ms. Result :sat
Minimization took 4126 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 59 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 770/770 places, 1181/1181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 49 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
[2024-05-28 09:24:41] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 09:24:41] [INFO ] Invariant cache hit.
[2024-05-28 09:24:43] [INFO ] Implicit Places using invariants in 1393 ms returned []
[2024-05-28 09:24:43] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 09:24:43] [INFO ] Invariant cache hit.
[2024-05-28 09:24:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:24:59] [INFO ] Implicit Places using invariants and state equation in 15778 ms returned []
Implicit Place search using SMT with State Equation took 17178 ms to find 0 implicit places.
[2024-05-28 09:24:59] [INFO ] Redundant transitions in 123 ms returned []
Running 1175 sub problems to find dead transitions.
[2024-05-28 09:24:59] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 09:24:59] [INFO ] Invariant cache hit.
[2024-05-28 09:24:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/770 variables, 5/137 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/1947 variables, and 137 constraints, problems are : Problem set: 95 solved, 1080 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
[2024-05-28 09:25:39] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 1)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 1)
(s220 9)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 1)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 1)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 1)
(s349 0)
(s350 1)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 1)
(s413 1)
(s414 0)
(s415 1)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 1)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 133 constraints, problems are : Problem set: 95 solved, 1080 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 1/1 constraints]
After SMT, in 63908ms problems are : Problem set: 95 solved, 1080 unsolved
Search for dead transitions found 95 dead transitions in 63928ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 770/770 places, 1086/1181 transitions.
Applied a total of 0 rules in 62 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 09:26:03] [INFO ] Redundant transitions in 63 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 81440 ms. Remains : 770/770 places, 1086/1181 transitions.
[2024-05-28 09:26:03] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-28 09:26:03] [INFO ] Computed 137 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[136]
RANDOM walk for 1000001 steps (52165 resets) in 7182 ms. (139 steps per ms)
BEST_FIRST walk for 1000001 steps (3440 resets) in 1632 ms. (612 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-05-28 09:26:12] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:26:12] [INFO ] Invariant cache hit.
[2024-05-28 09:26:12] [INFO ] [Real]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-28 09:26:12] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 35 ms returned sat
[2024-05-28 09:26:12] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2024-05-28 09:26:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:26:13] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2024-05-28 09:26:13] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 34 ms returned sat
[2024-05-28 09:26:14] [INFO ] [Nat]Absence check using state equation in 988 ms returned sat
[2024-05-28 09:26:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:26:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 31 ms returned sat
[2024-05-28 09:26:14] [INFO ] Deduced a trap composed of 251 places in 392 ms of which 7 ms to minimize.
[2024-05-28 09:26:14] [INFO ] Deduced a trap composed of 251 places in 367 ms of which 5 ms to minimize.
[2024-05-28 09:26:15] [INFO ] Deduced a trap composed of 246 places in 341 ms of which 5 ms to minimize.
[2024-05-28 09:26:15] [INFO ] Deduced a trap composed of 242 places in 308 ms of which 5 ms to minimize.
[2024-05-28 09:26:16] [INFO ] Deduced a trap composed of 230 places in 314 ms of which 5 ms to minimize.
[2024-05-28 09:26:16] [INFO ] Deduced a trap composed of 267 places in 317 ms of which 5 ms to minimize.
[2024-05-28 09:26:16] [INFO ] Deduced a trap composed of 239 places in 326 ms of which 5 ms to minimize.
[2024-05-28 09:26:17] [INFO ] Deduced a trap composed of 230 places in 386 ms of which 5 ms to minimize.
[2024-05-28 09:26:17] [INFO ] Deduced a trap composed of 254 places in 427 ms of which 6 ms to minimize.
[2024-05-28 09:26:18] [INFO ] Deduced a trap composed of 257 places in 373 ms of which 6 ms to minimize.
[2024-05-28 09:26:18] [INFO ] Deduced a trap composed of 260 places in 340 ms of which 6 ms to minimize.
[2024-05-28 09:26:19] [INFO ] Deduced a trap composed of 242 places in 333 ms of which 6 ms to minimize.
[2024-05-28 09:26:19] [INFO ] Deduced a trap composed of 248 places in 362 ms of which 6 ms to minimize.
[2024-05-28 09:26:20] [INFO ] Deduced a trap composed of 242 places in 381 ms of which 7 ms to minimize.
[2024-05-28 09:26:20] [INFO ] Deduced a trap composed of 242 places in 380 ms of which 6 ms to minimize.
[2024-05-28 09:26:20] [INFO ] Deduced a trap composed of 248 places in 322 ms of which 4 ms to minimize.
[2024-05-28 09:26:21] [INFO ] Deduced a trap composed of 239 places in 321 ms of which 5 ms to minimize.
[2024-05-28 09:26:22] [INFO ] Deduced a trap composed of 246 places in 398 ms of which 6 ms to minimize.
[2024-05-28 09:26:22] [INFO ] Deduced a trap composed of 257 places in 390 ms of which 6 ms to minimize.
[2024-05-28 09:26:24] [INFO ] Deduced a trap composed of 279 places in 362 ms of which 6 ms to minimize.
[2024-05-28 09:26:24] [INFO ] Deduced a trap composed of 249 places in 377 ms of which 5 ms to minimize.
[2024-05-28 09:26:24] [INFO ] Deduced a trap composed of 252 places in 364 ms of which 6 ms to minimize.
[2024-05-28 09:26:25] [INFO ] Deduced a trap composed of 248 places in 317 ms of which 4 ms to minimize.
[2024-05-28 09:26:25] [INFO ] Deduced a trap composed of 245 places in 457 ms of which 6 ms to minimize.
[2024-05-28 09:26:26] [INFO ] Deduced a trap composed of 246 places in 401 ms of which 5 ms to minimize.
[2024-05-28 09:26:26] [INFO ] Deduced a trap composed of 264 places in 478 ms of which 7 ms to minimize.
[2024-05-28 09:26:27] [INFO ] Deduced a trap composed of 233 places in 517 ms of which 20 ms to minimize.
[2024-05-28 09:26:28] [INFO ] Deduced a trap composed of 251 places in 390 ms of which 5 ms to minimize.
[2024-05-28 09:26:29] [INFO ] Deduced a trap composed of 245 places in 541 ms of which 20 ms to minimize.
[2024-05-28 09:26:29] [INFO ] Deduced a trap composed of 248 places in 422 ms of which 6 ms to minimize.
[2024-05-28 09:26:30] [INFO ] Deduced a trap composed of 257 places in 466 ms of which 10 ms to minimize.
[2024-05-28 09:26:31] [INFO ] Deduced a trap composed of 236 places in 331 ms of which 5 ms to minimize.
[2024-05-28 09:26:31] [INFO ] Deduced a trap composed of 243 places in 407 ms of which 5 ms to minimize.
[2024-05-28 09:26:32] [INFO ] Deduced a trap composed of 234 places in 385 ms of which 4 ms to minimize.
[2024-05-28 09:26:32] [INFO ] Deduced a trap composed of 261 places in 398 ms of which 5 ms to minimize.
[2024-05-28 09:26:33] [INFO ] Deduced a trap composed of 246 places in 319 ms of which 4 ms to minimize.
[2024-05-28 09:26:34] [INFO ] Deduced a trap composed of 257 places in 308 ms of which 5 ms to minimize.
[2024-05-28 09:26:34] [INFO ] Deduced a trap composed of 245 places in 385 ms of which 5 ms to minimize.
[2024-05-28 09:26:35] [INFO ] Deduced a trap composed of 255 places in 362 ms of which 5 ms to minimize.
[2024-05-28 09:26:35] [INFO ] Deduced a trap composed of 236 places in 355 ms of which 5 ms to minimize.
[2024-05-28 09:26:36] [INFO ] Deduced a trap composed of 251 places in 353 ms of which 6 ms to minimize.
[2024-05-28 09:26:37] [INFO ] Deduced a trap composed of 246 places in 331 ms of which 4 ms to minimize.
[2024-05-28 09:26:37] [INFO ] Deduced a trap composed of 231 places in 373 ms of which 7 ms to minimize.
[2024-05-28 09:26:38] [INFO ] Deduced a trap composed of 238 places in 390 ms of which 5 ms to minimize.
[2024-05-28 09:26:38] [INFO ] Deduced a trap composed of 253 places in 405 ms of which 6 ms to minimize.
[2024-05-28 09:26:39] [INFO ] Deduced a trap composed of 260 places in 360 ms of which 5 ms to minimize.
[2024-05-28 09:26:39] [INFO ] Deduced a trap composed of 284 places in 360 ms of which 5 ms to minimize.
[2024-05-28 09:26:39] [INFO ] Deduced a trap composed of 248 places in 373 ms of which 8 ms to minimize.
[2024-05-28 09:26:40] [INFO ] Deduced a trap composed of 273 places in 428 ms of which 4 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 245 places in 350 ms of which 5 ms to minimize.
[2024-05-28 09:26:41] [INFO ] Deduced a trap composed of 236 places in 385 ms of which 4 ms to minimize.
[2024-05-28 09:26:44] [INFO ] Deduced a trap composed of 254 places in 419 ms of which 6 ms to minimize.
[2024-05-28 09:26:46] [INFO ] Deduced a trap composed of 230 places in 356 ms of which 6 ms to minimize.
[2024-05-28 09:26:47] [INFO ] Deduced a trap composed of 247 places in 344 ms of which 5 ms to minimize.
[2024-05-28 09:26:47] [INFO ] Deduced a trap composed of 259 places in 353 ms of which 5 ms to minimize.
[2024-05-28 09:26:47] [INFO ] Deduced a trap composed of 240 places in 407 ms of which 5 ms to minimize.
[2024-05-28 09:26:51] [INFO ] Deduced a trap composed of 241 places in 349 ms of which 7 ms to minimize.
[2024-05-28 09:26:52] [INFO ] Deduced a trap composed of 250 places in 340 ms of which 5 ms to minimize.
[2024-05-28 09:26:56] [INFO ] Trap strengthening (SAT) tested/added 58/58 trap constraints in 42665 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 73 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 52 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 09:26:56] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:26:56] [INFO ] Invariant cache hit.
[2024-05-28 09:26:58] [INFO ] Implicit Places using invariants in 1745 ms returned []
[2024-05-28 09:26:58] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:26:58] [INFO ] Invariant cache hit.
[2024-05-28 09:26:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:27:13] [INFO ] Implicit Places using invariants and state equation in 14635 ms returned []
Implicit Place search using SMT with State Equation took 16386 ms to find 0 implicit places.
[2024-05-28 09:27:13] [INFO ] Redundant transitions in 28 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 09:27:13] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:27:13] [INFO ] Invariant cache hit.
[2024-05-28 09:27:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:27:27] [INFO ] Deduced a trap composed of 281 places in 461 ms of which 5 ms to minimize.
[2024-05-28 09:27:28] [INFO ] Deduced a trap composed of 242 places in 396 ms of which 4 ms to minimize.
[2024-05-28 09:27:28] [INFO ] Deduced a trap composed of 209 places in 372 ms of which 6 ms to minimize.
[2024-05-28 09:27:29] [INFO ] Deduced a trap composed of 206 places in 294 ms of which 4 ms to minimize.
[2024-05-28 09:27:29] [INFO ] Deduced a trap composed of 209 places in 366 ms of which 5 ms to minimize.
[2024-05-28 09:27:29] [INFO ] Deduced a trap composed of 204 places in 306 ms of which 4 ms to minimize.
[2024-05-28 09:27:30] [INFO ] Deduced a trap composed of 203 places in 491 ms of which 11 ms to minimize.
[2024-05-28 09:27:30] [INFO ] Deduced a trap composed of 197 places in 398 ms of which 6 ms to minimize.
[2024-05-28 09:27:31] [INFO ] Deduced a trap composed of 209 places in 494 ms of which 37 ms to minimize.
[2024-05-28 09:27:32] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-05-28 09:27:32] [INFO ] Deduced a trap composed of 206 places in 476 ms of which 8 ms to minimize.
[2024-05-28 09:27:33] [INFO ] Deduced a trap composed of 197 places in 479 ms of which 9 ms to minimize.
[2024-05-28 09:27:33] [INFO ] Deduced a trap composed of 201 places in 488 ms of which 19 ms to minimize.
[2024-05-28 09:27:34] [INFO ] Deduced a trap composed of 206 places in 689 ms of which 9 ms to minimize.
[2024-05-28 09:27:34] [INFO ] Deduced a trap composed of 199 places in 335 ms of which 5 ms to minimize.
[2024-05-28 09:27:34] [INFO ] Deduced a trap composed of 197 places in 374 ms of which 6 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 204 places in 357 ms of which 4 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 196 places in 350 ms of which 4 ms to minimize.
[2024-05-28 09:27:36] [INFO ] Deduced a trap composed of 197 places in 366 ms of which 4 ms to minimize.
[2024-05-28 09:27:36] [INFO ] Deduced a trap composed of 201 places in 367 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:27:38] [INFO ] Deduced a trap composed of 240 places in 346 ms of which 5 ms to minimize.
[2024-05-28 09:27:39] [INFO ] Deduced a trap composed of 248 places in 358 ms of which 5 ms to minimize.
[2024-05-28 09:27:40] [INFO ] Deduced a trap composed of 211 places in 432 ms of which 5 ms to minimize.
[2024-05-28 09:27:40] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 4 ms to minimize.
[2024-05-28 09:27:40] [INFO ] Deduced a trap composed of 240 places in 298 ms of which 4 ms to minimize.
[2024-05-28 09:27:41] [INFO ] Deduced a trap composed of 265 places in 292 ms of which 4 ms to minimize.
[2024-05-28 09:27:41] [INFO ] Deduced a trap composed of 233 places in 479 ms of which 9 ms to minimize.
[2024-05-28 09:27:41] [INFO ] Deduced a trap composed of 197 places in 254 ms of which 4 ms to minimize.
[2024-05-28 09:27:43] [INFO ] Deduced a trap composed of 196 places in 501 ms of which 19 ms to minimize.
[2024-05-28 09:27:43] [INFO ] Deduced a trap composed of 196 places in 440 ms of which 6 ms to minimize.
[2024-05-28 09:27:44] [INFO ] Deduced a trap composed of 196 places in 385 ms of which 4 ms to minimize.
[2024-05-28 09:27:44] [INFO ] Deduced a trap composed of 196 places in 357 ms of which 6 ms to minimize.
[2024-05-28 09:27:44] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 6 ms to minimize.
[2024-05-28 09:27:45] [INFO ] Deduced a trap composed of 206 places in 311 ms of which 4 ms to minimize.
[2024-05-28 09:27:45] [INFO ] Deduced a trap composed of 209 places in 293 ms of which 5 ms to minimize.
[2024-05-28 09:27:45] [INFO ] Deduced a trap composed of 206 places in 273 ms of which 4 ms to minimize.
[2024-05-28 09:27:46] [INFO ] Deduced a trap composed of 196 places in 391 ms of which 5 ms to minimize.
SMT process timed out in 33097ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 33110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49597 ms. Remains : 770/770 places, 1086/1086 transitions.
RANDOM walk for 40000 steps (2070 resets) in 1296 ms. (30 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (139 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (139 resets) in 224 ms. (177 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 117549 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 2
Probabilistic random walk after 117549 steps, saw 35068 distinct states, run finished after 3020 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-28 09:27:50] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:27:50] [INFO ] Invariant cache hit.
[2024-05-28 09:27:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 09:27:52] [INFO ] Deduced a trap composed of 233 places in 380 ms of which 6 ms to minimize.
[2024-05-28 09:27:52] [INFO ] Deduced a trap composed of 269 places in 348 ms of which 5 ms to minimize.
[2024-05-28 09:27:53] [INFO ] Deduced a trap composed of 246 places in 386 ms of which 5 ms to minimize.
[2024-05-28 09:27:53] [INFO ] Deduced a trap composed of 242 places in 332 ms of which 4 ms to minimize.
[2024-05-28 09:27:53] [INFO ] Deduced a trap composed of 236 places in 329 ms of which 5 ms to minimize.
[2024-05-28 09:27:54] [INFO ] Deduced a trap composed of 239 places in 313 ms of which 4 ms to minimize.
[2024-05-28 09:27:54] [INFO ] Deduced a trap composed of 254 places in 293 ms of which 5 ms to minimize.
[2024-05-28 09:27:54] [INFO ] Deduced a trap composed of 254 places in 324 ms of which 4 ms to minimize.
[2024-05-28 09:27:55] [INFO ] Deduced a trap composed of 254 places in 284 ms of which 5 ms to minimize.
[2024-05-28 09:27:55] [INFO ] Deduced a trap composed of 236 places in 289 ms of which 5 ms to minimize.
[2024-05-28 09:27:55] [INFO ] Deduced a trap composed of 230 places in 337 ms of which 4 ms to minimize.
[2024-05-28 09:27:56] [INFO ] Deduced a trap composed of 254 places in 314 ms of which 4 ms to minimize.
[2024-05-28 09:27:56] [INFO ] Deduced a trap composed of 239 places in 275 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1852 variables, and 150 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 6395ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 60 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 09:27:56] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:27:56] [INFO ] Invariant cache hit.
[2024-05-28 09:27:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:28:11] [INFO ] Deduced a trap composed of 281 places in 492 ms of which 4 ms to minimize.
[2024-05-28 09:28:12] [INFO ] Deduced a trap composed of 242 places in 322 ms of which 5 ms to minimize.
[2024-05-28 09:28:12] [INFO ] Deduced a trap composed of 209 places in 283 ms of which 4 ms to minimize.
[2024-05-28 09:28:13] [INFO ] Deduced a trap composed of 206 places in 369 ms of which 5 ms to minimize.
[2024-05-28 09:28:13] [INFO ] Deduced a trap composed of 209 places in 355 ms of which 6 ms to minimize.
[2024-05-28 09:28:13] [INFO ] Deduced a trap composed of 204 places in 340 ms of which 4 ms to minimize.
[2024-05-28 09:28:14] [INFO ] Deduced a trap composed of 203 places in 374 ms of which 6 ms to minimize.
[2024-05-28 09:28:14] [INFO ] Deduced a trap composed of 197 places in 356 ms of which 4 ms to minimize.
[2024-05-28 09:28:15] [INFO ] Deduced a trap composed of 209 places in 371 ms of which 4 ms to minimize.
[2024-05-28 09:28:15] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2024-05-28 09:28:15] [INFO ] Deduced a trap composed of 206 places in 308 ms of which 4 ms to minimize.
[2024-05-28 09:28:16] [INFO ] Deduced a trap composed of 197 places in 375 ms of which 5 ms to minimize.
[2024-05-28 09:28:16] [INFO ] Deduced a trap composed of 201 places in 352 ms of which 5 ms to minimize.
[2024-05-28 09:28:17] [INFO ] Deduced a trap composed of 206 places in 361 ms of which 6 ms to minimize.
[2024-05-28 09:28:17] [INFO ] Deduced a trap composed of 199 places in 329 ms of which 6 ms to minimize.
[2024-05-28 09:28:17] [INFO ] Deduced a trap composed of 197 places in 355 ms of which 5 ms to minimize.
[2024-05-28 09:28:18] [INFO ] Deduced a trap composed of 204 places in 329 ms of which 4 ms to minimize.
[2024-05-28 09:28:18] [INFO ] Deduced a trap composed of 196 places in 341 ms of which 4 ms to minimize.
[2024-05-28 09:28:18] [INFO ] Deduced a trap composed of 197 places in 298 ms of which 4 ms to minimize.
[2024-05-28 09:28:19] [INFO ] Deduced a trap composed of 201 places in 337 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 152 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:28:29] [INFO ] Deduced a trap composed of 258 places in 341 ms of which 5 ms to minimize.
[2024-05-28 09:28:29] [INFO ] Deduced a trap composed of 206 places in 317 ms of which 5 ms to minimize.
[2024-05-28 09:28:30] [INFO ] Deduced a trap composed of 245 places in 366 ms of which 6 ms to minimize.
[2024-05-28 09:28:30] [INFO ] Deduced a trap composed of 196 places in 377 ms of which 6 ms to minimize.
[2024-05-28 09:28:31] [INFO ] Deduced a trap composed of 243 places in 369 ms of which 6 ms to minimize.
[2024-05-28 09:28:31] [INFO ] Deduced a trap composed of 236 places in 475 ms of which 23 ms to minimize.
[2024-05-28 09:28:32] [INFO ] Deduced a trap composed of 201 places in 446 ms of which 17 ms to minimize.
[2024-05-28 09:28:33] [INFO ] Deduced a trap composed of 197 places in 375 ms of which 6 ms to minimize.
[2024-05-28 09:28:33] [INFO ] Deduced a trap composed of 212 places in 296 ms of which 5 ms to minimize.
[2024-05-28 09:28:33] [INFO ] Deduced a trap composed of 214 places in 315 ms of which 5 ms to minimize.
[2024-05-28 09:28:34] [INFO ] Deduced a trap composed of 209 places in 351 ms of which 5 ms to minimize.
[2024-05-28 09:28:34] [INFO ] Deduced a trap composed of 207 places in 286 ms of which 5 ms to minimize.
[2024-05-28 09:28:35] [INFO ] Deduced a trap composed of 208 places in 347 ms of which 6 ms to minimize.
[2024-05-28 09:28:36] [INFO ] Deduced a trap composed of 255 places in 351 ms of which 6 ms to minimize.
[2024-05-28 09:28:36] [INFO ] Deduced a trap composed of 242 places in 360 ms of which 5 ms to minimize.
[2024-05-28 09:28:36] [INFO ] Deduced a trap composed of 256 places in 367 ms of which 5 ms to minimize.
[2024-05-28 09:28:37] [INFO ] Deduced a trap composed of 239 places in 347 ms of which 6 ms to minimize.
[2024-05-28 09:28:37] [INFO ] Deduced a trap composed of 203 places in 309 ms of which 4 ms to minimize.
[2024-05-28 09:28:38] [INFO ] Deduced a trap composed of 235 places in 369 ms of which 5 ms to minimize.
[2024-05-28 09:28:38] [INFO ] Deduced a trap composed of 204 places in 373 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 40/40 constraints]
After SMT, in 43472ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 43494ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43572 ms. Remains : 770/770 places, 1086/1086 transitions.
RANDOM walk for 40000 steps (2086 resets) in 663 ms. (60 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (141 resets) in 568 ms. (70 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 138792 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 1
Probabilistic random walk after 138792 steps, saw 41007 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
[2024-05-28 09:28:43] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:28:43] [INFO ] Invariant cache hit.
[2024-05-28 09:28:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:28:45] [INFO ] Deduced a trap composed of 233 places in 376 ms of which 5 ms to minimize.
[2024-05-28 09:28:45] [INFO ] Deduced a trap composed of 269 places in 276 ms of which 5 ms to minimize.
[2024-05-28 09:28:45] [INFO ] Deduced a trap composed of 246 places in 295 ms of which 5 ms to minimize.
[2024-05-28 09:28:45] [INFO ] Deduced a trap composed of 242 places in 311 ms of which 5 ms to minimize.
[2024-05-28 09:28:46] [INFO ] Deduced a trap composed of 236 places in 274 ms of which 5 ms to minimize.
[2024-05-28 09:28:46] [INFO ] Deduced a trap composed of 239 places in 283 ms of which 6 ms to minimize.
[2024-05-28 09:28:46] [INFO ] Deduced a trap composed of 254 places in 346 ms of which 4 ms to minimize.
[2024-05-28 09:28:47] [INFO ] Deduced a trap composed of 254 places in 348 ms of which 5 ms to minimize.
[2024-05-28 09:28:47] [INFO ] Deduced a trap composed of 254 places in 357 ms of which 4 ms to minimize.
[2024-05-28 09:28:48] [INFO ] Deduced a trap composed of 236 places in 346 ms of which 5 ms to minimize.
[2024-05-28 09:28:48] [INFO ] Deduced a trap composed of 230 places in 458 ms of which 20 ms to minimize.
[2024-05-28 09:28:48] [INFO ] Deduced a trap composed of 254 places in 421 ms of which 5 ms to minimize.
[2024-05-28 09:28:49] [INFO ] Deduced a trap composed of 239 places in 394 ms of which 27 ms to minimize.
[2024-05-28 09:28:49] [INFO ] Deduced a trap composed of 254 places in 395 ms of which 6 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 233 places in 351 ms of which 5 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 242 places in 401 ms of which 5 ms to minimize.
[2024-05-28 09:28:51] [INFO ] Deduced a trap composed of 242 places in 363 ms of which 6 ms to minimize.
[2024-05-28 09:28:51] [INFO ] Deduced a trap composed of 218 places in 350 ms of which 6 ms to minimize.
[2024-05-28 09:28:51] [INFO ] Deduced a trap composed of 241 places in 370 ms of which 6 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 258 places in 387 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 224 places in 341 ms of which 7 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 241 places in 345 ms of which 5 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 251 places in 396 ms of which 6 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 239 places in 372 ms of which 6 ms to minimize.
[2024-05-28 09:28:54] [INFO ] Deduced a trap composed of 239 places in 381 ms of which 6 ms to minimize.
[2024-05-28 09:28:54] [INFO ] Deduced a trap composed of 240 places in 359 ms of which 5 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 251 places in 307 ms of which 5 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 236 places in 330 ms of which 5 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 232 places in 362 ms of which 6 ms to minimize.
[2024-05-28 09:28:56] [INFO ] Deduced a trap composed of 246 places in 318 ms of which 5 ms to minimize.
[2024-05-28 09:28:56] [INFO ] Deduced a trap composed of 236 places in 335 ms of which 6 ms to minimize.
[2024-05-28 09:28:56] [INFO ] Deduced a trap composed of 265 places in 344 ms of which 5 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 250 places in 362 ms of which 5 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 256 places in 337 ms of which 6 ms to minimize.
[2024-05-28 09:28:58] [INFO ] Deduced a trap composed of 248 places in 384 ms of which 5 ms to minimize.
[2024-05-28 09:28:58] [INFO ] Deduced a trap composed of 248 places in 371 ms of which 7 ms to minimize.
[2024-05-28 09:28:59] [INFO ] Deduced a trap composed of 254 places in 351 ms of which 5 ms to minimize.
[2024-05-28 09:28:59] [INFO ] Deduced a trap composed of 272 places in 391 ms of which 6 ms to minimize.
[2024-05-28 09:28:59] [INFO ] Deduced a trap composed of 251 places in 421 ms of which 5 ms to minimize.
[2024-05-28 09:29:00] [INFO ] Deduced a trap composed of 257 places in 385 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:29:00] [INFO ] Deduced a trap composed of 236 places in 379 ms of which 5 ms to minimize.
[2024-05-28 09:29:01] [INFO ] Deduced a trap composed of 239 places in 381 ms of which 4 ms to minimize.
[2024-05-28 09:29:01] [INFO ] Deduced a trap composed of 231 places in 381 ms of which 5 ms to minimize.
[2024-05-28 09:29:02] [INFO ] Deduced a trap composed of 260 places in 331 ms of which 5 ms to minimize.
[2024-05-28 09:29:02] [INFO ] Deduced a trap composed of 245 places in 405 ms of which 6 ms to minimize.
[2024-05-28 09:29:04] [INFO ] Deduced a trap composed of 236 places in 335 ms of which 4 ms to minimize.
[2024-05-28 09:29:04] [INFO ] Deduced a trap composed of 230 places in 456 ms of which 5 ms to minimize.
[2024-05-28 09:29:04] [INFO ] Deduced a trap composed of 236 places in 318 ms of which 5 ms to minimize.
[2024-05-28 09:29:05] [INFO ] Deduced a trap composed of 218 places in 352 ms of which 5 ms to minimize.
[2024-05-28 09:29:06] [INFO ] Deduced a trap composed of 246 places in 390 ms of which 5 ms to minimize.
[2024-05-28 09:29:06] [INFO ] Deduced a trap composed of 248 places in 360 ms of which 5 ms to minimize.
[2024-05-28 09:29:07] [INFO ] Deduced a trap composed of 242 places in 494 ms of which 19 ms to minimize.
[2024-05-28 09:29:07] [INFO ] Deduced a trap composed of 227 places in 531 ms of which 8 ms to minimize.
[2024-05-28 09:29:08] [INFO ] Deduced a trap composed of 251 places in 400 ms of which 5 ms to minimize.
[2024-05-28 09:29:09] [INFO ] Deduced a trap composed of 254 places in 373 ms of which 5 ms to minimize.
[2024-05-28 09:29:10] [INFO ] Deduced a trap composed of 230 places in 490 ms of which 8 ms to minimize.
[2024-05-28 09:29:10] [INFO ] Deduced a trap composed of 239 places in 506 ms of which 5 ms to minimize.
[2024-05-28 09:29:11] [INFO ] Deduced a trap composed of 242 places in 469 ms of which 6 ms to minimize.
[2024-05-28 09:29:11] [INFO ] Deduced a trap composed of 242 places in 366 ms of which 4 ms to minimize.
[2024-05-28 09:29:14] [INFO ] Deduced a trap composed of 248 places in 468 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:29:14] [INFO ] Deduced a trap composed of 260 places in 360 ms of which 5 ms to minimize.
[2024-05-28 09:29:15] [INFO ] Deduced a trap composed of 242 places in 350 ms of which 6 ms to minimize.
[2024-05-28 09:29:15] [INFO ] Deduced a trap composed of 257 places in 364 ms of which 5 ms to minimize.
[2024-05-28 09:29:15] [INFO ] Deduced a trap composed of 245 places in 366 ms of which 6 ms to minimize.
[2024-05-28 09:29:16] [INFO ] Deduced a trap composed of 230 places in 365 ms of which 5 ms to minimize.
[2024-05-28 09:29:16] [INFO ] Deduced a trap composed of 242 places in 348 ms of which 4 ms to minimize.
[2024-05-28 09:29:16] [INFO ] Deduced a trap composed of 245 places in 346 ms of which 5 ms to minimize.
[2024-05-28 09:29:17] [INFO ] Deduced a trap composed of 236 places in 350 ms of which 5 ms to minimize.
[2024-05-28 09:29:17] [INFO ] Deduced a trap composed of 236 places in 338 ms of which 5 ms to minimize.
[2024-05-28 09:29:18] [INFO ] Deduced a trap composed of 233 places in 339 ms of which 5 ms to minimize.
[2024-05-28 09:29:19] [INFO ] Deduced a trap composed of 273 places in 330 ms of which 4 ms to minimize.
[2024-05-28 09:29:19] [INFO ] Deduced a trap composed of 236 places in 377 ms of which 5 ms to minimize.
[2024-05-28 09:29:20] [INFO ] Deduced a trap composed of 239 places in 343 ms of which 6 ms to minimize.
[2024-05-28 09:29:20] [INFO ] Deduced a trap composed of 260 places in 299 ms of which 5 ms to minimize.
[2024-05-28 09:29:20] [INFO ] Deduced a trap composed of 236 places in 380 ms of which 6 ms to minimize.
[2024-05-28 09:29:21] [INFO ] Deduced a trap composed of 257 places in 336 ms of which 5 ms to minimize.
[2024-05-28 09:29:21] [INFO ] Deduced a trap composed of 239 places in 355 ms of which 5 ms to minimize.
[2024-05-28 09:29:22] [INFO ] Deduced a trap composed of 230 places in 479 ms of which 20 ms to minimize.
[2024-05-28 09:29:22] [INFO ] Deduced a trap composed of 268 places in 557 ms of which 31 ms to minimize.
[2024-05-28 09:29:23] [INFO ] Deduced a trap composed of 236 places in 568 ms of which 21 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:29:23] [INFO ] Deduced a trap composed of 233 places in 349 ms of which 6 ms to minimize.
[2024-05-28 09:29:24] [INFO ] Deduced a trap composed of 242 places in 395 ms of which 6 ms to minimize.
[2024-05-28 09:29:24] [INFO ] Deduced a trap composed of 245 places in 390 ms of which 5 ms to minimize.
[2024-05-28 09:29:26] [INFO ] Deduced a trap composed of 257 places in 369 ms of which 6 ms to minimize.
[2024-05-28 09:29:26] [INFO ] Deduced a trap composed of 245 places in 393 ms of which 5 ms to minimize.
[2024-05-28 09:29:27] [INFO ] Deduced a trap composed of 224 places in 337 ms of which 6 ms to minimize.
[2024-05-28 09:29:27] [INFO ] Deduced a trap composed of 250 places in 333 ms of which 5 ms to minimize.
[2024-05-28 09:29:28] [INFO ] Deduced a trap composed of 242 places in 318 ms of which 6 ms to minimize.
[2024-05-28 09:29:28] [INFO ] Deduced a trap composed of 254 places in 343 ms of which 5 ms to minimize.
[2024-05-28 09:29:29] [INFO ] Deduced a trap composed of 239 places in 338 ms of which 5 ms to minimize.
[2024-05-28 09:29:29] [INFO ] Deduced a trap composed of 247 places in 301 ms of which 5 ms to minimize.
SMT process timed out in 45977ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 34 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 35 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 09:29:29] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:29:29] [INFO ] Invariant cache hit.
[2024-05-28 09:29:31] [INFO ] Implicit Places using invariants in 2103 ms returned []
[2024-05-28 09:29:31] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:29:31] [INFO ] Invariant cache hit.
[2024-05-28 09:29:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:29:46] [INFO ] Implicit Places using invariants and state equation in 15232 ms returned []
Implicit Place search using SMT with State Equation took 17364 ms to find 0 implicit places.
[2024-05-28 09:29:47] [INFO ] Redundant transitions in 18 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 09:29:47] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:29:47] [INFO ] Invariant cache hit.
[2024-05-28 09:29:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:30:09] [INFO ] Deduced a trap composed of 281 places in 370 ms of which 6 ms to minimize.
[2024-05-28 09:30:09] [INFO ] Deduced a trap composed of 242 places in 374 ms of which 6 ms to minimize.
[2024-05-28 09:30:10] [INFO ] Deduced a trap composed of 209 places in 357 ms of which 4 ms to minimize.
[2024-05-28 09:30:10] [INFO ] Deduced a trap composed of 206 places in 479 ms of which 19 ms to minimize.
[2024-05-28 09:30:11] [INFO ] Deduced a trap composed of 209 places in 324 ms of which 4 ms to minimize.
[2024-05-28 09:30:11] [INFO ] Deduced a trap composed of 204 places in 348 ms of which 4 ms to minimize.
[2024-05-28 09:30:11] [INFO ] Deduced a trap composed of 203 places in 309 ms of which 5 ms to minimize.
[2024-05-28 09:30:12] [INFO ] Deduced a trap composed of 197 places in 298 ms of which 5 ms to minimize.
[2024-05-28 09:30:12] [INFO ] Deduced a trap composed of 209 places in 339 ms of which 5 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 196 places in 361 ms of which 7 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 206 places in 358 ms of which 4 ms to minimize.
[2024-05-28 09:30:14] [INFO ] Deduced a trap composed of 197 places in 483 ms of which 8 ms to minimize.
[2024-05-28 09:30:14] [INFO ] Deduced a trap composed of 201 places in 308 ms of which 4 ms to minimize.
[2024-05-28 09:30:14] [INFO ] Deduced a trap composed of 206 places in 307 ms of which 5 ms to minimize.
[2024-05-28 09:30:15] [INFO ] Deduced a trap composed of 199 places in 443 ms of which 9 ms to minimize.
[2024-05-28 09:30:15] [INFO ] Deduced a trap composed of 197 places in 375 ms of which 5 ms to minimize.
[2024-05-28 09:30:15] [INFO ] Deduced a trap composed of 204 places in 459 ms of which 8 ms to minimize.
[2024-05-28 09:30:16] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 4 ms to minimize.
[2024-05-28 09:30:16] [INFO ] Deduced a trap composed of 197 places in 337 ms of which 7 ms to minimize.
[2024-05-28 09:30:17] [INFO ] Deduced a trap composed of 201 places in 305 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:30:18] [INFO ] Deduced a trap composed of 240 places in 507 ms of which 21 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 153 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 21/153 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:30:23] [INFO ] Deduced a trap composed of 196 places in 392 ms of which 6 ms to minimize.
[2024-05-28 09:30:24] [INFO ] Deduced a trap composed of 196 places in 596 ms of which 21 ms to minimize.
[2024-05-28 09:30:24] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 4 ms to minimize.
[2024-05-28 09:30:25] [INFO ] Deduced a trap composed of 196 places in 369 ms of which 5 ms to minimize.
[2024-05-28 09:30:25] [INFO ] Deduced a trap composed of 196 places in 494 ms of which 19 ms to minimize.
[2024-05-28 09:30:26] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 5 ms to minimize.
[2024-05-28 09:30:26] [INFO ] Deduced a trap composed of 197 places in 287 ms of which 5 ms to minimize.
[2024-05-28 09:30:26] [INFO ] Deduced a trap composed of 197 places in 370 ms of which 4 ms to minimize.
[2024-05-28 09:30:27] [INFO ] Deduced a trap composed of 196 places in 426 ms of which 5 ms to minimize.
[2024-05-28 09:30:27] [INFO ] Deduced a trap composed of 196 places in 364 ms of which 5 ms to minimize.
[2024-05-28 09:30:28] [INFO ] Deduced a trap composed of 196 places in 359 ms of which 5 ms to minimize.
[2024-05-28 09:30:28] [INFO ] Deduced a trap composed of 196 places in 369 ms of which 4 ms to minimize.
[2024-05-28 09:30:28] [INFO ] Deduced a trap composed of 197 places in 363 ms of which 5 ms to minimize.
[2024-05-28 09:30:29] [INFO ] Deduced a trap composed of 197 places in 342 ms of which 5 ms to minimize.
[2024-05-28 09:30:29] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 09:30:29] [INFO ] Deduced a trap composed of 196 places in 351 ms of which 5 ms to minimize.
[2024-05-28 09:30:30] [INFO ] Deduced a trap composed of 196 places in 354 ms of which 5 ms to minimize.
[2024-05-28 09:30:30] [INFO ] Deduced a trap composed of 197 places in 283 ms of which 4 ms to minimize.
[2024-05-28 09:30:30] [INFO ] Deduced a trap composed of 197 places in 291 ms of which 4 ms to minimize.
[2024-05-28 09:30:31] [INFO ] Deduced a trap composed of 197 places in 312 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/173 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 173 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 41/41 constraints]
After SMT, in 63083ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 63113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80561 ms. Remains : 770/770 places, 1086/1086 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[136]
Starting property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[136]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[136]
[2024-05-28 09:30:50] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:30:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[136]
RANDOM walk for 10000 steps (497 resets) in 85 ms. (116 steps per ms)
BEST_FIRST walk for 10001 steps (34 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-05-28 09:30:50] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:30:50] [INFO ] Invariant cache hit.
[2024-05-28 09:30:50] [INFO ] [Real]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-05-28 09:30:50] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 27 ms returned sat
[2024-05-28 09:30:50] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2024-05-28 09:30:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:30:51] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-28 09:30:51] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 25 ms returned sat
[2024-05-28 09:30:52] [INFO ] [Nat]Absence check using state equation in 896 ms returned sat
[2024-05-28 09:30:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:30:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2024-05-28 09:30:52] [INFO ] Deduced a trap composed of 251 places in 304 ms of which 4 ms to minimize.
[2024-05-28 09:30:52] [INFO ] Deduced a trap composed of 251 places in 303 ms of which 5 ms to minimize.
[2024-05-28 09:30:53] [INFO ] Deduced a trap composed of 246 places in 294 ms of which 5 ms to minimize.
[2024-05-28 09:30:53] [INFO ] Deduced a trap composed of 242 places in 508 ms of which 23 ms to minimize.
[2024-05-28 09:30:54] [INFO ] Deduced a trap composed of 230 places in 371 ms of which 6 ms to minimize.
[2024-05-28 09:30:54] [INFO ] Deduced a trap composed of 267 places in 341 ms of which 6 ms to minimize.
[2024-05-28 09:30:54] [INFO ] Deduced a trap composed of 239 places in 385 ms of which 5 ms to minimize.
[2024-05-28 09:30:55] [INFO ] Deduced a trap composed of 230 places in 356 ms of which 5 ms to minimize.
[2024-05-28 09:30:55] [INFO ] Deduced a trap composed of 254 places in 374 ms of which 5 ms to minimize.
[2024-05-28 09:30:56] [INFO ] Deduced a trap composed of 257 places in 522 ms of which 19 ms to minimize.
[2024-05-28 09:30:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 49 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 09:30:56] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:30:56] [INFO ] Invariant cache hit.
[2024-05-28 09:30:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:31:12] [INFO ] Deduced a trap composed of 281 places in 297 ms of which 5 ms to minimize.
[2024-05-28 09:31:12] [INFO ] Deduced a trap composed of 242 places in 344 ms of which 4 ms to minimize.
[2024-05-28 09:31:13] [INFO ] Deduced a trap composed of 209 places in 404 ms of which 4 ms to minimize.
[2024-05-28 09:31:13] [INFO ] Deduced a trap composed of 206 places in 459 ms of which 7 ms to minimize.
[2024-05-28 09:31:14] [INFO ] Deduced a trap composed of 209 places in 458 ms of which 5 ms to minimize.
[2024-05-28 09:31:14] [INFO ] Deduced a trap composed of 204 places in 278 ms of which 4 ms to minimize.
[2024-05-28 09:31:15] [INFO ] Deduced a trap composed of 203 places in 351 ms of which 5 ms to minimize.
[2024-05-28 09:31:15] [INFO ] Deduced a trap composed of 197 places in 395 ms of which 5 ms to minimize.
[2024-05-28 09:31:15] [INFO ] Deduced a trap composed of 209 places in 327 ms of which 4 ms to minimize.
[2024-05-28 09:31:16] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 4 ms to minimize.
[2024-05-28 09:31:16] [INFO ] Deduced a trap composed of 206 places in 362 ms of which 5 ms to minimize.
[2024-05-28 09:31:17] [INFO ] Deduced a trap composed of 197 places in 312 ms of which 5 ms to minimize.
[2024-05-28 09:31:17] [INFO ] Deduced a trap composed of 201 places in 324 ms of which 4 ms to minimize.
[2024-05-28 09:31:17] [INFO ] Deduced a trap composed of 206 places in 344 ms of which 5 ms to minimize.
[2024-05-28 09:31:18] [INFO ] Deduced a trap composed of 199 places in 329 ms of which 5 ms to minimize.
[2024-05-28 09:31:18] [INFO ] Deduced a trap composed of 197 places in 346 ms of which 6 ms to minimize.
[2024-05-28 09:31:18] [INFO ] Deduced a trap composed of 204 places in 277 ms of which 4 ms to minimize.
[2024-05-28 09:31:19] [INFO ] Deduced a trap composed of 196 places in 380 ms of which 4 ms to minimize.
[2024-05-28 09:31:19] [INFO ] Deduced a trap composed of 197 places in 274 ms of which 5 ms to minimize.
SMT process timed out in 23066ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 23079ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23132 ms. Remains : 770/770 places, 1086/1086 transitions.
[2024-05-28 09:31:19] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:31:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[136]
RANDOM walk for 1000000 steps (51967 resets) in 6913 ms. (144 steps per ms)
BEST_FIRST walk for 1000001 steps (3386 resets) in 1669 ms. (598 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[136]
[2024-05-28 09:31:28] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:31:28] [INFO ] Invariant cache hit.
[2024-05-28 09:31:28] [INFO ] [Real]Absence check using 111 positive place invariants in 29 ms returned sat
[2024-05-28 09:31:28] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 35 ms returned sat
[2024-05-28 09:31:28] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2024-05-28 09:31:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:31:29] [INFO ] [Nat]Absence check using 111 positive place invariants in 24 ms returned sat
[2024-05-28 09:31:29] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 26 ms returned sat
[2024-05-28 09:31:30] [INFO ] [Nat]Absence check using state equation in 903 ms returned sat
[2024-05-28 09:31:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:31:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 28 ms returned sat
[2024-05-28 09:31:30] [INFO ] Deduced a trap composed of 251 places in 317 ms of which 4 ms to minimize.
[2024-05-28 09:31:30] [INFO ] Deduced a trap composed of 251 places in 373 ms of which 5 ms to minimize.
[2024-05-28 09:31:31] [INFO ] Deduced a trap composed of 246 places in 377 ms of which 5 ms to minimize.
[2024-05-28 09:31:31] [INFO ] Deduced a trap composed of 242 places in 378 ms of which 4 ms to minimize.
[2024-05-28 09:31:32] [INFO ] Deduced a trap composed of 230 places in 372 ms of which 4 ms to minimize.
[2024-05-28 09:31:32] [INFO ] Deduced a trap composed of 267 places in 359 ms of which 5 ms to minimize.
[2024-05-28 09:31:32] [INFO ] Deduced a trap composed of 239 places in 326 ms of which 5 ms to minimize.
[2024-05-28 09:31:33] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 5 ms to minimize.
[2024-05-28 09:31:33] [INFO ] Deduced a trap composed of 254 places in 281 ms of which 4 ms to minimize.
[2024-05-28 09:31:34] [INFO ] Deduced a trap composed of 257 places in 316 ms of which 5 ms to minimize.
[2024-05-28 09:31:34] [INFO ] Deduced a trap composed of 260 places in 381 ms of which 9 ms to minimize.
[2024-05-28 09:31:34] [INFO ] Deduced a trap composed of 242 places in 307 ms of which 4 ms to minimize.
[2024-05-28 09:31:35] [INFO ] Deduced a trap composed of 248 places in 494 ms of which 19 ms to minimize.
[2024-05-28 09:31:35] [INFO ] Deduced a trap composed of 242 places in 310 ms of which 4 ms to minimize.
[2024-05-28 09:31:36] [INFO ] Deduced a trap composed of 242 places in 494 ms of which 20 ms to minimize.
[2024-05-28 09:31:36] [INFO ] Deduced a trap composed of 248 places in 374 ms of which 5 ms to minimize.
[2024-05-28 09:31:37] [INFO ] Deduced a trap composed of 239 places in 504 ms of which 19 ms to minimize.
[2024-05-28 09:31:38] [INFO ] Deduced a trap composed of 246 places in 507 ms of which 19 ms to minimize.
[2024-05-28 09:31:38] [INFO ] Deduced a trap composed of 257 places in 400 ms of which 5 ms to minimize.
[2024-05-28 09:31:40] [INFO ] Deduced a trap composed of 279 places in 371 ms of which 5 ms to minimize.
[2024-05-28 09:31:40] [INFO ] Deduced a trap composed of 249 places in 393 ms of which 5 ms to minimize.
[2024-05-28 09:31:41] [INFO ] Deduced a trap composed of 252 places in 375 ms of which 5 ms to minimize.
[2024-05-28 09:31:41] [INFO ] Deduced a trap composed of 248 places in 360 ms of which 6 ms to minimize.
[2024-05-28 09:31:41] [INFO ] Deduced a trap composed of 245 places in 361 ms of which 5 ms to minimize.
[2024-05-28 09:31:42] [INFO ] Deduced a trap composed of 246 places in 398 ms of which 6 ms to minimize.
[2024-05-28 09:31:42] [INFO ] Deduced a trap composed of 264 places in 369 ms of which 5 ms to minimize.
[2024-05-28 09:31:43] [INFO ] Deduced a trap composed of 233 places in 498 ms of which 20 ms to minimize.
[2024-05-28 09:31:44] [INFO ] Deduced a trap composed of 251 places in 465 ms of which 5 ms to minimize.
[2024-05-28 09:31:45] [INFO ] Deduced a trap composed of 245 places in 546 ms of which 19 ms to minimize.
[2024-05-28 09:31:45] [INFO ] Deduced a trap composed of 248 places in 409 ms of which 27 ms to minimize.
[2024-05-28 09:31:46] [INFO ] Deduced a trap composed of 257 places in 412 ms of which 5 ms to minimize.
[2024-05-28 09:31:46] [INFO ] Deduced a trap composed of 236 places in 376 ms of which 4 ms to minimize.
[2024-05-28 09:31:47] [INFO ] Deduced a trap composed of 243 places in 540 ms of which 17 ms to minimize.
[2024-05-28 09:31:48] [INFO ] Deduced a trap composed of 234 places in 497 ms of which 8 ms to minimize.
[2024-05-28 09:31:48] [INFO ] Deduced a trap composed of 261 places in 371 ms of which 4 ms to minimize.
[2024-05-28 09:31:50] [INFO ] Deduced a trap composed of 246 places in 383 ms of which 6 ms to minimize.
[2024-05-28 09:31:51] [INFO ] Deduced a trap composed of 257 places in 511 ms of which 8 ms to minimize.
[2024-05-28 09:31:51] [INFO ] Deduced a trap composed of 245 places in 395 ms of which 6 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 255 places in 410 ms of which 5 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 236 places in 397 ms of which 4 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 251 places in 331 ms of which 4 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 246 places in 498 ms of which 19 ms to minimize.
[2024-05-28 09:31:59] [INFO ] Deduced a trap composed of 231 places in 5852 ms of which 31 ms to minimize.
[2024-05-28 09:32:00] [INFO ] Deduced a trap composed of 238 places in 333 ms of which 5 ms to minimize.
[2024-05-28 09:32:00] [INFO ] Deduced a trap composed of 253 places in 395 ms of which 20 ms to minimize.
[2024-05-28 09:32:01] [INFO ] Deduced a trap composed of 260 places in 353 ms of which 5 ms to minimize.
[2024-05-28 09:32:01] [INFO ] Deduced a trap composed of 284 places in 371 ms of which 5 ms to minimize.
[2024-05-28 09:32:02] [INFO ] Deduced a trap composed of 248 places in 482 ms of which 7 ms to minimize.
[2024-05-28 09:32:02] [INFO ] Deduced a trap composed of 273 places in 378 ms of which 5 ms to minimize.
[2024-05-28 09:32:03] [INFO ] Deduced a trap composed of 245 places in 323 ms of which 4 ms to minimize.
[2024-05-28 09:32:04] [INFO ] Deduced a trap composed of 236 places in 496 ms of which 19 ms to minimize.
[2024-05-28 09:32:06] [INFO ] Deduced a trap composed of 254 places in 486 ms of which 7 ms to minimize.
[2024-05-28 09:32:08] [INFO ] Deduced a trap composed of 230 places in 637 ms of which 5 ms to minimize.
[2024-05-28 09:32:09] [INFO ] Deduced a trap composed of 247 places in 377 ms of which 5 ms to minimize.
[2024-05-28 09:32:09] [INFO ] Deduced a trap composed of 259 places in 306 ms of which 5 ms to minimize.
[2024-05-28 09:32:10] [INFO ] Deduced a trap composed of 240 places in 279 ms of which 4 ms to minimize.
[2024-05-28 09:32:13] [INFO ] Deduced a trap composed of 241 places in 389 ms of which 5 ms to minimize.
[2024-05-28 09:32:13] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 43897 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[136]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[136]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 59 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 72 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 09:32:14] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:32:14] [INFO ] Invariant cache hit.
[2024-05-28 09:32:15] [INFO ] Implicit Places using invariants in 1545 ms returned []
[2024-05-28 09:32:15] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:32:15] [INFO ] Invariant cache hit.
[2024-05-28 09:32:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:32:30] [INFO ] Implicit Places using invariants and state equation in 14302 ms returned []
Implicit Place search using SMT with State Equation took 15864 ms to find 0 implicit places.
[2024-05-28 09:32:30] [INFO ] Redundant transitions in 16 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 09:32:30] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:32:30] [INFO ] Invariant cache hit.
[2024-05-28 09:32:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:32:50] [INFO ] Deduced a trap composed of 281 places in 454 ms of which 19 ms to minimize.
[2024-05-28 09:32:51] [INFO ] Deduced a trap composed of 242 places in 370 ms of which 6 ms to minimize.
[2024-05-28 09:32:51] [INFO ] Deduced a trap composed of 209 places in 346 ms of which 4 ms to minimize.
[2024-05-28 09:32:52] [INFO ] Deduced a trap composed of 206 places in 403 ms of which 5 ms to minimize.
[2024-05-28 09:32:52] [INFO ] Deduced a trap composed of 209 places in 491 ms of which 8 ms to minimize.
[2024-05-28 09:32:53] [INFO ] Deduced a trap composed of 204 places in 474 ms of which 19 ms to minimize.
[2024-05-28 09:32:53] [INFO ] Deduced a trap composed of 203 places in 508 ms of which 20 ms to minimize.
[2024-05-28 09:32:54] [INFO ] Deduced a trap composed of 197 places in 474 ms of which 8 ms to minimize.
[2024-05-28 09:32:55] [INFO ] Deduced a trap composed of 209 places in 531 ms of which 20 ms to minimize.
[2024-05-28 09:32:55] [INFO ] Deduced a trap composed of 196 places in 363 ms of which 4 ms to minimize.
[2024-05-28 09:32:56] [INFO ] Deduced a trap composed of 206 places in 363 ms of which 5 ms to minimize.
[2024-05-28 09:32:56] [INFO ] Deduced a trap composed of 197 places in 323 ms of which 5 ms to minimize.
[2024-05-28 09:32:56] [INFO ] Deduced a trap composed of 201 places in 411 ms of which 4 ms to minimize.
[2024-05-28 09:32:57] [INFO ] Deduced a trap composed of 206 places in 428 ms of which 30 ms to minimize.
[2024-05-28 09:32:59] [INFO ] Deduced a trap composed of 199 places in 2593 ms of which 5 ms to minimize.
[2024-05-28 09:33:00] [INFO ] Deduced a trap composed of 197 places in 376 ms of which 5 ms to minimize.
[2024-05-28 09:33:00] [INFO ] Deduced a trap composed of 204 places in 354 ms of which 4 ms to minimize.
[2024-05-28 09:33:01] [INFO ] Deduced a trap composed of 196 places in 365 ms of which 4 ms to minimize.
[2024-05-28 09:33:01] [INFO ] Deduced a trap composed of 197 places in 333 ms of which 4 ms to minimize.
[2024-05-28 09:33:01] [INFO ] Deduced a trap composed of 201 places in 405 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:33:03] [INFO ] Deduced a trap composed of 240 places in 508 ms of which 44 ms to minimize.
SMT process timed out in 33541ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 33555ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49518 ms. Remains : 770/770 places, 1086/1086 transitions.
RANDOM walk for 40000 steps (2045 resets) in 901 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (129 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (142 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 99493 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 2
Probabilistic random walk after 99493 steps, saw 30015 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-28 09:33:07] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:33:07] [INFO ] Invariant cache hit.
[2024-05-28 09:33:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 09:33:08] [INFO ] Deduced a trap composed of 233 places in 294 ms of which 4 ms to minimize.
[2024-05-28 09:33:08] [INFO ] Deduced a trap composed of 269 places in 290 ms of which 4 ms to minimize.
[2024-05-28 09:33:09] [INFO ] Deduced a trap composed of 246 places in 292 ms of which 4 ms to minimize.
[2024-05-28 09:33:09] [INFO ] Deduced a trap composed of 242 places in 271 ms of which 4 ms to minimize.
[2024-05-28 09:33:09] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 4 ms to minimize.
[2024-05-28 09:33:10] [INFO ] Deduced a trap composed of 239 places in 333 ms of which 6 ms to minimize.
[2024-05-28 09:33:10] [INFO ] Deduced a trap composed of 254 places in 324 ms of which 5 ms to minimize.
[2024-05-28 09:33:10] [INFO ] Deduced a trap composed of 254 places in 365 ms of which 4 ms to minimize.
[2024-05-28 09:33:11] [INFO ] Deduced a trap composed of 254 places in 346 ms of which 5 ms to minimize.
[2024-05-28 09:33:11] [INFO ] Deduced a trap composed of 236 places in 359 ms of which 5 ms to minimize.
[2024-05-28 09:33:12] [INFO ] Deduced a trap composed of 230 places in 394 ms of which 5 ms to minimize.
[2024-05-28 09:33:12] [INFO ] Deduced a trap composed of 254 places in 336 ms of which 5 ms to minimize.
[2024-05-28 09:33:12] [INFO ] Deduced a trap composed of 239 places in 346 ms of which 5 ms to minimize.
[2024-05-28 09:33:13] [INFO ] Deduced a trap composed of 254 places in 400 ms of which 5 ms to minimize.
SMT process timed out in 6350ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 31 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Running 1080 sub problems to find dead transitions.
[2024-05-28 09:33:13] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:33:13] [INFO ] Invariant cache hit.
[2024-05-28 09:33:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:33:27] [INFO ] Deduced a trap composed of 281 places in 366 ms of which 5 ms to minimize.
[2024-05-28 09:33:28] [INFO ] Deduced a trap composed of 242 places in 283 ms of which 4 ms to minimize.
[2024-05-28 09:33:28] [INFO ] Deduced a trap composed of 209 places in 278 ms of which 4 ms to minimize.
[2024-05-28 09:33:28] [INFO ] Deduced a trap composed of 206 places in 335 ms of which 5 ms to minimize.
[2024-05-28 09:33:29] [INFO ] Deduced a trap composed of 209 places in 356 ms of which 5 ms to minimize.
[2024-05-28 09:33:29] [INFO ] Deduced a trap composed of 204 places in 325 ms of which 4 ms to minimize.
[2024-05-28 09:33:30] [INFO ] Deduced a trap composed of 203 places in 364 ms of which 4 ms to minimize.
[2024-05-28 09:33:30] [INFO ] Deduced a trap composed of 197 places in 338 ms of which 5 ms to minimize.
[2024-05-28 09:33:30] [INFO ] Deduced a trap composed of 209 places in 324 ms of which 5 ms to minimize.
[2024-05-28 09:33:31] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 5 ms to minimize.
[2024-05-28 09:33:31] [INFO ] Deduced a trap composed of 206 places in 358 ms of which 8 ms to minimize.
[2024-05-28 09:33:32] [INFO ] Deduced a trap composed of 197 places in 332 ms of which 5 ms to minimize.
[2024-05-28 09:33:32] [INFO ] Deduced a trap composed of 201 places in 480 ms of which 21 ms to minimize.
[2024-05-28 09:33:33] [INFO ] Deduced a trap composed of 206 places in 365 ms of which 5 ms to minimize.
[2024-05-28 09:33:33] [INFO ] Deduced a trap composed of 199 places in 311 ms of which 5 ms to minimize.
[2024-05-28 09:33:33] [INFO ] Deduced a trap composed of 197 places in 321 ms of which 4 ms to minimize.
[2024-05-28 09:33:34] [INFO ] Deduced a trap composed of 204 places in 294 ms of which 4 ms to minimize.
[2024-05-28 09:33:34] [INFO ] Deduced a trap composed of 196 places in 383 ms of which 5 ms to minimize.
[2024-05-28 09:33:34] [INFO ] Deduced a trap composed of 197 places in 326 ms of which 4 ms to minimize.
[2024-05-28 09:33:35] [INFO ] Deduced a trap composed of 201 places in 354 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:33:37] [INFO ] Deduced a trap composed of 240 places in 399 ms of which 4 ms to minimize.
SMT process timed out in 23556ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 23568ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23603 ms. Remains : 770/770 places, 1086/1086 transitions.
RANDOM walk for 40000 steps (2051 resets) in 466 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (153 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 138871 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 1
Probabilistic random walk after 138871 steps, saw 41016 distinct states, run finished after 3002 ms. (steps per millisecond=46 ) properties seen :0
[2024-05-28 09:33:40] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:33:40] [INFO ] Invariant cache hit.
[2024-05-28 09:33:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:33:41] [INFO ] Deduced a trap composed of 233 places in 370 ms of which 6 ms to minimize.
[2024-05-28 09:33:42] [INFO ] Deduced a trap composed of 269 places in 327 ms of which 6 ms to minimize.
[2024-05-28 09:33:42] [INFO ] Deduced a trap composed of 246 places in 332 ms of which 6 ms to minimize.
[2024-05-28 09:33:42] [INFO ] Deduced a trap composed of 242 places in 354 ms of which 5 ms to minimize.
[2024-05-28 09:33:43] [INFO ] Deduced a trap composed of 236 places in 338 ms of which 5 ms to minimize.
[2024-05-28 09:33:43] [INFO ] Deduced a trap composed of 239 places in 347 ms of which 5 ms to minimize.
[2024-05-28 09:33:43] [INFO ] Deduced a trap composed of 254 places in 354 ms of which 5 ms to minimize.
[2024-05-28 09:33:44] [INFO ] Deduced a trap composed of 254 places in 372 ms of which 4 ms to minimize.
[2024-05-28 09:33:44] [INFO ] Deduced a trap composed of 254 places in 357 ms of which 6 ms to minimize.
[2024-05-28 09:33:45] [INFO ] Deduced a trap composed of 236 places in 364 ms of which 5 ms to minimize.
[2024-05-28 09:33:45] [INFO ] Deduced a trap composed of 230 places in 356 ms of which 4 ms to minimize.
[2024-05-28 09:33:45] [INFO ] Deduced a trap composed of 254 places in 344 ms of which 5 ms to minimize.
[2024-05-28 09:33:46] [INFO ] Deduced a trap composed of 239 places in 344 ms of which 5 ms to minimize.
[2024-05-28 09:33:46] [INFO ] Deduced a trap composed of 254 places in 378 ms of which 6 ms to minimize.
[2024-05-28 09:33:47] [INFO ] Deduced a trap composed of 233 places in 357 ms of which 5 ms to minimize.
[2024-05-28 09:33:47] [INFO ] Deduced a trap composed of 242 places in 370 ms of which 5 ms to minimize.
[2024-05-28 09:33:47] [INFO ] Deduced a trap composed of 242 places in 349 ms of which 4 ms to minimize.
[2024-05-28 09:33:48] [INFO ] Deduced a trap composed of 218 places in 347 ms of which 4 ms to minimize.
[2024-05-28 09:33:48] [INFO ] Deduced a trap composed of 241 places in 432 ms of which 5 ms to minimize.
[2024-05-28 09:33:49] [INFO ] Deduced a trap composed of 258 places in 346 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:33:49] [INFO ] Deduced a trap composed of 224 places in 352 ms of which 5 ms to minimize.
[2024-05-28 09:33:49] [INFO ] Deduced a trap composed of 241 places in 312 ms of which 5 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 251 places in 389 ms of which 4 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 239 places in 385 ms of which 4 ms to minimize.
[2024-05-28 09:33:51] [INFO ] Deduced a trap composed of 239 places in 499 ms of which 19 ms to minimize.
[2024-05-28 09:33:51] [INFO ] Deduced a trap composed of 240 places in 531 ms of which 34 ms to minimize.
[2024-05-28 09:33:52] [INFO ] Deduced a trap composed of 251 places in 376 ms of which 5 ms to minimize.
[2024-05-28 09:33:52] [INFO ] Deduced a trap composed of 236 places in 472 ms of which 19 ms to minimize.
[2024-05-28 09:33:53] [INFO ] Deduced a trap composed of 232 places in 320 ms of which 4 ms to minimize.
[2024-05-28 09:33:53] [INFO ] Deduced a trap composed of 246 places in 490 ms of which 20 ms to minimize.
[2024-05-28 09:33:53] [INFO ] Deduced a trap composed of 236 places in 314 ms of which 4 ms to minimize.
[2024-05-28 09:33:54] [INFO ] Deduced a trap composed of 265 places in 501 ms of which 21 ms to minimize.
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 250 places in 481 ms of which 19 ms to minimize.
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 256 places in 495 ms of which 18 ms to minimize.
[2024-05-28 09:33:56] [INFO ] Deduced a trap composed of 248 places in 478 ms of which 7 ms to minimize.
[2024-05-28 09:33:56] [INFO ] Deduced a trap composed of 248 places in 516 ms of which 33 ms to minimize.
[2024-05-28 09:33:57] [INFO ] Deduced a trap composed of 254 places in 476 ms of which 19 ms to minimize.
[2024-05-28 09:33:57] [INFO ] Deduced a trap composed of 272 places in 517 ms of which 19 ms to minimize.
[2024-05-28 09:33:58] [INFO ] Deduced a trap composed of 251 places in 504 ms of which 20 ms to minimize.
[2024-05-28 09:33:58] [INFO ] Deduced a trap composed of 257 places in 505 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:33:59] [INFO ] Deduced a trap composed of 236 places in 501 ms of which 19 ms to minimize.
[2024-05-28 09:33:59] [INFO ] Deduced a trap composed of 239 places in 393 ms of which 5 ms to minimize.
[2024-05-28 09:34:00] [INFO ] Deduced a trap composed of 231 places in 358 ms of which 5 ms to minimize.
[2024-05-28 09:34:01] [INFO ] Deduced a trap composed of 260 places in 361 ms of which 5 ms to minimize.
[2024-05-28 09:34:01] [INFO ] Deduced a trap composed of 245 places in 503 ms of which 20 ms to minimize.
[2024-05-28 09:34:03] [INFO ] Deduced a trap composed of 236 places in 421 ms of which 5 ms to minimize.
[2024-05-28 09:34:03] [INFO ] Deduced a trap composed of 230 places in 330 ms of which 4 ms to minimize.
[2024-05-28 09:34:03] [INFO ] Deduced a trap composed of 236 places in 393 ms of which 4 ms to minimize.
[2024-05-28 09:34:04] [INFO ] Deduced a trap composed of 218 places in 351 ms of which 5 ms to minimize.
[2024-05-28 09:34:05] [INFO ] Deduced a trap composed of 246 places in 286 ms of which 4 ms to minimize.
[2024-05-28 09:34:05] [INFO ] Deduced a trap composed of 248 places in 290 ms of which 4 ms to minimize.
[2024-05-28 09:34:05] [INFO ] Deduced a trap composed of 242 places in 500 ms of which 23 ms to minimize.
[2024-05-28 09:34:06] [INFO ] Deduced a trap composed of 227 places in 510 ms of which 19 ms to minimize.
[2024-05-28 09:34:07] [INFO ] Deduced a trap composed of 251 places in 523 ms of which 22 ms to minimize.
[2024-05-28 09:34:08] [INFO ] Deduced a trap composed of 254 places in 520 ms of which 20 ms to minimize.
[2024-05-28 09:34:09] [INFO ] Deduced a trap composed of 230 places in 642 ms of which 18 ms to minimize.
[2024-05-28 09:34:09] [INFO ] Deduced a trap composed of 239 places in 608 ms of which 4 ms to minimize.
[2024-05-28 09:34:10] [INFO ] Deduced a trap composed of 242 places in 542 ms of which 19 ms to minimize.
[2024-05-28 09:34:11] [INFO ] Deduced a trap composed of 242 places in 489 ms of which 19 ms to minimize.
[2024-05-28 09:34:13] [INFO ] Deduced a trap composed of 248 places in 443 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:34:13] [INFO ] Deduced a trap composed of 260 places in 431 ms of which 5 ms to minimize.
[2024-05-28 09:34:14] [INFO ] Deduced a trap composed of 242 places in 408 ms of which 4 ms to minimize.
[2024-05-28 09:34:14] [INFO ] Deduced a trap composed of 257 places in 501 ms of which 20 ms to minimize.
[2024-05-28 09:34:15] [INFO ] Deduced a trap composed of 245 places in 355 ms of which 4 ms to minimize.
[2024-05-28 09:34:15] [INFO ] Deduced a trap composed of 230 places in 474 ms of which 20 ms to minimize.
[2024-05-28 09:34:15] [INFO ] Deduced a trap composed of 242 places in 351 ms of which 4 ms to minimize.
[2024-05-28 09:34:16] [INFO ] Deduced a trap composed of 245 places in 342 ms of which 5 ms to minimize.
[2024-05-28 09:34:17] [INFO ] Deduced a trap composed of 236 places in 1343 ms of which 31 ms to minimize.
[2024-05-28 09:34:18] [INFO ] Deduced a trap composed of 236 places in 383 ms of which 4 ms to minimize.
[2024-05-28 09:34:18] [INFO ] Deduced a trap composed of 233 places in 561 ms of which 4 ms to minimize.
[2024-05-28 09:34:19] [INFO ] Deduced a trap composed of 273 places in 379 ms of which 4 ms to minimize.
[2024-05-28 09:34:20] [INFO ] Deduced a trap composed of 236 places in 380 ms of which 4 ms to minimize.
[2024-05-28 09:34:20] [INFO ] Deduced a trap composed of 239 places in 342 ms of which 4 ms to minimize.
[2024-05-28 09:34:21] [INFO ] Deduced a trap composed of 260 places in 343 ms of which 4 ms to minimize.
[2024-05-28 09:34:21] [INFO ] Deduced a trap composed of 236 places in 447 ms of which 8 ms to minimize.
[2024-05-28 09:34:22] [INFO ] Deduced a trap composed of 257 places in 504 ms of which 18 ms to minimize.
[2024-05-28 09:34:22] [INFO ] Deduced a trap composed of 239 places in 387 ms of which 5 ms to minimize.
[2024-05-28 09:34:22] [INFO ] Deduced a trap composed of 230 places in 313 ms of which 4 ms to minimize.
[2024-05-28 09:34:23] [INFO ] Deduced a trap composed of 268 places in 326 ms of which 5 ms to minimize.
[2024-05-28 09:34:23] [INFO ] Deduced a trap composed of 236 places in 517 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:34:24] [INFO ] Deduced a trap composed of 233 places in 500 ms of which 32 ms to minimize.
[2024-05-28 09:34:25] [INFO ] Deduced a trap composed of 242 places in 487 ms of which 33 ms to minimize.
[2024-05-28 09:34:25] [INFO ] Deduced a trap composed of 245 places in 529 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1852 variables, and 220 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45042 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 83/83 constraints]
After SMT, in 45902ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 65 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 39 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 09:34:26] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:34:26] [INFO ] Invariant cache hit.
[2024-05-28 09:34:27] [INFO ] Implicit Places using invariants in 1623 ms returned []
[2024-05-28 09:34:27] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:34:27] [INFO ] Invariant cache hit.
[2024-05-28 09:34:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:34:42] [INFO ] Implicit Places using invariants and state equation in 14517 ms returned []
Implicit Place search using SMT with State Equation took 16143 ms to find 0 implicit places.
[2024-05-28 09:34:42] [INFO ] Redundant transitions in 37 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 09:34:42] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:34:42] [INFO ] Invariant cache hit.
[2024-05-28 09:34:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 132 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:35:17] [INFO ] Deduced a trap composed of 186 places in 385 ms of which 4 ms to minimize.
[2024-05-28 09:35:17] [INFO ] Deduced a trap composed of 255 places in 502 ms of which 18 ms to minimize.
[2024-05-28 09:35:18] [INFO ] Deduced a trap composed of 251 places in 482 ms of which 19 ms to minimize.
[2024-05-28 09:35:18] [INFO ] Deduced a trap composed of 248 places in 307 ms of which 5 ms to minimize.
[2024-05-28 09:35:18] [INFO ] Deduced a trap composed of 216 places in 358 ms of which 4 ms to minimize.
[2024-05-28 09:35:19] [INFO ] Deduced a trap composed of 239 places in 374 ms of which 6 ms to minimize.
[2024-05-28 09:35:19] [INFO ] Deduced a trap composed of 274 places in 364 ms of which 5 ms to minimize.
[2024-05-28 09:35:20] [INFO ] Deduced a trap composed of 209 places in 497 ms of which 20 ms to minimize.
[2024-05-28 09:35:20] [INFO ] Deduced a trap composed of 204 places in 367 ms of which 6 ms to minimize.
[2024-05-28 09:35:21] [INFO ] Deduced a trap composed of 197 places in 384 ms of which 5 ms to minimize.
[2024-05-28 09:35:21] [INFO ] Deduced a trap composed of 197 places in 389 ms of which 5 ms to minimize.
[2024-05-28 09:35:22] [INFO ] Deduced a trap composed of 203 places in 391 ms of which 21 ms to minimize.
[2024-05-28 09:35:22] [INFO ] Deduced a trap composed of 198 places in 317 ms of which 5 ms to minimize.
[2024-05-28 09:35:23] [INFO ] Deduced a trap composed of 207 places in 567 ms of which 19 ms to minimize.
[2024-05-28 09:35:23] [INFO ] Deduced a trap composed of 206 places in 514 ms of which 20 ms to minimize.
[2024-05-28 09:35:23] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 5 ms to minimize.
[2024-05-28 09:35:24] [INFO ] Deduced a trap composed of 199 places in 343 ms of which 5 ms to minimize.
[2024-05-28 09:35:24] [INFO ] Deduced a trap composed of 209 places in 360 ms of which 5 ms to minimize.
[2024-05-28 09:35:25] [INFO ] Deduced a trap composed of 200 places in 361 ms of which 4 ms to minimize.
[2024-05-28 09:35:25] [INFO ] Deduced a trap composed of 136 places in 356 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:35:34] [INFO ] Deduced a trap composed of 227 places in 977 ms of which 30 ms to minimize.
[2024-05-28 09:35:34] [INFO ] Deduced a trap composed of 235 places in 514 ms of which 21 ms to minimize.
[2024-05-28 09:35:35] [INFO ] Deduced a trap composed of 235 places in 374 ms of which 5 ms to minimize.
[2024-05-28 09:35:35] [INFO ] Deduced a trap composed of 223 places in 357 ms of which 5 ms to minimize.
[2024-05-28 09:35:35] [INFO ] Deduced a trap composed of 222 places in 365 ms of which 5 ms to minimize.
[2024-05-28 09:35:36] [INFO ] Deduced a trap composed of 233 places in 366 ms of which 4 ms to minimize.
[2024-05-28 09:35:36] [INFO ] Deduced a trap composed of 300 places in 503 ms of which 4 ms to minimize.
[2024-05-28 09:35:37] [INFO ] Deduced a trap composed of 223 places in 401 ms of which 5 ms to minimize.
[2024-05-28 09:35:37] [INFO ] Deduced a trap composed of 230 places in 329 ms of which 4 ms to minimize.
[2024-05-28 09:35:38] [INFO ] Deduced a trap composed of 227 places in 373 ms of which 4 ms to minimize.
[2024-05-28 09:35:38] [INFO ] Deduced a trap composed of 308 places in 319 ms of which 4 ms to minimize.
[2024-05-28 09:35:39] [INFO ] Deduced a trap composed of 310 places in 306 ms of which 5 ms to minimize.
[2024-05-28 09:35:39] [INFO ] Deduced a trap composed of 314 places in 338 ms of which 5 ms to minimize.
[2024-05-28 09:35:40] [INFO ] Deduced a trap composed of 227 places in 502 ms of which 9 ms to minimize.
[2024-05-28 09:35:40] [INFO ] Deduced a trap composed of 234 places in 521 ms of which 19 ms to minimize.
[2024-05-28 09:35:41] [INFO ] Deduced a trap composed of 218 places in 419 ms of which 7 ms to minimize.
[2024-05-28 09:35:41] [INFO ] Deduced a trap composed of 235 places in 298 ms of which 4 ms to minimize.
[2024-05-28 09:35:42] [INFO ] Deduced a trap composed of 218 places in 317 ms of which 4 ms to minimize.
[2024-05-28 09:35:42] [INFO ] Deduced a trap composed of 306 places in 314 ms of which 4 ms to minimize.
[2024-05-28 09:35:43] [INFO ] Deduced a trap composed of 229 places in 493 ms of which 20 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 40/40 constraints]
After SMT, in 63172ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 63187ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79430 ms. Remains : 770/770 places, 1086/1086 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[136]
Ending property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-06 in 295480 ms.
[2024-05-28 09:35:46] [INFO ] Flatten gal took : 183 ms
[2024-05-28 09:35:46] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-28 09:35:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 770 places, 1086 transitions and 5509 arcs took 11 ms.
Total runtime 757799 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-PT-S05J60

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/422/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 770
TRANSITIONS: 1086
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.029s, Sys 0.000s]


SAVING FILE /home/mcc/execution/422/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2518
MODEL NAME: /home/mcc/execution/422/model
770 places, 1086 transitions.

No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J60"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBNT-PT-S05J60, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654446000469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J60.tgz
mv PolyORBNT-PT-S05J60 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;