Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524700541.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 Murphy-COL-D2N100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524700541
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 20K 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 Murphy-COL-D2N100-UpperBounds-00
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-01
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-02
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-03
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-04
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-05
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-06
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-07
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-08
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-09
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-10
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-11
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-12
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-13
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-14
FORMULA_NAME Murphy-COL-D2N100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749299095982

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D2N100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-07 12:24:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 12:24:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 12:24:59] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-07 12:24:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-07 12:25:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1289 ms
[2025-06-07 12:25:00] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 18 PT places and 21.0 transition bindings in 43 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Reduction of identical properties reduced properties to check from 16 to 5
[2025-06-07 12:25:00] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 11 ms.
[2025-06-07 12:25:00] [INFO ] Skeletonized 5 HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 6 cols
[2025-06-07 12:25:00] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 300, 0, 3, 3] Max Struct:[+inf, 303, +inf, 303, 303]
[2025-06-07 12:25:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:00] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-07 12:25:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-07 12:25:01] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2025-06-07 12:25:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-07 12:25:01] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-07 12:25:01] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Real]Added 2 Read/Feed constraints in 4 ms returned sat
[2025-06-07 12:25:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2025-06-07 12:25:01] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 12:25:01] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-07 12:25:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-07 12:25:01] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-07 12:25:01] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 7 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-07 12:25:01] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-07 12:25:01] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2025-06-07 12:25:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2025-06-07 12:25:01] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-07 12:25:01] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-07 12:25:01] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-07 12:25:01] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2025-06-07 12:25:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2025-06-07 12:25:01] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-07 12:25:01] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 300, 0, 3, 3] Max Struct:[+inf, 303, +inf, 303, 303]
Arc [0:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2025-06-07 12:25:01] [INFO ] Unfolded HLPN to a Petri net with 18 places and 21 transitions 81 arcs in 26 ms.
[2025-06-07 12:25:01] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 300, 0, 3, 3] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 300, 0, 3, 3] Max Struct:[+inf, 303, +inf, 303, 303]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 300, 0, 3, 3] Max Struct:[+inf, 303, +inf, 303, 303]
// Phase 1: matrix 21 rows 18 cols
[2025-06-07 12:25:01] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 300, 0, 3, 3] Max Struct:[+inf, 303, +inf, 303, 303]
RANDOM walk for 10044 steps (2 resets) in 34 ms. (286 steps per ms)
FORMULA Murphy-COL-D2N100-UpperBounds-12 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D2N100-UpperBounds-11 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D2N100-UpperBounds-07 303 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 75 ms. (394 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 301, 6] Max Struct:[+inf, 303, +inf]
[2025-06-07 12:25:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:01] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-07 12:25:01] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-07 12:25:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-07 12:25:02] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-07 12:25:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-07 12:25:02] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2025-06-07 12:25:02] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-07 12:25:02] [INFO ] Added : 2 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 11 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-07 12:25:02] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-07 12:25:02] [INFO ] [Real]Added 6 Read/Feed constraints in 5 ms returned sat
[2025-06-07 12:25:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-07 12:25:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-07 12:25:02] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-07 12:25:02] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2025-06-07 12:25:02] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-07 12:25:02] [INFO ] Added : 5 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-07 12:25:02] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-07 12:25:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-07 12:25:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:02] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-07 12:25:02] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-07 12:25:02] [INFO ] [Nat]Added 6 Read/Feed constraints in 8 ms returned sat
[2025-06-07 12:25:02] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-07 12:25:02] [INFO ] Added : 2 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 301, 6] Max Struct:[+inf, 303, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 301, 6] Max Struct:[+inf, 303, +inf]
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 17 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-07 12:25:02] [INFO ] Invariant cache hit.
[2025-06-07 12:25:02] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1066ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 1080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1116 ms. Remains : 18/18 places, 21/21 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {10=1, 13=1, 19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {10=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :[3, 300, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 301, 6] Max Struct:[+inf, 303, +inf]
[2025-06-07 12:25:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 301, 6] Max Struct:[+inf, 303, +inf]
RANDOM walk for 1000035 steps (2 resets) in 785 ms. (1272 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 1989 ms. (1507 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 301, 6] Max Struct:[+inf, 303, +inf]
[2025-06-07 12:25:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 12:25:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:06] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-07 12:25:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-07 12:25:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 12:25:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:06] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-07 12:25:06] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-07 12:25:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-07 12:25:06] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2025-06-07 12:25:06] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-07 12:25:06] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 9 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 12:25:06] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-07 12:25:06] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-07 12:25:06] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-07 12:25:06] [INFO ] [Real]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-07 12:25:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 12:25:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:06] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-07 12:25:06] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-07 12:25:06] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2025-06-07 12:25:06] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-07 12:25:06] [INFO ] Added : 5 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 12:25:07] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:07] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-07 12:25:07] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-07 12:25:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 12:25:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:07] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-07 12:25:07] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-07 12:25:07] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2025-06-07 12:25:07] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-07 12:25:07] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 301, 6] Max Struct:[+inf, 303, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 301, 6] Max Struct:[+inf, 303, +inf]
Support contains 9 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 3 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-07 12:25:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:25:07] [INFO ] Implicit Places using invariants in 59 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 65 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 71 ms. Remains : 15/18 places, 21/21 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {9=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {9=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :[3, 300, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 301, 6] Max Struct:[+inf, 303, +inf]
// Phase 1: matrix 21 rows 15 cols
[2025-06-07 12:25:07] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 301, 6] Max Struct:[+inf, 303, +inf]
RANDOM walk for 1000088 steps (2 resets) in 476 ms. (2096 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 1514 ms. (1980 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 301, 6] Max Struct:[+inf, 303, +inf]
[2025-06-07 12:25:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 12:25:09] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-07 12:25:09] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-07 12:25:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 12:25:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-07 12:25:09] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-07 12:25:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-07 12:25:09] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-07 12:25:09] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 12:25:09] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 9 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 12:25:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-07 12:25:09] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-07 12:25:09] [INFO ] [Real]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-07 12:25:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 12:25:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-07 12:25:09] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-07 12:25:09] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-07 12:25:09] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-07 12:25:09] [INFO ] Added : 5 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 12 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 12:25:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-07 12:25:09] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-07 12:25:09] [INFO ] [Real]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-07 12:25:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-07 12:25:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-07 12:25:09] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-07 12:25:09] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2025-06-07 12:25:09] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-07 12:25:09] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 301, 6] Max Struct:[+inf, 303, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 301, 6] Max Struct:[+inf, 303, +inf]
Support contains 9 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-07 12:25:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:25:09] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-07 12:25:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:25:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-07 12:25:09] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 12:25:09] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-07 12:25:09] [INFO ] Invariant cache hit.
[2025-06-07 12:25:09] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 778ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 779ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 881 ms. Remains : 15/15 places, 21/21 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {9=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :[3, 300, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 301, 6] Max Struct:[+inf, 303, +inf]
RANDOM walk for 40049 steps (8 resets) in 388 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 225 ms. (177 steps per ms) remains 4/4 properties
[2025-06-07 12:25:10] [INFO ] Flatten gal took : 41 ms
[2025-06-07 12:25:10] [INFO ] Flatten gal took : 9 ms
[2025-06-07 12:25:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18270053997003811057.gal : 9 ms
[2025-06-07 12:25:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1853844337989594356.prop : 2 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/ReachabilityCardinality18270053997003811057.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1853844337989594356.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40003 steps (8 resets) in 299 ms. (133 steps per ms) remains 4/4 properties
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 ...329
Loading property file /tmp/ReachabilityCardinality1853844337989594356.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :36 after 69
BEST_FIRST walk for 40003 steps (8 resets) in 409 ms. (97 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :69 after 217326
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :217326 after 1.82617e+06
Interrupted probabilistic random walk after 278776 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 4
Probabilistic random walk after 278776 steps, saw 180032 distinct states, run finished after 3006 ms. (steps per millisecond=92 ) properties seen :0
[2025-06-07 12:25:14] [INFO ] Invariant cache hit.
[2025-06-07 12:25:14] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 12:25:14] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 8 ms to minimize.
Problem MAX1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 21/33 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/36 variables, 3/23 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 1 solved, 3 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 21/33 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem MIN1 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 1/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/36 variables, 3/24 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 2/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 26 constraints, problems are : Problem set: 2 solved, 2 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 312ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 9 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 9 transition count 12
Applied a total of 4 rules in 15 ms. Remains 9 /15 variables (removed 6) and now considering 12/21 (removed 9) transitions.
Running 9 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 9 cols
[2025-06-07 12:25:14] [INFO ] Computed 0 invariants in 0 ms
[2025-06-07 12:25:14] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/21 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 12 constraints, problems are : Problem set: 0 solved, 9 unsolved in 117 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/21 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 21 constraints, problems are : Problem set: 0 solved, 9 unsolved in 160 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 293ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 9/15 places, 12/21 transitions.
RANDOM walk for 40002 steps (8 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
Probably explored full state space saw : 216 states, properties seen :0
Probabilistic random walk after 1080 steps, saw 216 distinct states, run finished after 14 ms. (steps per millisecond=77 ) properties seen :0
Explored full state space saw : 216 states, properties seen :0
Exhaustive walk after 1080 steps, saw 216 distinct states, run finished after 7 ms. (steps per millisecond=154 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Murphy-COL-D2N100-UpperBounds-09 6 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N100-UpperBounds-15 6 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N100-UpperBounds-06 6 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N100-UpperBounds-02 301 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N100-UpperBounds-05 301 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N100-UpperBounds-10 301 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N100-UpperBounds-13 301 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N100-UpperBounds-01 301 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N100-UpperBounds-03 3 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N100-UpperBounds-04 3 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N100-UpperBounds-08 3 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N100-UpperBounds-14 3 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N100-UpperBounds-00 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 16249 ms.

BK_STOP 1749299115105

--------------------
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="Murphy-COL-D2N100"
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 Murphy-COL-D2N100, 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 r128-smll-174876524700541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D2N100.tgz
mv Murphy-COL-D2N100 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 ;