About the Execution of 2024-gold for FunctionPointer-PT-a008
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r111-smll-174867015800003.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is FunctionPointer-PT-a008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015800003
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 34K May 29 14:32 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-a008-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748758429015
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 06:13:51] [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]
[2025-06-01 06:13:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 06:13:51] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2025-06-01 06:13:51] [INFO ] Transformed 40 places.
[2025-06-01 06:13:51] [INFO ] Transformed 70 transitions.
[2025-06-01 06:13:51] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a008-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +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, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 06:13:51] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2025-06-01 06:13:51] [INFO ] Computed 4 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, 1, 1, +inf, +inf, +inf, +inf, +inf, 1, +inf, +inf]
RANDOM walk for 10000 steps (35 resets) in 61 ms. (161 steps per ms)
FORMULA FunctionPointer-PT-a008-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100008 steps (59 resets) in 189 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[22, 56, 12, 125, 9, 15, 13, 4, 26, 54] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 06:13:51] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2025-06-01 06:13:51] [INFO ] Invariant cache hit.
[2025-06-01 06:13:52] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-01 06:13:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 06:13:52] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-06-01 06:13:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 06:13:52] [INFO ] [Real]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-01 06:13:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:13:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:13:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:13:52] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-06-01 06:13:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-01 06:13:52] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 13 ms to minimize.
[2025-06-01 06:13:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2025-06-01 06:13:52] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 17 ms.
[2025-06-01 06:13:52] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 4 ms to minimize.
[2025-06-01 06:13:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2025-06-01 06:13:52] [INFO ] Added : 12 causal constraints over 3 iterations in 191 ms. Result :sat
Minimization took 23 ms.
[2025-06-01 06:13:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:13:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 8 ms returned sat
[2025-06-01 06:13:52] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-01 06:13:52] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:13:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:13:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:13:53] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2025-06-01 06:13:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2025-06-01 06:13:53] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 12 ms.
[2025-06-01 06:13:53] [INFO ] Added : 18 causal constraints over 6 iterations in 77 ms. Result :sat
Minimization took 17 ms.
[2025-06-01 06:13:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:13:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:13:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2025-06-01 06:13:53] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2025-06-01 06:13:53] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2025-06-01 06:13:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2025-06-01 06:13:53] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 12 ms.
[2025-06-01 06:13:53] [INFO ] Added : 6 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 11 ms.
[2025-06-01 06:13:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 10 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:13:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:13:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:13:53] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
[2025-06-01 06:13:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-01 06:13:53] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 11 ms.
[2025-06-01 06:13:53] [INFO ] Added : 2 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 17 ms.
[2025-06-01 06:13:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:13:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:13:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-01 06:13:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-01 06:13:54] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 3 ms to minimize.
[2025-06-01 06:13:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2025-06-01 06:13:54] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 14 ms.
[2025-06-01 06:13:54] [INFO ] Added : 11 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 21 ms.
[2025-06-01 06:13:54] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Real]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-06-01 06:13:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:13:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:13:54] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 3 ms to minimize.
[2025-06-01 06:13:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2025-06-01 06:13:54] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 8 ms.
[2025-06-01 06:13:54] [INFO ] Added : 19 causal constraints over 5 iterations in 67 ms. Result :sat
Minimization took 23 ms.
[2025-06-01 06:13:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-01 06:13:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:13:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 9 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-01 06:13:54] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2025-06-01 06:13:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2025-06-01 06:13:54] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 9 ms.
[2025-06-01 06:13:54] [INFO ] Added : 19 causal constraints over 5 iterations in 66 ms. Result :sat
Minimization took 24 ms.
[2025-06-01 06:13:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-06-01 06:13:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:13:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:13:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:13:54] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 2 ms to minimize.
[2025-06-01 06:13:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2025-06-01 06:13:55] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 8 ms.
[2025-06-01 06:13:55] [INFO ] Added : 13 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 21 ms.
[2025-06-01 06:13:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 06:13:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:13:55] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-01 06:13:55] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:13:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:13:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:13:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 06:13:55] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 06:13:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-01 06:13:55] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2025-06-01 06:13:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2025-06-01 06:13:55] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 7 ms.
[2025-06-01 06:13:55] [INFO ] Added : 13 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 13 ms.
[2025-06-01 06:13:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:13:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:13:55] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 06:13:55] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:13:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 06:13:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 06:13:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 06:13:55] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 06:13:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-06-01 06:13:55] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
[2025-06-01 06:13:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2025-06-01 06:13:55] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 8 ms.
[2025-06-01 06:13:55] [INFO ] Added : 13 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[22, 56, 12, 125, 9, 15, 13, 4, 26, 54] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[419, 56, 12, 125, 10, 15, 19, 8, 26, 54] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 32 transition count 64
Applied a total of 3 rules in 37 ms. Remains 32 /34 variables (removed 2) and now considering 64/66 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 32/34 places, 64/66 transitions.
[2025-06-01 06:13:56] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {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 90 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :[2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 06:13:56] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 32 cols
[2025-06-01 06:13:56] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (3570 resets) in 1120 ms. (892 steps per ms)
FORMULA FunctionPointer-PT-a008-UpperBounds-14 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-09 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-06 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a008-UpperBounds-00 +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 )
[2025-06-01 06:13:58] [INFO ] Flatten gal took : 70 ms
[2025-06-01 06:13:58] [INFO ] Flatten gal took : 21 ms
[2025-06-01 06:13:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9949789258967045328.gal : 13 ms
[2025-06-01 06:13:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11746402621198228839.prop : 1 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/ReachabilityCardinality9949789258967045328.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11746402621198228839.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
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 7405 ms.
BK_STOP 1748758438637
--------------------
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-a008"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is FunctionPointer-PT-a008, 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 r111-smll-174867015800003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a008.tgz
mv FunctionPointer-PT-a008 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.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 ;