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-171654446000477.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-S05J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654446000477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 38K Apr 12 09:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 12 09:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 74K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 357K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 156K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 79K Apr 12 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 324K Apr 12 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 131K Apr 12 10:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 566K Apr 12 10:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K 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.8M 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-S05J80-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716888933460

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-S05J80
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:35:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 09:35:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:35:36] [INFO ] Load time of PNML (sax parser for PT used): 402 ms
[2024-05-28 09:35:36] [INFO ] Transformed 1189 places.
[2024-05-28 09:35:36] [INFO ] Transformed 2350 transitions.
[2024-05-28 09:35:36] [INFO ] Parsed PT model containing 1189 places and 2350 transitions and 14464 arcs in 681 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 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, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0] 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, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 09:35:36] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2024-05-28 09:35:36] [INFO ] Computed 182 invariants in 270 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[273, 3, 273, 393, 273, 988, 99, 393, 1, 1, 3, 2, 3, 396, 2]
FORMULA PolyORBNT-PT-S05J80-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (673 resets) in 375 ms. (26 steps per ms)
FORMULA PolyORBNT-PT-S05J80-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90006 steps (1251 resets) in 430 ms. (208 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 4, 1, 3, 1, 4, 4] Max Struct:[273, 273, 393, 273, 988, 99, 393, 396]
[2024-05-28 09:35:37] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
[2024-05-28 09:35:37] [INFO ] Invariant cache hit.
[2024-05-28 09:35:38] [INFO ] [Real]Absence check using 157 positive place invariants in 80 ms returned sat
[2024-05-28 09:35:38] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 68 ms returned unsat
[2024-05-28 09:35:40] [INFO ] [Real]Absence check using 157 positive place invariants in 1054 ms returned sat
[2024-05-28 09:35:40] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 168 ms returned unsat
[2024-05-28 09:35:40] [INFO ] [Real]Absence check using 157 positive place invariants in 60 ms returned sat
[2024-05-28 09:35:40] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 127 ms returned unsat
[2024-05-28 09:35:41] [INFO ] [Real]Absence check using 157 positive place invariants in 72 ms returned sat
[2024-05-28 09:35:41] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 70 ms returned unsat
[2024-05-28 09:35:41] [INFO ] [Real]Absence check using 157 positive place invariants in 96 ms returned sat
[2024-05-28 09:35:41] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 101 ms returned sat
[2024-05-28 09:35:43] [INFO ] [Real]Absence check using state equation in 2219 ms returned sat
[2024-05-28 09:35:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:35:44] [INFO ] [Nat]Absence check using 157 positive place invariants in 57 ms returned sat
[2024-05-28 09:35:44] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 106 ms returned sat
[2024-05-28 09:35:46] [INFO ] [Nat]Absence check using state equation in 1367 ms returned sat
[2024-05-28 09:35:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:35:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 292 ms returned sat
[2024-05-28 09:35:46] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 397 ms.
[2024-05-28 09:35:48] [INFO ] Added : 15 causal constraints over 3 iterations in 1975 ms. Result :sat
Minimization took 541 ms.
[2024-05-28 09:35:49] [INFO ] [Real]Absence check using 157 positive place invariants in 91 ms returned sat
[2024-05-28 09:35:49] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 65 ms returned unsat
[2024-05-28 09:35:49] [INFO ] [Real]Absence check using 157 positive place invariants in 36 ms returned sat
[2024-05-28 09:35:49] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 42 ms returned unsat
[2024-05-28 09:35:50] [INFO ] [Real]Absence check using 157 positive place invariants in 37 ms returned sat
[2024-05-28 09:35:50] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 44 ms returned sat
[2024-05-28 09:35:52] [INFO ] [Real]Absence check using state equation in 2017 ms returned sat
[2024-05-28 09:35:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:35:52] [INFO ] [Nat]Absence check using 157 positive place invariants in 63 ms returned sat
[2024-05-28 09:35:52] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 51 ms returned sat
[2024-05-28 09:35:53] [INFO ] [Nat]Absence check using state equation in 1448 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 4, 1, 3, 1, 4, 4] Max Struct:[1, 1, 4, 1, 988, 1, 4, 396]
FORMULA PolyORBNT-PT-S05J80-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 4] Max Struct:[988, 396]
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 1184 transition count 1610
Reduce places removed 85 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 176 place count 1099 transition count 1609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 177 place count 1098 transition count 1525
Deduced a syphon composed of 84 places in 8 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 345 place count 1014 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 346 place count 1013 transition count 1524
Iterating global reduction 3 with 1 rules applied. Total rules applied 347 place count 1013 transition count 1524
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 3 with 4 rules applied. Total rules applied 351 place count 1011 transition count 1522
Applied a total of 351 rules in 916 ms. Remains 1011 /1189 variables (removed 178) and now considering 1522/1695 (removed 173) transitions.
Running 1516 sub problems to find dead transitions.
[2024-05-28 09:35:54] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
// Phase 1: matrix 1518 rows 1011 cols
[2024-05-28 09:35:55] [INFO ] Computed 177 invariants in 141 ms
[2024-05-28 09:35:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20097 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 09:36:36] [INFO ] Deduced a trap composed of 13 places in 286 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 173 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 1/1 constraints]
After SMT, in 46089ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 46176ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47149 ms. Remains : 1011/1189 places, 1522/1695 transitions.
[2024-05-28 09:36:41] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:36:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 4] Max Struct:[333, 396]
RANDOM walk for 1000000 steps (47384 resets) in 9414 ms. (106 steps per ms)
BEST_FIRST walk for 2000002 steps (4459 resets) in 3896 ms. (513 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 4] Max Struct:[333, 396]
[2024-05-28 09:36:54] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:36:54] [INFO ] Invariant cache hit.
[2024-05-28 09:36:54] [INFO ] [Real]Absence check using 157 positive place invariants in 62 ms returned sat
[2024-05-28 09:36:54] [INFO ] [Real]Absence check using 157 positive and 20 generalized place invariants in 63 ms returned sat
[2024-05-28 09:36:56] [INFO ] [Real]Absence check using state equation in 1602 ms returned sat
[2024-05-28 09:36:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:36:56] [INFO ] [Nat]Absence check using 157 positive place invariants in 41 ms returned sat
[2024-05-28 09:36:56] [INFO ] [Nat]Absence check using 157 positive and 20 generalized place invariants in 36 ms returned sat
[2024-05-28 09:36:57] [INFO ] [Nat]Absence check using state equation in 1072 ms returned sat
[2024-05-28 09:36:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:36:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 974 ms returned sat
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 445 places in 724 ms of which 9 ms to minimize.
[2024-05-28 09:36:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1002 ms
[2024-05-28 09:37:00] [INFO ] Computed and/alt/rep : 777/2682/777 causal constraints (skipped 735 transitions) in 288 ms.
[2024-05-28 09:37:00] [INFO ] Added : 7 causal constraints over 2 iterations in 707 ms. Result :sat
Minimization took 3500 ms.
[2024-05-28 09:37:04] [INFO ] [Real]Absence check using 157 positive place invariants in 39 ms returned sat
[2024-05-28 09:37:04] [INFO ] [Real]Absence check using 157 positive and 20 generalized place invariants in 44 ms returned sat
[2024-05-28 09:37:04] [INFO ] [Real]Absence check using state equation in 702 ms returned sat
[2024-05-28 09:37:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:37:05] [INFO ] [Nat]Absence check using 157 positive place invariants in 35 ms returned sat
[2024-05-28 09:37:05] [INFO ] [Nat]Absence check using 157 positive and 20 generalized place invariants in 31 ms returned sat
[2024-05-28 09:37:06] [INFO ] [Nat]Absence check using state equation in 1689 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 4] Max Struct:[333, 4]
FORMULA PolyORBNT-PT-S05J80-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[333]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 84 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 1011/1011 places, 1522/1522 transitions.
[2024-05-28 09:37:07] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:37:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[333]
RANDOM walk for 1000000 steps (47366 resets) in 9532 ms. (104 steps per ms)
BEST_FIRST walk for 1000001 steps (2641 resets) in 1899 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[333]
[2024-05-28 09:37:18] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:37:18] [INFO ] Invariant cache hit.
[2024-05-28 09:37:18] [INFO ] [Real]Absence check using 157 positive place invariants in 37 ms returned sat
[2024-05-28 09:37:18] [INFO ] [Real]Absence check using 157 positive and 20 generalized place invariants in 35 ms returned sat
[2024-05-28 09:37:19] [INFO ] [Real]Absence check using state equation in 1144 ms returned sat
[2024-05-28 09:37:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:37:20] [INFO ] [Nat]Absence check using 157 positive place invariants in 40 ms returned sat
[2024-05-28 09:37:20] [INFO ] [Nat]Absence check using 157 positive and 20 generalized place invariants in 35 ms returned sat
[2024-05-28 09:37:21] [INFO ] [Nat]Absence check using state equation in 1095 ms returned sat
[2024-05-28 09:37:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:37:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1013 ms returned sat
[2024-05-28 09:37:22] [INFO ] Deduced a trap composed of 445 places in 592 ms of which 9 ms to minimize.
[2024-05-28 09:37:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 872 ms
[2024-05-28 09:37:23] [INFO ] Computed and/alt/rep : 777/2682/777 causal constraints (skipped 735 transitions) in 136 ms.
[2024-05-28 09:37:23] [INFO ] Added : 7 causal constraints over 2 iterations in 553 ms. Result :sat
Minimization took 4071 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[333]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[333]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 66 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 60 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-28 09:37:28] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:37:28] [INFO ] Invariant cache hit.
[2024-05-28 09:37:30] [INFO ] Implicit Places using invariants in 2798 ms returned []
[2024-05-28 09:37:30] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:37:30] [INFO ] Invariant cache hit.
[2024-05-28 09:37:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:37:59] [INFO ] Implicit Places using invariants and state equation in 28997 ms returned []
Implicit Place search using SMT with State Equation took 31803 ms to find 0 implicit places.
[2024-05-28 09:37:59] [INFO ] Redundant transitions in 105 ms returned []
Running 1516 sub problems to find dead transitions.
[2024-05-28 09:38:00] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:38:00] [INFO ] Invariant cache hit.
[2024-05-28 09:38:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 09:38:56] [INFO ] Deduced a trap composed of 14 places in 561 ms of which 7 ms to minimize.
[2024-05-28 09:39:03] [INFO ] Deduced a trap composed of 244 places in 522 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1006 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 09:39:04] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 175 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 3/3 constraints]
After SMT, in 65212ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 65247ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97238 ms. Remains : 1011/1011 places, 1522/1522 transitions.
RANDOM walk for 40000 steps (1854 resets) in 1374 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (116 resets) in 257 ms. (155 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (107 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 117474 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 2
Probabilistic random walk after 117474 steps, saw 35575 distinct states, run finished after 3005 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-28 09:39:08] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:39:08] [INFO ] Invariant cache hit.
[2024-05-28 09:39:08] [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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 0/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2529 variables, 1/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2529/2529 variables, and 1189 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1137 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 09:39:11] [INFO ] Deduced a trap composed of 529 places in 546 ms of which 8 ms to minimize.
[2024-05-28 09:39:12] [INFO ] Deduced a trap composed of 228 places in 560 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 2/1190 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2528 variables, 0/1190 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2529 variables, 1/1191 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2529 variables, 1/1192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2529 variables, 0/1192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2529 variables, 0/1192 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2529/2529 variables, and 1192 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2607 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 3762ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 58 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Running 1516 sub problems to find dead transitions.
[2024-05-28 09:39:12] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:39:12] [INFO ] Invariant cache hit.
[2024-05-28 09:39:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 0/0 constraints]
After SMT, in 46303ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 46327ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46400 ms. Remains : 1011/1011 places, 1522/1522 transitions.
RANDOM walk for 40000 steps (1874 resets) in 745 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (100 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 119085 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 1
Probabilistic random walk after 119085 steps, saw 36027 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-28 09:40:02] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:40:02] [INFO ] Invariant cache hit.
[2024-05-28 09:40:02] [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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2529 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2529/2529 variables, and 1189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 999 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:40:05] [INFO ] Deduced a trap composed of 529 places in 583 ms of which 8 ms to minimize.
[2024-05-28 09:40:06] [INFO ] Deduced a trap composed of 228 places in 627 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 2/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2528 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2529 variables, 1/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2529 variables, 1/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2529 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2529 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2529/2529 variables, and 1192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3081 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 4100ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 71 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 62 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-28 09:40:06] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:40:06] [INFO ] Invariant cache hit.
[2024-05-28 09:40:09] [INFO ] Implicit Places using invariants in 2761 ms returned []
[2024-05-28 09:40:09] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:40:09] [INFO ] Invariant cache hit.
[2024-05-28 09:40:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:40:37] [INFO ] Implicit Places using invariants and state equation in 28371 ms returned []
Implicit Place search using SMT with State Equation took 31138 ms to find 0 implicit places.
[2024-05-28 09:40:37] [INFO ] Redundant transitions in 76 ms returned []
Running 1516 sub problems to find dead transitions.
[2024-05-28 09:40:37] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:40:37] [INFO ] Invariant cache hit.
[2024-05-28 09:40:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 9.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 1.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 4.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 09:41:38] [INFO ] Deduced a trap composed of 14 places in 572 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 173 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 1/1 constraints]
After SMT, in 66557ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 66586ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97900 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[333]
Starting property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-05
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:[333]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[333]
[2024-05-28 09:41:44] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:41:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[333]
RANDOM walk for 10000 steps (459 resets) in 106 ms. (93 steps per ms)
BEST_FIRST walk for 10001 steps (31 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[333]
[2024-05-28 09:41:44] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:41:44] [INFO ] Invariant cache hit.
[2024-05-28 09:41:44] [INFO ] [Real]Absence check using 157 positive place invariants in 63 ms returned sat
[2024-05-28 09:41:45] [INFO ] [Real]Absence check using 157 positive and 20 generalized place invariants in 68 ms returned sat
[2024-05-28 09:41:46] [INFO ] [Real]Absence check using state equation in 1791 ms returned sat
[2024-05-28 09:41:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:41:47] [INFO ] [Nat]Absence check using 157 positive place invariants in 36 ms returned sat
[2024-05-28 09:41:47] [INFO ] [Nat]Absence check using 157 positive and 20 generalized place invariants in 26 ms returned sat
[2024-05-28 09:41:48] [INFO ] [Nat]Absence check using state equation in 948 ms returned sat
[2024-05-28 09:41:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:41:48] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 09:41:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1004 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[333]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[333]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 95 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Running 1516 sub problems to find dead transitions.
[2024-05-28 09:41:49] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:41:49] [INFO ] Invariant cache hit.
[2024-05-28 09:41:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 (/ 2.0 3.0))
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 (/ 2.0 3.0))
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 (/ 2.0 3.0))
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 (/ 2.0 3.0))
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 0/0 constraints]
After SMT, in 46318ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 46339ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46439 ms. Remains : 1011/1011 places, 1522/1522 transitions.
[2024-05-28 09:42:35] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:42:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[333]
RANDOM walk for 1000000 steps (47297 resets) in 10317 ms. (96 steps per ms)
BEST_FIRST walk for 1000001 steps (2612 resets) in 2339 ms. (427 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[333]
[2024-05-28 09:42:48] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:42:48] [INFO ] Invariant cache hit.
[2024-05-28 09:42:48] [INFO ] [Real]Absence check using 157 positive place invariants in 38 ms returned sat
[2024-05-28 09:42:48] [INFO ] [Real]Absence check using 157 positive and 20 generalized place invariants in 38 ms returned sat
[2024-05-28 09:42:49] [INFO ] [Real]Absence check using state equation in 1195 ms returned sat
[2024-05-28 09:42:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:42:49] [INFO ] [Nat]Absence check using 157 positive place invariants in 32 ms returned sat
[2024-05-28 09:42:49] [INFO ] [Nat]Absence check using 157 positive and 20 generalized place invariants in 26 ms returned sat
[2024-05-28 09:42:50] [INFO ] [Nat]Absence check using state equation in 945 ms returned sat
[2024-05-28 09:42:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:42:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1011 ms returned sat
[2024-05-28 09:42:52] [INFO ] Deduced a trap composed of 445 places in 573 ms of which 7 ms to minimize.
[2024-05-28 09:42:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 903 ms
[2024-05-28 09:42:52] [INFO ] Computed and/alt/rep : 777/2682/777 causal constraints (skipped 735 transitions) in 173 ms.
[2024-05-28 09:42:53] [INFO ] Added : 7 causal constraints over 2 iterations in 695 ms. Result :sat
Minimization took 3328 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[333]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[333]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 63 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 54 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-28 09:42:56] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:42:56] [INFO ] Invariant cache hit.
[2024-05-28 09:42:59] [INFO ] Implicit Places using invariants in 2448 ms returned []
[2024-05-28 09:42:59] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:42:59] [INFO ] Invariant cache hit.
[2024-05-28 09:43:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:43:26] [INFO ] Implicit Places using invariants and state equation in 27074 ms returned []
Implicit Place search using SMT with State Equation took 29526 ms to find 0 implicit places.
[2024-05-28 09:43:26] [INFO ] Redundant transitions in 57 ms returned []
Running 1516 sub problems to find dead transitions.
[2024-05-28 09:43:26] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:43:26] [INFO ] Invariant cache hit.
[2024-05-28 09:43:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 09:44:23] [INFO ] Deduced a trap composed of 14 places in 486 ms of which 5 ms to minimize.
[2024-05-28 09:44:31] [INFO ] Deduced a trap composed of 244 places in 501 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1006 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 174 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 2/2 constraints]
After SMT, in 65610ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 65628ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95288 ms. Remains : 1011/1011 places, 1522/1522 transitions.
RANDOM walk for 40001 steps (1906 resets) in 587 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (106 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (120 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 112889 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 2
Probabilistic random walk after 112889 steps, saw 34208 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-28 09:44:35] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:44:35] [INFO ] Invariant cache hit.
[2024-05-28 09:44:35] [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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 0/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2529 variables, 1/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2529/2529 variables, and 1189 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1185 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2528/2529 variables, and 1188 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1376 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1010/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2579ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 72 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Running 1516 sub problems to find dead transitions.
[2024-05-28 09:44:38] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:44:38] [INFO ] Invariant cache hit.
[2024-05-28 09:44:38] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
SMT process timed out in 25373ms, After SMT, problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 25407ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25488 ms. Remains : 1011/1011 places, 1522/1522 transitions.
RANDOM walk for 40000 steps (1859 resets) in 550 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (109 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 125723 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 1
Probabilistic random walk after 125723 steps, saw 37938 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-28 09:45:06] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:45:06] [INFO ] Invariant cache hit.
[2024-05-28 09:45:06] [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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2529 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2529/2529 variables, and 1189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1201 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 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) 296/297 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 472/769 variables, 115/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 166/935 variables, 34/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/935 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 67/1002 variables, 19/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1002 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1010 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:45:09] [INFO ] Deduced a trap composed of 529 places in 597 ms of which 7 ms to minimize.
[2024-05-28 09:45:10] [INFO ] Deduced a trap composed of 228 places in 510 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 2/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2528 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2529 variables, 1/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2529 variables, 1/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2529 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2529 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2529/2529 variables, and 1192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2650 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3868ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 63 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 60 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-28 09:45:10] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:45:10] [INFO ] Invariant cache hit.
[2024-05-28 09:45:13] [INFO ] Implicit Places using invariants in 2593 ms returned []
[2024-05-28 09:45:13] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:45:13] [INFO ] Invariant cache hit.
[2024-05-28 09:45:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:45:41] [INFO ] Implicit Places using invariants and state equation in 28143 ms returned []
Implicit Place search using SMT with State Equation took 30739 ms to find 0 implicit places.
[2024-05-28 09:45:41] [INFO ] Redundant transitions in 26 ms returned []
Running 1516 sub problems to find dead transitions.
[2024-05-28 09:45:41] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 09:45:41] [INFO ] Invariant cache hit.
[2024-05-28 09:45:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 15/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 09:46:44] [INFO ] Deduced a trap composed of 14 places in 476 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 173 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 157/157 constraints, Generalized P Invariants (flows): 15/20 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 1/1 constraints]
After SMT, in 66360ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 66380ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97220 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[333]
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-05 in 303540 ms.
[2024-05-28 09:46:48] [INFO ] Flatten gal took : 209 ms
[2024-05-28 09:46:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-28 09:46:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1011 places, 1522 transitions and 7906 arcs took 10 ms.
Total runtime 672790 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-PT-S05J80

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/424/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1011
TRANSITIONS: 1522
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.041s, Sys 0.009s]


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


----------------------------------------------------------------------
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: 844
MODEL NAME: /home/mcc/execution/424/model
1011 places, 1522 transitions.

No place bound informations found.
No place bound informations found.
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-S05J80"
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-S05J80, 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-171654446000477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J80.tgz
mv PolyORBNT-PT-S05J80 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 ;