About the Execution of ITS-Tools for PolyORBLF-COL-S06J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16223.396 | 3600000.00 | 2681386.00 | 524953.70 | 4 1 1 2 1 1 1 1 1 10 3 1 1 3 ? 6 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r293-tall-167873945400453.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBLF-COL-S06J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945400453
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 14:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 14:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K Mar 5 18:23 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-S06J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S06J04T06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678865266314
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T06
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-15 07:27:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 07:27:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:27:49] [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.
[2023-03-15 07:27:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 07:27:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 509 ms
[2023-03-15 07:27:50] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 632 PT places and 10560.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-15 07:27:50] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2023-03-15 07:27:50] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 64 out of 65 initially.
// Phase 1: matrix 64 rows 81 cols
[2023-03-15 07:27:50] [INFO ] Computed 26 place invariants in 15 ms
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-15 07:27:50] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-15 07:27:50] [INFO ] Computed 26 place invariants in 2 ms
[2023-03-15 07:27:50] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-15 07:27:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-15 07:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:50] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-15 07:27:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-15 07:27:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-15 07:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:50] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-15 07:27:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-15 07:27:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2023-03-15 07:27:50] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 07:27:50] [INFO ] Added : 32 causal constraints over 7 iterations in 142 ms. Result :sat
Minimization took 40 ms.
[2023-03-15 07:27:50] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 07:27:50] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 07:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:50] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 07:27:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:50] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 07:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:50] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-15 07:27:50] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-15 07:27:51] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 5 ms to minimize.
[2023-03-15 07:27:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-15 07:27:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-15 07:27:51] [INFO ] Added : 37 causal constraints over 8 iterations in 81 ms. Result :sat
Minimization took 18 ms.
[2023-03-15 07:27:51] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:51] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-15 07:27:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:51] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-15 07:27:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 07:27:51] [INFO ] Added : 59 causal constraints over 13 iterations in 115 ms. Result :sat
Minimization took 20 ms.
[2023-03-15 07:27:51] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:51] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-15 07:27:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:51] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-15 07:27:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 07:27:51] [INFO ] Added : 6 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 20 ms.
[2023-03-15 07:27:51] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:51] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-15 07:27:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:51] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-15 07:27:51] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2023-03-15 07:27:51] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 07:27:52] [INFO ] Added : 50 causal constraints over 10 iterations in 75 ms. Result :sat
Minimization took 18 ms.
[2023-03-15 07:27:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 07:27:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:52] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-15 07:27:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 07:27:52] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 07:27:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-15 07:27:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:52] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 22 ms returned sat
[2023-03-15 07:27:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 07:27:52] [INFO ] Added : 22 causal constraints over 5 iterations in 39 ms. Result :sat
Minimization took 15 ms.
[2023-03-15 07:27:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 07:27:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-15 07:27:52] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2023-03-15 07:27:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-15 07:27:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 07:27:52] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2023-03-15 07:27:52] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 2 ms to minimize.
[2023-03-15 07:27:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2023-03-15 07:27:52] [INFO ] Added : 53 causal constraints over 11 iterations in 178 ms. Result :sat
Minimization took 21 ms.
[2023-03-15 07:27:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 1 ms returned unsat
[2023-03-15 07:27:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 8 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-15 07:27:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:52] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-15 07:27:52] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-15 07:27:52] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 07:27:53] [INFO ] Added : 55 causal constraints over 11 iterations in 96 ms. Result :sat
Minimization took 28 ms.
[2023-03-15 07:27:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-15 07:27:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:53] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2023-03-15 07:27:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 07:27:53] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2023-03-15 07:27:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-15 07:27:53] [INFO ] Added : 54 causal constraints over 11 iterations in 135 ms. Result :sat
Minimization took 22 ms.
[2023-03-15 07:27:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:53] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-15 07:27:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:53] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-15 07:27:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 07:27:53] [INFO ] Added : 31 causal constraints over 7 iterations in 61 ms. Result :sat
Minimization took 18 ms.
[2023-03-15 07:27:53] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 07:27:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:53] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-15 07:27:53] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 07:27:53] [INFO ] Added : 30 causal constraints over 7 iterations in 53 ms. Result :sat
Minimization took 85 ms.
[2023-03-15 07:27:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-15 07:27:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 07:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:53] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-15 07:27:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 24 ms returned sat
[2023-03-15 07:27:54] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2023-03-15 07:27:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-15 07:27:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 07:27:54] [INFO ] Added : 22 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 30 ms.
[2023-03-15 07:27:54] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:54] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-15 07:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-15 07:27:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-15 07:27:54] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 2 ms returned sat
[2023-03-15 07:27:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:54] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-15 07:27:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 5 ms returned sat
[2023-03-15 07:27:54] [INFO ] Computed and/alt/rep : 64/119/63 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 07:27:54] [INFO ] Added : 52 causal constraints over 11 iterations in 105 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [41, 1, 1, 2, 1, 1, 1, 1, 10, 3, 6, 1, 3, 6, 6]
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
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
[2023-03-15 07:27:54] [INFO ] Unfolded HLPN to a Petri net with 632 places and 10500 transitions 88770 arcs in 148 ms.
[2023-03-15 07:27:54] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 14) seen :28
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :13
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :14
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :11
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :13
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-15 07:27:54] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2023-03-15 07:27:54] [INFO ] Computed 54 place invariants in 124 ms
[2023-03-15 07:27:55] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-15 07:27:55] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 33 ms returned unsat
[2023-03-15 07:27:55] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-15 07:27:55] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 42 ms returned unsat
[2023-03-15 07:27:55] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-15 07:27:55] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 41 ms returned sat
[2023-03-15 07:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:56] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2023-03-15 07:27:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:27:56] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-15 07:27:56] [INFO ] [Nat]Absence check using 18 positive and 36 generalized place invariants in 44 ms returned sat
[2023-03-15 07:27:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:27:57] [INFO ] [Nat]Absence check using state equation in 1086 ms returned sat
[2023-03-15 07:27:57] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-15 07:28:00] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 07:28:01] [INFO ] [Nat]Added 168 Read/Feed constraints in 3774 ms returned unknown
Current structural bounds on expressions (after SMT) : [4, 1, 6] Max seen :[4, 1, 4]
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-COL-S06J04T06-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 36 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 626 transition count 2376
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 114 place count 572 transition count 2376
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 114 place count 572 transition count 2304
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 258 place count 500 transition count 2304
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 402 place count 428 transition count 2232
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 414 place count 428 transition count 2220
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 426 place count 416 transition count 2220
Applied a total of 426 rules in 365 ms. Remains 416 /632 variables (removed 216) and now considering 2220/2430 (removed 210) transitions.
[2023-03-15 07:28:01] [INFO ] Flow matrix only has 2184 transitions (discarded 36 similar events)
// Phase 1: matrix 2184 rows 416 cols
[2023-03-15 07:28:01] [INFO ] Computed 48 place invariants in 71 ms
[2023-03-15 07:28:02] [INFO ] Dead Transitions using invariants and state equation in 972 ms found 918 transitions.
Found 918 dead transitions using SMT.
Drop transitions removed 918 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 918 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 416/632 places, 1302/2430 transitions.
Applied a total of 0 rules in 32 ms. Remains 416 /416 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1374 ms. Remains : 416/632 places, 1302/2430 transitions.
Normalized transition count is 1266 out of 1302 initially.
// Phase 1: matrix 1266 rows 416 cols
[2023-03-15 07:28:02] [INFO ] Computed 48 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 11712 resets, run finished after 5459 ms. (steps per millisecond=183 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 2124 resets, run finished after 2464 ms. (steps per millisecond=405 ) properties (out of 1) seen :4
[2023-03-15 07:28:10] [INFO ] Flow matrix only has 1266 transitions (discarded 36 similar events)
// Phase 1: matrix 1266 rows 416 cols
[2023-03-15 07:28:10] [INFO ] Computed 48 place invariants in 27 ms
[2023-03-15 07:28:10] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-15 07:28:10] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 15 ms returned sat
[2023-03-15 07:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:28:10] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2023-03-15 07:28:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:28:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-15 07:28:11] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 16 ms returned sat
[2023-03-15 07:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:28:11] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2023-03-15 07:28:11] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-15 07:28:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 07:28:17] [INFO ] [Nat]Added 168 Read/Feed constraints in 6012 ms returned unknown
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Support contains 36 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1302/1302 transitions.
Applied a total of 0 rules in 23 ms. Remains 416 /416 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 416/416 places, 1302/1302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1302/1302 transitions.
Applied a total of 0 rules in 22 ms. Remains 416 /416 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2023-03-15 07:28:17] [INFO ] Flow matrix only has 1266 transitions (discarded 36 similar events)
[2023-03-15 07:28:17] [INFO ] Invariant cache hit.
[2023-03-15 07:28:17] [INFO ] Implicit Places using invariants in 427 ms returned [352, 353, 354, 355, 356, 357]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 432 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 410/416 places, 1302/1302 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 404 transition count 1296
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 404 transition count 1296
Applied a total of 12 rules in 41 ms. Remains 404 /410 variables (removed 6) and now considering 1296/1302 (removed 6) transitions.
[2023-03-15 07:28:18] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
// Phase 1: matrix 1260 rows 404 cols
[2023-03-15 07:28:18] [INFO ] Computed 42 place invariants in 17 ms
[2023-03-15 07:28:18] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-15 07:28:18] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-15 07:28:18] [INFO ] Invariant cache hit.
[2023-03-15 07:28:18] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-15 07:28:26] [INFO ] Implicit Places using invariants and state equation in 8523 ms returned []
Implicit Place search using SMT with State Equation took 8905 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 404/416 places, 1296/1302 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9402 ms. Remains : 404/416 places, 1296/1302 transitions.
Normalized transition count is 1260 out of 1296 initially.
// Phase 1: matrix 1260 rows 404 cols
[2023-03-15 07:28:26] [INFO ] Computed 42 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 11649 resets, run finished after 5361 ms. (steps per millisecond=186 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 2070 resets, run finished after 2297 ms. (steps per millisecond=435 ) properties (out of 1) seen :4
[2023-03-15 07:28:34] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
// Phase 1: matrix 1260 rows 404 cols
[2023-03-15 07:28:34] [INFO ] Computed 42 place invariants in 32 ms
[2023-03-15 07:28:34] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-15 07:28:34] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-15 07:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:28:35] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2023-03-15 07:28:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:28:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-15 07:28:35] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-15 07:28:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:28:35] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2023-03-15 07:28:35] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-15 07:28:37] [INFO ] [Nat]Added 168 Read/Feed constraints in 1528 ms returned sat
[2023-03-15 07:28:37] [INFO ] Deduced a trap composed of 50 places in 263 ms of which 1 ms to minimize.
[2023-03-15 07:28:38] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 0 ms to minimize.
[2023-03-15 07:28:39] [INFO ] Deduced a trap composed of 50 places in 241 ms of which 1 ms to minimize.
[2023-03-15 07:28:39] [INFO ] Deduced a trap composed of 50 places in 269 ms of which 1 ms to minimize.
[2023-03-15 07:28:39] [INFO ] Deduced a trap composed of 182 places in 237 ms of which 1 ms to minimize.
[2023-03-15 07:28:41] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 0 ms to minimize.
[2023-03-15 07:28:42] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2023-03-15 07:28:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5123 ms
[2023-03-15 07:28:42] [INFO ] Computed and/alt/rep : 750/4031/745 causal constraints (skipped 509 transitions) in 101 ms.
[2023-03-15 07:28:44] [INFO ] Added : 119 causal constraints over 24 iterations in 1991 ms. Result :sat
Minimization took 1728 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[4]
Support contains 36 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 22 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 404/404 places, 1296/1296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 22 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
[2023-03-15 07:28:48] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-15 07:28:48] [INFO ] Invariant cache hit.
[2023-03-15 07:28:48] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-15 07:28:48] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-15 07:28:48] [INFO ] Invariant cache hit.
[2023-03-15 07:28:49] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-15 07:28:57] [INFO ] Implicit Places using invariants and state equation in 8132 ms returned []
Implicit Place search using SMT with State Equation took 8606 ms to find 0 implicit places.
[2023-03-15 07:28:57] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-15 07:28:57] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-15 07:28:57] [INFO ] Invariant cache hit.
[2023-03-15 07:28:57] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9247 ms. Remains : 404/404 places, 1296/1296 transitions.
Starting property specific reduction for PolyORBLF-COL-S06J04T06-UpperBounds-14
Normalized transition count is 1260 out of 1296 initially.
// Phase 1: matrix 1260 rows 404 cols
[2023-03-15 07:28:57] [INFO ] Computed 42 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 123 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :4
[2023-03-15 07:28:57] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
// Phase 1: matrix 1260 rows 404 cols
[2023-03-15 07:28:57] [INFO ] Computed 42 place invariants in 25 ms
[2023-03-15 07:28:57] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-15 07:28:57] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-15 07:28:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:28:58] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2023-03-15 07:28:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:28:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-15 07:28:58] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-15 07:28:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:28:58] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2023-03-15 07:28:58] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-15 07:29:00] [INFO ] [Nat]Added 168 Read/Feed constraints in 1523 ms returned sat
[2023-03-15 07:29:00] [INFO ] Deduced a trap composed of 50 places in 255 ms of which 0 ms to minimize.
[2023-03-15 07:29:01] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2023-03-15 07:29:02] [INFO ] Deduced a trap composed of 50 places in 240 ms of which 1 ms to minimize.
[2023-03-15 07:29:02] [INFO ] Deduced a trap composed of 50 places in 243 ms of which 1 ms to minimize.
[2023-03-15 07:29:02] [INFO ] Deduced a trap composed of 182 places in 249 ms of which 1 ms to minimize.
[2023-03-15 07:29:03] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 3052 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 36 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 25 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
[2023-03-15 07:29:03] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-15 07:29:03] [INFO ] Invariant cache hit.
[2023-03-15 07:29:04] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 577 ms. Remains : 404/404 places, 1296/1296 transitions.
Normalized transition count is 1260 out of 1296 initially.
// Phase 1: matrix 1260 rows 404 cols
[2023-03-15 07:29:04] [INFO ] Computed 42 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 11631 resets, run finished after 5419 ms. (steps per millisecond=184 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2171 resets, run finished after 2322 ms. (steps per millisecond=430 ) properties (out of 1) seen :4
[2023-03-15 07:29:11] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
// Phase 1: matrix 1260 rows 404 cols
[2023-03-15 07:29:11] [INFO ] Computed 42 place invariants in 34 ms
[2023-03-15 07:29:12] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-15 07:29:12] [INFO ] [Real]Absence check using 17 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-15 07:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:29:12] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2023-03-15 07:29:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:29:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-15 07:29:12] [INFO ] [Nat]Absence check using 17 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-15 07:29:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:29:12] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2023-03-15 07:29:12] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-15 07:29:14] [INFO ] [Nat]Added 168 Read/Feed constraints in 1580 ms returned sat
[2023-03-15 07:29:14] [INFO ] Deduced a trap composed of 50 places in 237 ms of which 1 ms to minimize.
[2023-03-15 07:29:15] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 0 ms to minimize.
[2023-03-15 07:29:16] [INFO ] Deduced a trap composed of 50 places in 258 ms of which 1 ms to minimize.
[2023-03-15 07:29:16] [INFO ] Deduced a trap composed of 50 places in 250 ms of which 1 ms to minimize.
[2023-03-15 07:29:17] [INFO ] Deduced a trap composed of 182 places in 246 ms of which 1 ms to minimize.
[2023-03-15 07:29:18] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 1 ms to minimize.
[2023-03-15 07:29:19] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 0 ms to minimize.
[2023-03-15 07:29:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5150 ms
[2023-03-15 07:29:19] [INFO ] Computed and/alt/rep : 750/4031/745 causal constraints (skipped 509 transitions) in 68 ms.
[2023-03-15 07:29:21] [INFO ] Added : 119 causal constraints over 24 iterations in 2032 ms. Result :sat
Minimization took 1708 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 36 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 23 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 404/404 places, 1296/1296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 1296/1296 transitions.
Applied a total of 0 rules in 18 ms. Remains 404 /404 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
[2023-03-15 07:29:25] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-15 07:29:25] [INFO ] Invariant cache hit.
[2023-03-15 07:29:26] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-15 07:29:26] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-15 07:29:26] [INFO ] Invariant cache hit.
[2023-03-15 07:29:26] [INFO ] State equation strengthened by 168 read => feed constraints.
[2023-03-15 07:29:35] [INFO ] Implicit Places using invariants and state equation in 9385 ms returned []
Implicit Place search using SMT with State Equation took 9764 ms to find 0 implicit places.
[2023-03-15 07:29:35] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 07:29:35] [INFO ] Flow matrix only has 1260 transitions (discarded 36 similar events)
[2023-03-15 07:29:35] [INFO ] Invariant cache hit.
[2023-03-15 07:29:36] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10357 ms. Remains : 404/404 places, 1296/1296 transitions.
Ending property specific reduction for PolyORBLF-COL-S06J04T06-UpperBounds-14 in 38529 ms.
[2023-03-15 07:29:36] [INFO ] Flatten gal took : 160 ms
[2023-03-15 07:29:36] [INFO ] Applying decomposition
[2023-03-15 07:29:36] [INFO ] Flatten gal took : 127 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5266303532143980274.txt' '-o' '/tmp/graph5266303532143980274.bin' '-w' '/tmp/graph5266303532143980274.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5266303532143980274.bin' '-l' '-1' '-v' '-w' '/tmp/graph5266303532143980274.weights' '-q' '0' '-e' '0.001'
[2023-03-15 07:29:36] [INFO ] Decomposing Gal with order
[2023-03-15 07:29:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:29:37] [INFO ] Removed a total of 960 redundant transitions.
[2023-03-15 07:29:37] [INFO ] Flatten gal took : 352 ms
[2023-03-15 07:29:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 391 labels/synchronizations in 40 ms.
[2023-03-15 07:29:37] [INFO ] Time to serialize gal into /tmp/UpperBounds10729548289082075206.gal : 20 ms
[2023-03-15 07:29:37] [INFO ] Time to serialize properties into /tmp/UpperBounds11534645965207435348.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10729548289082075206.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11534645965207435348.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds11534645965207435348.prop.
Detected timeout of ITS tools.
[2023-03-15 07:50:31] [INFO ] Applying decomposition
[2023-03-15 07:50:32] [INFO ] Flatten gal took : 280 ms
[2023-03-15 07:50:32] [INFO ] Decomposing Gal with order
[2023-03-15 07:50:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:50:32] [INFO ] Removed a total of 6427 redundant transitions.
[2023-03-15 07:50:32] [INFO ] Flatten gal took : 204 ms
[2023-03-15 07:50:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 61 ms.
[2023-03-15 07:50:32] [INFO ] Time to serialize gal into /tmp/UpperBounds9978533193602824332.gal : 26 ms
[2023-03-15 07:50:32] [INFO ] Time to serialize properties into /tmp/UpperBounds11412051937816248400.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9978533193602824332.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11412051937816248400.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds11412051937816248400.prop.
Detected timeout of ITS tools.
[2023-03-15 08:11:39] [INFO ] Flatten gal took : 231 ms
[2023-03-15 08:11:40] [INFO ] Input system was already deterministic with 1296 transitions.
[2023-03-15 08:11:40] [INFO ] Transformed 404 places.
[2023-03-15 08:11:40] [INFO ] Transformed 1296 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 08:12:11] [INFO ] Time to serialize gal into /tmp/UpperBounds17007601767365336205.gal : 49 ms
[2023-03-15 08:12:11] [INFO ] Time to serialize properties into /tmp/UpperBounds7373504383867524554.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17007601767365336205.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7373504383867524554.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7373504383867524554.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 178152 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15756000 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S06J04T06"
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-5348"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S06J04T06, 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 r293-tall-167873945400453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T06.tgz
mv PolyORBLF-COL-S06J04T06 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 ;