fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r146-tall-177961073900069
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for FunctionPointer-PT-b004

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
532.659 21455.00 32472.00 100.50 4 inf 0 inf 0 inf 1 inf inf inf inf 4 inf inf inf 0 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961073900069.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is FunctionPointer-PT-b004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961073900069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.8K Mar 7 07:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 7 07:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 07:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 07:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Mar 7 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Mar 7 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 7 07:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 391K Mar 3 18:30 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-b004-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779668162782

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-b004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 00:16:03] [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]
[2026-05-25 00:16:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 00:16:04] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2026-05-25 00:16:04] [INFO ] Transformed 306 places.
[2026-05-25 00:16:04] [INFO ] Transformed 840 transitions.
[2026-05-25 00:16:04] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-15 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] 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, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6859478889546663511.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7610757977607272341.kers'
[2026-05-25 00:16:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6859478889546663511.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7610757977607272341.kers]
Normalized transition count is 414 out of 648 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 414 rows 221 cols 1114 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-25 00:16:04] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7610757977607272341.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, +inf, +inf, +inf, 1, +inf, +inf, +inf, +inf, 4, +inf, +inf, +inf]
RANDOM walk for 10002 steps (12 resets) in 62 ms. (158 steps per ms)
FORMULA FunctionPointer-PT-b004-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110011 steps (32 resets) in 130 ms. (839 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 11, 2, 11, 3, 2, 12, 2, 1, 2, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4, +inf, +inf, +inf]
[2026-05-25 00:16:04] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12738421742091923661.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8216540187274404087.kers'
[2026-05-25 00:16:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12738421742091923661.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8216540187274404087.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 414 rows 221 cols 1114 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-25 00:16:04] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8216540187274404087.kers
Total runtime 2 ms.
[2026-05-25 00:16:04] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2026-05-25 00:16:04] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:16:04] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2026-05-25 00:16:04] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-25 00:16:04] [INFO ] [Real]Added 65 Read/Feed constraints in 11 ms returned sat
[2026-05-25 00:16:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:16:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:05] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:16:05] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2026-05-25 00:16:05] [INFO ] [Nat]Added 65 Read/Feed constraints in 28 ms returned sat
[2026-05-25 00:16:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2026-05-25 00:16:05] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 61 ms.
[2026-05-25 00:16:05] [INFO ] Added : 2 causal constraints over 1 iterations in 137 ms. Result :sat
Minimization took 82 ms.
[2026-05-25 00:16:05] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:16:05] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-25 00:16:05] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-25 00:16:05] [INFO ] [Real]Added 65 Read/Feed constraints in 27 ms returned sat
[2026-05-25 00:16:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:16:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:16:05] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 00:16:05] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2026-05-25 00:16:05] [INFO ] [Nat]Added 65 Read/Feed constraints in 13 ms returned sat
[2026-05-25 00:16:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2026-05-25 00:16:06] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 66 ms.
[2026-05-25 00:16:06] [INFO ] Added : 2 causal constraints over 1 iterations in 139 ms. Result :sat
Minimization took 86 ms.
[2026-05-25 00:16:06] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:16:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 00:16:06] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2026-05-25 00:16:06] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2026-05-25 00:16:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:16:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:16:06] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:16:06] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-25 00:16:06] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2026-05-25 00:16:06] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 40 ms.
[2026-05-25 00:16:06] [INFO ] Added : 2 causal constraints over 1 iterations in 86 ms. Result :sat
Minimization took 81 ms.
[2026-05-25 00:16:06] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 14 ms returned sat
[2026-05-25 00:16:06] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2026-05-25 00:16:07] [INFO ] [Real]Added 65 Read/Feed constraints in 29 ms returned sat
[2026-05-25 00:16:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:16:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-25 00:16:07] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-25 00:16:07] [INFO ] [Nat]Added 65 Read/Feed constraints in 16 ms returned sat
[2026-05-25 00:16:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2026-05-25 00:16:07] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 32 ms.
[2026-05-25 00:16:07] [INFO ] Added : 1 causal constraints over 1 iterations in 110 ms. Result :sat
Minimization took 79 ms.
[2026-05-25 00:16:07] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:16:07] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2026-05-25 00:16:07] [INFO ] [Real]Added 65 Read/Feed constraints in 16 ms returned sat
[2026-05-25 00:16:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:16:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:16:07] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-25 00:16:07] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2026-05-25 00:16:07] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 37 ms.
[2026-05-25 00:16:07] [INFO ] Added : 1 causal constraints over 1 iterations in 89 ms. Result :sat
Minimization took 81 ms.
[2026-05-25 00:16:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:16:08] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-25 00:16:08] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2026-05-25 00:16:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:16:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 00:16:08] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-25 00:16:08] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2026-05-25 00:16:08] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 26 ms.
[2026-05-25 00:16:08] [INFO ] Added : 2 causal constraints over 1 iterations in 75 ms. Result :sat
Minimization took 75 ms.
[2026-05-25 00:16:08] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:16:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:16:08] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-25 00:16:08] [INFO ] [Real]Added 65 Read/Feed constraints in 21 ms returned sat
[2026-05-25 00:16:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:16:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 00:16:08] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-25 00:16:08] [INFO ] [Nat]Added 65 Read/Feed constraints in 13 ms returned sat
[2026-05-25 00:16:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2026-05-25 00:16:08] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 34 ms.
[2026-05-25 00:16:09] [INFO ] Added : 2 causal constraints over 1 iterations in 87 ms. Result :sat
Minimization took 77 ms.
[2026-05-25 00:16:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 00:16:09] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-25 00:16:09] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2026-05-25 00:16:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:16:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:16:09] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-25 00:16:09] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2026-05-25 00:16:09] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 22 ms.
[2026-05-25 00:16:09] [INFO ] Added : 2 causal constraints over 1 iterations in 68 ms. Result :sat
Minimization took 84 ms.
[2026-05-25 00:16:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:09] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:16:09] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-25 00:16:09] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2026-05-25 00:16:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:16:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:16:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 00:16:09] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-25 00:16:09] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2026-05-25 00:16:09] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 27 ms.
[2026-05-25 00:16:09] [INFO ] Added : 2 causal constraints over 1 iterations in 73 ms. Result :sat
Minimization took 78 ms.
[2026-05-25 00:16:10] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:16:10] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:16:10] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-25 00:16:10] [INFO ] [Real]Added 65 Read/Feed constraints in 15 ms returned sat
[2026-05-25 00:16:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:16:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:10] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 00:16:10] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-25 00:16:10] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2026-05-25 00:16:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2026-05-25 00:16:10] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 26 ms.
[2026-05-25 00:16:10] [INFO ] Added : 2 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 78 ms.
[2026-05-25 00:16:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:10] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 00:16:10] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2026-05-25 00:16:10] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2026-05-25 00:16:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:16:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:16:10] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:16:10] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2026-05-25 00:16:10] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2026-05-25 00:16:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2026-05-25 00:16:11] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 28 ms.
[2026-05-25 00:16:11] [INFO ] Added : 1 causal constraints over 1 iterations in 73 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 11, 2, 11, 3, 2, 12, 2, 1, 2, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 11, 2, 11, 3, 2, 12, 2, 1, 2, 10] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4, +inf, +inf, +inf]
Support contains 11 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 191 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.4 ms
Discarding 31 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 191 transition count 605
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 70 place count 165 transition count 451
Iterating global reduction 1 with 26 rules applied. Total rules applied 96 place count 165 transition count 451
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 120 place count 165 transition count 427
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 134 place count 151 transition count 399
Iterating global reduction 2 with 14 rules applied. Total rules applied 148 place count 151 transition count 399
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 153 place count 146 transition count 389
Iterating global reduction 2 with 5 rules applied. Total rules applied 158 place count 146 transition count 389
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 163 place count 141 transition count 369
Iterating global reduction 2 with 5 rules applied. Total rules applied 168 place count 141 transition count 369
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 172 place count 137 transition count 361
Iterating global reduction 2 with 4 rules applied. Total rules applied 176 place count 137 transition count 361
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 180 place count 133 transition count 345
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 133 transition count 345
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 188 place count 129 transition count 329
Iterating global reduction 2 with 4 rules applied. Total rules applied 192 place count 129 transition count 329
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 196 place count 125 transition count 321
Iterating global reduction 2 with 4 rules applied. Total rules applied 200 place count 125 transition count 321
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 204 place count 121 transition count 313
Iterating global reduction 2 with 4 rules applied. Total rules applied 208 place count 121 transition count 313
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 212 place count 117 transition count 305
Iterating global reduction 2 with 4 rules applied. Total rules applied 216 place count 117 transition count 305
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 220 place count 113 transition count 297
Iterating global reduction 2 with 4 rules applied. Total rules applied 224 place count 113 transition count 297
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 227 place count 110 transition count 291
Iterating global reduction 2 with 3 rules applied. Total rules applied 230 place count 110 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 238 place count 110 transition count 283
Applied a total of 238 rules in 140 ms. Remains 110 /222 variables (removed 112) and now considering 283/648 (removed 365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 110/222 places, 283/648 transitions.
[2026-05-25 00:16:11] [INFO ] Flow matrix only has 181 transitions (discarded 102 similar events)
findPositiveTsemiflow completed in 37 ms - Found solution {30=1, 95=1, 132=1, 169=1} and attempted to minimize in 0 ms success -> {26=1, 91=1, 144=1, 179=1}
FORMULA FunctionPointer-PT-b004-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-03 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-09 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-14 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-12 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[4]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16644418776093604413.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11865121651784389431.kers'
[2026-05-25 00:16:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16644418776093604413.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11865121651784389431.kers]
Normalized transition count is 181 out of 283 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 110 cols 518 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-25 00:16:21] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11865121651784389431.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (2 resets) in 1847 ms. (541 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 481 ms. (2074 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2026-05-25 00:16:23] [INFO ] Flow matrix only has 181 transitions (discarded 102 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2903067647208253667.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13338674661570928706.kers'
[2026-05-25 00:16:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2903067647208253667.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13338674661570928706.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 110 cols 518 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-25 00:16:23] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13338674661570928706.kers
Total runtime 1 ms.
[2026-05-25 00:16:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:23] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-25 00:16:23] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-25 00:16:23] [INFO ] [Real]Added 29 Read/Feed constraints in 6 ms returned sat
[2026-05-25 00:16:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:16:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:16:24] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2026-05-25 00:16:24] [INFO ] [Nat]Added 29 Read/Feed constraints in 12 ms returned sat
[2026-05-25 00:16:24] [INFO ] Computed and/alt/rep : 70/390/67 causal constraints (skipped 112 transitions) in 24 ms.
[2026-05-25 00:16:24] [INFO ] Added : 3 causal constraints over 1 iterations in 59 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[4]
FORMULA FunctionPointer-PT-b004-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
All properties solved without resorting to model-checking.
Total runtime 20251 ms.

BK_STOP 1779668184237

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-b004"
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-5973"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b004, 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 r146-tall-177961073900069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b004.tgz
mv FunctionPointer-PT-b004 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;