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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 32K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 249K Apr 12 10:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 904K Apr 12 10:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 190K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 233K Apr 12 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 627K Apr 12 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 12 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K 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 14M 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-S10J40-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J40-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716892185545

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-S10J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 10:29:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 10:29:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:29:47] [INFO ] Load time of PNML (sax parser for PT used): 812 ms
[2024-05-28 10:29:47] [INFO ] Transformed 854 places.
[2024-05-28 10:29:47] [INFO ] Transformed 12340 transitions.
[2024-05-28 10:29:48] [INFO ] Parsed PT model containing 854 places and 12340 transitions and 113999 arcs in 1041 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 10, 0, 1, 0, 10, 0, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 10, 0, 1, 0, 10, 0, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 10:29:48] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2024-05-28 10:29:48] [INFO ] Computed 112 invariants in 140 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 10, 0, 1, 0, 10, 0, 1, 0, 0, 0, 0, 0] Max Struct:[149, 4, 343, 109, 1, 1, 343, 410, 1, 109, 445, 1, 1, 1]
FORMULA PolyORBNT-PT-S10J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (559 resets) in 347 ms. (28 steps per ms)
FORMULA PolyORBNT-PT-S10J40-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (789 resets) in 446 ms. (201 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 10, 1, 10, 1, 1, 1, 0] Max Struct:[149, 4, 343, 109, 343, 410, 109, 445, 1]
[2024-05-28 10:29:49] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-05-28 10:29:49] [INFO ] Invariant cache hit.
[2024-05-28 10:29:49] [INFO ] [Real]Absence check using 81 positive place invariants in 29 ms returned sat
[2024-05-28 10:29:49] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 17 ms returned unsat
[2024-05-28 10:29:49] [INFO ] [Real]Absence check using 81 positive place invariants in 25 ms returned sat
[2024-05-28 10:29:49] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 20 ms returned unsat
[2024-05-28 10:29:50] [INFO ] [Real]Absence check using 81 positive place invariants in 54 ms returned sat
[2024-05-28 10:29:50] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 30 ms returned unsat
[2024-05-28 10:29:50] [INFO ] [Real]Absence check using 81 positive place invariants in 39 ms returned sat
[2024-05-28 10:29:50] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 16 ms returned unsat
[2024-05-28 10:29:50] [INFO ] [Real]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-05-28 10:29:50] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 51 ms returned unsat
[2024-05-28 10:29:50] [INFO ] [Real]Absence check using 81 positive place invariants in 20 ms returned sat
[2024-05-28 10:29:50] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 25 ms returned sat
[2024-05-28 10:29:52] [INFO ] [Real]Absence check using state equation in 1496 ms returned sat
[2024-05-28 10:29:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 10:29:52] [INFO ] [Nat]Absence check using 81 positive place invariants in 24 ms returned sat
[2024-05-28 10:29:52] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 29 ms returned sat
[2024-05-28 10:29:53] [INFO ] [Nat]Absence check using state equation in 1266 ms returned sat
[2024-05-28 10:29:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:29:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 192 ms returned sat
[2024-05-28 10:29:54] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 590 ms.
[2024-05-28 10:29:56] [INFO ] Deduced a trap composed of 110 places in 527 ms of which 21 ms to minimize.
[2024-05-28 10:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1007 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-28 10:29:57] [INFO ] [Real]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-05-28 10:29:57] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 20 ms returned unsat
[2024-05-28 10:29:57] [INFO ] [Real]Absence check using 81 positive place invariants in 32 ms returned sat
[2024-05-28 10:29:57] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 58 ms returned sat
[2024-05-28 10:29:58] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2024-05-28 10:29:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 10:29:58] [INFO ] [Nat]Absence check using 81 positive place invariants in 25 ms returned sat
[2024-05-28 10:29:58] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 43 ms returned sat
[2024-05-28 10:29:59] [INFO ] [Nat]Absence check using state equation in 1024 ms returned sat
[2024-05-28 10:30:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 152 ms returned sat
[2024-05-28 10:30:00] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 241 ms.
[2024-05-28 10:30:01] [INFO ] Added : 5 causal constraints over 1 iterations in 934 ms. Result :sat
Minimization took 744 ms.
[2024-05-28 10:30:02] [INFO ] [Real]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-05-28 10:30:02] [INFO ] [Real]Absence check using 81 positive and 31 generalized place invariants in 32 ms returned sat
[2024-05-28 10:30:02] [INFO ] [Real]Absence check using state equation in 877 ms returned sat
[2024-05-28 10:30:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 10:30:03] [INFO ] [Nat]Absence check using 81 positive place invariants in 21 ms returned sat
[2024-05-28 10:30:03] [INFO ] [Nat]Absence check using 81 positive and 31 generalized place invariants in 26 ms returned sat
[2024-05-28 10:30:04] [INFO ] [Nat]Absence check using state equation in 1171 ms returned sat
[2024-05-28 10:30:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 339 ms returned sat
[2024-05-28 10:30:05] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 395 ms.
[2024-05-28 10:30:06] [INFO ] Deduced a trap composed of 12 places in 835 ms of which 8 ms to minimize.
[2024-05-28 10:30:07] [INFO ] Deduced a trap composed of 19 places in 549 ms of which 10 ms to minimize.
[2024-05-28 10:30:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1897 ms
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 10, 1, 10, 1, 1, 1, 0] Max Struct:[1, 1, 10, 1, 10, 410, 1, 445, 1]
FORMULA PolyORBNT-PT-S10J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J40-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0] Max Struct:[410, 445, 1]
Support contains 412 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 844 transition count 2185
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 101 place count 799 transition count 2184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 798 transition count 2184
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 102 place count 798 transition count 2140
Deduced a syphon composed of 44 places in 3 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 190 place count 754 transition count 2140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 191 place count 753 transition count 2139
Iterating global reduction 3 with 1 rules applied. Total rules applied 192 place count 753 transition count 2139
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 196 place count 751 transition count 2137
Applied a total of 196 rules in 362 ms. Remains 751 /854 variables (removed 103) and now considering 2137/2230 (removed 93) transitions.
Running 2126 sub problems to find dead transitions.
[2024-05-28 10:30:08] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
// Phase 1: matrix 2128 rows 751 cols
[2024-05-28 10:30:08] [INFO ] Computed 102 invariants in 41 ms
[2024-05-28 10:30:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
SMT process timed out in 38601ms, After SMT, problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 38643ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39040 ms. Remains : 751/854 places, 2137/2230 transitions.
[2024-05-28 10:30:47] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:30:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 0] Max Struct:[410, 181, 1]
RANDOM walk for 1000000 steps (70392 resets) in 18970 ms. (52 steps per ms)
FORMULA PolyORBNT-PT-S10J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1565514 steps (13057 resets) in 8304 ms. (188 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 3] Max Struct:[410, 181]
[2024-05-28 10:31:14] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:31:14] [INFO ] Invariant cache hit.
[2024-05-28 10:31:14] [INFO ] [Real]Absence check using 81 positive place invariants in 23 ms returned sat
[2024-05-28 10:31:14] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 24 ms returned sat
[2024-05-28 10:31:15] [INFO ] [Real]Absence check using state equation in 1001 ms returned sat
[2024-05-28 10:31:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 10:31:15] [INFO ] [Nat]Absence check using 81 positive place invariants in 17 ms returned sat
[2024-05-28 10:31:15] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 15 ms returned sat
[2024-05-28 10:31:17] [INFO ] [Nat]Absence check using state equation in 2219 ms returned unsat
[2024-05-28 10:31:18] [INFO ] [Real]Absence check using 81 positive place invariants in 16 ms returned sat
[2024-05-28 10:31:18] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 19 ms returned sat
[2024-05-28 10:31:18] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2024-05-28 10:31:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 10:31:18] [INFO ] [Nat]Absence check using 81 positive place invariants in 22 ms returned sat
[2024-05-28 10:31:18] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 24 ms returned sat
[2024-05-28 10:31:19] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2024-05-28 10:31:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:31:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 270 ms returned sat
[2024-05-28 10:31:20] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 205 ms.
[2024-05-28 10:31:20] [INFO ] Added : 6 causal constraints over 2 iterations in 735 ms. Result :sat
Minimization took 4757 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 3] Max Struct:[4, 181]
FORMULA PolyORBNT-PT-S10J40-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[181]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 135 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 751/751 places, 2137/2137 transitions.
[2024-05-28 10:31:25] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:31:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[181]
RANDOM walk for 1000000 steps (70202 resets) in 14595 ms. (68 steps per ms)
BEST_FIRST walk for 1000001 steps (8256 resets) in 2628 ms. (380 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[181]
[2024-05-28 10:31:42] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:31:42] [INFO ] Invariant cache hit.
[2024-05-28 10:31:42] [INFO ] [Real]Absence check using 81 positive place invariants in 17 ms returned sat
[2024-05-28 10:31:42] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 19 ms returned sat
[2024-05-28 10:31:43] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2024-05-28 10:31:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 10:31:43] [INFO ] [Nat]Absence check using 81 positive place invariants in 18 ms returned sat
[2024-05-28 10:31:43] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 18 ms returned sat
[2024-05-28 10:31:44] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2024-05-28 10:31:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:31:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 280 ms returned sat
[2024-05-28 10:31:44] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 232 ms.
[2024-05-28 10:31:45] [INFO ] Added : 6 causal constraints over 2 iterations in 679 ms. Result :sat
Minimization took 4547 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[181]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[181]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 68 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 61 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2024-05-28 10:31:49] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:31:49] [INFO ] Invariant cache hit.
[2024-05-28 10:31:51] [INFO ] Implicit Places using invariants in 1295 ms returned []
[2024-05-28 10:31:51] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:31:51] [INFO ] Invariant cache hit.
[2024-05-28 10:31:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:32:05] [INFO ] Implicit Places using invariants and state equation in 13885 ms returned []
Implicit Place search using SMT with State Equation took 15182 ms to find 0 implicit places.
[2024-05-28 10:32:05] [INFO ] Redundant transitions in 119 ms returned []
Running 2126 sub problems to find dead transitions.
[2024-05-28 10:32:05] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:32:05] [INFO ] Invariant cache hit.
[2024-05-28 10:32:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-05-28 10:33:05] [INFO ] Deduced a trap composed of 18 places in 278 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 86016ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 86049ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101430 ms. Remains : 751/751 places, 2137/2137 transitions.
RANDOM walk for 40000 steps (2768 resets) in 1913 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (343 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (323 resets) in 650 ms. (61 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 160716 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 2
Probabilistic random walk after 160716 steps, saw 27786 distinct states, run finished after 3012 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-28 10:33:35] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:33:35] [INFO ] Invariant cache hit.
[2024-05-28 10:33: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) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 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) 173/174 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 10:33:38] [INFO ] Deduced a trap composed of 339 places in 652 ms of which 5 ms to minimize.
[2024-05-28 10:33:39] [INFO ] Deduced a trap composed of 160 places in 597 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 2/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 0/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2879 variables, 1/856 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2879 variables, 1/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 857 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3170 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 4600ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 68 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Running 2126 sub problems to find dead transitions.
[2024-05-28 10:33:39] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:33:39] [INFO ] Invariant cache hit.
[2024-05-28 10:33:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-05-28 10:34:23] [INFO ] Deduced a trap composed of 18 places in 419 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 59073ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 59101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59183 ms. Remains : 751/751 places, 2137/2137 transitions.
RANDOM walk for 40000 steps (2845 resets) in 1224 ms. (32 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (333 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 183194 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 1
Probabilistic random walk after 183194 steps, saw 31229 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-28 10:34:42] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:34:42] [INFO ] Invariant cache hit.
[2024-05-28 10:34:42] [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) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 0 solved, 1 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 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) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 10:34:44] [INFO ] Deduced a trap composed of 339 places in 451 ms of which 5 ms to minimize.
[2024-05-28 10:34:45] [INFO ] Deduced a trap composed of 160 places in 442 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2879 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2879 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 857 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2242 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3216ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 76 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 66 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2024-05-28 10:34:45] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:34:45] [INFO ] Invariant cache hit.
[2024-05-28 10:34:47] [INFO ] Implicit Places using invariants in 1192 ms returned []
[2024-05-28 10:34:47] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:34:47] [INFO ] Invariant cache hit.
[2024-05-28 10:34:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:35:02] [INFO ] Implicit Places using invariants and state equation in 15117 ms returned []
Implicit Place search using SMT with State Equation took 16318 ms to find 0 implicit places.
[2024-05-28 10:35:02] [INFO ] Redundant transitions in 173 ms returned []
Running 2126 sub problems to find dead transitions.
[2024-05-28 10:35:02] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:35:02] [INFO ] Invariant cache hit.
[2024-05-28 10:35:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.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 4.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.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 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.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 0.0)
(s82 0.0)
(s83 0.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 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.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 4.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.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 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 9.0)
(s145 1.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 4.0)
(s157 0.0)
(s158 0.0)
(s159 1.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)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 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 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s204 0.0)
(s205 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.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 1.0)
(s223 0.0)
(s224 1.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 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 2.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.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 0.0)
(s284 0.0)
(s285 1.0)
(s286 1.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)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.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 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.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 timeout
4.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-05-28 10:35:57] [INFO ] Deduced a trap composed of 18 places in 373 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 81342ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 81370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97942 ms. Remains : 751/751 places, 2137/2137 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[181]
Starting property specific reduction for PolyORBNT-PT-S10J40-UpperBounds-12
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:[181]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[181]
[2024-05-28 10:36:23] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:36:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[181]
RANDOM walk for 10000 steps (717 resets) in 216 ms. (46 steps per ms)
BEST_FIRST walk for 10001 steps (85 resets) in 31 ms. (312 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[181]
[2024-05-28 10:36:24] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:36:24] [INFO ] Invariant cache hit.
[2024-05-28 10:36:24] [INFO ] [Real]Absence check using 81 positive place invariants in 21 ms returned sat
[2024-05-28 10:36:24] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 25 ms returned sat
[2024-05-28 10:36:25] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2024-05-28 10:36:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 10:36:25] [INFO ] [Nat]Absence check using 81 positive place invariants in 20 ms returned sat
[2024-05-28 10:36:25] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 20 ms returned sat
[2024-05-28 10:36:25] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2024-05-28 10:36:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:36:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 283 ms returned sat
[2024-05-28 10:36:26] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 198 ms.
[2024-05-28 10:36:26] [INFO ] Added : 6 causal constraints over 2 iterations in 627 ms. Result :sat
Minimization took 1224 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[181]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[181]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 97 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Running 2126 sub problems to find dead transitions.
[2024-05-28 10:36:28] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:36:28] [INFO ] Invariant cache hit.
[2024-05-28 10:36:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.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 4.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.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 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 (/ 1.0 2.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 0.0)
(s82 0.0)
(s83 0.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 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.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 4.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.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 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 9.0)
(s145 1.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 4.0)
(s157 0.0)
(s158 0.0)
(s159 1.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)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 2.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)
(s204 0.0)
(s205 0.0)
(s207 0.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 1.0)
(s220 0.0)
(s221 1.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 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 (/ 3.0 2.0))
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.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 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.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)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.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 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.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 4.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.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 1.0)
(s388 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.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 1.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 1.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 4.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 0.0)
(s467 0.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 0.0)
(s484 0.0)
(s485 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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-05-28 10:37:12] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 60718ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 60753ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60859 ms. Remains : 751/751 places, 2137/2137 transitions.
[2024-05-28 10:37:28] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:37:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[181]
RANDOM walk for 1000000 steps (70270 resets) in 14388 ms. (69 steps per ms)
BEST_FIRST walk for 1000001 steps (8173 resets) in 2463 ms. (405 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[181]
[2024-05-28 10:37:45] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:37:45] [INFO ] Invariant cache hit.
[2024-05-28 10:37:45] [INFO ] [Real]Absence check using 81 positive place invariants in 20 ms returned sat
[2024-05-28 10:37:45] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 23 ms returned sat
[2024-05-28 10:37:46] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2024-05-28 10:37:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 10:37:46] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2024-05-28 10:37:46] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 21 ms returned sat
[2024-05-28 10:37:47] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2024-05-28 10:37:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:37:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 300 ms returned sat
[2024-05-28 10:37:47] [INFO ] Computed and/alt/rep : 1495/5626/1495 causal constraints (skipped 622 transitions) in 176 ms.
[2024-05-28 10:37:48] [INFO ] Added : 6 causal constraints over 2 iterations in 583 ms. Result :sat
Minimization took 4505 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[181]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[181]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 104 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 68 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2024-05-28 10:37:52] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:37:52] [INFO ] Invariant cache hit.
[2024-05-28 10:37:54] [INFO ] Implicit Places using invariants in 1219 ms returned []
[2024-05-28 10:37:54] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:37:54] [INFO ] Invariant cache hit.
[2024-05-28 10:37:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:38:09] [INFO ] Implicit Places using invariants and state equation in 15332 ms returned []
Implicit Place search using SMT with State Equation took 16557 ms to find 0 implicit places.
[2024-05-28 10:38:09] [INFO ] Redundant transitions in 57 ms returned []
Running 2126 sub problems to find dead transitions.
[2024-05-28 10:38:09] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:38:09] [INFO ] Invariant cache hit.
[2024-05-28 10:38:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-05-28 10:39:04] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 81736ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 81757ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98457 ms. Remains : 751/751 places, 2137/2137 transitions.
RANDOM walk for 40000 steps (2773 resets) in 997 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (346 resets) in 247 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (343 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 165864 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 2
Probabilistic random walk after 165864 steps, saw 28579 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-28 10:39:34] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:39:34] [INFO ] Invariant cache hit.
[2024-05-28 10:39:34] [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) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 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) 173/174 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 10:39:37] [INFO ] Deduced a trap composed of 339 places in 433 ms of which 4 ms to minimize.
[2024-05-28 10:39:37] [INFO ] Deduced a trap composed of 160 places in 528 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 2/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 0/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2879 variables, 1/856 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2879 variables, 1/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 857 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2337 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 3415ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 53 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Running 2126 sub problems to find dead transitions.
[2024-05-28 10:39:38] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:39:38] [INFO ] Invariant cache hit.
[2024-05-28 10:39:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
SMT process timed out in 43195ms, After SMT, problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 43215ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43273 ms. Remains : 751/751 places, 2137/2137 transitions.
RANDOM walk for 40000 steps (2833 resets) in 737 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (334 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 187274 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 1
Probabilistic random walk after 187274 steps, saw 31894 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-28 10:40:24] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:40:24] [INFO ] Invariant cache hit.
[2024-05-28 10:40:24] [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) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2879 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2879 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2879/2879 variables, and 854 constraints, problems are : Problem set: 0 solved, 1 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 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) 173/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/489 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/489 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 190/679 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/679 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/745 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/750 variables, 5/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/750 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2128/2878 variables, 750/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2878 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 10:40:27] [INFO ] Deduced a trap composed of 339 places in 646 ms of which 6 ms to minimize.
[2024-05-28 10:40:27] [INFO ] Deduced a trap composed of 160 places in 479 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 2/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2879 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2879 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2879 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2879/2879 variables, and 857 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2404 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 751/751 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 3282ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 51 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 751/751 places, 2137/2137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 2137/2137 transitions.
Applied a total of 0 rules in 50 ms. Remains 751 /751 variables (removed 0) and now considering 2137/2137 (removed 0) transitions.
[2024-05-28 10:40:28] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:40:28] [INFO ] Invariant cache hit.
[2024-05-28 10:40:29] [INFO ] Implicit Places using invariants in 991 ms returned []
[2024-05-28 10:40:29] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:40:29] [INFO ] Invariant cache hit.
[2024-05-28 10:40:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:40:43] [INFO ] Implicit Places using invariants and state equation in 13962 ms returned []
Implicit Place search using SMT with State Equation took 14984 ms to find 0 implicit places.
[2024-05-28 10:40:43] [INFO ] Redundant transitions in 58 ms returned []
Running 2126 sub problems to find dead transitions.
[2024-05-28 10:40:43] [INFO ] Flow matrix only has 2128 transitions (discarded 9 similar events)
[2024-05-28 10:40:43] [INFO ] Invariant cache hit.
[2024-05-28 10:40:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/2879 variables, and 92 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2126/1126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/741 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 2126 unsolved
[2024-05-28 10:41:36] [INFO ] Deduced a trap composed of 18 places in 307 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/2879 variables, and 93 constraints, problems are : Problem set: 0 solved, 2126 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 11/21 constraints, State Equation: 0/751 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1126 constraints, Known Traps: 1/1 constraints]
After SMT, in 79989ms problems are : Problem set: 0 solved, 2126 unsolved
Search for dead transitions found 0 dead transitions in 80011ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95127 ms. Remains : 751/751 places, 2137/2137 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[181]
Ending property specific reduction for PolyORBNT-PT-S10J40-UpperBounds-12 in 339504 ms.
[2024-05-28 10:42:04] [INFO ] Flatten gal took : 491 ms
[2024-05-28 10:42:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-28 10:42:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 751 places, 2137 transitions and 14186 arcs took 47 ms.
Total runtime 737278 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-PT-S10J40

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 751
TRANSITIONS: 2137
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.058s, Sys 0.007s]


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


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

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

Process ID: 881
MODEL NAME: /home/mcc/execution/419/model
751 places, 2137 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J40"
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-S10J40, 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-171654446100501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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