Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812800549.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is Peterson-COL-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812800549
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 42K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Peterson-COL-2-UpperBounds-00
FORMULA_NAME Peterson-COL-2-UpperBounds-01
FORMULA_NAME Peterson-COL-2-UpperBounds-02
FORMULA_NAME Peterson-COL-2-UpperBounds-03
FORMULA_NAME Peterson-COL-2-UpperBounds-04
FORMULA_NAME Peterson-COL-2-UpperBounds-05
FORMULA_NAME Peterson-COL-2-UpperBounds-06
FORMULA_NAME Peterson-COL-2-UpperBounds-07
FORMULA_NAME Peterson-COL-2-UpperBounds-08
FORMULA_NAME Peterson-COL-2-UpperBounds-09
FORMULA_NAME Peterson-COL-2-UpperBounds-10
FORMULA_NAME Peterson-COL-2-UpperBounds-11
FORMULA_NAME Peterson-COL-2-UpperBounds-12
FORMULA_NAME Peterson-COL-2-UpperBounds-13
FORMULA_NAME Peterson-COL-2-UpperBounds-14
FORMULA_NAME Peterson-COL-2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748921491197

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202505121319
[2025-06-03 03:31:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 03:31:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 03:31:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 03:31:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 03:31:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 514 ms
[2025-06-03 03:31:32] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2025-06-03 03:31:32] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 4 ms.
[2025-06-03 03:31:33] [INFO ] Skeletonized 9 HLPN properties in 1 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2025-06-03 03:31:33] [INFO ] Computed 1 invariants in 4 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 3, 0, 0, 0, 0, 2, 0, 3] Max Struct:[3, 3, 3, 3, 3, 3, 2, 3, 3]
FORMULA Peterson-COL-2-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-2-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-2-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-2-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-03 03:31:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 03:31:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 03:31:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 03:31:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 03:31:33] [INFO ] Added : 12 causal constraints over 4 iterations in 21 ms. Result :sat
Minimization took 6 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 03:31:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 03:31:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-03 03:31:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 03:31:33] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 03:31:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 03:31:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 03:31:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 03:31:33] [INFO ] Added : 11 causal constraints over 4 iterations in 16 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-03 03:31:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 03:31:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 03:31:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 03:31:33] [INFO ] Added : 11 causal constraints over 5 iterations in 13 ms. Result :sat
Minimization took 4 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 03:31:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 03:31:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 03:31:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 03:31:33] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 3 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 03:31:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 03:31:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-03 03:31:33] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 03:31:33] [INFO ] Added : 11 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[3, 3, 3, 3, 3, 3]
Domain [Process(3), Tour(2), Process(3)] of place BeginLoop breaks symmetries in sort Process
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
Arc [2:1*[$i, (MOD (ADD $j 1) 2)]] contains successor/predecessor on variables of sort Tour
[2025-06-03 03:31:33] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 19 ms.
[2025-06-03 03:31:33] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[3, 3, 3, 3, 3, 3]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[3, 3, 3, 3, 3, 3]
[2025-06-03 03:31:33] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2025-06-03 03:31:33] [INFO ] Computed 11 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[3, 3, 3, 3, 3, 3]
RANDOM walk for 10000 steps (2 resets) in 42 ms. (232 steps per ms)
FORMULA Peterson-COL-2-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-2-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-2-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-2-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-2-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-2-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-2-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-2-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 19 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2] Max Struct:[3, 3]
[2025-06-03 03:31:33] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2025-06-03 03:31:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-03 03:31:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-06-03 03:31:33] [INFO ] [Real]Added 22 Read/Feed constraints in 5 ms returned sat
[2025-06-03 03:31:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-03 03:31:33] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 2 ms to minimize.
[2025-06-03 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 673 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:34] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-03 03:31:34] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 03:31:34] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-03 03:31:34] [INFO ] [Real]Added 22 Read/Feed constraints in 4 ms returned sat
[2025-06-03 03:31:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 03:31:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-03 03:31:34] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-03 03:31:34] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-03 03:31:34] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 03:31:34] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 2 ms to minimize.
[2025-06-03 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 144 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2] Max Struct:[1, 2]
FORMULA Peterson-COL-2-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-03 03:31:35] [INFO ] Flatten gal took : 27 ms
[2025-06-03 03:31:35] [INFO ] Flatten gal took : 11 ms
[2025-06-03 03:31:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8600409059711881594.gal : 7 ms
[2025-06-03 03:31:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8364640019086844606.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8600409059711881594.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8364640019086844606.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 2787 ms.

BK_STOP 1748921495162

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Peterson-COL-2, 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 r142-tall-174876812800549"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-2.tgz
mv Peterson-COL-2 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;