About the Execution of ITS-Tools for PolyORBNT-COL-S05J30
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.527 | 1570398.00 | 1106299.00 | 273028.80 | 1 4 1 3 4 3 1 2 4 5 1 1 1 1 5 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.r293-tall-167873945700645.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is PolyORBNT-COL-S05J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945700645
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.4K Feb 25 23:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 23:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 23:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K 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.3K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 25 23:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 92K 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-S05J30-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678925798871
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J30
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-16 00:16:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 00:16:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 00:16:40] [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-16 00:16:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 00:16:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 696 ms
[2023-03-16 00:16:41] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-16 00:16:41] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-16 00:16:41] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-16 00:16:41] [INFO ] Computed 13 place invariants in 12 ms
FORMULA PolyORBNT-COL-S05J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-16 00:16:41] [INFO ] Invariant cache hit.
[2023-03-16 00:16:41] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-16 00:16:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-16 00:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:41] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-16 00:16:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 00:16:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:41] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-16 00:16:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:16:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-16 00:16:41] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
[2023-03-16 00:16:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-16 00:16:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 00:16:41] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2023-03-16 00:16:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-16 00:16:41] [INFO ] Added : 36 causal constraints over 8 iterations in 108 ms. Result :sat
Minimization took 12 ms.
[2023-03-16 00:16:41] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 00:16:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 00:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:41] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-16 00:16:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 00:16:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:41] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-16 00:16:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-16 00:16:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 00:16:41] [INFO ] Added : 33 causal constraints over 7 iterations in 45 ms. Result :sat
Minimization took 18 ms.
[2023-03-16 00:16:41] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 00:16:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 00:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:41] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 00:16:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 00:16:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:41] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 00:16:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 00:16:41] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2023-03-16 00:16:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-16 00:16:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-16 00:16:41] [INFO ] Added : 21 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 44 ms.
[2023-03-16 00:16:42] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:42] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-16 00:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:42] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 00:16:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:42] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 00:16:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:42] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-16 00:16:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-16 00:16:42] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2023-03-16 00:16:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-16 00:16:42] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 00:16:42] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2023-03-16 00:16:42] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2023-03-16 00:16:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-03-16 00:16:42] [INFO ] Added : 36 causal constraints over 8 iterations in 241 ms. Result :sat
Minimization took 204 ms.
[2023-03-16 00:16:42] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:42] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 00:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:42] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 00:16:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:42] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 00:16:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:42] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-16 00:16:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-16 00:16:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-16 00:16:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-16 00:16:42] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-16 00:16:42] [INFO ] Added : 21 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 180 ms.
[2023-03-16 00:16:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:43] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 00:16:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 00:16:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-16 00:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-16 00:16:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 00:16:43] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2023-03-16 00:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-16 00:16:43] [INFO ] Added : 36 causal constraints over 8 iterations in 157 ms. Result :sat
Minimization took 16 ms.
[2023-03-16 00:16:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 00:16:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:43] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 00:16:43] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-16 00:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-16 00:16:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 00:16:43] [INFO ] Added : 20 causal constraints over 5 iterations in 28 ms. Result :sat
Minimization took 13 ms.
[2023-03-16 00:16:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:43] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 00:16:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:43] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 00:16:43] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2023-03-16 00:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-16 00:16:43] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 00:16:43] [INFO ] Added : 18 causal constraints over 4 iterations in 259 ms. Result :sat
Minimization took 59 ms.
[2023-03-16 00:16:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:43] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-16 00:16:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 00:16:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:44] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 00:16:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 00:16:44] [INFO ] Added : 36 causal constraints over 8 iterations in 46 ms. Result :sat
Minimization took 14 ms.
[2023-03-16 00:16:44] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 00:16:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:44] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-16 00:16:44] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2023-03-16 00:16:44] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2023-03-16 00:16:44] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2023-03-16 00:16:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 85 ms
[2023-03-16 00:16:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 00:16:44] [INFO ] Added : 36 causal constraints over 8 iterations in 36 ms. Result :sat
Minimization took 13 ms.
[2023-03-16 00:16:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 00:16:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 00:16:44] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2023-03-16 00:16:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-16 00:16:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 00:16:44] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2023-03-16 00:16:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-16 00:16:44] [INFO ] Added : 33 causal constraints over 7 iterations in 144 ms. Result :sat
Minimization took 25 ms.
[2023-03-16 00:16:44] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 00:16:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 00:16:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 00:16:44] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 00:16:44] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-16 00:16:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:44] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 00:16:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-16 00:16:44] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2023-03-16 00:16:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-16 00:16:44] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 00:16:44] [INFO ] Added : 15 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [1, 5, 3, 10, 10, -1, 2, 10, -1, -1, 1, 5, 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-16 00:16:44] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 44 ms.
[2023-03-16 00:16:44] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 7 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 683 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :28
FORMULA PolyORBNT-COL-S05J30-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :20
FORMULA PolyORBNT-COL-S05J30-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :15
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :15
Incomplete Best-First random walk after 10001 steps, including 147 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 10001 steps, including 184 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :18
[2023-03-16 00:16:45] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2023-03-16 00:16:45] [INFO ] Computed 82 place invariants in 49 ms
[2023-03-16 00:16:45] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-16 00:16:45] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-16 00:16:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:45] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2023-03-16 00:16:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:45] [INFO ] [Nat]Absence check using 75 positive place invariants in 21 ms returned sat
[2023-03-16 00:16:45] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-16 00:16:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:46] [INFO ] [Nat]Absence check using state equation in 607 ms returned unsat
[2023-03-16 00:16:46] [INFO ] [Real]Absence check using 75 positive place invariants in 19 ms returned sat
[2023-03-16 00:16:46] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 00:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:46] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2023-03-16 00:16:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:46] [INFO ] [Nat]Absence check using 75 positive place invariants in 18 ms returned sat
[2023-03-16 00:16:46] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-16 00:16:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:51] [INFO ] [Nat]Absence check using state equation in 4931 ms returned unknown
[2023-03-16 00:16:51] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-16 00:16:51] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-16 00:16:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:51] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2023-03-16 00:16:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:51] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-16 00:16:51] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 00:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:52] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2023-03-16 00:16:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:16:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2023-03-16 00:16:52] [INFO ] Computed and/alt/rep : 449/1109/449 causal constraints (skipped 286 transitions) in 67 ms.
[2023-03-16 00:16:52] [INFO ] Added : 14 causal constraints over 3 iterations in 253 ms. Result :sat
Minimization took 114 ms.
[2023-03-16 00:16:52] [INFO ] [Real]Absence check using 75 positive place invariants in 18 ms returned sat
[2023-03-16 00:16:52] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned unsat
[2023-03-16 00:16:52] [INFO ] [Real]Absence check using 75 positive place invariants in 18 ms returned sat
[2023-03-16 00:16:52] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 6 ms returned unsat
[2023-03-16 00:16:52] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-16 00:16:52] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 3 ms returned unsat
[2023-03-16 00:16:53] [INFO ] [Real]Absence check using 75 positive place invariants in 19 ms returned sat
[2023-03-16 00:16:53] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 4 ms returned unsat
[2023-03-16 00:16:53] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-16 00:16:53] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-16 00:16:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:53] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2023-03-16 00:16:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:16:53] [INFO ] [Nat]Absence check using 75 positive place invariants in 18 ms returned sat
[2023-03-16 00:16:53] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-16 00:16:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:16:53] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2023-03-16 00:16:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2023-03-16 00:16:53] [INFO ] Computed and/alt/rep : 449/1109/449 causal constraints (skipped 286 transitions) in 47 ms.
[2023-03-16 00:16:53] [INFO ] Added : 9 causal constraints over 2 iterations in 202 ms. Result :sat
Minimization took 144 ms.
Current structural bounds on expressions (after SMT) : [4, 10, 10, 1, 4, 1, 1, 1] Max seen :[4, 4, 3, 1, 4, 1, 1, 0]
FORMULA PolyORBNT-COL-S05J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 484 transition count 709
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 77 place count 448 transition count 709
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 77 place count 448 transition count 675
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 145 place count 414 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 413 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 413 transition count 674
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 151 place count 411 transition count 672
Applied a total of 151 rules in 150 ms. Remains 411 /489 variables (removed 78) and now considering 672/745 (removed 73) transitions.
[2023-03-16 00:16:54] [INFO ] Flow matrix only has 668 transitions (discarded 4 similar events)
// Phase 1: matrix 668 rows 411 cols
[2023-03-16 00:16:54] [INFO ] Computed 77 place invariants in 15 ms
[2023-03-16 00:16:54] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 411/489 places, 577/745 transitions.
Applied a total of 0 rules in 20 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 542 ms. Remains : 411/489 places, 577/745 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 00:16:54] [INFO ] Computed 77 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 47261 resets, run finished after 3159 ms. (steps per millisecond=316 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 4162 resets, run finished after 943 ms. (steps per millisecond=1060 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 5526 resets, run finished after 991 ms. (steps per millisecond=1009 ) properties (out of 2) seen :7
[2023-03-16 00:16:59] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 00:16:59] [INFO ] Computed 77 place invariants in 15 ms
[2023-03-16 00:16:59] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-16 00:16:59] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-16 00:16:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:17:00] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-16 00:17:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:17:00] [INFO ] [Nat]Absence check using 70 positive place invariants in 14 ms returned sat
[2023-03-16 00:17:00] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-16 00:17:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:17:00] [INFO ] [Nat]Absence check using state equation in 394 ms returned unsat
[2023-03-16 00:17:00] [INFO ] [Real]Absence check using 70 positive place invariants in 14 ms returned sat
[2023-03-16 00:17:00] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 00:17:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:17:00] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-16 00:17:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:17:00] [INFO ] [Nat]Absence check using 70 positive place invariants in 14 ms returned sat
[2023-03-16 00:17:00] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 00:17:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:17:01] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2023-03-16 00:17:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:17:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 59 ms returned sat
[2023-03-16 00:17:01] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 1 ms to minimize.
[2023-03-16 00:17:01] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 0 ms to minimize.
[2023-03-16 00:17:01] [INFO ] Deduced a trap composed of 143 places in 130 ms of which 0 ms to minimize.
[2023-03-16 00:17:01] [INFO ] Deduced a trap composed of 128 places in 132 ms of which 1 ms to minimize.
[2023-03-16 00:17:01] [INFO ] Deduced a trap composed of 143 places in 133 ms of which 0 ms to minimize.
[2023-03-16 00:17:02] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 0 ms to minimize.
[2023-03-16 00:17:02] [INFO ] Deduced a trap composed of 114 places in 155 ms of which 13 ms to minimize.
[2023-03-16 00:17:02] [INFO ] Deduced a trap composed of 122 places in 175 ms of which 0 ms to minimize.
[2023-03-16 00:17:02] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:17:03] [INFO ] Deduced a trap composed of 146 places in 144 ms of which 0 ms to minimize.
[2023-03-16 00:17:03] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 0 ms to minimize.
[2023-03-16 00:17:03] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 0 ms to minimize.
[2023-03-16 00:17:03] [INFO ] Deduced a trap composed of 128 places in 202 ms of which 1 ms to minimize.
[2023-03-16 00:17:03] [INFO ] Deduced a trap composed of 131 places in 206 ms of which 2 ms to minimize.
[2023-03-16 00:17:04] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 0 ms to minimize.
[2023-03-16 00:17:04] [INFO ] Deduced a trap composed of 122 places in 122 ms of which 1 ms to minimize.
[2023-03-16 00:17:04] [INFO ] Deduced a trap composed of 119 places in 127 ms of which 1 ms to minimize.
[2023-03-16 00:17:04] [INFO ] Deduced a trap composed of 134 places in 123 ms of which 0 ms to minimize.
[2023-03-16 00:17:04] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 0 ms to minimize.
[2023-03-16 00:17:05] [INFO ] Deduced a trap composed of 119 places in 129 ms of which 1 ms to minimize.
[2023-03-16 00:17:05] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 1 ms to minimize.
[2023-03-16 00:17:05] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 1 ms to minimize.
[2023-03-16 00:17:05] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 1 ms to minimize.
[2023-03-16 00:17:05] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2023-03-16 00:17:05] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 1 ms to minimize.
[2023-03-16 00:17:06] [INFO ] Deduced a trap composed of 116 places in 130 ms of which 1 ms to minimize.
[2023-03-16 00:17:06] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 1 ms to minimize.
[2023-03-16 00:17:06] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 0 ms to minimize.
[2023-03-16 00:17:06] [INFO ] Deduced a trap composed of 116 places in 126 ms of which 0 ms to minimize.
[2023-03-16 00:17:06] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 1 ms to minimize.
[2023-03-16 00:17:07] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 0 ms to minimize.
[2023-03-16 00:17:07] [INFO ] Deduced a trap composed of 137 places in 124 ms of which 1 ms to minimize.
[2023-03-16 00:17:07] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 0 ms to minimize.
[2023-03-16 00:17:07] [INFO ] Deduced a trap composed of 122 places in 120 ms of which 0 ms to minimize.
[2023-03-16 00:17:08] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 1 ms to minimize.
[2023-03-16 00:17:08] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 1 ms to minimize.
[2023-03-16 00:17:08] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 1 ms to minimize.
[2023-03-16 00:17:08] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 1 ms to minimize.
[2023-03-16 00:17:09] [INFO ] Deduced a trap composed of 144 places in 122 ms of which 1 ms to minimize.
[2023-03-16 00:17:09] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 1 ms to minimize.
[2023-03-16 00:17:09] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 0 ms to minimize.
[2023-03-16 00:17:09] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 1 ms to minimize.
[2023-03-16 00:17:10] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 1 ms to minimize.
[2023-03-16 00:17:10] [INFO ] Deduced a trap composed of 138 places in 127 ms of which 1 ms to minimize.
[2023-03-16 00:17:10] [INFO ] Deduced a trap composed of 119 places in 126 ms of which 0 ms to minimize.
[2023-03-16 00:17:11] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 0 ms to minimize.
[2023-03-16 00:17:11] [INFO ] Deduced a trap composed of 137 places in 132 ms of which 0 ms to minimize.
[2023-03-16 00:17:11] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 1 ms to minimize.
[2023-03-16 00:17:11] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 2 ms to minimize.
[2023-03-16 00:17:11] [INFO ] Deduced a trap composed of 125 places in 116 ms of which 0 ms to minimize.
[2023-03-16 00:17:15] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 13905 ms
Current structural bounds on expressions (after SMT) : [4, 10] Max seen :[4, 3]
FORMULA PolyORBNT-COL-S05J30-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 16 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 411/411 places, 577/577 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 00:17:15] [INFO ] Computed 77 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 47187 resets, run finished after 2938 ms. (steps per millisecond=340 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5525 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 1) seen :3
[2023-03-16 00:17:18] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 00:17:18] [INFO ] Computed 77 place invariants in 18 ms
[2023-03-16 00:17:19] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-16 00:17:19] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 00:17:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:17:19] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-16 00:17:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:17:19] [INFO ] [Nat]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-16 00:17:19] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-16 00:17:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:17:19] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-16 00:17:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:17:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 61 ms returned sat
[2023-03-16 00:17:19] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 0 ms to minimize.
[2023-03-16 00:17:19] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 1 ms to minimize.
[2023-03-16 00:17:19] [INFO ] Deduced a trap composed of 143 places in 130 ms of which 1 ms to minimize.
[2023-03-16 00:17:20] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 1 ms to minimize.
[2023-03-16 00:17:20] [INFO ] Deduced a trap composed of 143 places in 126 ms of which 0 ms to minimize.
[2023-03-16 00:17:20] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 1 ms to minimize.
[2023-03-16 00:17:20] [INFO ] Deduced a trap composed of 114 places in 124 ms of which 0 ms to minimize.
[2023-03-16 00:17:20] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 0 ms to minimize.
[2023-03-16 00:17:21] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2023-03-16 00:17:21] [INFO ] Deduced a trap composed of 146 places in 112 ms of which 1 ms to minimize.
[2023-03-16 00:17:21] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 1 ms to minimize.
[2023-03-16 00:17:21] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 1 ms to minimize.
[2023-03-16 00:17:21] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 0 ms to minimize.
[2023-03-16 00:17:21] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 0 ms to minimize.
[2023-03-16 00:17:21] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 1 ms to minimize.
[2023-03-16 00:17:22] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 0 ms to minimize.
[2023-03-16 00:17:22] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 1 ms to minimize.
[2023-03-16 00:17:22] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 0 ms to minimize.
[2023-03-16 00:17:22] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2023-03-16 00:17:22] [INFO ] Deduced a trap composed of 119 places in 127 ms of which 1 ms to minimize.
[2023-03-16 00:17:23] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 0 ms to minimize.
[2023-03-16 00:17:23] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 0 ms to minimize.
[2023-03-16 00:17:23] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 1 ms to minimize.
[2023-03-16 00:17:23] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:17:23] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 1 ms to minimize.
[2023-03-16 00:17:23] [INFO ] Deduced a trap composed of 116 places in 126 ms of which 0 ms to minimize.
[2023-03-16 00:17:24] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 0 ms to minimize.
[2023-03-16 00:17:24] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 1 ms to minimize.
[2023-03-16 00:17:24] [INFO ] Deduced a trap composed of 116 places in 116 ms of which 0 ms to minimize.
[2023-03-16 00:17:24] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2023-03-16 00:17:24] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:17:25] [INFO ] Deduced a trap composed of 137 places in 120 ms of which 0 ms to minimize.
[2023-03-16 00:17:25] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 1 ms to minimize.
[2023-03-16 00:17:25] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 1 ms to minimize.
[2023-03-16 00:17:26] [INFO ] Deduced a trap composed of 119 places in 117 ms of which 0 ms to minimize.
[2023-03-16 00:17:26] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 0 ms to minimize.
[2023-03-16 00:17:26] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 0 ms to minimize.
[2023-03-16 00:17:26] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 1 ms to minimize.
[2023-03-16 00:17:26] [INFO ] Deduced a trap composed of 144 places in 118 ms of which 1 ms to minimize.
[2023-03-16 00:17:27] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 1 ms to minimize.
[2023-03-16 00:17:27] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 0 ms to minimize.
[2023-03-16 00:17:27] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2023-03-16 00:17:27] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2023-03-16 00:17:28] [INFO ] Deduced a trap composed of 138 places in 121 ms of which 0 ms to minimize.
[2023-03-16 00:17:28] [INFO ] Deduced a trap composed of 119 places in 118 ms of which 0 ms to minimize.
[2023-03-16 00:17:29] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 1 ms to minimize.
[2023-03-16 00:17:29] [INFO ] Deduced a trap composed of 137 places in 116 ms of which 1 ms to minimize.
[2023-03-16 00:17:29] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 0 ms to minimize.
[2023-03-16 00:17:29] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 1 ms to minimize.
[2023-03-16 00:17:29] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 0 ms to minimize.
[2023-03-16 00:17:32] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 13343 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 15 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 411/411 places, 577/577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 15 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-16 00:17:32] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 00:17:32] [INFO ] Invariant cache hit.
[2023-03-16 00:17:33] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-16 00:17:33] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 00:17:33] [INFO ] Invariant cache hit.
[2023-03-16 00:17:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:17:34] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
[2023-03-16 00:17:34] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-16 00:17:34] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 00:17:34] [INFO ] Invariant cache hit.
[2023-03-16 00:17:34] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2129 ms. Remains : 411/411 places, 577/577 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J30-UpperBounds-05
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 00:17:34] [INFO ] Computed 77 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 451 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :3
[2023-03-16 00:17:35] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 00:17:35] [INFO ] Computed 77 place invariants in 15 ms
[2023-03-16 00:17:35] [INFO ] [Real]Absence check using 70 positive place invariants in 12 ms returned sat
[2023-03-16 00:17:35] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 00:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:17:35] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-16 00:17:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:17:35] [INFO ] [Nat]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-16 00:17:35] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-16 00:17:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:17:35] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-16 00:17:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:17:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 59 ms returned sat
[2023-03-16 00:17:35] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 0 ms to minimize.
[2023-03-16 00:17:35] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 1 ms to minimize.
[2023-03-16 00:17:35] [INFO ] Deduced a trap composed of 143 places in 110 ms of which 0 ms to minimize.
[2023-03-16 00:17:36] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 0 ms to minimize.
[2023-03-16 00:17:36] [INFO ] Deduced a trap composed of 143 places in 129 ms of which 1 ms to minimize.
[2023-03-16 00:17:36] [INFO ] Deduced a trap composed of 137 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:17:36] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 1 ms to minimize.
[2023-03-16 00:17:36] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 1 ms to minimize.
[2023-03-16 00:17:37] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 0 ms to minimize.
[2023-03-16 00:17:37] [INFO ] Deduced a trap composed of 146 places in 110 ms of which 0 ms to minimize.
[2023-03-16 00:17:37] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 0 ms to minimize.
[2023-03-16 00:17:37] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 0 ms to minimize.
[2023-03-16 00:17:37] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 1 ms to minimize.
[2023-03-16 00:17:37] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 1 ms to minimize.
[2023-03-16 00:17:38] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 1 ms to minimize.
[2023-03-16 00:17:38] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 0 ms to minimize.
[2023-03-16 00:17:38] [INFO ] Deduced a trap composed of 119 places in 117 ms of which 1 ms to minimize.
[2023-03-16 00:17:38] [INFO ] Deduced a trap composed of 134 places in 118 ms of which 0 ms to minimize.
[2023-03-16 00:17:38] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 1 ms to minimize.
[2023-03-16 00:17:38] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 1 ms to minimize.
[2023-03-16 00:17:38] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 1 ms to minimize.
[2023-03-16 00:17:39] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2023-03-16 00:17:39] [INFO ] Deduced a trap composed of 119 places in 119 ms of which 0 ms to minimize.
[2023-03-16 00:17:39] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2023-03-16 00:17:39] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 0 ms to minimize.
[2023-03-16 00:17:39] [INFO ] Deduced a trap composed of 116 places in 116 ms of which 1 ms to minimize.
[2023-03-16 00:17:40] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 1 ms to minimize.
[2023-03-16 00:17:40] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 1 ms to minimize.
[2023-03-16 00:17:40] [INFO ] Deduced a trap composed of 116 places in 117 ms of which 0 ms to minimize.
[2023-03-16 00:17:40] [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 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 19 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-16 00:17:40] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 00:17:40] [INFO ] Invariant cache hit.
[2023-03-16 00:17:40] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 368 ms. Remains : 411/411 places, 577/577 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 00:17:40] [INFO ] Computed 77 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 47297 resets, run finished after 2974 ms. (steps per millisecond=336 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5449 resets, run finished after 943 ms. (steps per millisecond=1060 ) properties (out of 1) seen :3
[2023-03-16 00:17:44] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-16 00:17:44] [INFO ] Computed 77 place invariants in 13 ms
[2023-03-16 00:17:44] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-16 00:17:44] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-16 00:17:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 00:17:44] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-16 00:17:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 00:17:45] [INFO ] [Nat]Absence check using 70 positive place invariants in 13 ms returned sat
[2023-03-16 00:17:45] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-16 00:17:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 00:17:45] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2023-03-16 00:17:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:17:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 61 ms returned sat
[2023-03-16 00:17:45] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 0 ms to minimize.
[2023-03-16 00:17:45] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 0 ms to minimize.
[2023-03-16 00:17:45] [INFO ] Deduced a trap composed of 143 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:17:45] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 1 ms to minimize.
[2023-03-16 00:17:46] [INFO ] Deduced a trap composed of 143 places in 115 ms of which 0 ms to minimize.
[2023-03-16 00:17:46] [INFO ] Deduced a trap composed of 137 places in 122 ms of which 1 ms to minimize.
[2023-03-16 00:17:46] [INFO ] Deduced a trap composed of 114 places in 128 ms of which 1 ms to minimize.
[2023-03-16 00:17:46] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 0 ms to minimize.
[2023-03-16 00:17:46] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 0 ms to minimize.
[2023-03-16 00:17:47] [INFO ] Deduced a trap composed of 146 places in 114 ms of which 1 ms to minimize.
[2023-03-16 00:17:47] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 0 ms to minimize.
[2023-03-16 00:17:47] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 1 ms to minimize.
[2023-03-16 00:17:47] [INFO ] Deduced a trap composed of 128 places in 117 ms of which 1 ms to minimize.
[2023-03-16 00:17:47] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 0 ms to minimize.
[2023-03-16 00:17:47] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 0 ms to minimize.
[2023-03-16 00:17:47] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 0 ms to minimize.
[2023-03-16 00:17:48] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 1 ms to minimize.
[2023-03-16 00:17:48] [INFO ] Deduced a trap composed of 134 places in 111 ms of which 1 ms to minimize.
[2023-03-16 00:17:48] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 0 ms to minimize.
[2023-03-16 00:17:48] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 0 ms to minimize.
[2023-03-16 00:17:48] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 0 ms to minimize.
[2023-03-16 00:17:48] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 0 ms to minimize.
[2023-03-16 00:17:49] [INFO ] Deduced a trap composed of 119 places in 118 ms of which 1 ms to minimize.
[2023-03-16 00:17:49] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 0 ms to minimize.
[2023-03-16 00:17:49] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 0 ms to minimize.
[2023-03-16 00:17:49] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 0 ms to minimize.
[2023-03-16 00:17:49] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2023-03-16 00:17:49] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 0 ms to minimize.
[2023-03-16 00:17:50] [INFO ] Deduced a trap composed of 116 places in 116 ms of which 1 ms to minimize.
[2023-03-16 00:17:50] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 0 ms to minimize.
[2023-03-16 00:17:50] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:17:50] [INFO ] Deduced a trap composed of 137 places in 113 ms of which 0 ms to minimize.
[2023-03-16 00:17:51] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 0 ms to minimize.
[2023-03-16 00:17:51] [INFO ] Deduced a trap composed of 122 places in 114 ms of which 0 ms to minimize.
[2023-03-16 00:17:51] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 0 ms to minimize.
[2023-03-16 00:17:51] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 1 ms to minimize.
[2023-03-16 00:17:52] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:17:52] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 1 ms to minimize.
[2023-03-16 00:17:52] [INFO ] Deduced a trap composed of 144 places in 125 ms of which 1 ms to minimize.
[2023-03-16 00:17:52] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 1 ms to minimize.
[2023-03-16 00:17:52] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 0 ms to minimize.
[2023-03-16 00:17:53] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 0 ms to minimize.
[2023-03-16 00:17:53] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 0 ms to minimize.
[2023-03-16 00:17:53] [INFO ] Deduced a trap composed of 138 places in 125 ms of which 0 ms to minimize.
[2023-03-16 00:17:54] [INFO ] Deduced a trap composed of 119 places in 122 ms of which 0 ms to minimize.
[2023-03-16 00:17:54] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 0 ms to minimize.
[2023-03-16 00:17:54] [INFO ] Deduced a trap composed of 137 places in 112 ms of which 1 ms to minimize.
[2023-03-16 00:17:54] [INFO ] Deduced a trap composed of 134 places in 111 ms of which 0 ms to minimize.
[2023-03-16 00:17:55] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 1 ms to minimize.
[2023-03-16 00:17:55] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 1 ms to minimize.
[2023-03-16 00:17:58] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 13079 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 13 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 411/411 places, 577/577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 13 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-16 00:17:58] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 00:17:58] [INFO ] Invariant cache hit.
[2023-03-16 00:17:58] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-16 00:17:58] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 00:17:58] [INFO ] Invariant cache hit.
[2023-03-16 00:17:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-16 00:18:00] [INFO ] Implicit Places using invariants and state equation in 1353 ms returned []
Implicit Place search using SMT with State Equation took 1730 ms to find 0 implicit places.
[2023-03-16 00:18:00] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-16 00:18:00] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-16 00:18:00] [INFO ] Invariant cache hit.
[2023-03-16 00:18:00] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2047 ms. Remains : 411/411 places, 577/577 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J30-UpperBounds-05 in 25460 ms.
[2023-03-16 00:18:00] [INFO ] Flatten gal took : 94 ms
[2023-03-16 00:18:00] [INFO ] Applying decomposition
[2023-03-16 00:18:00] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5829255587256934346.txt' '-o' '/tmp/graph5829255587256934346.bin' '-w' '/tmp/graph5829255587256934346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5829255587256934346.bin' '-l' '-1' '-v' '-w' '/tmp/graph5829255587256934346.weights' '-q' '0' '-e' '0.001'
[2023-03-16 00:18:00] [INFO ] Decomposing Gal with order
[2023-03-16 00:18:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 00:18:01] [INFO ] Removed a total of 541 redundant transitions.
[2023-03-16 00:18:01] [INFO ] Flatten gal took : 203 ms
[2023-03-16 00:18:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 29 ms.
[2023-03-16 00:18:01] [INFO ] Time to serialize gal into /tmp/UpperBounds8119200385456638326.gal : 10 ms
[2023-03-16 00:18:01] [INFO ] Time to serialize properties into /tmp/UpperBounds4254217710939537225.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8119200385456638326.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4254217710939537225.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds4254217710939537225.prop.
Detected timeout of ITS tools.
[2023-03-16 00:39:02] [INFO ] Applying decomposition
[2023-03-16 00:39:02] [INFO ] Flatten gal took : 270 ms
[2023-03-16 00:39:02] [INFO ] Decomposing Gal with order
[2023-03-16 00:39:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 00:39:03] [INFO ] Removed a total of 2114 redundant transitions.
[2023-03-16 00:39:03] [INFO ] Flatten gal took : 785 ms
[2023-03-16 00:39:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9324 ms.
[2023-03-16 00:39:12] [INFO ] Time to serialize gal into /tmp/UpperBounds16538027379962912557.gal : 63 ms
[2023-03-16 00:39:12] [INFO ] Time to serialize properties into /tmp/UpperBounds4056186834445475270.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16538027379962912557.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4056186834445475270.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds4056186834445475270.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.48727e+09,160.3,3016176,1.01021e+06,25,7.7468e+06,2072,1408,7.37908e+06,48,1885,0
Total reachable state count : 3487273800
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property PolyORBNT-COL-S05J30-UpperBounds-05 :0 <= QueueJobE.QueueJobE_0 <= 3
FORMULA PolyORBNT-COL-S05J30-UpperBounds-05 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBNT-COL-S05J30-UpperBounds-05,0,211.787,3021796,1,0,7.7468e+06,2072,2920,1.39013e+07,60,1885,34008
Total runtime 1565203 ms.
BK_STOP 1678927369269
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J30"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J30, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873945700645"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J30.tgz
mv PolyORBNT-COL-S05J30 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 ;