About the Execution of ITS-Tools for Murphy-COL-D2N050
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r194-tall-177969913800021.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is Murphy-COL-D2N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969913800021
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 5.6K Mar 8 14:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 8 14:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 8 14:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 8 14:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 17 09:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 17 09:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 17 09:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 17 09:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Mar 8 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 8 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 8 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Mar 8 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 17 09:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 17 09:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 20K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-00
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-01
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-02
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-03
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-04
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-05
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-06
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-07
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-08
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-09
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-10
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-11
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-12
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-13
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-14
FORMULA_NAME Murphy-COL-D2N050-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779700702329
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-D2N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-25 09:18:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:18:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:18:23] [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.
[2026-05-25 09:18:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-25 09:18:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 521 ms
[2026-05-25 09:18:24] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 18 PT places and 21.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 6
[2026-05-25 09:18:24] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2026-05-25 09:18:24] [INFO ] Skeletonized 6 HLPN properties in 0 ms.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8000504943172896753.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15163647068271380120.kers'
[2026-05-25 09:18:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8000504943172896753.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15163647068271380120.kers]
Normalized transition count is 6 out of 7 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 6 rows 4 cols 11 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 09:18:24] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15163647068271380120.kers
Total runtime 0 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[3, 9, 0, 150, 0, 3] Max Struct:[153, +inf, +inf, 153, +inf, 153]
[2026-05-25 09:18:24] [INFO ] Invariant cache hit.
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-25 09:18:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 09:18:24] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2026-05-25 09:18:24] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:18:24] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 16 ms.
[2026-05-25 09:18:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:18:24] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Added 2 Read/Feed constraints in 0 ms returned sat
[2026-05-25 09:18:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:18:24] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Added 2 Read/Feed constraints in 0 ms returned sat
[2026-05-25 09:18:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:18:24] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2026-05-25 09:18:24] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:18:24] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:18:24] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2026-05-25 09:18:24] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:18:24] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2026-05-25 09:18:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 0 ms.
[2026-05-25 09:18:24] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[3, 9, 0, 150, 0, 3] Max Struct:[153, +inf, +inf, 153, +inf, 153]
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2026-05-25 09:18:24] [INFO ] Unfolded HLPN to a Petri net with 18 places and 21 transitions 81 arcs in 11 ms.
[2026-05-25 09:18:24] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[3, 9, 0, 150, 0, 3] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3, 9, 0, 150, 0, 3] Max Struct:[153, +inf, +inf, 153, +inf, 153]
Current structural bounds on expressions (Before main loop) : Max Seen:[3, 9, 0, 150, 0, 3] Max Struct:[153, +inf, +inf, 153, +inf, 153]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14545484565222710996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14886778749800367670.kers'
[2026-05-25 09:18:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14545484565222710996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14886778749800367670.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 21 rows 15 cols 51 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 09:18:24] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14886778749800367670.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 9, 0, 150, 0, 3] Max Struct:[153, +inf, +inf, 153, +inf, 153]
RANDOM walk for 10006 steps (2 resets) in 16 ms. (588 steps per ms)
FORMULA Murphy-COL-D2N050-UpperBounds-08 153 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D2N050-UpperBounds-06 153 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D2N050-UpperBounds-09 153 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D2N050-UpperBounds-10 153 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D2N050-UpperBounds-00 153 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 48 ms. (816 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 6, 151, 3] Max Struct:[+inf, +inf, 153, +inf]
[2026-05-25 09:18:24] [INFO ] Invariant cache hit.
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 0 ms returned sat
[2026-05-25 09:18:24] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 09:18:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 09:18:24] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:18:25] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
[2026-05-25 09:18:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 09:18:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:18:25] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 09:18:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:18:25] [INFO ] Added : 5 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2026-05-25 09:18:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-25 09:18:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:18:25] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:25] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:18:25] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 6, 151, 3] Max Struct:[+inf, +inf, 153, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 6, 151, 3] Max Struct:[+inf, +inf, 153, +inf]
Support contains 12 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 9 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2026-05-25 09:18:25] [INFO ] Invariant cache hit.
[2026-05-25 09:18:25] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 1/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 261 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 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
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 1/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 282 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 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 563ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 570ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 600 ms. Remains : 18/18 places, 21/21 transitions.
findPositiveTsemiflow completed in 13 ms - Found solution {10=1, 13=1, 19=1} and attempted to minimize in 1 ms success -> {10=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[9, 6, 151, 3] Max Struct:[+inf, +inf, 153, +inf]
[2026-05-25 09:18:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9, 6, 151, 3] Max Struct:[+inf, +inf, 153, +inf]
RANDOM walk for 1000000 steps (2 resets) in 390 ms. (2557 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 1408 ms. (2838 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 6, 151, 3] Max Struct:[+inf, +inf, 153, +inf]
[2026-05-25 09:18:37] [INFO ] Invariant cache hit.
[2026-05-25 09:18:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 0 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:18:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 09:18:37] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 0 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:37] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:18:37] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2026-05-25 09:18:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 0 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 09:18:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 0 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:37] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:18:37] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 09:18:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 0 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 09:18:37] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:37] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:18:37] [INFO ] Added : 5 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2026-05-25 09:18:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:38] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 09:18:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-25 09:18:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:38] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 09:18:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 09:18:38] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:38] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:18:38] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 6, 151, 3] Max Struct:[+inf, +inf, 153, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 6, 151, 3] Max Struct:[+inf, +inf, 153, +inf]
Support contains 12 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 1 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 1 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 1 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2026-05-25 09:18:38] [INFO ] Invariant cache hit.
[2026-05-25 09:18:38] [INFO ] Implicit Places using invariants in 33 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 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 0 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 37 ms. Remains : 15/18 places, 21/21 transitions.
findPositiveTsemiflow completed in 8 ms - Found solution {9=1} and attempted to minimize in 1 ms success -> {9=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[9, 6, 151, 3] Max Struct:[+inf, +inf, 153, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4195685918417909907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1821705815917127616.kers'
[2026-05-25 09:18:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4195685918417909907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1821705815917127616.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 21 rows 15 cols 51 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 09:18:48] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1821705815917127616.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[9, 6, 151, 3] Max Struct:[+inf, +inf, 153, +inf]
RANDOM walk for 1000009 steps (2 resets) in 315 ms. (3164 steps per ms)
BEST_FIRST walk for 4000003 steps (8 resets) in 1167 ms. (3424 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 6, 151, 3] Max Struct:[+inf, +inf, 153, +inf]
[2026-05-25 09:18:49] [INFO ] Invariant cache hit.
[2026-05-25 09:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:49] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 09:18:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 09:18:49] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:49] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-25 09:18:49] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:49] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 09:18:49] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 09:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:49] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-25 09:18:49] [INFO ] [Real]Added 6 Read/Feed constraints in 2 ms returned sat
[2026-05-25 09:18:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 09:18:49] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:49] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 09:18:49] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2026-05-25 09:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:18:49] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 09:18:49] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 09:18:49] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:49] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 09:18:49] [INFO ] Added : 5 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2026-05-25 09:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:18:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 09:18:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:18:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 09:18:50] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 09:18:50] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2026-05-25 09:18:50] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 09:18:50] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 6, 151, 3] Max Struct:[+inf, +inf, 153, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 6, 151, 3] Max Struct:[+inf, +inf, 153, +inf]
Support contains 12 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 3 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 3 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 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2026-05-25 09:18:50] [INFO ] Invariant cache hit.
[2026-05-25 09:18:50] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 09:18:50] [INFO ] Invariant cache hit.
[2026-05-25 09:18:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-25 09:18:50] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2026-05-25 09:18:50] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2026-05-25 09:18:50] [INFO ] Invariant cache hit.
[2026-05-25 09:18:50] [INFO ] State equation strengthened by 6 read => feed constraints.
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 122 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
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 170 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 296ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 297ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 376 ms. Remains : 15/15 places, 21/21 transitions.
findPositiveTsemiflow completed in 9 ms - Found solution {9=1} and attempted to minimize in 1 ms success -> {9=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[9, 6, 151, 3] Max Struct:[+inf, +inf, 153, +inf]
RANDOM walk for 40095 steps (8 resets) in 287 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
[2026-05-25 09:19:00] [INFO ] Flatten gal took : 27 ms
[2026-05-25 09:19:00] [INFO ] Flatten gal took : 3 ms
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
[2026-05-25 09:19:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12410809287936430613.gal : 4 ms
[2026-05-25 09:19:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8936256977213923093.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12410809287936430613.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8936256977213923093.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8936256977213923093.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 36
BEST_FIRST walk for 40002 steps (8 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :36 after 27216
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :27216 after 242742
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :242742 after 6.73294e+06
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :6.73294e+06 after 5.3497e+07
Interrupted probabilistic random walk after 322179 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 5
Probabilistic random walk after 322179 steps, saw 207729 distinct states, run finished after 3004 ms. (steps per millisecond=107 ) properties seen :0
[2026-05-25 09:19:03] [INFO ] Invariant cache hit.
[2026-05-25 09:19:03] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MAX2 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 21/36 variables, 15/18 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 6/24 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 24 constraints, problems are : Problem set: 1 solved, 4 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem MIN2 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 4/29 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/36 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 29 constraints, problems are : Problem set: 2 solved, 3 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 264ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 9 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.0 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 6 ms. Remains 9 /15 variables (removed 6) and now considering 12/21 (removed 9) transitions.
Running 9 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7323456634777243742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1361971234000465878.kers'
[2026-05-25 09:19:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7323456634777243742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1361971234000465878.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 12 rows 9 cols 27 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-25 09:19:04] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1361971234000465878.kers
Total runtime 1 ms.
[2026-05-25 09:19:04] [INFO ] State equation strengthened by 3 read => feed constraints.
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 71 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
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 193 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 272ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 272ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 9/15 places, 12/21 transitions.
RANDOM walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 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 7 ms. (steps per millisecond=154 ) 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 6 ms. (steps per millisecond=180 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Murphy-COL-D2N050-UpperBounds-02 9 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N050-UpperBounds-07 9 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N050-UpperBounds-01 9 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N050-UpperBounds-11 6 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N050-UpperBounds-12 6 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N050-UpperBounds-15 6 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N050-UpperBounds-03 6 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N050-UpperBounds-13 151 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N050-UpperBounds-14 151 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N050-UpperBounds-04 151 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D2N050-UpperBounds-05 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-724808794335565960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13241669556848307222.kers'
[2026-05-25 09:19:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-724808794335565960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13241669556848307222.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 21 rows 15 cols 51 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 09:19:04] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13241669556848307222.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000038 steps (2 resets) in 277 ms. (3597 steps per ms)
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:[]
All properties solved without resorting to model-checking.
Total runtime 41342 ms.
BK_STOP 1779700744900
--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Murphy-COL-D2N050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is Murphy-COL-D2N050, 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 r194-tall-177969913800021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D2N050.tgz
mv Murphy-COL-D2N050 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;