About the Execution of LTSMin+red for FunctionPointer-PT-a128
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r496-tall-171640602900213.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FunctionPointer-PT-a128, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602900213
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 16:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 16:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 34K May 18 16:42 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 FunctionPointer-PT-a128-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-a128-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717187616178
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:33:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 20:33:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:33:37] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-31 20:33:37] [INFO ] Transformed 40 places.
[2024-05-31 20:33:37] [INFO ] Transformed 70 transitions.
[2024-05-31 20:33:37] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a128-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a128-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a128-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:33:37] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2024-05-31 20:33:37] [INFO ] Computed 4 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, 1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 10064 steps (19 resets) in 24 ms. (402 steps per ms)
FORMULA FunctionPointer-PT-a128-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a128-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a128-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (128 resets) in 81 ms. (1097 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12, 8, 8, 14, 25, 11, 22, 62, 9] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:33:37] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-31 20:33:37] [INFO ] Invariant cache hit.
[2024-05-31 20:33:37] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:33:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 10 ms returned sat
[2024-05-31 20:33:37] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 20:33:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:33:37] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:33:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 9 ms returned sat
[2024-05-31 20:33:37] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:33:37] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:37] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 6 ms to minimize.
[2024-05-31 20:33:37] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:33:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2024-05-31 20:33:38] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 10 ms.
[2024-05-31 20:33:38] [INFO ] Added : 19 causal constraints over 5 iterations in 82 ms. Result :sat
Minimization took 20 ms.
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:33:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-31 20:33:38] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 5 ms.
[2024-05-31 20:33:38] [INFO ] Added : 13 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 9 ms.
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:33:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-31 20:33:38] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 6 ms.
[2024-05-31 20:33:38] [INFO ] Added : 13 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 10 ms.
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-31 20:33:38] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:33:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2024-05-31 20:33:38] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 9 ms.
[2024-05-31 20:33:38] [INFO ] Added : 13 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 15 ms.
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:33:38] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-31 20:33:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 60 ms
[2024-05-31 20:33:38] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 6 ms.
[2024-05-31 20:33:38] [INFO ] Added : 19 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 15 ms.
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-31 20:33:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-31 20:33:38] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 3 ms.
[2024-05-31 20:33:38] [INFO ] Added : 20 causal constraints over 6 iterations in 31 ms. Result :sat
Minimization took 15 ms.
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:33:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:39] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-31 20:33:39] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:33:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2024-05-31 20:33:39] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 5 ms.
[2024-05-31 20:33:39] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 9 ms.
[2024-05-31 20:33:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:33:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:39] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:33:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-31 20:33:39] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-31 20:33:39] [INFO ] Added : 5 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 12 ms.
[2024-05-31 20:33:39] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:33:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-31 20:33:39] [INFO ] [Nat]Added 8 Read/Feed constraints in 44 ms returned sat
[2024-05-31 20:33:40] [INFO ] Deduced a trap composed of 9 places in 886 ms of which 32 ms to minimize.
[2024-05-31 20:33:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 925 ms
[2024-05-31 20:33:40] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 6 ms.
[2024-05-31 20:33:40] [INFO ] Added : 13 causal constraints over 3 iterations in 142 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12, 8, 8, 14, 25, 11, 22, 62, 9] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13, 12, 8, 20, 25, 16, 72, 117, 9] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 32 transition count 63
Applied a total of 4 rules in 45 ms. Remains 32 /34 variables (removed 2) and now considering 63/66 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 32/34 places, 63/66 transitions.
[2024-05-31 20:33:41] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 22=1, 33=1, 42=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 22=1, 33=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :[2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 14, 80, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, +inf, +inf, +inf, +inf, +inf, 72, 117, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:33:41] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
// Phase 1: matrix 44 rows 32 cols
[2024-05-31 20:33:41] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, +inf, +inf, +inf, +inf, +inf, 72, 117, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000049 steps (2 resets) in 457 ms. (2183 steps per ms)
FORMULA FunctionPointer-PT-a128-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a128-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a128-UpperBounds-06 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a128-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a128-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a128-UpperBounds-03 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a128-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a128-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 2000002 steps (4 resets) in 858 ms. (2328 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[148, 183] Max Struct:[+inf, +inf]
[2024-05-31 20:33:42] [INFO ] Flow matrix only has 44 transitions (discarded 19 similar events)
[2024-05-31 20:33:42] [INFO ] Invariant cache hit.
[2024-05-31 20:33:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:42] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 20:33:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:33:42] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:33:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 20:33:42] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-31 20:33:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:42] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:33:42] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:33:42] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:33:42] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-31 20:33:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 126 ms
[2024-05-31 20:33:42] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 4 ms.
[2024-05-31 20:33:42] [INFO ] Added : 20 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 11 ms.
[2024-05-31 20:33:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:42] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-31 20:33:42] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:42] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:33:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:42] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-31 20:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-31 20:33:43] [INFO ] Computed and/alt/rep : 24/100/22 causal constraints (skipped 20 transitions) in 4 ms.
[2024-05-31 20:33:43] [INFO ] Added : 19 causal constraints over 5 iterations in 26 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[148, 183] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[148, 246] Max Struct:[+inf, +inf]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 63/63 transitions.
Graph (complete) has 113 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 30 transition count 59
Applied a total of 5 rules in 8 ms. Remains 30 /32 variables (removed 2) and now considering 59/63 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 30/32 places, 59/63 transitions.
[2024-05-31 20:33:43] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :[11, 100]
Current structural bounds on expressions (after cover walk) : Max Seen:[148, 246] Max Struct:[+inf, +inf]
[2024-05-31 20:33:43] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
// Phase 1: matrix 42 rows 30 cols
[2024-05-31 20:33:43] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[148, 246] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 314 ms. (3174 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 686 ms. (2911 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[148, 246] Max Struct:[+inf, +inf]
[2024-05-31 20:33:44] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:44] [INFO ] Invariant cache hit.
[2024-05-31 20:33:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:33:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:33:44] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-31 20:33:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:44] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-31 20:33:44] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-31 20:33:44] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-31 20:33:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 103 ms
[2024-05-31 20:33:44] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 7 ms.
[2024-05-31 20:33:44] [INFO ] Added : 22 causal constraints over 6 iterations in 35 ms. Result :sat
Minimization took 19 ms.
[2024-05-31 20:33:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-31 20:33:44] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:33:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:44] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-31 20:33:44] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 3 ms.
[2024-05-31 20:33:44] [INFO ] Added : 20 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[148, 246] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[148, 246] Max Struct:[+inf, +inf]
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-31 20:33:44] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:44] [INFO ] Invariant cache hit.
[2024-05-31 20:33:44] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-31 20:33:44] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:44] [INFO ] Invariant cache hit.
[2024-05-31 20:33:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:33:44] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-31 20:33:44] [INFO ] Redundant transitions in 0 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-31 20:33:44] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:44] [INFO ] Invariant cache hit.
[2024-05-31 20:33:44] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 57 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 98 constraints, problems are : Problem set: 0 solved, 57 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 1067ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1074ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1178 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-31 20:33:45] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :[13, 86]
Current structural bounds on expressions (after cover walk) : Max Seen:[148, 246] Max Struct:[+inf, +inf]
RANDOM walk for 40200 steps (8 resets) in 320 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 620242 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 2
Probabilistic random walk after 620242 steps, saw 410678 distinct states, run finished after 3004 ms. (steps per millisecond=206 ) properties seen :0
[2024-05-31 20:33:49] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:49] [INFO ] Invariant cache hit.
[2024-05-31 20:33:49] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/33 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/39 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 27/66 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/72 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 2 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/33 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 27/66 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/72 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/72 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/72 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 43 constraints, problems are : Problem set: 0 solved, 2 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 151ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 3166 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=527 )
Parikh walk visited 2 properties in 175 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[148, 246] Max Struct:[+inf, +inf]
Starting property specific reduction for FunctionPointer-PT-a128-UpperBounds-09
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 20:33:49] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[76] Max Struct:[+inf]
[2024-05-31 20:33:49] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:49] [INFO ] Invariant cache hit.
[2024-05-31 20:33:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:33:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:33:49] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:33:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-31 20:33:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:49] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-31 20:33:49] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:33:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2024-05-31 20:33:49] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 3 ms.
[2024-05-31 20:33:49] [INFO ] Added : 6 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[76] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[76] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-31 20:33:49] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[12]
Current structural bounds on expressions (after cover walk) : Max Seen:[76] Max Struct:[+inf]
[2024-05-31 20:33:49] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[76] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 303 ms. (3289 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 342 ms. (2915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[153] Max Struct:[+inf]
[2024-05-31 20:33:50] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:50] [INFO ] Invariant cache hit.
[2024-05-31 20:33:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:33:50] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-31 20:33:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:33:50] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:50] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-31 20:33:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:33:50] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:33:50] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:33:50] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-31 20:33:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 88 ms
[2024-05-31 20:33:50] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 2 ms.
[2024-05-31 20:33:50] [INFO ] Added : 22 causal constraints over 6 iterations in 33 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[153] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[153] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-31 20:33:50] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:50] [INFO ] Invariant cache hit.
[2024-05-31 20:33:50] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-31 20:33:50] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:50] [INFO ] Invariant cache hit.
[2024-05-31 20:33:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:33:50] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-31 20:33:50] [INFO ] Redundant transitions in 0 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-31 20:33:50] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:50] [INFO ] Invariant cache hit.
[2024-05-31 20:33:50] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 57 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 98 constraints, problems are : Problem set: 0 solved, 57 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 910ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 911ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 997 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-31 20:33:51] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[15]
Current structural bounds on expressions (after cover walk) : Max Seen:[153] Max Struct:[+inf]
[2024-05-31 20:33:51] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[153] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 305 ms. (3267 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 339 ms. (2941 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[153] Max Struct:[+inf]
[2024-05-31 20:33:52] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:52] [INFO ] Invariant cache hit.
[2024-05-31 20:33:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:33:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:33:52] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:52] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:33:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:52] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:33:52] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:33:52] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
[2024-05-31 20:33:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 85 ms
[2024-05-31 20:33:52] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 2 ms.
[2024-05-31 20:33:52] [INFO ] Added : 22 causal constraints over 6 iterations in 28 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[153] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[153] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-31 20:33:52] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:52] [INFO ] Invariant cache hit.
[2024-05-31 20:33:52] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-31 20:33:52] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:52] [INFO ] Invariant cache hit.
[2024-05-31 20:33:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:33:52] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-31 20:33:52] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-31 20:33:52] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:52] [INFO ] Invariant cache hit.
[2024-05-31 20:33:52] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 57 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 42/72 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 57/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 98 constraints, problems are : Problem set: 0 solved, 57 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 923ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 924ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1011 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-31 20:33:53] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[20]
Current structural bounds on expressions (after cover walk) : Max Seen:[153] Max Struct:[+inf]
RANDOM walk for 40074 steps (8 resets) in 44 ms. (890 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2836164 steps, run timeout after 3001 ms. (steps per millisecond=945 ) properties seen :0 out of 1
Probabilistic random walk after 2836164 steps, saw 1917557 distinct states, run finished after 3001 ms. (steps per millisecond=945 ) properties seen :0
[2024-05-31 20:33:56] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:56] [INFO ] Invariant cache hit.
[2024-05-31 20:33:56] [INFO ] State equation strengthened by 8 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/39 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/66 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/66 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/72 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 41 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/33 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 27/66 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/66 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/66 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/72 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/72 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 42 constraints, problems are : Problem set: 0 solved, 1 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 898 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=449 )
Parikh walk visited 1 properties in 2 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[153] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-a128-UpperBounds-09 in 7431 ms.
Starting property specific reduction for FunctionPointer-PT-a128-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 20:33:56] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[71] Max Struct:[+inf]
[2024-05-31 20:33:56] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:56] [INFO ] Invariant cache hit.
[2024-05-31 20:33:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 20:33:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:33:57] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:33:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:33:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:33:57] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:33:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:33:57] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-31 20:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-05-31 20:33:57] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 4 ms.
[2024-05-31 20:33:57] [INFO ] Added : 5 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[71] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[71] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-31 20:33:57] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 5=1, 20=1, 23=1, 31=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 20=1, 29=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-31 20:33:57] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:33:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 331 ms. (3012 steps per ms)
FORMULA FunctionPointer-PT-a128-UpperBounds-12 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-a128-UpperBounds-12 in 563 ms.
[2024-05-31 20:33:57] [INFO ] Flatten gal took : 23 ms
[2024-05-31 20:33:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-31 20:33:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 59 transitions and 238 arcs took 3 ms.
Total runtime 20436 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : FunctionPointer-PT-a128-UpperBounds-09
BK_STOP 1717187637893
--------------------
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
mcc2024
ub formula name FunctionPointer-PT-a128-UpperBounds-09
ub formula formula --maxsum=/tmp/811/ub_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-a128"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-a128, 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 r496-tall-171640602900213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a128.tgz
mv FunctionPointer-PT-a128 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 '
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 ;