About the Execution of LTSMin+red for FunctionPointer-PT-a064
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-171640602900205.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-a064, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602900205
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K 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 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 16:08 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-a064-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-a064-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717187540103
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-a064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:32:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 20:32:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:32:21] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2024-05-31 20:32:21] [INFO ] Transformed 40 places.
[2024-05-31 20:32:21] [INFO ] Transformed 70 transitions.
[2024-05-31 20:32:21] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 13
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a064-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 64, 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, 64, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:32:21] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2024-05-31 20:32:21] [INFO ] Computed 4 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 64, 0, 0, 0] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, 1, +inf, 64, 64, 1, +inf]
FORMULA FunctionPointer-PT-a064-UpperBounds-12 64 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10001 steps (21 resets) in 25 ms. (384 steps per ms)
FORMULA FunctionPointer-PT-a064-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-13 64 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (127 resets) in 100 ms. (792 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 20, 25, 32, 11, 11, 11, 7] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:32:21] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-31 20:32:21] [INFO ] Invariant cache hit.
[2024-05-31 20:32:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:32:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 20:32:21] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:32:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:32:21] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:32:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:32:21] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-31 20:32:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:32:21] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 8 ms to minimize.
[2024-05-31 20:32:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-31 20:32:21] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 6 ms.
[2024-05-31 20:32:21] [INFO ] Added : 13 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 12 ms.
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 6 ms.
[2024-05-31 20:32:22] [INFO ] Added : 19 causal constraints over 6 iterations in 43 ms. Result :sat
Minimization took 18 ms.
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
[2024-05-31 20:32:22] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-31 20:32:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2024-05-31 20:32:22] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-31 20:32:22] [INFO ] Added : 13 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 17 ms.
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:32:22] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:32:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2024-05-31 20:32:22] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-31 20:32:22] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 8 ms.
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-31 20:32:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-31 20:32:22] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 3 ms.
[2024-05-31 20:32:22] [INFO ] Added : 13 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 14 ms.
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:32:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-31 20:32:22] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 3 ms.
[2024-05-31 20:32:22] [INFO ] Added : 13 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 12 ms.
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-31 20:32:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:32:22] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:32:22] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-31 20:32:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2024-05-31 20:32:22] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 3 ms.
[2024-05-31 20:32:22] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 9 ms.
[2024-05-31 20:32:23] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 20:32:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:32:23] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:32:23] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:23] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:32:23] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-31 20:32:23] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:23] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-31 20:32:23] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-31 20:32:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 56 ms
[2024-05-31 20:32:23] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 3 ms.
[2024-05-31 20:32:23] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 20, 25, 32, 11, 11, 11, 7] Max Struct:[+inf, 64, +inf, +inf, +inf, +inf, +inf, +inf]
FORMULA FunctionPointer-PT-a064-UpperBounds-01 64 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 27, 64, 11, 11, 11, 7] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 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.0 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 31 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 31 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 31 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 31 transition count 59
Applied a total of 8 rules in 30 ms. Remains 31 /34 variables (removed 3) and now considering 59/66 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 31/34 places, 59/66 transitions.
[2024-05-31 20:32:23] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {5=1, 20=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, 31=1, 40=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :[2147483647, 2147483647, 11, 2147483647, 2147483647, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, +inf, 64, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:32:23] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
// Phase 1: matrix 42 rows 31 cols
[2024-05-31 20:32:23] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, +inf, 64, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000038 steps (2 resets) in 469 ms. (2127 steps per ms)
FORMULA FunctionPointer-PT-a064-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-09 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-06 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a064-UpperBounds-00 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 458 ms. (2178 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[78] Max Struct:[+inf]
[2024-05-31 20:32:24] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:24] [INFO ] Invariant cache hit.
[2024-05-31 20:32:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:24] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:32:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:32:24] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:24] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:32:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:32:24] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:32:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-31 20:32:24] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 4 ms.
[2024-05-31 20:32:24] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:32:24] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-31 20:32:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2024-05-31 20:32:24] [INFO ] Added : 19 causal constraints over 5 iterations in 104 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[78] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[78] Max Struct:[+inf]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 59/59 transitions.
Graph (complete) has 109 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 30 /31 variables (removed 1) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/31 places, 59/59 transitions.
[2024-05-31 20:32:24] [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 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :[11]
Current structural bounds on expressions (after cover walk) : Max Seen:[78] Max Struct:[+inf]
[2024-05-31 20:32:24] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
// Phase 1: matrix 42 rows 30 cols
[2024-05-31 20:32:24] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[78] Max Struct:[+inf]
RANDOM walk for 1000067 steps (2 resets) in 393 ms. (2538 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 363 ms. (2747 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[83] Max Struct:[+inf]
[2024-05-31 20:32:25] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:25] [INFO ] Invariant cache hit.
[2024-05-31 20:32:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:25] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-31 20:32:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:32:25] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:25] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:32:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:25] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:32:25] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:32:25] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:32:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 104 ms
[2024-05-31 20:32:25] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 3 ms.
[2024-05-31 20:32:25] [INFO ] Added : 22 causal constraints over 6 iterations in 38 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[83] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[83] 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.
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:32:25] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:25] [INFO ] Invariant cache hit.
[2024-05-31 20:32:25] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 20:32:25] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:25] [INFO ] Invariant cache hit.
[2024-05-31 20:32:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:32:26] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-31 20:32:26] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-31 20:32:26] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:26] [INFO ] Invariant cache hit.
[2024-05-31 20:32:26] [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 444 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 575 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 1062ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1069ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1183 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-31 20:32:27] [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 1 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 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[11]
Current structural bounds on expressions (after cover walk) : Max Seen:[83] Max Struct:[+inf]
[2024-05-31 20:32:27] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[83] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 383 ms. (2604 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 369 ms. (2702 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[83] Max Struct:[+inf]
[2024-05-31 20:32:27] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:27] [INFO ] Invariant cache hit.
[2024-05-31 20:32:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:32:27] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:32:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:32:27] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:28] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:32:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:32:28] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-31 20:32:28] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-31 20:32:28] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-31 20:32:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 93 ms
[2024-05-31 20:32:28] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 3 ms.
[2024-05-31 20:32:28] [INFO ] Added : 22 causal constraints over 6 iterations in 29 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[83] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[83] 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-31 20:32:28] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:28] [INFO ] Invariant cache hit.
[2024-05-31 20:32:28] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-31 20:32:28] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:28] [INFO ] Invariant cache hit.
[2024-05-31 20:32:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:32:28] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-31 20:32:28] [INFO ] Redundant transitions in 0 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-31 20:32:28] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:28] [INFO ] Invariant cache hit.
[2024-05-31 20:32:28] [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 433 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 538 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 994ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 995ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1098 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-31 20:32:29] [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 :[11]
Current structural bounds on expressions (after cover walk) : Max Seen:[83] Max Struct:[+inf]
RANDOM walk for 40089 steps (8 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2356965 steps, run timeout after 3001 ms. (steps per millisecond=785 ) properties seen :0 out of 1
Probabilistic random walk after 2356965 steps, saw 1588612 distinct states, run finished after 3004 ms. (steps per millisecond=784 ) properties seen :0
[2024-05-31 20:32:32] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:32] [INFO ] Invariant cache hit.
[2024-05-31 20:32:32] [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 53 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 42 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 103ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 484 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=242 )
Parikh walk visited 1 properties in 6 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[83] Max Struct:[+inf]
Starting property specific reduction for FunctionPointer-PT-a064-UpperBounds-03
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:32:32] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10009 steps (2 resets) in 7 ms. (1251 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:[75] Max Struct:[+inf]
[2024-05-31 20:32:32] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:32] [INFO ] Invariant cache hit.
[2024-05-31 20:32:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-31 20:32:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:32:32] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:32:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:32] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-31 20:32:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:32:32] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-31 20:32:32] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:32:32] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-31 20:32:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 83 ms
[2024-05-31 20:32:32] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 3 ms.
[2024-05-31 20:32:32] [INFO ] Added : 22 causal constraints over 6 iterations in 30 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[75] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[75] 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.
[2024-05-31 20:32:32] [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:[75] Max Struct:[+inf]
[2024-05-31 20:32:32] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[75] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 405 ms. (2463 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 388 ms. (2570 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[78] Max Struct:[+inf]
[2024-05-31 20:32:33] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:33] [INFO ] Invariant cache hit.
[2024-05-31 20:32:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:32:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:32:33] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:32:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:33] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-31 20:32:33] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:33] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-31 20:32:33] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-31 20:32:33] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-31 20:32:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 91 ms
[2024-05-31 20:32:33] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 3 ms.
[2024-05-31 20:32:33] [INFO ] Added : 22 causal constraints over 6 iterations in 32 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[78] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[78] 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 5 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 5 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:32:33] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:33] [INFO ] Invariant cache hit.
[2024-05-31 20:32:34] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 20:32:34] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:34] [INFO ] Invariant cache hit.
[2024-05-31 20:32:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:32:34] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-31 20:32:34] [INFO ] Redundant transitions in 0 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-31 20:32:34] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:34] [INFO ] Invariant cache hit.
[2024-05-31 20:32:34] [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 417 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 582 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 1020ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1024ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1124 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-31 20:32:35] [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 :[13]
Current structural bounds on expressions (after cover walk) : Max Seen:[78] Max Struct:[+inf]
[2024-05-31 20:32:35] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[78] Max Struct:[+inf]
RANDOM walk for 1000008 steps (2 resets) in 380 ms. (2624 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 357 ms. (2793 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[78] Max Struct:[+inf]
[2024-05-31 20:32:35] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:35] [INFO ] Invariant cache hit.
[2024-05-31 20:32:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:35] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 20:32:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:32:35] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:32:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:35] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 20:32:35] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-31 20:32:36] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-31 20:32:36] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-31 20:32:36] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-31 20:32:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 88 ms
[2024-05-31 20:32:36] [INFO ] Computed and/alt/rep : 25/108/23 causal constraints (skipped 17 transitions) in 4 ms.
[2024-05-31 20:32:36] [INFO ] Added : 22 causal constraints over 6 iterations in 32 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[78] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[78] 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 1 ms. Remains 30 /30 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-05-31 20:32:36] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:36] [INFO ] Invariant cache hit.
[2024-05-31 20:32:36] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 20:32:36] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:36] [INFO ] Invariant cache hit.
[2024-05-31 20:32:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:32:36] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-31 20:32:36] [INFO ] Redundant transitions in 0 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-31 20:32:36] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:36] [INFO ] Invariant cache hit.
[2024-05-31 20:32:36] [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 433 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 523 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 973ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 974ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1068 ms. Remains : 30/30 places, 59/59 transitions.
[2024-05-31 20:32:37] [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 1 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 :[11]
Current structural bounds on expressions (after cover walk) : Max Seen:[78] Max Struct:[+inf]
RANDOM walk for 40132 steps (8 resets) in 48 ms. (819 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2695797 steps, run timeout after 3001 ms. (steps per millisecond=898 ) properties seen :0 out of 1
Probabilistic random walk after 2695797 steps, saw 1821188 distinct states, run finished after 3001 ms. (steps per millisecond=898 ) properties seen :0
[2024-05-31 20:32:40] [INFO ] Flow matrix only has 42 transitions (discarded 17 similar events)
[2024-05-31 20:32:40] [INFO ] Invariant cache hit.
[2024-05-31 20:32:40] [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 45 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 53 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 101ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 459 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=459 )
Parikh walk visited 1 properties in 0 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[78] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-a064-UpperBounds-03 in 7831 ms.
[2024-05-31 20:32:40] [INFO ] Flatten gal took : 24 ms
[2024-05-31 20:32:40] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-31 20:32:40] [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 19356 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-a064-UpperBounds-03
BK_STOP 1717187560812
--------------------
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-a064-UpperBounds-03
ub formula formula --maxsum=/tmp/793/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-a064"
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-a064, 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-171640602900205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a064.tgz
mv FunctionPointer-PT-a064 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 ;