About the Execution of ITS-Tools for PolyORBLF-COL-S02J04T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 622.855 | 28082.00 | 43340.00 | 96.70 | 1 5 2 1 1 1 1 2 1 1 1 2 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016700453.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-COL-S02J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016700453
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 8.2K Apr 29 13:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 13:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 13:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 154K May 10 09:34 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-S02J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J04T08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652852277738
Running Version 202205111006
[2022-05-18 05:37:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 05:37:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 05:37:59] [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.
[2022-05-18 05:37:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 05:37:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 692 ms
[2022-05-18 05:37:59] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2022-05-18 05:37:59] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2022-05-18 05:37:59] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 05:37:59] [INFO ] Computed 26 place invariants in 12 ms
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-18 05:37:59] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 05:37:59] [INFO ] Computed 26 place invariants in 10 ms
[2022-05-18 05:37:59] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-18 05:37:59] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2022-05-18 05:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:00] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-05-18 05:38:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2022-05-18 05:38:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 05:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:00] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-18 05:38:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-18 05:38:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2022-05-18 05:38:00] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2022-05-18 05:38:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-18 05:38:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 05:38:00] [INFO ] Added : 41 causal constraints over 9 iterations in 330 ms. Result :sat
Minimization took 32 ms.
[2022-05-18 05:38:00] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 05:38:00] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 05:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:00] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-18 05:38:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 05:38:00] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 05:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:00] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2022-05-18 05:38:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 30 ms returned sat
[2022-05-18 05:38:00] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 05:38:00] [INFO ] Added : 59 causal constraints over 12 iterations in 125 ms. Result :sat
Minimization took 31 ms.
[2022-05-18 05:38:01] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:01] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-18 05:38:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:01] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 25 ms returned sat
[2022-05-18 05:38:01] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2022-05-18 05:38:01] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 0 ms to minimize.
[2022-05-18 05:38:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2022-05-18 05:38:01] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 05:38:01] [INFO ] Added : 58 causal constraints over 12 iterations in 112 ms. Result :sat
Minimization took 21 ms.
[2022-05-18 05:38:01] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:01] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-18 05:38:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:01] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 23 ms returned sat
[2022-05-18 05:38:01] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2022-05-18 05:38:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2022-05-18 05:38:01] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 05:38:01] [INFO ] Added : 58 causal constraints over 12 iterations in 98 ms. Result :sat
Minimization took 21 ms.
[2022-05-18 05:38:01] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:01] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 05:38:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:01] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-18 05:38:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2022-05-18 05:38:02] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 2 ms to minimize.
[2022-05-18 05:38:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2022-05-18 05:38:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-18 05:38:02] [INFO ] Added : 54 causal constraints over 11 iterations in 139 ms. Result :sat
Minimization took 21 ms.
[2022-05-18 05:38:02] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:02] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 05:38:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:02] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2022-05-18 05:38:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 05:38:02] [INFO ] Added : 1 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 13 ms.
[2022-05-18 05:38:02] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:02] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-18 05:38:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:02] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2022-05-18 05:38:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 05:38:02] [INFO ] Added : 6 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 19 ms.
[2022-05-18 05:38:02] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:02] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 05:38:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:02] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-18 05:38:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2022-05-18 05:38:02] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-18 05:38:02] [INFO ] Added : 58 causal constraints over 12 iterations in 104 ms. Result :sat
Minimization took 21 ms.
[2022-05-18 05:38:03] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 10 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:03] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-18 05:38:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:03] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2022-05-18 05:38:03] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2022-05-18 05:38:03] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2022-05-18 05:38:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2022-05-18 05:38:03] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-18 05:38:03] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2022-05-18 05:38:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2022-05-18 05:38:03] [INFO ] Added : 56 causal constraints over 12 iterations in 156 ms. Result :sat
Minimization took 24 ms.
[2022-05-18 05:38:03] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:03] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2022-05-18 05:38:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:03] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2022-05-18 05:38:03] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2022-05-18 05:38:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-05-18 05:38:03] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 05:38:03] [INFO ] Added : 23 causal constraints over 5 iterations in 42 ms. Result :sat
Minimization took 15 ms.
[2022-05-18 05:38:03] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:03] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-18 05:38:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:03] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2022-05-18 05:38:03] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-18 05:38:03] [INFO ] Added : 25 causal constraints over 5 iterations in 83 ms. Result :sat
Minimization took 33 ms.
[2022-05-18 05:38:03] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 05:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:03] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-18 05:38:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 05:38:04] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 12 ms returned sat
[2022-05-18 05:38:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:04] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-18 05:38:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2022-05-18 05:38:04] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-18 05:38:04] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2022-05-18 05:38:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-05-18 05:38:04] [INFO ] Added : 57 causal constraints over 12 iterations in 140 ms. Result :sat
Minimization took 23 ms.
[2022-05-18 05:38:04] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 05:38:04] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2022-05-18 05:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:04] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-18 05:38:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 05:38:04] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 16 ms returned sat
[2022-05-18 05:38:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:04] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-18 05:38:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2022-05-18 05:38:04] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-18 05:38:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2022-05-18 05:38:04] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2022-05-18 05:38:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2022-05-18 05:38:04] [INFO ] Added : 54 causal constraints over 11 iterations in 200 ms. Result :sat
Minimization took 20 ms.
[2022-05-18 05:38:04] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 05:38:04] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 05:38:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:04] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-18 05:38:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2022-05-18 05:38:04] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2022-05-18 05:38:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:04] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-18 05:38:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 17 ms returned sat
[2022-05-18 05:38:04] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-18 05:38:04] [INFO ] Added : 54 causal constraints over 11 iterations in 103 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [2, 2, 8, 8, 8, 1, 20, 2, 1, 2, 28, 2, 8, 1]
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2022-05-18 05:38:04] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 33 ms.
[2022-05-18 05:38:04] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :17
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :11
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :12
[2022-05-18 05:38:05] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2022-05-18 05:38:05] [INFO ] Computed 50 place invariants in 50 ms
[2022-05-18 05:38:05] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-18 05:38:05] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 16 ms returned sat
[2022-05-18 05:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:05] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2022-05-18 05:38:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-18 05:38:05] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 16 ms returned unsat
[2022-05-18 05:38:06] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-18 05:38:06] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 10 ms returned unsat
[2022-05-18 05:38:06] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-18 05:38:06] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 11 ms returned unsat
[2022-05-18 05:38:06] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-18 05:38:06] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 10 ms returned unsat
[2022-05-18 05:38:06] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-18 05:38:06] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 19 ms returned sat
[2022-05-18 05:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:06] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2022-05-18 05:38:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2022-05-18 05:38:06] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 17 ms returned sat
[2022-05-18 05:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:09] [INFO ] [Nat]Absence check using state equation in 2627 ms returned sat
[2022-05-18 05:38:09] [INFO ] State equation strengthened by 96 read => feed constraints.
[2022-05-18 05:38:10] [INFO ] [Nat]Added 96 Read/Feed constraints in 1435 ms returned sat
[2022-05-18 05:38:11] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2022-05-18 05:38:11] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2022-05-18 05:38:11] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 0 ms to minimize.
[2022-05-18 05:38:11] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 0 ms to minimize.
[2022-05-18 05:38:11] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 846 ms
[2022-05-18 05:38:11] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-18 05:38:11] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 11 ms returned unsat
[2022-05-18 05:38:11] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-18 05:38:11] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 10 ms returned unsat
[2022-05-18 05:38:12] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-18 05:38:12] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 29 ms returned sat
[2022-05-18 05:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:12] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2022-05-18 05:38:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-18 05:38:12] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 34 ms returned sat
[2022-05-18 05:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:13] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2022-05-18 05:38:13] [INFO ] [Nat]Added 96 Read/Feed constraints in 642 ms returned sat
[2022-05-18 05:38:13] [INFO ] Computed and/alt/rep : 728/2582/720 causal constraints (skipped 376 transitions) in 98 ms.
[2022-05-18 05:38:15] [INFO ] Added : 73 causal constraints over 15 iterations in 1961 ms. Result :sat
Minimization took 1810 ms.
[2022-05-18 05:38:17] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-18 05:38:17] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 19 ms returned sat
[2022-05-18 05:38:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 05:38:18] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2022-05-18 05:38:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 05:38:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-18 05:38:18] [INFO ] [Nat]Absence check using 14 positive and 36 generalized place invariants in 18 ms returned unsat
[2022-05-18 05:38:18] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2022-05-18 05:38:18] [INFO ] [Real]Absence check using 14 positive and 36 generalized place invariants in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 20, 1, 1, 28, 1, 1] Max seen :[1, 1, 1, 1, 2, 1, 1, 2, 1, 1]
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 16 out of 614 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 612 transition count 1050
Reduce places removed 64 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 72 rules applied. Total rules applied 138 place count 548 transition count 1042
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 146 place count 540 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 146 place count 540 transition count 978
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 274 place count 476 transition count 978
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 5 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 386 place count 420 transition count 922
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 394 place count 420 transition count 914
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 402 place count 412 transition count 914
Applied a total of 402 rules in 236 ms. Remains 412 /614 variables (removed 202) and now considering 914/1114 (removed 200) transitions.
[2022-05-18 05:38:18] [INFO ] Flow matrix only has 898 transitions (discarded 16 similar events)
// Phase 1: matrix 898 rows 412 cols
[2022-05-18 05:38:18] [INFO ] Computed 48 place invariants in 26 ms
[2022-05-18 05:38:19] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 88 transitions.
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 412/614 places, 826/1114 transitions.
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 410 transition count 810
Reduce places removed 16 places and 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 18 place count 394 transition count 794
Applied a total of 18 rules in 27 ms. Remains 394 /412 variables (removed 18) and now considering 794/826 (removed 32) transitions.
Finished structural reductions, in 2 iterations. Remains : 394/614 places, 794/1114 transitions.
Normalized transition count is 778 out of 794 initially.
// Phase 1: matrix 778 rows 394 cols
[2022-05-18 05:38:19] [INFO ] Computed 48 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 378 resets, run finished after 3075 ms. (steps per millisecond=325 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 168 resets, run finished after 1526 ms. (steps per millisecond=655 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000000 steps, including 149 resets, run finished after 1547 ms. (steps per millisecond=646 ) properties (out of 2) seen :4
[2022-05-18 05:38:25] [INFO ] Flow matrix only has 778 transitions (discarded 16 similar events)
// Phase 1: matrix 778 rows 394 cols
[2022-05-18 05:38:25] [INFO ] Computed 48 place invariants in 18 ms
[2022-05-18 05:38:25] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-18 05:38:25] [INFO ] [Real]Absence check using 12 positive and 36 generalized place invariants in 4 ms returned unsat
[2022-05-18 05:38:25] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-05-18 05:38:25] [INFO ] [Real]Absence check using 12 positive and 36 generalized place invariants in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2] Max seen :[2, 2]
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T08-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 26860 ms.
BK_STOP 1652852305820
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-S02J04T08"
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-4028"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J04T08, 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 r168-tall-165277016700453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T08.tgz
mv PolyORBLF-COL-S02J04T08 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 '
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 ;