About the Execution of LTSMin+red for PolyORBNT-COL-S10J40
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 984.852 | 3600000.00 | 13710431.00 | 884.50 | 10 10 41 1 1 1 4 1 1 1 1 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/mcc2023-input.r297-tall-167873950800693.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 ltsminxred
Input is PolyORBNT-COL-S10J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950800693
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 12K Feb 26 00:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 00:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 23:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 01:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 01:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 01:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K 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 PolyORBNT-COL-S10J40-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J40-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679612897220
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J40
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 23:08:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 23:08:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 23:08:19] [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-23 23:08:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 23:08:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 594 ms
[2023-03-23 23:08:19] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-23 23:08:19] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-23 23:08:19] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 23:08:19] [INFO ] Computed 13 place invariants in 10 ms
FORMULA PolyORBNT-COL-S10J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-02 41 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J40-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-23 23:08:20] [INFO ] Invariant cache hit.
[2023-03-23 23:08:20] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:20] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-23 23:08:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:20] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-23 23:08:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:08:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 23:08:20] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 3 ms to minimize.
[2023-03-23 23:08:20] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2023-03-23 23:08:20] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2023-03-23 23:08:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 117 ms
[2023-03-23 23:08:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-23 23:08:20] [INFO ] Added : 36 causal constraints over 8 iterations in 60 ms. Result :sat
Minimization took 17 ms.
[2023-03-23 23:08:20] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:20] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-23 23:08:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:20] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 23:08:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 23:08:20] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2023-03-23 23:08:20] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:20] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-23 23:08:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:20] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-23 23:08:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 23:08:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 23:08:20] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2023-03-23 23:08:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-23 23:08:21] [INFO ] Added : 36 causal constraints over 8 iterations in 194 ms. Result :sat
Minimization took 15 ms.
[2023-03-23 23:08:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 23:08:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 23:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:21] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 23:08:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2023-03-23 23:08:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 23:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:21] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-23 23:08:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 23:08:21] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2023-03-23 23:08:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-23 23:08:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 23:08:21] [INFO ] Added : 20 causal constraints over 4 iterations in 241 ms. Result :sat
Minimization took 78 ms.
[2023-03-23 23:08:21] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 23:08:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-23 23:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:21] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-23 23:08:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 23:08:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-23 23:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:21] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-23 23:08:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 23:08:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 23:08:21] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2023-03-23 23:08:21] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2023-03-23 23:08:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2023-03-23 23:08:21] [INFO ] Added : 36 causal constraints over 8 iterations in 213 ms. Result :sat
Minimization took 17 ms.
[2023-03-23 23:08:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 23:08:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 23:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:21] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 23:08:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 23:08:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 23:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:22] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 23:08:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 23:08:22] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2023-03-23 23:08:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:22] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-23 23:08:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:22] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 23:08:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 23:08:22] [INFO ] Added : 36 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 16 ms.
[2023-03-23 23:08:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-23 23:08:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:22] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 23:08:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2023-03-23 23:08:22] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2023-03-23 23:08:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2023-03-23 23:08:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 23:08:22] [INFO ] Added : 36 causal constraints over 8 iterations in 47 ms. Result :sat
Minimization took 12 ms.
[2023-03-23 23:08:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:22] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-23 23:08:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:22] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-23 23:08:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 23:08:22] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2023-03-23 23:08:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-23 23:08:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 23:08:22] [INFO ] Added : 14 causal constraints over 4 iterations in 258 ms. Result :sat
Minimization took 89 ms.
[2023-03-23 23:08:23] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 23:08:23] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 23:08:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 23:08:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-23 23:08:23] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 23:08:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:23] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-23 23:08:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 23:08:23] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 23:08:23] [INFO ] Added : 2 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 8 ms.
[2023-03-23 23:08:23] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 23:08:23] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 23:08:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 23:08:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 23:08:23] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 23:08:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:23] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 23:08:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 23:08:23] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2023-03-23 23:08:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-23 23:08:23] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 23:08:23] [INFO ] Added : 15 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, 1, 4, -1, -1, -1, -1, 10, -1, 1]
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-23 23:08:23] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 304 ms.
[2023-03-23 23:08:23] [INFO ] Unfolded 11 HLPN properties in 15 ms.
Deduced a syphon composed of 40 places in 97 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 11) seen :4
FORMULA PolyORBNT-COL-S10J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :3
[2023-03-23 23:08:24] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2023-03-23 23:08:24] [INFO ] Computed 112 place invariants in 149 ms
[2023-03-23 23:08:24] [INFO ] [Real]Absence check using 105 positive place invariants in 33 ms returned sat
[2023-03-23 23:08:24] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-23 23:08:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:25] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2023-03-23 23:08:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:25] [INFO ] [Nat]Absence check using 105 positive place invariants in 37 ms returned sat
[2023-03-23 23:08:25] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-23 23:08:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:26] [INFO ] [Nat]Absence check using state equation in 1117 ms returned sat
[2023-03-23 23:08:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:08:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 322 ms returned sat
[2023-03-23 23:08:27] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 281 ms.
[2023-03-23 23:08:29] [INFO ] Deduced a trap composed of 19 places in 633 ms of which 1 ms to minimize.
[2023-03-23 23:08:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 957 ms
[2023-03-23 23:08:30] [INFO ] Deduced a trap composed of 212 places in 523 ms of which 1 ms to minimize.
[2023-03-23 23:08:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 729 ms
[2023-03-23 23:08:31] [INFO ] Deduced a trap composed of 3 places in 755 ms of which 1 ms to minimize.
[2023-03-23 23:08:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 23:08:31] [INFO ] [Real]Absence check using 105 positive place invariants in 32 ms returned sat
[2023-03-23 23:08:31] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 20 ms returned unsat
[2023-03-23 23:08:31] [INFO ] [Real]Absence check using 105 positive place invariants in 32 ms returned sat
[2023-03-23 23:08:31] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-23 23:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:32] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2023-03-23 23:08:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:32] [INFO ] [Nat]Absence check using 105 positive place invariants in 36 ms returned sat
[2023-03-23 23:08:32] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-23 23:08:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:37] [INFO ] [Nat]Absence check using state equation in 4830 ms returned unknown
[2023-03-23 23:08:37] [INFO ] [Real]Absence check using 105 positive place invariants in 32 ms returned sat
[2023-03-23 23:08:37] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-23 23:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:38] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2023-03-23 23:08:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:38] [INFO ] [Nat]Absence check using 105 positive place invariants in 42 ms returned sat
[2023-03-23 23:08:38] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-23 23:08:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:38] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2023-03-23 23:08:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 785 ms returned sat
[2023-03-23 23:08:40] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 498 ms.
[2023-03-23 23:08:41] [INFO ] Deduced a trap composed of 19 places in 430 ms of which 0 ms to minimize.
[2023-03-23 23:08:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 604 ms
[2023-03-23 23:08:41] [INFO ] Added : 27 causal constraints over 6 iterations in 1868 ms. Result :sat
Minimization took 1082 ms.
[2023-03-23 23:08:42] [INFO ] [Real]Absence check using 105 positive place invariants in 31 ms returned sat
[2023-03-23 23:08:42] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 17 ms returned unsat
[2023-03-23 23:08:43] [INFO ] [Real]Absence check using 105 positive place invariants in 33 ms returned sat
[2023-03-23 23:08:43] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-23 23:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:43] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2023-03-23 23:08:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:43] [INFO ] [Nat]Absence check using 105 positive place invariants in 31 ms returned sat
[2023-03-23 23:08:44] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 23:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:44] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2023-03-23 23:08:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 225 ms returned sat
[2023-03-23 23:08:45] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 184 ms.
[2023-03-23 23:08:46] [INFO ] Deduced a trap composed of 19 places in 346 ms of which 0 ms to minimize.
[2023-03-23 23:08:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 530 ms
[2023-03-23 23:08:46] [INFO ] Added : 24 causal constraints over 6 iterations in 1513 ms. Result :sat
Minimization took 1533 ms.
[2023-03-23 23:08:48] [INFO ] [Real]Absence check using 105 positive place invariants in 33 ms returned sat
[2023-03-23 23:08:48] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-23 23:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:49] [INFO ] [Real]Absence check using state equation in 658 ms returned sat
[2023-03-23 23:08:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:49] [INFO ] [Nat]Absence check using 105 positive place invariants in 34 ms returned sat
[2023-03-23 23:08:49] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-23 23:08:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:50] [INFO ] [Nat]Absence check using state equation in 1172 ms returned sat
[2023-03-23 23:08:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 253 ms returned sat
[2023-03-23 23:08:51] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 207 ms.
[2023-03-23 23:08:52] [INFO ] Deduced a trap composed of 19 places in 604 ms of which 1 ms to minimize.
[2023-03-23 23:08:53] [INFO ] Deduced a trap composed of 212 places in 582 ms of which 1 ms to minimize.
[2023-03-23 23:08:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1721 ms
[2023-03-23 23:08:53] [INFO ] Added : 27 causal constraints over 6 iterations in 2993 ms. Result :sat
Minimization took 317 ms.
[2023-03-23 23:08:54] [INFO ] [Real]Absence check using 105 positive place invariants in 32 ms returned sat
[2023-03-23 23:08:54] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-23 23:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:08:55] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2023-03-23 23:08:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:08:55] [INFO ] [Nat]Absence check using 105 positive place invariants in 34 ms returned sat
[2023-03-23 23:08:55] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-23 23:08:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:09:00] [INFO ] [Nat]Absence check using state equation in 4835 ms returned unknown
[2023-03-23 23:09:00] [INFO ] [Real]Absence check using 105 positive place invariants in 33 ms returned sat
[2023-03-23 23:09:00] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned unsat
[2023-03-23 23:09:00] [INFO ] [Real]Absence check using 105 positive place invariants in 32 ms returned sat
[2023-03-23 23:09:00] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-23 23:09:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:09:01] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2023-03-23 23:09:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:09:01] [INFO ] [Nat]Absence check using 105 positive place invariants in 33 ms returned sat
[2023-03-23 23:09:01] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-23 23:09:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:09:02] [INFO ] [Nat]Absence check using state equation in 1170 ms returned sat
[2023-03-23 23:09:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2023-03-23 23:09:02] [INFO ] Computed and/alt/rep : 1587/4983/1587 causal constraints (skipped 623 transitions) in 201 ms.
[2023-03-23 23:09:03] [INFO ] Added : 7 causal constraints over 2 iterations in 516 ms. Result :sat
Minimization took 264 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 1, 4, 2147483647, 1, 2147483647, 2147483647, 10, 1, 1] Max seen :[0, 1, 0, 0, 1, 0, 0, 0, 1, 0]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 46 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 844 transition count 2228
Reduce places removed 2 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 1 with 45 rules applied. Total rules applied 57 place count 842 transition count 2185
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 100 place count 799 transition count 2185
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 100 place count 799 transition count 2182
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 106 place count 796 transition count 2182
Applied a total of 106 rules in 298 ms. Remains 796 /854 variables (removed 58) and now considering 2182/2230 (removed 48) transitions.
[2023-03-23 23:09:04] [INFO ] Flow matrix only has 2173 transitions (discarded 9 similar events)
// Phase 1: matrix 2173 rows 796 cols
[2023-03-23 23:09:04] [INFO ] Computed 102 place invariants in 46 ms
[2023-03-23 23:09:05] [INFO ] Dead Transitions using invariants and state equation in 1663 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 796/854 places, 1567/2230 transitions.
Applied a total of 0 rules in 56 ms. Remains 796 /796 variables (removed 0) and now considering 1567/1567 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2023 ms. Remains : 796/854 places, 1567/2230 transitions.
Normalized transition count is 1558 out of 1567 initially.
// Phase 1: matrix 1558 rows 796 cols
[2023-03-23 23:09:06] [INFO ] Computed 102 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 67017 resets, run finished after 12061 ms. (steps per millisecond=82 ) properties (out of 6) seen :11
FORMULA PolyORBNT-COL-S10J40-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 8118 resets, run finished after 2265 ms. (steps per millisecond=441 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8190 resets, run finished after 2655 ms. (steps per millisecond=376 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000000 steps, including 8107 resets, run finished after 2240 ms. (steps per millisecond=446 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8319 resets, run finished after 2225 ms. (steps per millisecond=449 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8281 resets, run finished after 2200 ms. (steps per millisecond=454 ) properties (out of 5) seen :7
[2023-03-23 23:09:29] [INFO ] Flow matrix only has 1558 transitions (discarded 9 similar events)
// Phase 1: matrix 1558 rows 796 cols
[2023-03-23 23:09:29] [INFO ] Computed 102 place invariants in 26 ms
[2023-03-23 23:09:29] [INFO ] [Real]Absence check using 96 positive place invariants in 26 ms returned sat
[2023-03-23 23:09:29] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 14 ms returned unsat
[2023-03-23 23:09:30] [INFO ] [Real]Absence check using 96 positive place invariants in 27 ms returned sat
[2023-03-23 23:09:30] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 12 ms returned unsat
[2023-03-23 23:09:30] [INFO ] [Real]Absence check using 96 positive place invariants in 28 ms returned sat
[2023-03-23 23:09:30] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 14 ms returned unsat
[2023-03-23 23:09:30] [INFO ] [Real]Absence check using 96 positive place invariants in 29 ms returned sat
[2023-03-23 23:09:30] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 15 ms returned unsat
[2023-03-23 23:09:30] [INFO ] [Real]Absence check using 96 positive place invariants in 28 ms returned sat
[2023-03-23 23:09:30] [INFO ] [Real]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned sat
[2023-03-23 23:09:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:09:30] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2023-03-23 23:09:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:09:31] [INFO ] [Nat]Absence check using 96 positive place invariants in 28 ms returned sat
[2023-03-23 23:09:31] [INFO ] [Nat]Absence check using 96 positive and 6 generalized place invariants in 13 ms returned sat
[2023-03-23 23:09:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:09:31] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2023-03-23 23:09:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:09:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 343 ms returned sat
[2023-03-23 23:09:32] [INFO ] Deduced a trap composed of 352 places in 437 ms of which 0 ms to minimize.
[2023-03-23 23:09:32] [INFO ] Deduced a trap composed of 362 places in 436 ms of which 0 ms to minimize.
[2023-03-23 23:09:33] [INFO ] Deduced a trap composed of 350 places in 426 ms of which 1 ms to minimize.
[2023-03-23 23:09:33] [INFO ] Deduced a trap composed of 352 places in 415 ms of which 1 ms to minimize.
[2023-03-23 23:09:34] [INFO ] Deduced a trap composed of 350 places in 413 ms of which 1 ms to minimize.
[2023-03-23 23:09:34] [INFO ] Deduced a trap composed of 352 places in 433 ms of which 0 ms to minimize.
[2023-03-23 23:09:35] [INFO ] Deduced a trap composed of 366 places in 425 ms of which 1 ms to minimize.
[2023-03-23 23:09:35] [INFO ] Deduced a trap composed of 364 places in 425 ms of which 0 ms to minimize.
[2023-03-23 23:09:36] [INFO ] Deduced a trap composed of 358 places in 418 ms of which 1 ms to minimize.
[2023-03-23 23:09:36] [INFO ] Deduced a trap composed of 360 places in 434 ms of which 0 ms to minimize.
[2023-03-23 23:09:37] [INFO ] Deduced a trap composed of 360 places in 436 ms of which 1 ms to minimize.
[2023-03-23 23:09:37] [INFO ] Deduced a trap composed of 366 places in 446 ms of which 1 ms to minimize.
[2023-03-23 23:09:38] [INFO ] Deduced a trap composed of 360 places in 442 ms of which 1 ms to minimize.
[2023-03-23 23:09:38] [INFO ] Deduced a trap composed of 360 places in 460 ms of which 1 ms to minimize.
[2023-03-23 23:09:39] [INFO ] Deduced a trap composed of 366 places in 424 ms of which 1 ms to minimize.
[2023-03-23 23:09:40] [INFO ] Deduced a trap composed of 350 places in 437 ms of which 2 ms to minimize.
[2023-03-23 23:09:40] [INFO ] Deduced a trap composed of 352 places in 439 ms of which 2 ms to minimize.
[2023-03-23 23:09:41] [INFO ] Deduced a trap composed of 350 places in 448 ms of which 1 ms to minimize.
[2023-03-23 23:09:41] [INFO ] Deduced a trap composed of 350 places in 467 ms of which 1 ms to minimize.
[2023-03-23 23:09:42] [INFO ] Deduced a trap composed of 350 places in 462 ms of which 1 ms to minimize.
[2023-03-23 23:09:43] [INFO ] Deduced a trap composed of 338 places in 450 ms of which 1 ms to minimize.
[2023-03-23 23:09:44] [INFO ] Deduced a trap composed of 350 places in 457 ms of which 2 ms to minimize.
[2023-03-23 23:09:44] [INFO ] Deduced a trap composed of 344 places in 456 ms of which 1 ms to minimize.
[2023-03-23 23:09:45] [INFO ] Deduced a trap composed of 354 places in 462 ms of which 1 ms to minimize.
[2023-03-23 23:09:45] [INFO ] Deduced a trap composed of 344 places in 472 ms of which 1 ms to minimize.
[2023-03-23 23:09:46] [INFO ] Deduced a trap composed of 353 places in 455 ms of which 1 ms to minimize.
[2023-03-23 23:09:46] [INFO ] Deduced a trap composed of 348 places in 424 ms of which 1 ms to minimize.
[2023-03-23 23:09:47] [INFO ] Deduced a trap composed of 346 places in 428 ms of which 1 ms to minimize.
[2023-03-23 23:09:47] [INFO ] Deduced a trap composed of 362 places in 448 ms of which 0 ms to minimize.
[2023-03-23 23:09:48] [INFO ] Deduced a trap composed of 358 places in 431 ms of which 0 ms to minimize.
[2023-03-23 23:09:48] [INFO ] Deduced a trap composed of 360 places in 452 ms of which 1 ms to minimize.
[2023-03-23 23:09:49] [INFO ] Deduced a trap composed of 354 places in 463 ms of which 1 ms to minimize.
[2023-03-23 23:09:49] [INFO ] Deduced a trap composed of 350 places in 464 ms of which 1 ms to minimize.
[2023-03-23 23:09:50] [INFO ] Deduced a trap composed of 348 places in 440 ms of which 1 ms to minimize.
[2023-03-23 23:09:51] [INFO ] Deduced a trap composed of 364 places in 445 ms of which 1 ms to minimize.
[2023-03-23 23:09:51] [INFO ] Deduced a trap composed of 358 places in 458 ms of which 2 ms to minimize.
[2023-03-23 23:09:52] [INFO ] Deduced a trap composed of 360 places in 450 ms of which 1 ms to minimize.
[2023-03-23 23:09:52] [INFO ] Deduced a trap composed of 348 places in 437 ms of which 0 ms to minimize.
[2023-03-23 23:09:53] [INFO ] Deduced a trap composed of 358 places in 463 ms of which 6 ms to minimize.
[2023-03-23 23:09:53] [INFO ] Deduced a trap composed of 356 places in 441 ms of which 1 ms to minimize.
[2023-03-23 23:09:54] [INFO ] Deduced a trap composed of 358 places in 444 ms of which 0 ms to minimize.
[2023-03-23 23:09:55] [INFO ] Deduced a trap composed of 360 places in 435 ms of which 1 ms to minimize.
[2023-03-23 23:09:56] [INFO ] Deduced a trap composed of 358 places in 398 ms of which 1 ms to minimize.
[2023-03-23 23:09:57] [INFO ] Deduced a trap composed of 364 places in 429 ms of which 1 ms to minimize.
[2023-03-23 23:09:57] [INFO ] Deduced a trap composed of 360 places in 447 ms of which 1 ms to minimize.
[2023-03-23 23:09:58] [INFO ] Deduced a trap composed of 358 places in 432 ms of which 1 ms to minimize.
[2023-03-23 23:09:58] [INFO ] Deduced a trap composed of 354 places in 425 ms of which 1 ms to minimize.
[2023-03-23 23:09:59] [INFO ] Deduced a trap composed of 360 places in 423 ms of which 4 ms to minimize.
[2023-03-23 23:09:59] [INFO ] Deduced a trap composed of 362 places in 442 ms of which 1 ms to minimize.
[2023-03-23 23:10:00] [INFO ] Deduced a trap composed of 354 places in 452 ms of which 4 ms to minimize.
[2023-03-23 23:10:00] [INFO ] Deduced a trap composed of 360 places in 459 ms of which 3 ms to minimize.
[2023-03-23 23:10:01] [INFO ] Deduced a trap composed of 360 places in 447 ms of which 2 ms to minimize.
[2023-03-23 23:10:01] [INFO ] Deduced a trap composed of 366 places in 440 ms of which 0 ms to minimize.
[2023-03-23 23:10:02] [INFO ] Deduced a trap composed of 356 places in 449 ms of which 1 ms to minimize.
[2023-03-23 23:10:03] [INFO ] Deduced a trap composed of 354 places in 418 ms of which 1 ms to minimize.
[2023-03-23 23:10:03] [INFO ] Deduced a trap composed of 360 places in 419 ms of which 1 ms to minimize.
[2023-03-23 23:10:04] [INFO ] Deduced a trap composed of 354 places in 433 ms of which 1 ms to minimize.
[2023-03-23 23:10:04] [INFO ] Deduced a trap composed of 362 places in 428 ms of which 1 ms to minimize.
[2023-03-23 23:10:05] [INFO ] Deduced a trap composed of 360 places in 433 ms of which 1 ms to minimize.
[2023-03-23 23:10:06] [INFO ] Deduced a trap composed of 354 places in 432 ms of which 1 ms to minimize.
[2023-03-23 23:10:06] [INFO ] Deduced a trap composed of 358 places in 430 ms of which 1 ms to minimize.
[2023-03-23 23:10:07] [INFO ] Deduced a trap composed of 360 places in 450 ms of which 0 ms to minimize.
[2023-03-23 23:10:07] [INFO ] Deduced a trap composed of 348 places in 438 ms of which 1 ms to minimize.
[2023-03-23 23:10:08] [INFO ] Deduced a trap composed of 362 places in 431 ms of which 0 ms to minimize.
[2023-03-23 23:10:08] [INFO ] Deduced a trap composed of 356 places in 446 ms of which 1 ms to minimize.
[2023-03-23 23:10:09] [INFO ] Deduced a trap composed of 360 places in 443 ms of which 1 ms to minimize.
[2023-03-23 23:10:10] [INFO ] Deduced a trap composed of 356 places in 440 ms of which 1 ms to minimize.
[2023-03-23 23:10:10] [INFO ] Deduced a trap composed of 366 places in 441 ms of which 0 ms to minimize.
[2023-03-23 23:10:11] [INFO ] Deduced a trap composed of 356 places in 443 ms of which 1 ms to minimize.
[2023-03-23 23:10:12] [INFO ] Deduced a trap composed of 348 places in 450 ms of which 1 ms to minimize.
[2023-03-23 23:10:13] [INFO ] Deduced a trap composed of 348 places in 434 ms of which 1 ms to minimize.
[2023-03-23 23:10:13] [INFO ] Deduced a trap composed of 350 places in 445 ms of which 1 ms to minimize.
[2023-03-23 23:10:15] [INFO ] Deduced a trap composed of 354 places in 427 ms of which 0 ms to minimize.
[2023-03-23 23:10:15] [INFO ] Deduced a trap composed of 356 places in 447 ms of which 1 ms to minimize.
[2023-03-23 23:10:16] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 44090 ms
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 10] Max seen :[1, 1, 1, 1, 3]
FORMULA PolyORBNT-COL-S10J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 1567/1567 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 796 transition count 1566
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 795 transition count 1566
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 2 place count 795 transition count 1525
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 84 place count 754 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 753 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 753 transition count 1524
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 751 transition count 1522
Applied a total of 90 rules in 185 ms. Remains 751 /796 variables (removed 45) and now considering 1522/1567 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 751/796 places, 1522/1567 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-23 23:10:16] [INFO ] Computed 102 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 70593 resets, run finished after 11508 ms. (steps per millisecond=86 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8222 resets, run finished after 2105 ms. (steps per millisecond=475 ) properties (out of 1) seen :3
[2023-03-23 23:10:29] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-23 23:10:29] [INFO ] Computed 102 place invariants in 24 ms
[2023-03-23 23:10:30] [INFO ] [Real]Absence check using 95 positive place invariants in 27 ms returned sat
[2023-03-23 23:10:30] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-23 23:10:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:10:30] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2023-03-23 23:10:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:10:30] [INFO ] [Nat]Absence check using 95 positive place invariants in 27 ms returned sat
[2023-03-23 23:10:30] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-23 23:10:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:10:31] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2023-03-23 23:10:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:10:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 478 ms returned sat
[2023-03-23 23:10:32] [INFO ] Deduced a trap composed of 306 places in 412 ms of which 1 ms to minimize.
[2023-03-23 23:10:32] [INFO ] Deduced a trap composed of 302 places in 405 ms of which 0 ms to minimize.
[2023-03-23 23:10:33] [INFO ] Deduced a trap composed of 310 places in 391 ms of which 1 ms to minimize.
[2023-03-23 23:10:33] [INFO ] Deduced a trap composed of 304 places in 412 ms of which 1 ms to minimize.
[2023-03-23 23:10:33] [INFO ] Deduced a trap composed of 300 places in 409 ms of which 1 ms to minimize.
[2023-03-23 23:10:34] [INFO ] Deduced a trap composed of 302 places in 411 ms of which 1 ms to minimize.
[2023-03-23 23:10:34] [INFO ] Deduced a trap composed of 304 places in 396 ms of which 1 ms to minimize.
[2023-03-23 23:10:35] [INFO ] Deduced a trap composed of 300 places in 381 ms of which 0 ms to minimize.
[2023-03-23 23:10:36] [INFO ] Deduced a trap composed of 296 places in 368 ms of which 1 ms to minimize.
[2023-03-23 23:10:36] [INFO ] Deduced a trap composed of 300 places in 406 ms of which 0 ms to minimize.
[2023-03-23 23:10:36] [INFO ] Deduced a trap composed of 296 places in 381 ms of which 1 ms to minimize.
[2023-03-23 23:10:37] [INFO ] Deduced a trap composed of 302 places in 400 ms of which 1 ms to minimize.
[2023-03-23 23:10:37] [INFO ] Deduced a trap composed of 306 places in 372 ms of which 1 ms to minimize.
[2023-03-23 23:10:38] [INFO ] Deduced a trap composed of 302 places in 398 ms of which 0 ms to minimize.
[2023-03-23 23:10:38] [INFO ] Deduced a trap composed of 302 places in 379 ms of which 1 ms to minimize.
[2023-03-23 23:10:39] [INFO ] Deduced a trap composed of 302 places in 371 ms of which 0 ms to minimize.
[2023-03-23 23:10:39] [INFO ] Deduced a trap composed of 304 places in 358 ms of which 1 ms to minimize.
[2023-03-23 23:10:40] [INFO ] Deduced a trap composed of 304 places in 365 ms of which 1 ms to minimize.
[2023-03-23 23:10:40] [INFO ] Deduced a trap composed of 300 places in 360 ms of which 0 ms to minimize.
[2023-03-23 23:10:40] [INFO ] Deduced a trap composed of 298 places in 359 ms of which 0 ms to minimize.
[2023-03-23 23:10:41] [INFO ] Deduced a trap composed of 310 places in 368 ms of which 1 ms to minimize.
[2023-03-23 23:10:42] [INFO ] Deduced a trap composed of 296 places in 407 ms of which 1 ms to minimize.
[2023-03-23 23:10:42] [INFO ] Deduced a trap composed of 296 places in 368 ms of which 1 ms to minimize.
[2023-03-23 23:10:43] [INFO ] Deduced a trap composed of 306 places in 358 ms of which 2 ms to minimize.
[2023-03-23 23:10:44] [INFO ] Deduced a trap composed of 302 places in 406 ms of which 0 ms to minimize.
[2023-03-23 23:10:44] [INFO ] Deduced a trap composed of 306 places in 415 ms of which 1 ms to minimize.
[2023-03-23 23:10:45] [INFO ] Deduced a trap composed of 296 places in 416 ms of which 1 ms to minimize.
[2023-03-23 23:10:45] [INFO ] Deduced a trap composed of 296 places in 419 ms of which 1 ms to minimize.
[2023-03-23 23:10:46] [INFO ] Deduced a trap composed of 302 places in 409 ms of which 1 ms to minimize.
[2023-03-23 23:10:46] [INFO ] Deduced a trap composed of 298 places in 403 ms of which 0 ms to minimize.
[2023-03-23 23:10:47] [INFO ] Deduced a trap composed of 302 places in 404 ms of which 1 ms to minimize.
[2023-03-23 23:10:47] [INFO ] Deduced a trap composed of 300 places in 410 ms of which 1 ms to minimize.
[2023-03-23 23:10:48] [INFO ] Deduced a trap composed of 290 places in 421 ms of which 1 ms to minimize.
[2023-03-23 23:10:48] [INFO ] Deduced a trap composed of 312 places in 407 ms of which 0 ms to minimize.
[2023-03-23 23:10:49] [INFO ] Deduced a trap composed of 300 places in 399 ms of which 1 ms to minimize.
[2023-03-23 23:10:50] [INFO ] Deduced a trap composed of 292 places in 406 ms of which 0 ms to minimize.
[2023-03-23 23:10:50] [INFO ] Deduced a trap composed of 298 places in 405 ms of which 1 ms to minimize.
[2023-03-23 23:10:52] [INFO ] Deduced a trap composed of 296 places in 399 ms of which 1 ms to minimize.
[2023-03-23 23:10:54] [INFO ] Deduced a trap composed of 294 places in 398 ms of which 1 ms to minimize.
[2023-03-23 23:10:56] [INFO ] Deduced a trap composed of 304 places in 405 ms of which 0 ms to minimize.
[2023-03-23 23:10:56] [INFO ] Deduced a trap composed of 294 places in 403 ms of which 0 ms to minimize.
[2023-03-23 23:10:57] [INFO ] Deduced a trap composed of 304 places in 405 ms of which 1 ms to minimize.
[2023-03-23 23:10:57] [INFO ] Deduced a trap composed of 300 places in 406 ms of which 1 ms to minimize.
[2023-03-23 23:10:58] [INFO ] Deduced a trap composed of 306 places in 394 ms of which 1 ms to minimize.
[2023-03-23 23:10:59] [INFO ] Deduced a trap composed of 296 places in 391 ms of which 0 ms to minimize.
[2023-03-23 23:11:00] [INFO ] Deduced a trap composed of 310 places in 374 ms of which 0 ms to minimize.
[2023-03-23 23:11:03] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 31699 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 44 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 751/751 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 42 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-23 23:11:03] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-23 23:11:03] [INFO ] Invariant cache hit.
[2023-03-23 23:11:04] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-23 23:11:04] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-23 23:11:04] [INFO ] Invariant cache hit.
[2023-03-23 23:11:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:11:07] [INFO ] Implicit Places using invariants and state equation in 3709 ms returned []
Implicit Place search using SMT with State Equation took 4318 ms to find 0 implicit places.
[2023-03-23 23:11:07] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-23 23:11:07] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-23 23:11:07] [INFO ] Invariant cache hit.
[2023-03-23 23:11:08] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5309 ms. Remains : 751/751 places, 1522/1522 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-13
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-23 23:11:08] [INFO ] Computed 102 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 696 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :3
[2023-03-23 23:11:08] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-23 23:11:08] [INFO ] Computed 102 place invariants in 27 ms
[2023-03-23 23:11:09] [INFO ] [Real]Absence check using 95 positive place invariants in 26 ms returned sat
[2023-03-23 23:11:09] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 23:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:11:09] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2023-03-23 23:11:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:11:09] [INFO ] [Nat]Absence check using 95 positive place invariants in 25 ms returned sat
[2023-03-23 23:11:09] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 23:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:11:10] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2023-03-23 23:11:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:11:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 503 ms returned sat
[2023-03-23 23:11:11] [INFO ] Deduced a trap composed of 306 places in 422 ms of which 0 ms to minimize.
[2023-03-23 23:11:11] [INFO ] Deduced a trap composed of 302 places in 413 ms of which 0 ms to minimize.
[2023-03-23 23:11:12] [INFO ] Deduced a trap composed of 310 places in 432 ms of which 1 ms to minimize.
[2023-03-23 23:11:12] [INFO ] Deduced a trap composed of 304 places in 426 ms of which 0 ms to minimize.
[2023-03-23 23:11:13] [INFO ] Deduced a trap composed of 300 places in 423 ms of which 0 ms to minimize.
[2023-03-23 23:11:13] [INFO ] Deduced a trap composed of 302 places in 418 ms of which 1 ms to minimize.
[2023-03-23 23:11:14] [INFO ] Deduced a trap composed of 304 places in 423 ms of which 1 ms to minimize.
[2023-03-23 23:11:14] [INFO ] Deduced a trap composed of 300 places in 417 ms of which 1 ms to minimize.
[2023-03-23 23:11:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 38 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-23 23:11:14] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-23 23:11:14] [INFO ] Invariant cache hit.
[2023-03-23 23:11:15] [INFO ] Dead Transitions using invariants and state equation in 833 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 875 ms. Remains : 751/751 places, 1522/1522 transitions.
Normalized transition count is 1513 out of 1522 initially.
// Phase 1: matrix 1513 rows 751 cols
[2023-03-23 23:11:15] [INFO ] Computed 102 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 70546 resets, run finished after 11718 ms. (steps per millisecond=85 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8102 resets, run finished after 2214 ms. (steps per millisecond=451 ) properties (out of 1) seen :3
[2023-03-23 23:11:29] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-23 23:11:29] [INFO ] Computed 102 place invariants in 30 ms
[2023-03-23 23:11:29] [INFO ] [Real]Absence check using 95 positive place invariants in 28 ms returned sat
[2023-03-23 23:11:29] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-23 23:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 23:11:30] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2023-03-23 23:11:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 23:11:30] [INFO ] [Nat]Absence check using 95 positive place invariants in 28 ms returned sat
[2023-03-23 23:11:30] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-23 23:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 23:11:30] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2023-03-23 23:11:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:11:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 520 ms returned sat
[2023-03-23 23:11:31] [INFO ] Deduced a trap composed of 306 places in 396 ms of which 1 ms to minimize.
[2023-03-23 23:11:32] [INFO ] Deduced a trap composed of 302 places in 423 ms of which 1 ms to minimize.
[2023-03-23 23:11:32] [INFO ] Deduced a trap composed of 310 places in 423 ms of which 1 ms to minimize.
[2023-03-23 23:11:33] [INFO ] Deduced a trap composed of 304 places in 419 ms of which 1 ms to minimize.
[2023-03-23 23:11:33] [INFO ] Deduced a trap composed of 300 places in 420 ms of which 1 ms to minimize.
[2023-03-23 23:11:34] [INFO ] Deduced a trap composed of 302 places in 396 ms of which 1 ms to minimize.
[2023-03-23 23:11:34] [INFO ] Deduced a trap composed of 304 places in 398 ms of which 1 ms to minimize.
[2023-03-23 23:11:35] [INFO ] Deduced a trap composed of 300 places in 416 ms of which 1 ms to minimize.
[2023-03-23 23:11:35] [INFO ] Deduced a trap composed of 296 places in 408 ms of which 0 ms to minimize.
[2023-03-23 23:11:36] [INFO ] Deduced a trap composed of 300 places in 418 ms of which 1 ms to minimize.
[2023-03-23 23:11:36] [INFO ] Deduced a trap composed of 296 places in 395 ms of which 1 ms to minimize.
[2023-03-23 23:11:37] [INFO ] Deduced a trap composed of 302 places in 386 ms of which 1 ms to minimize.
[2023-03-23 23:11:37] [INFO ] Deduced a trap composed of 306 places in 435 ms of which 0 ms to minimize.
[2023-03-23 23:11:38] [INFO ] Deduced a trap composed of 302 places in 422 ms of which 1 ms to minimize.
[2023-03-23 23:11:38] [INFO ] Deduced a trap composed of 302 places in 430 ms of which 2 ms to minimize.
[2023-03-23 23:11:39] [INFO ] Deduced a trap composed of 302 places in 425 ms of which 2 ms to minimize.
[2023-03-23 23:11:39] [INFO ] Deduced a trap composed of 304 places in 405 ms of which 1 ms to minimize.
[2023-03-23 23:11:40] [INFO ] Deduced a trap composed of 304 places in 415 ms of which 1 ms to minimize.
[2023-03-23 23:11:40] [INFO ] Deduced a trap composed of 300 places in 411 ms of which 0 ms to minimize.
[2023-03-23 23:11:41] [INFO ] Deduced a trap composed of 298 places in 398 ms of which 1 ms to minimize.
[2023-03-23 23:11:41] [INFO ] Deduced a trap composed of 310 places in 412 ms of which 1 ms to minimize.
[2023-03-23 23:11:42] [INFO ] Deduced a trap composed of 296 places in 411 ms of which 0 ms to minimize.
[2023-03-23 23:11:42] [INFO ] Deduced a trap composed of 296 places in 397 ms of which 1 ms to minimize.
[2023-03-23 23:11:43] [INFO ] Deduced a trap composed of 306 places in 400 ms of which 1 ms to minimize.
[2023-03-23 23:11:44] [INFO ] Deduced a trap composed of 302 places in 402 ms of which 1 ms to minimize.
[2023-03-23 23:11:44] [INFO ] Deduced a trap composed of 306 places in 374 ms of which 1 ms to minimize.
[2023-03-23 23:11:45] [INFO ] Deduced a trap composed of 296 places in 413 ms of which 1 ms to minimize.
[2023-03-23 23:11:45] [INFO ] Deduced a trap composed of 296 places in 412 ms of which 0 ms to minimize.
[2023-03-23 23:11:46] [INFO ] Deduced a trap composed of 302 places in 393 ms of which 1 ms to minimize.
[2023-03-23 23:11:46] [INFO ] Deduced a trap composed of 298 places in 410 ms of which 1 ms to minimize.
[2023-03-23 23:11:47] [INFO ] Deduced a trap composed of 302 places in 408 ms of which 1 ms to minimize.
[2023-03-23 23:11:47] [INFO ] Deduced a trap composed of 300 places in 417 ms of which 1 ms to minimize.
[2023-03-23 23:11:48] [INFO ] Deduced a trap composed of 290 places in 396 ms of which 1 ms to minimize.
[2023-03-23 23:11:48] [INFO ] Deduced a trap composed of 312 places in 405 ms of which 1 ms to minimize.
[2023-03-23 23:11:50] [INFO ] Deduced a trap composed of 300 places in 412 ms of which 1 ms to minimize.
[2023-03-23 23:11:50] [INFO ] Deduced a trap composed of 292 places in 401 ms of which 1 ms to minimize.
[2023-03-23 23:11:51] [INFO ] Deduced a trap composed of 298 places in 400 ms of which 1 ms to minimize.
[2023-03-23 23:11:53] [INFO ] Deduced a trap composed of 296 places in 406 ms of which 1 ms to minimize.
[2023-03-23 23:11:54] [INFO ] Deduced a trap composed of 294 places in 413 ms of which 1 ms to minimize.
[2023-03-23 23:11:56] [INFO ] Deduced a trap composed of 304 places in 410 ms of which 0 ms to minimize.
[2023-03-23 23:11:57] [INFO ] Deduced a trap composed of 294 places in 421 ms of which 1 ms to minimize.
[2023-03-23 23:11:57] [INFO ] Deduced a trap composed of 304 places in 409 ms of which 0 ms to minimize.
[2023-03-23 23:11:58] [INFO ] Deduced a trap composed of 300 places in 405 ms of which 1 ms to minimize.
[2023-03-23 23:11:59] [INFO ] Deduced a trap composed of 306 places in 372 ms of which 0 ms to minimize.
[2023-03-23 23:12:00] [INFO ] Deduced a trap composed of 296 places in 372 ms of which 0 ms to minimize.
[2023-03-23 23:12:00] [INFO ] Deduced a trap composed of 310 places in 396 ms of which 1 ms to minimize.
[2023-03-23 23:12:03] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 32307 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 31 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 751/751 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Applied a total of 0 rules in 30 ms. Remains 751 /751 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2023-03-23 23:12:03] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-23 23:12:03] [INFO ] Invariant cache hit.
[2023-03-23 23:12:04] [INFO ] Implicit Places using invariants in 660 ms returned []
[2023-03-23 23:12:04] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-23 23:12:04] [INFO ] Invariant cache hit.
[2023-03-23 23:12:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 23:12:08] [INFO ] Implicit Places using invariants and state equation in 4512 ms returned []
Implicit Place search using SMT with State Equation took 5172 ms to find 0 implicit places.
[2023-03-23 23:12:09] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-23 23:12:09] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-23 23:12:09] [INFO ] Invariant cache hit.
[2023-03-23 23:12:09] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6121 ms. Remains : 751/751 places, 1522/1522 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J40-UpperBounds-13 in 61161 ms.
[2023-03-23 23:12:10] [INFO ] Flatten gal took : 215 ms
[2023-03-23 23:12:10] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-23 23:12:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 751 places, 1522 transitions and 9221 arcs took 11 ms.
Total runtime 230994 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/1233/ub_0_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393228 kB
MemFree: 15155356 kB
After kill :
MemTotal: 16393228 kB
MemFree: 16090280 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
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="PolyORBNT-COL-S10J40"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBNT-COL-S10J40, 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 r297-tall-167873950800693"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J40.tgz
mv PolyORBNT-COL-S10J40 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 ;