Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007200005.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 itstools
Input is FunctionPointer-PT-a002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007200005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K 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-a002-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-a002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748681578193

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-a002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-31 08:53:00] [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-05-31 08:53:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:53:01] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2025-05-31 08:53:01] [INFO ] Transformed 40 places.
[2025-05-31 08:53:01] [INFO ] Transformed 70 transitions.
[2025-05-31 08:53:01] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a002-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a002-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a002-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+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, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 08:53:01] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2025-05-31 08:53:01] [INFO ] Computed 4 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 2, 1, +inf, +inf, +inf, 1, +inf, 2, 1, +inf]
FORMULA FunctionPointer-PT-a002-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (66 resets) in 63 ms. (156 steps per ms)
FORMULA FunctionPointer-PT-a002-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (40 resets) in 115 ms. (431 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 10, 88, 107, 201] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-05-31 08:53:01] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2025-05-31 08:53:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 08:53:01] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-05-31 08:53:01] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2025-05-31 08:53:01] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2025-05-31 08:53:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 08:53:01] [INFO ] [Real]Added 8 Read/Feed constraints in 7 ms returned sat
[2025-05-31 08:53:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 08:53:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-05-31 08:53:01] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 08:53:02] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-05-31 08:53:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:53:02] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 13 ms to minimize.
[2025-05-31 08:53:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2025-05-31 08:53:02] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 24 ms.
[2025-05-31 08:53:02] [INFO ] Added : 14 causal constraints over 4 iterations in 114 ms. Result :sat
Minimization took 42 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 08:53:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-05-31 08:53:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-31 08:53:02] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-05-31 08:53:02] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 08:53:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 08:53:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 08:53:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 08:53:02] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-05-31 08:53:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:53:02] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 6 ms to minimize.
[2025-05-31 08:53:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2025-05-31 08:53:02] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 14 ms.
[2025-05-31 08:53:02] [INFO ] Added : 14 causal constraints over 4 iterations in 93 ms. Result :sat
Minimization took 23 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 08:53:02] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 08:53:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 08:53:02] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-05-31 08:53:02] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-05-31 08:53:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 08:53:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:53:03] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 4 ms to minimize.
[2025-05-31 08:53:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2025-05-31 08:53:03] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 10 ms.
[2025-05-31 08:53:03] [INFO ] Added : 2 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 11 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 08:53:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-05-31 08:53:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 08:53:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 27 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:53:03] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 5 ms to minimize.
[2025-05-31 08:53:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2025-05-31 08:53:03] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 9 ms.
[2025-05-31 08:53:03] [INFO ] Added : 2 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 17 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 08:53:03] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-05-31 08:53:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 08:53:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-05-31 08:53:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 08:53:03] [INFO ] Computed and/alt/rep : 25/101/23 causal constraints (skipped 21 transitions) in 11 ms.
[2025-05-31 08:53:03] [INFO ] Added : 19 causal constraints over 7 iterations in 86 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 10, 88, 107, 201] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 10, 89, 108, 454] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 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 28 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 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 60
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 28 transition count 58
Applied a total of 9 rules in 31 ms. Remains 28 /34 variables (removed 6) and now considering 58/66 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 28/34 places, 58/66 transitions.
[2025-05-31 08:53:05] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 4=1, 6=1, 20=1, 30=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 20=1, 30=1, 40=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :[5, 6, 3, 4, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 10, 89, 108, 454] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-05-31 08:53:05] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
// Phase 1: matrix 41 rows 28 cols
[2025-05-31 08:53:05] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5, 10, 89, 108, 454] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1147 ms. (871 steps per ms)
BEST_FIRST walk for 5000003 steps (10 resets) in 1908 ms. (2619 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6834, 4123, 18873, 18873, 22222] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-05-31 08:53:08] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
[2025-05-31 08:53:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 08:53:08] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 08:53:08] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 08:53:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-31 08:53:08] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2025-05-31 08:53:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 08:53:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 08:53:08] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 08:53:08] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2025-05-31 08:53:08] [INFO ] Computed and/alt/rep : 23/91/21 causal constraints (skipped 18 transitions) in 7 ms.
[2025-05-31 08:53:08] [INFO ] Added : 13 causal constraints over 5 iterations in 57 ms. Result :sat
Minimization took 21 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 08:53:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 08:53:08] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-05-31 08:53:08] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2025-05-31 08:53:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 08:53:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 08:53:08] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-31 08:53:08] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2025-05-31 08:53:08] [INFO ] Computed and/alt/rep : 23/91/21 causal constraints (skipped 18 transitions) in 7 ms.
[2025-05-31 08:53:08] [INFO ] Added : 6 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 18 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 08:53:08] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 08:53:08] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-05-31 08:53:08] [INFO ] [Real]Added 7 Read/Feed constraints in 2 ms returned sat
[2025-05-31 08:53:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 08:53:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 08:53:08] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-05-31 08:53:08] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2025-05-31 08:53:08] [INFO ] Computed and/alt/rep : 23/91/21 causal constraints (skipped 18 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:53:08] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 4 ms to minimize.
[2025-05-31 08:53:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2025-05-31 08:53:08] [INFO ] Added : 4 causal constraints over 2 iterations in 108 ms. Result :sat
Minimization took 16 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 08:53:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 08:53:08] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-05-31 08:53:08] [INFO ] [Real]Added 7 Read/Feed constraints in 2 ms returned sat
[2025-05-31 08:53:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 08:53:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 08:53:08] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-05-31 08:53:09] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2025-05-31 08:53:09] [INFO ] Computed and/alt/rep : 23/91/21 causal constraints (skipped 18 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:53:09] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:53:09] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 4 ms to minimize.
[2025-05-31 08:53:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2025-05-31 08:53:09] [INFO ] Added : 4 causal constraints over 2 iterations in 172 ms. Result :sat
Minimization took 15 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 08:53:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-05-31 08:53:09] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 08:53:09] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2025-05-31 08:53:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 08:53:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-05-31 08:53:09] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 08:53:09] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2025-05-31 08:53:09] [INFO ] Computed and/alt/rep : 23/91/21 causal constraints (skipped 18 transitions) in 10 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:53:09] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 3 ms to minimize.
[2025-05-31 08:53:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2025-05-31 08:53:09] [INFO ] Added : 4 causal constraints over 2 iterations in 110 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6834, 4123, 18873, 18873, 22222] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6834, 4141, 18874, 18880, 22227] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 58/58 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 28/28 places, 58/58 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 58/58 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2025-05-31 08:53:56] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
[2025-05-31 08:53:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:53:56] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-31 08:53:56] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
[2025-05-31 08:53:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 08:53:56] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-31 08:53:56] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 08:53:57] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2025-05-31 08:53:57] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
[2025-05-31 08:53:57] [INFO ] Invariant cache hit.
[2025-05-31 08:53:57] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 41/69 variables, 28/31 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 08:53:57] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 0/69 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 39 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1859 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 41/69 variables, 28/32 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 56/95 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 95 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1932 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 28/28 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3865ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 3874ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4050 ms. Remains : 28/28 places, 58/58 transitions.
[2025-05-31 08:54:00] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 4=1, 6=1, 20=1, 30=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {3=1, 20=1, 30=1, 40=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :[2147483647, 2147483647, 2147483647, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-05-31 08:54:01] [INFO ] Flow matrix only has 41 transitions (discarded 17 similar events)
[2025-05-31 08:54:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1010 ms. (989 steps per ms)
FORMULA FunctionPointer-PT-a002-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-09 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-a002-UpperBounds-04 +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-05-31 08:54:02] [INFO ] Flatten gal took : 46 ms
[2025-05-31 08:54:02] [INFO ] Flatten gal took : 14 ms
[2025-05-31 08:54:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12854685743560021116.gal : 9 ms
[2025-05-31 08:54:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18340083500247865190.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12854685743560021116.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18340083500247865190.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
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 61802 ms.

BK_STOP 1748681642525

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-a002"
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-5832"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-a002, 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 r100-smll-174867007200005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a002.tgz
mv FunctionPointer-PT-a002 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 ;