About the Execution of ITS-Tools for Murphy-COL-D4N050
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-177969913900053.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-D4N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969913900053
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.1K Mar 8 14:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 8 14:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Mar 8 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 8 14:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 17 06:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 17 06:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 17 06:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 17 06:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 8 14:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 8 14:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 8 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 8 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 17 06:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 17 06:57 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-D4N050-UpperBounds-00
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-01
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-02
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-03
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-04
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-05
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-06
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-07
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-08
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-09
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-10
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-11
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-12
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-13
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-14
FORMULA_NAME Murphy-COL-D4N050-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779707926907
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-D4N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-25 11:18:48] [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 11:18:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:18:48] [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 11:18:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-25 11:18:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 495 ms
[2026-05-25 11:18:48] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 30 PT places and 35.0 transition bindings in 17 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 11:18:48] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2026-05-25 11:18:48] [INFO ] Skeletonized 6 HLPN properties in 1 ms.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12764372746416553127.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16842563457493682249.kers'
[2026-05-25 11:18:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12764372746416553127.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16842563457493682249.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 11:18:48] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16842563457493682249.kers
Total runtime 1 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[5, 0, 0, 5, 250, 15] Max Struct:[255, +inf, +inf, 255, 255, +inf]
[2026-05-25 11:18:48] [INFO ] Invariant cache hit.
[2026-05-25 11:18:48] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2026-05-25 11:18:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2026-05-25 11:18:48] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2026-05-25 11:18:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 11:18:48] [INFO ] [Real]Added 2 Read/Feed constraints in 4 ms returned sat
[2026-05-25 11:18:48] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:18:48] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 10 ms.
[2026-05-25 11:18:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:18:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-25 11:18:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:18:49] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:18:49] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:18:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:18:49] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:18:49] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:18:49] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2026-05-25 11:18:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2026-05-25 11:18:49] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:18:49] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:18:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:18:49] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 11:18:49] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[5, 0, 0, 5, 250, 15] Max Struct:[255, +inf, +inf, 255, 255, +inf]
Arc [2:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2026-05-25 11:18:49] [INFO ] Unfolded HLPN to a Petri net with 30 places and 35 transitions 135 arcs in 13 ms.
[2026-05-25 11:18:49] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[5, 0, 0, 5, 250, 15] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[5, 0, 0, 5, 250, 15] Max Struct:[255, +inf, +inf, 255, 255, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[5, 0, 0, 5, 250, 15] Max Struct:[255, +inf, +inf, 255, 255, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15799412951600451666.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12140269633629436746.kers'
[2026-05-25 11:18:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15799412951600451666.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12140269633629436746.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 35 rows 25 cols 85 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-25 11:18:49] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12140269633629436746.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 0, 0, 5, 250, 15] Max Struct:[255, +inf, +inf, 255, 255, +inf]
RANDOM walk for 10041 steps (2 resets) in 20 ms. (478 steps per ms)
BEST_FIRST walk for 60006 steps (12 resets) in 68 ms. (869 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[215, 5, 10, 215, 253, 15] Max Struct:[255, +inf, +inf, 255, 255, +inf]
[2026-05-25 11:18:49] [INFO ] Invariant cache hit.
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 0 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 11:18:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 11:18:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 11:18:49] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:18:49] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:18:49] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 17 ms.
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 11:18:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 0 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:18:49] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 11:18:49] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-25 11:18:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:18:49] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:18:49] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2026-05-25 11:18:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2026-05-25 11:18:49] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:18:49] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 19 ms.
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 5 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:49] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:18:50] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-25 11:18:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:18:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-25 11:18:50] [INFO ] Added : 5 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2026-05-25 11:18:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:50] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:18:50] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 11:18:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:18:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:18:50] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:18:50] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-25 11:18:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:18:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:18:50] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[215, 5, 10, 215, 253, 15] Max Struct:[255, +inf, +inf, 255, 255, +inf]
FORMULA Murphy-COL-D4N050-UpperBounds-04 255 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-COL-D4N050-UpperBounds-09 255 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-COL-D4N050-UpperBounds-14 255 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-COL-D4N050-UpperBounds-03 255 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-COL-D4N050-UpperBounds-06 255 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-COL-D4N050-UpperBounds-00 255 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 10, 253, 15] Max Struct:[+inf, +inf, 255, +inf]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2026-05-25 11:18:50] [INFO ] Invariant cache hit.
[2026-05-25 11:18:50] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 46 constraints, problems are : Problem set: 0 solved, 20 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 66 constraints, problems are : Problem set: 0 solved, 20 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1025ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1033ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1062 ms. Remains : 30/30 places, 35/35 transitions.
findPositiveTsemiflow completed in 23 ms - Found solution {19=1, 24=1, 34=1} and attempted to minimize in 0 ms success -> {17=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 10, 253, 15] Max Struct:[+inf, +inf, 255, +inf]
[2026-05-25 11:19:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 10, 253, 15] Max Struct:[+inf, +inf, 255, +inf]
RANDOM walk for 1000006 steps (2 resets) in 535 ms. (1865 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 1924 ms. (2077 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 10, 253, 15] Max Struct:[+inf, +inf, 255, +inf]
[2026-05-25 11:19:03] [INFO ] Invariant cache hit.
[2026-05-25 11:19:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:19:03] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-25 11:19:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:19:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 11:19:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 11:19:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:19:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:19:04] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
[2026-05-25 11:19:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-25 11:19:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:19:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2026-05-25 11:19:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:19:04] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2026-05-25 11:19:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:19:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:19:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:19:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:19:04] [INFO ] Added : 5 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2026-05-25 11:19:04] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 11:19:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:19:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 1 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-25 11:19:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:19:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:19:04] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 10, 253, 15] Max Struct:[+inf, +inf, 255, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 10, 253, 15] Max Struct:[+inf, +inf, 255, +inf]
Support contains 20 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2026-05-25 11:19:04] [INFO ] Invariant cache hit.
[2026-05-25 11:19:04] [INFO ] Implicit Places using invariants in 36 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 39 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41 ms. Remains : 25/30 places, 35/35 transitions.
findPositiveTsemiflow completed in 8 ms - Found solution {19=1} and attempted to minimize in 0 ms success -> {19=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 10, 253, 15] Max Struct:[+inf, +inf, 255, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11550656013829961041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11070209935846585862.kers'
[2026-05-25 11:19:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11550656013829961041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11070209935846585862.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 35 rows 25 cols 85 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-25 11:19:14] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11070209935846585862.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 10, 253, 15] Max Struct:[+inf, +inf, 255, +inf]
RANDOM walk for 1000025 steps (2 resets) in 464 ms. (2150 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 1603 ms. (2493 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 10, 253, 15] Max Struct:[+inf, +inf, 255, +inf]
[2026-05-25 11:19:16] [INFO ] Invariant cache hit.
[2026-05-25 11:19:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:19:16] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 11:19:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:19:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:19:16] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2026-05-25 11:19:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 11:19:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:19:16] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:19:16] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2026-05-25 11:19:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:19:16] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 11:19:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:19:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:19:16] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-25 11:19:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:19:16] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:19:16] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2026-05-25 11:19:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:19:16] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-25 11:19:16] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2026-05-25 11:19:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:19:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:19:16] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-25 11:19:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:19:16] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 11:19:16] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 10 ms.
[2026-05-25 11:19:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 11:19:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 11:19:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 11:19:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 11:19:16] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 11:19:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:19:16] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 11:19:16] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 10, 253, 15] Max Struct:[+inf, +inf, 255, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 10, 253, 15] Max Struct:[+inf, +inf, 255, +inf]
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2026-05-25 11:19:16] [INFO ] Invariant cache hit.
[2026-05-25 11:19:16] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-25 11:19:16] [INFO ] Invariant cache hit.
[2026-05-25 11:19:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 11:19:16] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2026-05-25 11:19:16] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2026-05-25 11:19:16] [INFO ] Invariant cache hit.
[2026-05-25 11:19:16] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 540ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 540ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 597 ms. Remains : 25/25 places, 35/35 transitions.
findPositiveTsemiflow completed in 10 ms - Found solution {19=1} and attempted to minimize in 0 ms success -> {19=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 10, 253, 15] Max Struct:[+inf, +inf, 255, +inf]
RANDOM walk for 40092 steps (8 resets) in 285 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
[2026-05-25 11:19:27] [INFO ] Flatten gal took : 56 ms
[2026-05-25 11:19:27] [INFO ] Flatten gal took : 10 ms
[2026-05-25 11:19:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10168640342374725073.gal : 8 ms
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
[2026-05-25 11:19:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4033809605851480093.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10168640342374725073.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4033809605851480093.prop' '--nowitness' '--gen-order' 'FOLLOW'
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/ReachabilityCardinality4033809605851480093.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :36 after 90
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :90 after 192
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :192 after 30630
BEST_FIRST walk for 40002 steps (8 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :30630 after 243534
Interrupted probabilistic random walk after 432582 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 5
Probabilistic random walk after 432582 steps, saw 299582 distinct states, run finished after 3004 ms. (steps per millisecond=144 ) properties seen :0
[2026-05-25 11:19:30] [INFO ] Invariant cache hit.
[2026-05-25 11:19:30] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem MAX2 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 35/60 variables, 25/32 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 10/42 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 42 constraints, problems are : Problem set: 1 solved, 4 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 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/20 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 35/60 variables, 25/34 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 10/44 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem MIN2 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 4/48 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 48 constraints, problems are : Problem set: 2 solved, 3 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 486ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 15 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 7 ms. Remains 15 /25 variables (removed 10) and now considering 20/35 (removed 15) transitions.
Running 15 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-15534679203460436802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7467236775959008987.kers'
[2026-05-25 11:19:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15534679203460436802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7467236775959008987.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 15 cols 45 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-25 11:19:31] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7467236775959008987.kers
Total runtime 0 ms.
[2026-05-25 11:19:31] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 5/35 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 20 constraints, problems are : Problem set: 0 solved, 15 unsolved in 110 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 5/35 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 145 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 261ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 262ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 15/25 places, 20/35 transitions.
RANDOM walk for 40001 steps (8 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
Probably explored full state space saw : 7776 states, properties seen :0
Probabilistic random walk after 59616 steps, saw 7776 distinct states, run finished after 173 ms. (steps per millisecond=344 ) properties seen :0
Explored full state space saw : 7776 states, properties seen :0
Exhaustive walk after 59616 steps, saw 7776 distinct states, run finished after 98 ms. (steps per millisecond=608 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Murphy-COL-D4N050-UpperBounds-01 5 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-13 10 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-02 10 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-08 253 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-10 253 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-11 253 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-12 253 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-05 253 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-15 15 TECHNIQUES REACHABILITY_MIN
FORMULA Murphy-COL-D4N050-UpperBounds-07 15 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-5996609005392815265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10089237376802886157.kers'
[2026-05-25 11:19:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5996609005392815265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10089237376802886157.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 35 rows 25 cols 85 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-25 11:19:31] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10089237376802886157.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (2 resets) in 410 ms. (2433 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 44360 ms.
BK_STOP 1779707972455
--------------------
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-D4N050"
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-D4N050, 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-177969913900053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Murphy-COL-D4N050.tgz
mv Murphy-COL-D4N050 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 ;