About the Execution of GreatSPN+red for FunctionPointer-PT-a016
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.r179-tall-171640601000189.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 greatspnxred
Input is FunctionPointer-PT-a016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601000189
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 11 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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-a016-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-a016-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716431081142
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:24:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 02:24:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:24:42] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-23 02:24:42] [INFO ] Transformed 40 places.
[2024-05-23 02:24:42] [INFO ] Transformed 70 transitions.
[2024-05-23 02:24:42] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 161 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 15
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a016-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a016-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 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, 16, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:24:42] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2024-05-23 02:24:42] [INFO ] Computed 4 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 16, +inf, +inf, 1, 1, 16, +inf, +inf]
FORMULA FunctionPointer-PT-a016-UpperBounds-12 16 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (29 resets) in 29 ms. (333 steps per ms)
FORMULA FunctionPointer-PT-a016-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a016-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a016-UpperBounds-04 16 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (37 resets) in 68 ms. (1159 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[22, 78, 17, 7, 110, 44, 112, 231] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:24:42] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-23 02:24:42] [INFO ] Invariant cache hit.
[2024-05-23 02:24:42] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 02:24:42] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 11 ms returned sat
[2024-05-23 02:24:42] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 02:24:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:24:42] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:24:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:24:42] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 02:24:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:24:42] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 7 ms to minimize.
[2024-05-23 02:24:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-23 02:24:42] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 7 ms.
[2024-05-23 02:24:43] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-23 02:24:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-23 02:24:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2024-05-23 02:24:43] [INFO ] Added : 19 causal constraints over 5 iterations in 128 ms. Result :sat
Minimization took 13 ms.
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:24:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:24:43] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-23 02:24:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-23 02:24:43] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-23 02:24:43] [INFO ] Added : 13 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 10 ms.
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:24:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-23 02:24:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-23 02:24:43] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-23 02:24:43] [INFO ] Added : 13 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 11 ms.
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-23 02:24:43] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-23 02:24:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2024-05-23 02:24:43] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 3 ms.
[2024-05-23 02:24:43] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 9 ms.
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-23 02:24:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-23 02:24:43] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 5 ms.
[2024-05-23 02:24:43] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-23 02:24:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-23 02:24:43] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 3 ms.
[2024-05-23 02:24:43] [INFO ] Added : 18 causal constraints over 6 iterations in 34 ms. Result :sat
Minimization took 13 ms.
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-23 02:24:43] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:24:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 02:24:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:44] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-23 02:24:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-23 02:24:44] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 5 ms.
[2024-05-23 02:24:44] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2024-05-23 02:24:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:44] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:24:44] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:24:44] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:24:44] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 02:24:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:44] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 3 ms.
[2024-05-23 02:24:44] [INFO ] Added : 18 causal constraints over 7 iterations in 35 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[22, 78, 17, 7, 110, 44, 112, 231] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[22, 78, 18, 15, 113, 44, 112, 654] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 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 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 64
Applied a total of 3 rules in 21 ms. Remains 31 /34 variables (removed 3) and now considering 64/66 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 31/34 places, 64/66 transitions.
[2024-05-23 02:24:44] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {3=1, 6=1, 23=1, 34=1, 43=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {6=1, 23=1, 34=1, 43=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 91 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :[18, 4, 2, 7, 2147483647, 7, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[22, 78, 18, 15, +inf, 44, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:24:44] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 31 cols
[2024-05-23 02:24:44] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[22, 78, 18, 15, +inf, 44, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2957 resets) in 671 ms. (1488 steps per ms)
FORMULA FunctionPointer-PT-a016-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a016-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a016-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 5000004 steps (2271 resets) in 1583 ms. (3156 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[28, 5668, 18, 38, 10382] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:24:47] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2024-05-23 02:24:47] [INFO ] Invariant cache hit.
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 21 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 02:24:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:24:47] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-23 02:24:47] [INFO ] Added : 19 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 14 ms.
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-23 02:24:47] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-23 02:24:47] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-23 02:24:47] [INFO ] Added : 15 causal constraints over 5 iterations in 21 ms. Result :sat
Minimization took 9 ms.
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 02:24:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:47] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-23 02:24:47] [INFO ] Added : 6 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[28, 5668, 18, 38, 10382] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[28, 5668, 18, 59, 10382] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 64/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 30 transition count 60
Applied a total of 4 rules in 18 ms. Remains 30 /31 variables (removed 1) and now considering 60/64 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 30/31 places, 60/64 transitions.
[2024-05-23 02:24:57] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {3=1, 6=1, 21=1, 24=1, 32=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {6=1, 21=1, 32=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 104 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :[2147483647, 2147483647, 2147483647, 4, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, +inf, +inf, 59, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:24:57] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2024-05-23 02:24:57] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, +inf, +inf, 59, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000019 steps (2855 resets) in 579 ms. (1724 steps per ms)
FORMULA FunctionPointer-PT-a016-UpperBounds-06 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a016-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a016-UpperBounds-14 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a016-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a016-UpperBounds-00 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 1000000 steps (1266 resets) in 302 ms. (3300 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[59] Max Struct:[+inf]
[2024-05-23 02:24:58] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
[2024-05-23 02:24:58] [INFO ] Invariant cache hit.
[2024-05-23 02:24:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 02:24:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:24:58] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-23 02:24:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:24:58] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:24:58] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 02:24:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:58] [INFO ] Computed and/alt/rep : 26/109/24 causal constraints (skipped 17 transitions) in 6 ms.
[2024-05-23 02:24:58] [INFO ] Added : 14 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[59] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[59] Max Struct:[+inf]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Graph (complete) has 106 edges and 30 vertex of which 27 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 27 transition count 54
Applied a total of 7 rules in 2 ms. Remains 27 /30 variables (removed 3) and now considering 54/60 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 27/30 places, 54/60 transitions.
[2024-05-23 02:24:58] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {3=1, 4=1, 5=1, 18=1, 28=1, 38=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {3=1, 18=1, 28=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 :[13]
Current structural bounds on expressions (after cover walk) : Max Seen:[59] Max Struct:[+inf]
[2024-05-23 02:24:58] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
// Phase 1: matrix 39 rows 27 cols
[2024-05-23 02:24:58] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[59] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 668 ms. (1494 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 286 ms. (3484 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2872] Max Struct:[+inf]
[2024-05-23 02:24:59] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:24:59] [INFO ] Invariant cache hit.
[2024-05-23 02:24:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:59] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 02:24:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 02:24:59] [INFO ] [Real]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:24:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:24:59] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-23 02:24:59] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:24:59] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-23 02:24:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-23 02:24:59] [INFO ] Computed and/alt/rep : 24/99/22 causal constraints (skipped 15 transitions) in 3 ms.
[2024-05-23 02:24:59] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2872] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3113] Max Struct:[+inf]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 8 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 27/27 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-05-23 02:25:03] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:03] [INFO ] Invariant cache hit.
[2024-05-23 02:25:03] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-23 02:25:03] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:03] [INFO ] Invariant cache hit.
[2024-05-23 02:25:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 02:25:03] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-23 02:25:03] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-05-23 02:25:03] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:03] [INFO ] Invariant cache hit.
[2024-05-23 02:25:03] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 39/66 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 37 constraints, problems are : Problem set: 0 solved, 52 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 39/66 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 52/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/66 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 89 constraints, problems are : Problem set: 0 solved, 52 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 919ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 925ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1032 ms. Remains : 27/27 places, 54/54 transitions.
[2024-05-23 02:25:04] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {3=1, 4=1, 5=1, 18=1, 28=1, 38=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {3=1, 18=1, 28=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 :[19]
Current structural bounds on expressions (after cover walk) : Max Seen:[3113] Max Struct:[+inf]
[2024-05-23 02:25:04] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3113] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 668 ms. (1494 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 287 ms. (3472 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3113] Max Struct:[+inf]
[2024-05-23 02:25:05] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:05] [INFO ] Invariant cache hit.
[2024-05-23 02:25:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:25:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 02:25:05] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 02:25:05] [INFO ] [Real]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:25:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:25:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 02:25:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-23 02:25:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:25:05] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-23 02:25:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-23 02:25:05] [INFO ] Computed and/alt/rep : 24/99/22 causal constraints (skipped 15 transitions) in 4 ms.
[2024-05-23 02:25:05] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3113] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3113] Max Struct:[+inf]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 27/27 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-05-23 02:25:08] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:08] [INFO ] Invariant cache hit.
[2024-05-23 02:25:08] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-23 02:25:08] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:08] [INFO ] Invariant cache hit.
[2024-05-23 02:25:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 02:25:08] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-23 02:25:08] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-05-23 02:25:08] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:08] [INFO ] Invariant cache hit.
[2024-05-23 02:25:08] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 39/66 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 37 constraints, problems are : Problem set: 0 solved, 52 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 39/66 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 52/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/66 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 89 constraints, problems are : Problem set: 0 solved, 52 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 841ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 842ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 938 ms. Remains : 27/27 places, 54/54 transitions.
[2024-05-23 02:25:09] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {3=1, 4=1, 5=1, 18=1, 28=1, 38=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {3=1, 18=1, 28=1, 38=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :[19]
Current structural bounds on expressions (after cover walk) : Max Seen:[3113] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 365 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 405136 steps, run visited all 1 properties in 421 ms. (steps per millisecond=962 )
Probabilistic random walk after 405136 steps, saw 255692 distinct states, run finished after 424 ms. (steps per millisecond=955 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3113] Max Struct:[+inf]
Starting property specific reduction for FunctionPointer-PT-a016-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-23 02:25:10] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:10] [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 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[27] Max Struct:[+inf]
[2024-05-23 02:25:10] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:10] [INFO ] Invariant cache hit.
[2024-05-23 02:25:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:25:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 02:25:10] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 02:25:10] [INFO ] [Real]Added 7 Read/Feed constraints in 10 ms returned sat
[2024-05-23 02:25:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:25:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:25:10] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 02:25:10] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:25:10] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-23 02:25:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-23 02:25:10] [INFO ] Computed and/alt/rep : 24/99/22 causal constraints (skipped 15 transitions) in 8 ms.
[2024-05-23 02:25:10] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[27] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[27] Max Struct:[+inf]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 27/27 places, 54/54 transitions.
[2024-05-23 02:25:10] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {3=1, 4=1, 5=1, 18=1, 28=1, 38=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {3=1, 18=1, 28=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 1) seen :[12]
Current structural bounds on expressions (after cover walk) : Max Seen:[27] Max Struct:[+inf]
[2024-05-23 02:25:10] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[27] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 695 ms. (1436 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 294 ms. (3389 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2866] Max Struct:[+inf]
[2024-05-23 02:25:11] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:11] [INFO ] Invariant cache hit.
[2024-05-23 02:25:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:25:11] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 02:25:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 02:25:11] [INFO ] [Real]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:25:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:25:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:25:11] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-23 02:25:11] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:25:11] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-23 02:25:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-05-23 02:25:11] [INFO ] Computed and/alt/rep : 24/99/22 causal constraints (skipped 15 transitions) in 3 ms.
[2024-05-23 02:25:11] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2866] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2871] Max Struct:[+inf]
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 8 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 27/27 places, 54/54 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 54/54 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2024-05-23 02:25:15] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:15] [INFO ] Invariant cache hit.
[2024-05-23 02:25:15] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-23 02:25:15] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:15] [INFO ] Invariant cache hit.
[2024-05-23 02:25:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 02:25:15] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-23 02:25:15] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-05-23 02:25:15] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:15] [INFO ] Invariant cache hit.
[2024-05-23 02:25:15] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 39/66 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 0/66 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 37 constraints, problems are : Problem set: 0 solved, 52 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 39/66 variables, 27/30 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 52/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/66 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 89 constraints, problems are : Problem set: 0 solved, 52 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 834ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 835ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 928 ms. Remains : 27/27 places, 54/54 transitions.
[2024-05-23 02:25:15] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
Found an invariant !
This invariant on transitions {3=1, 4=1, 5=1, 18=1, 28=1, 38=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {3=1, 18=1, 28=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 :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-23 02:25:16] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
[2024-05-23 02:25:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 674 ms. (1481 steps per ms)
FORMULA FunctionPointer-PT-a016-UpperBounds-03 +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-a016-UpperBounds-03 in 6344 ms.
[2024-05-23 02:25:16] [INFO ] Flatten gal took : 30 ms
Total runtime 34594 ms.
ITS solved all properties within timeout
BK_STOP 1716431116907
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-a016"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FunctionPointer-PT-a016, 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 r179-tall-171640601000189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a016.tgz
mv FunctionPointer-PT-a016 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 ;