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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.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 PolyORBLF-PT-S06J04T04-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716870437252

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 04:27:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 04:27:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:27:19] [INFO ] Load time of PNML (sax parser for PT used): 651 ms
[2024-05-28 04:27:19] [INFO ] Transformed 454 places.
[2024-05-28 04:27:19] [INFO ] Transformed 6994 transitions.
[2024-05-28 04:27:19] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 965 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 10, 0, 0, 1] Max Struct:[+inf, +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:[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 10, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 04:27:19] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 454 cols
[2024-05-28 04:27:19] [INFO ] Computed 50 invariants in 107 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 10, 0, 0, 1] Max Struct:[1, 13392, 6780, 6612, 6780, 1, 33, 6780, 16, 31, 6, 42, 10, 1653, 47, 1695]
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (43 resets) in 202 ms. (49 steps per ms)
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130007 steps (634 resets) in 802 ms. (161 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1, 4, 1, 6, 3, 1, 1, 1, 1, 4, 1, 1] Max Struct:[13392, 6780, 6612, 6780, 33, 6780, 16, 31, 6, 42, 1653, 47, 1695]
[2024-05-28 04:27:21] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-28 04:27:21] [INFO ] Invariant cache hit.
[2024-05-28 04:27:21] [INFO ] [Real]Absence check using 19 positive place invariants in 47 ms returned sat
[2024-05-28 04:27:21] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 26 ms returned unsat
[2024-05-28 04:27:21] [INFO ] [Real]Absence check using 19 positive place invariants in 34 ms returned sat
[2024-05-28 04:27:21] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 39 ms returned unsat
[2024-05-28 04:27:21] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-28 04:27:21] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 45 ms returned unsat
[2024-05-28 04:27:22] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 04:27:22] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2024-05-28 04:27:22] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 04:27:22] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned unsat
[2024-05-28 04:27:22] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-28 04:27:22] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned sat
[2024-05-28 04:27:23] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2024-05-28 04:27:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:27:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-28 04:27:23] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 30 ms returned sat
[2024-05-28 04:27:25] [INFO ] [Nat]Absence check using state equation in 1864 ms returned unknown
[2024-05-28 04:27:25] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-28 04:27:25] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 8 ms returned unsat
[2024-05-28 04:27:25] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-28 04:27:25] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 7 ms returned unsat
[2024-05-28 04:27:25] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 04:27:25] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 10 ms returned unsat
[2024-05-28 04:27:25] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 04:27:25] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 6 ms returned unsat
[2024-05-28 04:27:25] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-05-28 04:27:25] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 27 ms returned unsat
[2024-05-28 04:27:25] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-28 04:27:25] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned unsat
[2024-05-28 04:27:25] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-28 04:27:25] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned sat
[2024-05-28 04:27:27] [INFO ] [Real]Absence check using state equation in 1466 ms returned sat
[2024-05-28 04:27:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:27:27] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-28 04:27:27] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned sat
[2024-05-28 04:27:29] [INFO ] [Nat]Absence check using state equation in 1611 ms returned sat
[2024-05-28 04:27:29] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:27:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 04:27:30] [INFO ] [Nat]Added 112 Read/Feed constraints in 1038 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1, 4, 1, 6, 3, 1, 1, 1, 1, 4, 1, 1] Max Struct:[4, 1, 4, 1, 6, 6780, 1, 1, 1, 1, 4, 1, 1695]
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 1] Max Struct:[6780, 1695]
Support contains 5 out of 454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 78 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 364 transition count 1530
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 268 place count 317 transition count 1483
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 276 place count 317 transition count 1475
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 284 place count 309 transition count 1475
Applied a total of 284 rules in 293 ms. Remains 309 /454 variables (removed 145) and now considering 1475/1614 (removed 139) transitions.
Running 1469 sub problems to find dead transitions.
[2024-05-28 04:27:30] [INFO ] Flow matrix only has 1451 transitions (discarded 24 similar events)
// Phase 1: matrix 1451 rows 309 cols
[2024-05-28 04:27:30] [INFO ] Computed 44 invariants in 41 ms
[2024-05-28 04:27:30] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
[2024-05-28 04:27:58] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 10 ms to minimize.
[2024-05-28 04:27:59] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2024-05-28 04:27:59] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-28 04:28:02] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 3 ms to minimize.
[2024-05-28 04:28:02] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 303/1760 variables, and 38 constraints, problems are : Problem set: 0 solved, 1469 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/309 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1469/1469 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1469 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
[2024-05-28 04:28:12] [INFO ] Deduced a trap composed of 52 places in 370 ms of which 3 ms to minimize.
[2024-05-28 04:28:12] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 2 ms to minimize.
[2024-05-28 04:28:13] [INFO ] Deduced a trap composed of 23 places in 358 ms of which 3 ms to minimize.
[2024-05-28 04:28:13] [INFO ] Deduced a trap composed of 23 places in 304 ms of which 3 ms to minimize.
[2024-05-28 04:28:13] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/1760 variables, and 43 constraints, problems are : Problem set: 0 solved, 1469 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/17 constraints, Generalized P Invariants (flows): 19/27 constraints, State Equation: 0/309 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1469 constraints, Known Traps: 10/10 constraints]
After SMT, in 60020ms problems are : Problem set: 0 solved, 1469 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60388 ms. Remains : 309/454 places, 1475/1614 transitions.
[2024-05-28 04:28:30] [INFO ] Flow matrix only has 1451 transitions (discarded 24 similar events)
[2024-05-28 04:28:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 1] Max Struct:[420, 105]
RANDOM walk for 1000000 steps (10882 resets) in 9224 ms. (108 steps per ms)
BEST_FIRST walk for 2000001 steps (12391 resets) in 5573 ms. (358 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1] Max Struct:[420, 105]
[2024-05-28 04:28:45] [INFO ] Flow matrix only has 1451 transitions (discarded 24 similar events)
[2024-05-28 04:28:45] [INFO ] Invariant cache hit.
[2024-05-28 04:28:45] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-28 04:28:45] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-28 04:28:46] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2024-05-28 04:28:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:28:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-28 04:28:46] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 04:28:47] [INFO ] [Nat]Absence check using state equation in 1284 ms returned sat
[2024-05-28 04:28:47] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:28:47] [INFO ] [Nat]Added 112 Read/Feed constraints in 90 ms returned sat
[2024-05-28 04:28:48] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 2 ms to minimize.
[2024-05-28 04:28:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 382 ms
[2024-05-28 04:28:48] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-28 04:28:48] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 15 ms returned sat
[2024-05-28 04:28:49] [INFO ] [Real]Absence check using state equation in 1386 ms returned sat
[2024-05-28 04:28:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:28:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-28 04:28:49] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 04:28:52] [INFO ] [Nat]Absence check using state equation in 2211 ms returned sat
[2024-05-28 04:28:52] [INFO ] [Nat]Added 112 Read/Feed constraints in 342 ms returned sat
[2024-05-28 04:28:52] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2024-05-28 04:28:53] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-05-28 04:28:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1725 ms
[2024-05-28 04:28:54] [INFO ] Computed and/alt/rep : 1143/4555/1138 causal constraints (skipped 307 transitions) in 186 ms.
[2024-05-28 04:28:56] [INFO ] Added : 68 causal constraints over 14 iterations in 1961 ms. Result :sat
Minimization took 4856 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 1] Max Struct:[3, 105]
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[105]
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1475/1475 transitions.
Applied a total of 0 rules in 83 ms. Remains 309 /309 variables (removed 0) and now considering 1475/1475 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 309/309 places, 1475/1475 transitions.
[2024-05-28 04:29:01] [INFO ] Flow matrix only has 1451 transitions (discarded 24 similar events)
[2024-05-28 04:29:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[105]
RANDOM walk for 1000000 steps (10926 resets) in 9120 ms. (109 steps per ms)
BEST_FIRST walk for 1000001 steps (3442 resets) in 3138 ms. (318 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[105]
[2024-05-28 04:29:13] [INFO ] Flow matrix only has 1451 transitions (discarded 24 similar events)
[2024-05-28 04:29:13] [INFO ] Invariant cache hit.
[2024-05-28 04:29:13] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-28 04:29:13] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 16 ms returned sat
[2024-05-28 04:29:14] [INFO ] [Real]Absence check using state equation in 1371 ms returned sat
[2024-05-28 04:29:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:29:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2024-05-28 04:29:14] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 15 ms returned sat
[2024-05-28 04:29:17] [INFO ] [Nat]Absence check using state equation in 2204 ms returned sat
[2024-05-28 04:29:17] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:29:17] [INFO ] [Nat]Added 112 Read/Feed constraints in 356 ms returned sat
[2024-05-28 04:29:17] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2024-05-28 04:29:18] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-05-28 04:29:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1564 ms
[2024-05-28 04:29:19] [INFO ] Computed and/alt/rep : 1143/4555/1138 causal constraints (skipped 307 transitions) in 246 ms.
[2024-05-28 04:29:20] [INFO ] Added : 68 causal constraints over 14 iterations in 1694 ms. Result :sat
Minimization took 4854 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[105]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[105]
Support contains 1 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1475/1475 transitions.
Applied a total of 0 rules in 60 ms. Remains 309 /309 variables (removed 0) and now considering 1475/1475 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 309/309 places, 1475/1475 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1475/1475 transitions.
Applied a total of 0 rules in 35 ms. Remains 309 /309 variables (removed 0) and now considering 1475/1475 (removed 0) transitions.
[2024-05-28 04:29:25] [INFO ] Flow matrix only has 1451 transitions (discarded 24 similar events)
[2024-05-28 04:29:25] [INFO ] Invariant cache hit.
[2024-05-28 04:29:26] [INFO ] Implicit Places using invariants in 625 ms returned [29, 202, 241]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 639 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 306/309 places, 1475/1475 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 303 transition count 1472
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 303 transition count 1472
Applied a total of 6 rules in 63 ms. Remains 303 /306 variables (removed 3) and now considering 1472/1475 (removed 3) transitions.
[2024-05-28 04:29:26] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
// Phase 1: matrix 1448 rows 303 cols
[2024-05-28 04:29:26] [INFO ] Computed 41 invariants in 55 ms
[2024-05-28 04:29:27] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-28 04:29:27] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 04:29:27] [INFO ] Invariant cache hit.
[2024-05-28 04:29:28] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:29:33] [INFO ] Implicit Places using invariants and state equation in 6508 ms returned []
Implicit Place search using SMT with State Equation took 7111 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 303/309 places, 1472/1475 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7849 ms. Remains : 303/309 places, 1472/1475 transitions.
[2024-05-28 04:29:33] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 04:29:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[105]
RANDOM walk for 1000000 steps (10892 resets) in 9224 ms. (108 steps per ms)
BEST_FIRST walk for 1000001 steps (3548 resets) in 3331 ms. (300 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[105]
[2024-05-28 04:29:46] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 04:29:46] [INFO ] Invariant cache hit.
[2024-05-28 04:29:46] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2024-05-28 04:29:46] [INFO ] [Real]Absence check using 18 positive and 23 generalized place invariants in 18 ms returned sat
[2024-05-28 04:29:47] [INFO ] [Real]Absence check using state equation in 828 ms returned sat
[2024-05-28 04:29:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:29:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2024-05-28 04:29:47] [INFO ] [Nat]Absence check using 18 positive and 23 generalized place invariants in 17 ms returned sat
[2024-05-28 04:29:51] [INFO ] [Nat]Absence check using state equation in 3927 ms returned sat
[2024-05-28 04:29:51] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:29:51] [INFO ] [Nat]Added 112 Read/Feed constraints in 445 ms returned sat
[2024-05-28 04:29:51] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-05-28 04:29:51] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-05-28 04:29:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2024-05-28 04:29:52] [INFO ] Computed and/alt/rep : 1140/4551/1135 causal constraints (skipped 307 transitions) in 209 ms.
[2024-05-28 04:29:53] [INFO ] Added : 19 causal constraints over 4 iterations in 1130 ms. Result :sat
Minimization took 4817 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[105]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[105]
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1472/1472 transitions.
Applied a total of 0 rules in 28 ms. Remains 303 /303 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 303/303 places, 1472/1472 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1472/1472 transitions.
Applied a total of 0 rules in 27 ms. Remains 303 /303 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
[2024-05-28 04:29:58] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 04:29:58] [INFO ] Invariant cache hit.
[2024-05-28 04:29:58] [INFO ] Implicit Places using invariants in 640 ms returned []
[2024-05-28 04:29:58] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 04:29:58] [INFO ] Invariant cache hit.
[2024-05-28 04:29:59] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 04:30:05] [INFO ] Implicit Places using invariants and state equation in 7219 ms returned []
Implicit Place search using SMT with State Equation took 7862 ms to find 0 implicit places.
[2024-05-28 04:30:06] [INFO ] Redundant transitions in 143 ms returned []
Running 1466 sub problems to find dead transitions.
[2024-05-28 04:30:06] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 04:30:06] [INFO ] Invariant cache hit.
[2024-05-28 04:30:06] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
[2024-05-28 04:30:33] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-28 04:30:33] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2024-05-28 04:30:36] [INFO ] Deduced a trap composed of 75 places in 179 ms of which 2 ms to minimize.
[2024-05-28 04:30:37] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
SMT process timed out in 50390ms, After SMT, problems are : Problem set: 0 solved, 1466 unsolved
Search for dead transitions found 0 dead transitions in 50433ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58494 ms. Remains : 303/303 places, 1472/1472 transitions.
RANDOM walk for 40000 steps (435 resets) in 1251 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (125 resets) in 424 ms. (94 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (133 resets) in 441 ms. (90 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 190767 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 2
Probabilistic random walk after 190767 steps, saw 87292 distinct states, run finished after 3004 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-28 04:31:00] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 04:31:00] [INFO ] Invariant cache hit.
[2024-05-28 04:31:00] [INFO ] State equation strengthened by 112 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) 129/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/197 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/200 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 101/301 variables, 21/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 04:31:00] [INFO ] Deduced a trap composed of 50 places in 309 ms of which 3 ms to minimize.
[2024-05-28 04:31:01] [INFO ] Deduced a trap composed of 50 places in 350 ms of which 2 ms to minimize.
[2024-05-28 04:31:01] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 3 ms to minimize.
[2024-05-28 04:31:01] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 4/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1448/1749 variables, 301/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1749 variables, 112/457 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1749 variables, 0/457 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/1751 variables, 2/459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1751 variables, 1/460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1751 variables, 0/460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1751 variables, 0/460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1751/1751 variables, and 460 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2172 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 303/303 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 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) 129/130 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/197 variables, 16/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/200 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 101/301 variables, 21/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 4/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1749/1751 variables, and 345 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1426 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 301/303 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 3627ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 218 ms.
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 1472/1472 transitions.
Applied a total of 0 rules in 33 ms. Remains 303 /303 variables (removed 0) and now considering 1472/1472 (removed 0) transitions.
Running 1466 sub problems to find dead transitions.
[2024-05-28 04:31:04] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 04:31:04] [INFO ] Invariant cache hit.
[2024-05-28 04:31:04] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
[2024-05-28 04:31:34] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-28 04:31:35] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-28 04:31:38] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 2 ms to minimize.
[2024-05-28 04:31:39] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/1751 variables, and 34 constraints, problems are : Problem set: 0 solved, 1466 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 16/23 constraints, State Equation: 0/303 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1466/1466 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
[2024-05-28 04:31:48] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
[2024-05-28 04:31:59] [INFO ] Deduced a trap composed of 23 places in 688 ms of which 2 ms to minimize.
[2024-05-28 04:31:59] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
[2024-05-28 04:31:59] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
[2024-05-28 04:32:01] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-05-28 04:32:01] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 2)
(s8 0)
(s9 1)
(s10 4)
(s11 0)
(s12 1)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 297/1751 variables, and 40 constraints, problems are : Problem set: 0 solved, 1466 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 16/23 constraints, State Equation: 0/303 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1466 constraints, Known Traps: 10/10 constraints]
After SMT, in 62248ms problems are : Problem set: 0 solved, 1466 unsolved
Search for dead transitions found 0 dead transitions in 62271ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62312 ms. Remains : 303/303 places, 1472/1472 transitions.
RANDOM walk for 40000 steps (421 resets) in 502 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (140 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 264248 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 264248 steps, saw 122775 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-28 04:32:09] [INFO ] Flow matrix only has 1448 transitions (discarded 24 similar events)
[2024-05-28 04:32:09] [INFO ] Invariant cache hit.
[2024-05-28 04:32:09] [INFO ] State equation strengthened by 112 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) 129/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/197 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/200 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 101/301 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1448/1749 variables, 301/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1749 variables, 112/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1749 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1751 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1751 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1751 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1751 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1751/1751 variables, and 456 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1613 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 303/303 constraints, ReadFeed: 112/112 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) 129/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/197 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/200 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 101/301 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:32:11] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 1 ms to minimize.
[2024-05-28 04:32:11] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1448/1749 variables, 301/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1749 variables, 112/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1749 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:32:13] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 2 ms to minimize.
[2024-05-28 04:32:13] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 1749/1751 variables, and 458 constraints, problems are : Problem set: 1 solved, 0 unsolved in 2600 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 301/303 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 4231ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S06J04T04-UpperBounds-15 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 295263 ms.
ITS solved all properties within timeout

BK_STOP 1716870734047

--------------------
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="PolyORBLF-PT-S06J04T04"
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 PolyORBLF-PT-S06J04T04, 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-171654445700317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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