Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445400189.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-COL-S06J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445400189
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 17:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 11 17:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 17:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 17:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S06J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J04T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716856144191

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 00:29:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 00:29:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 00:29:06] [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-28 00:29:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 00:29:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 949 ms
[2024-05-28 00:29:07] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 810 PT places and 14100.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2024-05-28 00:29:07] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-28 00:29:07] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 00:29:07] [INFO ] Computed 26 invariants in 13 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 1, 6, 5, 1, 1, 8, 1, 8, 4, 8, 1, 3, 1, 1, 5]
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 00:29:07] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 00:29:07] [INFO ] Computed 26 invariants in 11 ms
[2024-05-28 00:29:07] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-05-28 00:29:07] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2024-05-28 00:29:07] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-28 00:29:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:29:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 00:29:07] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:29:07] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-28 00:29:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-28 00:29:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-28 00:29:07] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 00:29:07] [INFO ] Added : 26 causal constraints over 6 iterations in 70 ms. Result :sat
Minimization took 31 ms.
[2024-05-28 00:29:07] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:29:07] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:29:07] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-28 00:29:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:29:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 00:29:07] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:29:07] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-28 00:29:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2024-05-28 00:29:07] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 16 ms to minimize.
[2024-05-28 00:29:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-28 00:29:07] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-28 00:29:08] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-28 00:29:08] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 00:29:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2024-05-28 00:29:08] [INFO ] Added : 58 causal constraints over 12 iterations in 182 ms. Result :sat
Minimization took 27 ms.
[2024-05-28 00:29:08] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-28 00:29:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:29:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-28 00:29:08] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 00:29:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-28 00:29:08] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-28 00:29:08] [INFO ] Added : 28 causal constraints over 6 iterations in 50 ms. Result :sat
Minimization took 23 ms.
[2024-05-28 00:29:08] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-28 00:29:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:29:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-28 00:29:08] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 00:29:08] [INFO ] Added : 54 causal constraints over 11 iterations in 85 ms. Result :sat
Minimization took 24 ms.
[2024-05-28 00:29:08] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-28 00:29:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:29:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-28 00:29:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 35 ms returned sat
[2024-05-28 00:29:08] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-28 00:29:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-28 00:29:08] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 00:29:09] [INFO ] Added : 43 causal constraints over 10 iterations in 115 ms. Result :sat
Minimization took 49 ms.
[2024-05-28 00:29:09] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 00:29:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 19 ms returned sat
[2024-05-28 00:29:09] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-28 00:29:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:29:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 00:29:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 00:29:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-28 00:29:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 34 ms returned sat
[2024-05-28 00:29:09] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 00:29:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-28 00:29:09] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 00:29:09] [INFO ] Added : 20 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 40 ms.
[2024-05-28 00:29:09] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:29:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:29:09] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-28 00:29:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:29:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:29:09] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:29:09] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-28 00:29:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 23 ms returned sat
[2024-05-28 00:29:09] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-28 00:29:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-28 00:29:09] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 00:29:09] [INFO ] Added : 44 causal constraints over 9 iterations in 102 ms. Result :sat
Minimization took 54 ms.
[2024-05-28 00:29:09] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2024-05-28 00:29:09] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 00:29:09] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-28 00:29:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:29:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 00:29:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:29:10] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-28 00:29:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2024-05-28 00:29:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-28 00:29:10] [INFO ] Added : 58 causal constraints over 13 iterations in 394 ms. Result :sat
Minimization took 141 ms.
[2024-05-28 00:29:10] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 00:29:10] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:29:10] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-28 00:29:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:29:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:29:10] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-28 00:29:10] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-28 00:29:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2024-05-28 00:29:10] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-28 00:29:10] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-28 00:29:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-28 00:29:10] [INFO ] Added : 28 causal constraints over 6 iterations in 101 ms. Result :sat
Minimization took 34 ms.
[2024-05-28 00:29:11] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 00:29:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 00:29:11] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-28 00:29:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:29:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 00:29:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:29:11] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-28 00:29:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 00:29:11] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 00:29:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-28 00:29:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-28 00:29:11] [INFO ] Added : 20 causal constraints over 4 iterations in 64 ms. Result :sat
Minimization took 33 ms.
[2024-05-28 00:29:11] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-28 00:29:11] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2024-05-28 00:29:11] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-28 00:29:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:29:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-05-28 00:29:11] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:29:11] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2024-05-28 00:29:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 18 ms returned sat
[2024-05-28 00:29:11] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 00:29:11] [INFO ] Added : 30 causal constraints over 7 iterations in 86 ms. Result :sat
Minimization took 107 ms.
[2024-05-28 00:29:12] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Real]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-28 00:29:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:29:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-28 00:29:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 00:29:12] [INFO ] Added : 62 causal constraints over 13 iterations in 119 ms. Result :sat
Minimization took 50 ms.
[2024-05-28 00:29:12] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-28 00:29:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:29:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 17 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2024-05-28 00:29:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-28 00:29:12] [INFO ] Added : 31 causal constraints over 7 iterations in 55 ms. Result :sat
Minimization took 33 ms.
[2024-05-28 00:29:12] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-28 00:29:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 00:29:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-28 00:29:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 13 ms returned sat
[2024-05-28 00:29:12] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 00:29:13] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 00:29:13] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-28 00:29:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2024-05-28 00:29:13] [INFO ] Added : 56 causal constraints over 12 iterations in 282 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 6, 5, 1, 8, 1, 8, 4, 8, 1, 3, 1, 1, 5]
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
[2024-05-28 00:29:13] [INFO ] Unfolded HLPN to a Petri net with 810 places and 14014 transitions 118428 arcs in 318 ms.
[2024-05-28 00:29:13] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +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, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 6, 5, 1, 8, 1, 8, 4, 8, 1, 3, 1, 1, 5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 6, 5, 1, 8, 1, 8, 4, 8, 1, 3, 1, 1, 5]
[2024-05-28 00:29:13] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
// Phase 1: matrix 3206 rows 810 cols
[2024-05-28 00:29:13] [INFO ] Computed 58 invariants in 206 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[8, 6, 5, 1, 8, 1, 8, 4, 8, 1, 3, 1, 1, 5]
RANDOM walk for 10000 steps (66 resets) in 229 ms. (43 steps per ms)
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-08 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60004 steps (173 resets) in 395 ms. (151 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1] Max Struct:[8, 6, 5, 8, 5]
[2024-05-28 00:29:14] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
[2024-05-28 00:29:14] [INFO ] Invariant cache hit.
[2024-05-28 00:29:14] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-28 00:29:14] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 53 ms returned unsat
[2024-05-28 00:29:15] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-28 00:29:15] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 79 ms returned unsat
[2024-05-28 00:29:15] [INFO ] [Real]Absence check using 19 positive place invariants in 34 ms returned sat
[2024-05-28 00:29:15] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 72 ms returned unsat
[2024-05-28 00:29:15] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-28 00:29:15] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 27 ms returned unsat
[2024-05-28 00:29:15] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-28 00:29:15] [INFO ] [Real]Absence check using 19 positive and 39 generalized place invariants in 26 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1] Max Struct:[1, 1, 1, 1, 1]
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T08-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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 9900 ms.
ITS solved all properties within timeout

BK_STOP 1716856155896

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

+ 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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="PolyORBLF-COL-S06J04T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-COL-S06J04T08, 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 r289-tajo-171654445400189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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