About the Execution of ITS-Tools for FunctionPointer-PT-a004
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.r180-tall-171640602800173.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 itstools
Input is FunctionPointer-PT-a004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602800173
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K 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.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.0K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Apr 11 16:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 16:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 16:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 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-a004-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-a004-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716438891129
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-23 04:34:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 04:34:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 04:34:52] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-23 04:34:52] [INFO ] Transformed 40 places.
[2024-05-23 04:34:52] [INFO ] Transformed 70 transitions.
[2024-05-23 04:34:52] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a004-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a004-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a004-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +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, 4, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 04:34:52] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2024-05-23 04:34:52] [INFO ] Computed 4 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, +inf, 4, +inf, +inf, 4, +inf, +inf, +inf]
FORMULA FunctionPointer-PT-a004-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (52 resets) in 36 ms. (270 steps per ms)
FORMULA FunctionPointer-PT-a004-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a004-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a004-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90007 steps (56 resets) in 76 ms. (1168 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 10, 17, 6, 89, 34, 6, 76, 7] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 04:34:52] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-23 04:34:52] [INFO ] Invariant cache hit.
[2024-05-23 04:34:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 04:34:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-23 04:34:52] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 04:34:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 04:34:52] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-23 04:34:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:34:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 04:34:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:34:52] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 04:34:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 04:34:52] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 7 ms to minimize.
[2024-05-23 04:34:52] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
[2024-05-23 04:34:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2024-05-23 04:34:52] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 5 ms.
[2024-05-23 04:34:52] [INFO ] Added : 6 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 11 ms.
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-23 04:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-23 04:34:53] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 5 ms.
[2024-05-23 04:34:53] [INFO ] Added : 11 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 10 ms.
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-23 04:34:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-23 04:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-23 04:34:53] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 7 ms.
[2024-05-23 04:34:53] [INFO ] Added : 14 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 04:34:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-23 04:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-23 04:34:53] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-23 04:34:53] [INFO ] Added : 17 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 13 ms.
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 3 ms.
[2024-05-23 04:34:53] [INFO ] Added : 18 causal constraints over 6 iterations in 32 ms. Result :sat
Minimization took 11 ms.
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-23 04:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-23 04:34:53] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 3 ms.
[2024-05-23 04:34:53] [INFO ] Added : 14 causal constraints over 4 iterations in 21 ms. Result :sat
Minimization took 10 ms.
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 04:34:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 04:34:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 04:34:53] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-23 04:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-23 04:34:53] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-23 04:34:53] [INFO ] Added : 17 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 12 ms.
[2024-05-23 04:34:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:34:54] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 04:34:54] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 04:34:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:34:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:34:54] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 04:34:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 04:34:54] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-23 04:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-23 04:34:54] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 4 ms.
[2024-05-23 04:34:54] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2024-05-23 04:34:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:34:54] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 04:34:54] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 04:34:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:34:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:34:54] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 04:34:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 04:34:54] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-23 04:34:54] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-23 04:34:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2024-05-23 04:34:54] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 12 ms.
[2024-05-23 04:34:54] [INFO ] Added : 6 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 10, 17, 6, 89, 34, 6, 76, 7] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 10, 19, 10, 135, 35, 7, 79, 9] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 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 20 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 04:34:54] [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 97 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :[2147483647, 6, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, 10, +inf, +inf, +inf, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 04:34:54] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 31 cols
[2024-05-23 04:34:54] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, 10, +inf, +inf, +inf, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000002 steps (4437 resets) in 790 ms. (1264 steps per ms)
FORMULA FunctionPointer-PT-a004-UpperBounds-14 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a004-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a004-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a004-UpperBounds-09 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a004-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a004-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a004-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a004-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 1000001 steps (1389 resets) in 327 ms. (3048 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[+inf]
[2024-05-23 04:34:55] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2024-05-23 04:34:55] [INFO ] Invariant cache hit.
[2024-05-23 04:34:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:34:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-23 04:34:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 04:34:56] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 04:34:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:34:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:34:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-23 04:34:56] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-23 04:34:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 04:34:56] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 20 transitions) in 3 ms.
[2024-05-23 04:34:56] [INFO ] Added : 18 causal constraints over 7 iterations in 35 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[+inf]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 64/64 transitions.
Graph (complete) has 110 edges and 31 vertex of which 28 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 28 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 27 transition count 56
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 27 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 27 transition count 54
Applied a total of 11 rules in 19 ms. Remains 27 /31 variables (removed 4) and now considering 54/64 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 27/31 places, 54/64 transitions.
[2024-05-23 04:34:56] [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 0 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 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-23 04:34:56] [INFO ] Flow matrix only has 39 transitions (discarded 15 similar events)
// Phase 1: matrix 39 rows 27 cols
[2024-05-23 04:34:56] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 667 ms. (1497 steps per ms)
FORMULA FunctionPointer-PT-a004-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 )
[2024-05-23 04:34:57] [INFO ] Flatten gal took : 41 ms
[2024-05-23 04:34:57] [INFO ] Flatten gal took : 17 ms
[2024-05-23 04:34:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1981138879930282031.gal : 5 ms
[2024-05-23 04:34:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6354968986643613684.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1981138879930282031.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6354968986643613684.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 4886 ms.
BK_STOP 1716438897187
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-a004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FunctionPointer-PT-a004, 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 r180-tall-171640602800173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a004.tgz
mv FunctionPointer-PT-a004 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 ;