Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r268-smll-171654407100205.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
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 r268-smll-171654407100205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.1K Apr 12 02:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 12 02:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 02:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 02:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 02:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 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

here is the order used to build the result vector(from text 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 1716730815503

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 202405141337
[2024-05-26 13:40:17] [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]
[2024-05-26 13:40:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 13:40:18] [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.
[2024-05-26 13:40:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 13:40:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1277 ms
[2024-05-26 13:40:19] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 38 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-05-26 13:40:19] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2024-05-26 13:40:19] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2024-05-26 13:40:19] [INFO ] Computed 1 invariants in 6 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 2, 0, 3, 0, 0, 0] Max Struct:[3, 3, 3, 2, 3, 3, 3, 3, 3]
FORMULA Peterson-COL-2-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-2-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-2-UpperBounds-08 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-09 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-2-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-2-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-26 13:40:19] [INFO ] Invariant cache hit.
[2024-05-26 13:40:19] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-26 13:40:19] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-26 13:40:20] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-26 13:40:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 13:40:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 13:40:20] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-26 13:40:20] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-26 13:40:20] [INFO ] Added : 11 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 19 ms.
[2024-05-26 13:40:20] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-26 13:40:20] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-26 13:40:20] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-26 13:40:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 13:40:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 13:40:20] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-26 13:40:20] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 13:40:20] [INFO ] Added : 11 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2024-05-26 13:40:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 13:40:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 13:40:20] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 13:40:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 13:40:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 13:40:20] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-26 13:40:20] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 13:40:20] [INFO ] Added : 12 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 11 ms.
[2024-05-26 13:40:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 13:40:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-26 13:40:20] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 13:40:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 13:40:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 13:40:20] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-26 13:40:20] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-26 13:40:20] [INFO ] Added : 11 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 9 ms.
[2024-05-26 13:40:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 13:40:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-26 13:40:20] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-26 13:40:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 13:40:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-26 13:40:20] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-26 13:40:20] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 13:40:20] [INFO ] Added : 11 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2024-05-26 13:40:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 13:40:20] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-26 13:40:20] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 13:40:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 13:40:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 13:40:20] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-26 13:40:20] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-26 13:40:20] [INFO ] Added : 11 causal constraints over 5 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2024-05-26 13:40:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 13:40:21] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-26 13:40:21] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 13:40:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 13:40:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-26 13:40:21] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-26 13:40:21] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-26 13:40:21] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[3, 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
[2024-05-26 13:40:21] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 50 ms.
[2024-05-26 13:40:21] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 12 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +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, 0] Max Struct:[3, 3, 3, 3, 3, 3, 3]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[3, 3, 3, 3, 3, 3, 3]
[2024-05-26 13:40:21] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2024-05-26 13:40:21] [INFO ] Computed 11 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[3, 3, 3, 3, 3, 3, 3]
RANDOM walk for 10000 steps (2 resets) in 92 ms. (107 steps per ms)
FORMULA Peterson-COL-2-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-2-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-2-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-2-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-2-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 59 ms. (333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1] Max Struct:[3, 3]
[2024-05-26 13:40:21] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2024-05-26 13:40:21] [INFO ] Invariant cache hit.
[2024-05-26 13:40:21] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-26 13:40:21] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-26 13:40:21] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-05-26 13:40:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-26 13:40:21] [INFO ] [Real]Added 22 Read/Feed constraints in 11 ms returned sat
[2024-05-26 13:40:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 13:40:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-26 13:40:21] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-26 13:40:21] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-26 13:40:21] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2024-05-26 13:40:21] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 17 ms.
[2024-05-26 13:40:22] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 21 ms to minimize.
[2024-05-26 13:40:22] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-26 13:40:22] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-26 13:40:22] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 3 ms to minimize.
[2024-05-26 13:40:22] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 4 ms to minimize.
[2024-05-26 13:40:22] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-26 13:40:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 699 ms
[2024-05-26 13:40:22] [INFO ] Added : 84 causal constraints over 18 iterations in 1050 ms. Result :sat
Minimization took 69 ms.
[2024-05-26 13:40:22] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-26 13:40:22] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-26 13:40:22] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-26 13:40:22] [INFO ] [Real]Added 22 Read/Feed constraints in 6 ms returned sat
[2024-05-26 13:40:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 13:40:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-26 13:40:23] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-26 13:40:23] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-26 13:40:23] [INFO ] [Nat]Added 22 Read/Feed constraints in 11 ms returned sat
[2024-05-26 13:40:23] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-05-26 13:40:23] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 3 ms to minimize.
[2024-05-26 13:40:23] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-26 13:40:23] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-26 13:40:23] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 4 ms to minimize.
[2024-05-26 13:40:23] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-26 13:40:23] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 4 ms to minimize.
[2024-05-26 13:40:23] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 3 ms to minimize.
[2024-05-26 13:40:23] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 2 ms to minimize.
[2024-05-26 13:40:23] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-26 13:40:23] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-26 13:40:23] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-26 13:40:24] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-05-26 13:40:24] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-26 13:40:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 986 ms
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1] Max Struct:[3, 1]
FORMULA Peterson-COL-2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-COL-2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[3]
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 102 transition count 114
Reduce places removed 12 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 24 rules applied. Total rules applied 36 place count 90 transition count 102
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 48 place count 78 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 48 place count 78 transition count 90
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 72 place count 66 transition count 90
Applied a total of 72 rules in 64 ms. Remains 66 /102 variables (removed 36) and now considering 90/126 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 66/102 places, 90/126 transitions.
[2024-05-26 13:40:24] [INFO ] Flow matrix only has 84 transitions (discarded 6 similar events)
// Phase 1: matrix 84 rows 66 cols
[2024-05-26 13:40:24] [INFO ] Computed 11 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[3]
FORMULA Peterson-COL-2-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1224 ms. (816 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:[]
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 )
[2024-05-26 13:40:25] [INFO ] Flatten gal took : 55 ms
[2024-05-26 13:40:25] [INFO ] Flatten gal took : 25 ms
[2024-05-26 13:40:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16926646747494780288.gal : 14 ms
[2024-05-26 13:40:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7270872706731485043.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16926646747494780288.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7270872706731485043.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
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 8060 ms.

BK_STOP 1716730825886

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-5568"
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 r268-smll-171654407100205"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;