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.r299-tall-167873953300685.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 smartxred
Input is PolyORBNT-COL-S10J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953300685
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.9K Feb 26 00:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 00:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 01:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:07 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 93K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679531951825

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J30
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 00:39:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 00:39:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:39:13] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-23 00:39:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 00:39:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 468 ms
[2023-03-23 00:39:13] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-23 00:39:13] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2023-03-23 00:39:13] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 00:39:13] [INFO ] Computed 13 place invariants in 10 ms
FORMULA PolyORBNT-COL-S10J30-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-23 00:39:13] [INFO ] Invariant cache hit.
[2023-03-23 00:39:14] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-23 00:39:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-23 00:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-23 00:39:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:39:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:14] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-23 00:39:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:39:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:39:14] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
[2023-03-23 00:39:14] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2023-03-23 00:39:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2023-03-23 00:39:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 00:39:14] [INFO ] Added : 36 causal constraints over 8 iterations in 84 ms. Result :sat
Minimization took 170 ms.
[2023-03-23 00:39:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:14] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:39:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:39:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:14] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-23 00:39:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2023-03-23 00:39:14] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2023-03-23 00:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-23 00:39:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 00:39:14] [INFO ] Added : 20 causal constraints over 5 iterations in 87 ms. Result :sat
Minimization took 16 ms.
[2023-03-23 00:39:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:14] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-23 00:39:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:39:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:39:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:14] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-23 00:39:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:39:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 00:39:15] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2023-03-23 00:39:15] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2023-03-23 00:39:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-03-23 00:39:15] [INFO ] Added : 36 causal constraints over 8 iterations in 211 ms. Result :sat
Minimization took 14 ms.
[2023-03-23 00:39:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:15] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:39:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:15] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 00:39:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 00:39:15] [INFO ] Added : 21 causal constraints over 5 iterations in 336 ms. Result :sat
Minimization took 144 ms.
[2023-03-23 00:39:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:15] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2023-03-23 00:39:15] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-23 00:39:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:15] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 00:39:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 00:39:15] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 9 ms.
[2023-03-23 00:39:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 00:39:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 00:39:16] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 00:39:16] [INFO ] Added : 4 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 8 ms.
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-23 00:39:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 00:39:16] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2023-03-23 00:39:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-23 00:39:16] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 00:39:16] [INFO ] Added : 21 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 59 ms.
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 00:39:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:39:16] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2023-03-23 00:39:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-23 00:39:16] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 00:39:16] [INFO ] Added : 36 causal constraints over 8 iterations in 45 ms. Result :sat
Minimization took 12 ms.
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-23 00:39:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:39:16] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-23 00:39:16] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-23 00:39:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 00:39:16] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-23 00:39:16] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2023-03-23 00:39:16] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2023-03-23 00:39:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 92 ms
[2023-03-23 00:39:16] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 00:39:16] [INFO ] Added : 36 causal constraints over 8 iterations in 42 ms. Result :sat
Minimization took 12 ms.
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-23 00:39:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:16] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-23 00:39:16] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 00:39:16] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 00:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:17] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 00:39:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-23 00:39:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 00:39:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:17] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-23 00:39:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:39:17] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 00:39:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2023-03-23 00:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-23 00:39:17] [INFO ] Added : 22 causal constraints over 5 iterations in 72 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1, 2, 1, 10, 10, -1, -1, 10, 1, -1, -1, -1, -1, 3]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-23 00:39:17] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 195 ms.
[2023-03-23 00:39:17] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 27 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 12) seen :4
FORMULA PolyORBNT-COL-S10J30-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :3
[2023-03-23 00:39:18] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-23 00:39:18] [INFO ] Computed 92 place invariants in 126 ms
[2023-03-23 00:39:18] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-23 00:39:18] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-23 00:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:18] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2023-03-23 00:39:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:18] [INFO ] [Nat]Absence check using 85 positive place invariants in 24 ms returned sat
[2023-03-23 00:39:18] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-23 00:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:19] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2023-03-23 00:39:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:39:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 72 ms returned sat
[2023-03-23 00:39:19] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 224 ms.
[2023-03-23 00:39:20] [INFO ] Deduced a trap composed of 19 places in 426 ms of which 1 ms to minimize.
[2023-03-23 00:39:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 820 ms
[2023-03-23 00:39:21] [INFO ] Added : 23 causal constraints over 5 iterations in 1595 ms. Result :sat
Minimization took 945 ms.
[2023-03-23 00:39:22] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-23 00:39:22] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-23 00:39:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:22] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2023-03-23 00:39:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:23] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2023-03-23 00:39:23] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-23 00:39:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:25] [INFO ] [Nat]Absence check using state equation in 2131 ms returned sat
[2023-03-23 00:39:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 54 ms returned sat
[2023-03-23 00:39:25] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 411 ms.
[2023-03-23 00:39:26] [INFO ] Deduced a trap composed of 324 places in 428 ms of which 1 ms to minimize.
[2023-03-23 00:39:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 576 ms
[2023-03-23 00:39:26] [INFO ] Added : 11 causal constraints over 3 iterations in 1470 ms. Result :sat
Minimization took 786 ms.
[2023-03-23 00:39:27] [INFO ] [Real]Absence check using 85 positive place invariants in 20 ms returned sat
[2023-03-23 00:39:27] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-23 00:39:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:28] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2023-03-23 00:39:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:28] [INFO ] [Nat]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-23 00:39:28] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-23 00:39:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:33] [INFO ] [Nat]Absence check using state equation in 4890 ms returned unknown
[2023-03-23 00:39:33] [INFO ] [Real]Absence check using 85 positive place invariants in 23 ms returned sat
[2023-03-23 00:39:33] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 8 ms returned unsat
[2023-03-23 00:39:33] [INFO ] [Real]Absence check using 85 positive place invariants in 24 ms returned sat
[2023-03-23 00:39:33] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 8 ms returned unsat
[2023-03-23 00:39:33] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-23 00:39:33] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-23 00:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:34] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2023-03-23 00:39:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:34] [INFO ] [Nat]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-23 00:39:34] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-23 00:39:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:35] [INFO ] [Nat]Absence check using state equation in 1229 ms returned sat
[2023-03-23 00:39:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 152 ms returned sat
[2023-03-23 00:39:35] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 119 ms.
[2023-03-23 00:39:39] [INFO ] Added : 10 causal constraints over 2 iterations in 3446 ms. Result :unknown
[2023-03-23 00:39:39] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-23 00:39:39] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-23 00:39:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:39] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2023-03-23 00:39:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:39] [INFO ] [Nat]Absence check using 85 positive place invariants in 25 ms returned sat
[2023-03-23 00:39:39] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-23 00:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:40] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2023-03-23 00:39:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 62 ms returned sat
[2023-03-23 00:39:40] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 127 ms.
[2023-03-23 00:39:41] [INFO ] Added : 7 causal constraints over 2 iterations in 380 ms. Result :sat
Minimization took 311 ms.
[2023-03-23 00:39:41] [INFO ] [Real]Absence check using 85 positive place invariants in 20 ms returned sat
[2023-03-23 00:39:41] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-23 00:39:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:41] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2023-03-23 00:39:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:42] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-23 00:39:42] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-23 00:39:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:42] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2023-03-23 00:39:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 247 ms returned sat
[2023-03-23 00:39:43] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 126 ms.
[2023-03-23 00:39:43] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 0 ms to minimize.
[2023-03-23 00:39:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 516 ms
[2023-03-23 00:39:44] [INFO ] Added : 32 causal constraints over 7 iterations in 1301 ms. Result :sat
Minimization took 818 ms.
[2023-03-23 00:39:45] [INFO ] [Real]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-23 00:39:45] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-23 00:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:45] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2023-03-23 00:39:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:45] [INFO ] [Nat]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-23 00:39:45] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-23 00:39:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:46] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2023-03-23 00:39:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 492 ms returned sat
[2023-03-23 00:39:47] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 133 ms.
[2023-03-23 00:39:48] [INFO ] Deduced a trap composed of 19 places in 461 ms of which 1 ms to minimize.
[2023-03-23 00:39:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 613 ms
[2023-03-23 00:39:48] [INFO ] Added : 33 causal constraints over 7 iterations in 1395 ms. Result :sat
Minimization took 672 ms.
[2023-03-23 00:39:49] [INFO ] [Real]Absence check using 85 positive place invariants in 21 ms returned sat
[2023-03-23 00:39:49] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 9 ms returned unsat
[2023-03-23 00:39:49] [INFO ] [Real]Absence check using 85 positive place invariants in 22 ms returned sat
[2023-03-23 00:39:49] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-23 00:39:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:49] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2023-03-23 00:39:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:39:50] [INFO ] [Nat]Absence check using 85 positive place invariants in 23 ms returned sat
[2023-03-23 00:39:50] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-23 00:39:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:39:51] [INFO ] [Nat]Absence check using state equation in 1074 ms returned sat
[2023-03-23 00:39:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 00:39:51] [INFO ] Deduced a trap composed of 182 places in 423 ms of which 0 ms to minimize.
[2023-03-23 00:39:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 560 ms
[2023-03-23 00:39:51] [INFO ] Computed and/alt/rep : 1447/4713/1447 causal constraints (skipped 473 transitions) in 128 ms.
[2023-03-23 00:39:52] [INFO ] Added : 16 causal constraints over 4 iterations in 635 ms. Result :sat
Minimization took 807 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 2, 10, 1, 1, 10, 2147483647, 2147483647, 2147483647, 1, 3] Max seen :[0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 77 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 654 transition count 1937
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 651 transition count 1936
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 650 transition count 1936
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 18 place count 650 transition count 1902
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 86 place count 616 transition count 1902
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 615 transition count 1901
Applied a total of 88 rules in 280 ms. Remains 615 /664 variables (removed 49) and now considering 1901/1940 (removed 39) transitions.
[2023-03-23 00:39:53] [INFO ] Flow matrix only has 1892 transitions (discarded 9 similar events)
// Phase 1: matrix 1892 rows 615 cols
[2023-03-23 00:39:53] [INFO ] Computed 82 place invariants in 73 ms
[2023-03-23 00:39:54] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 615/664 places, 1286/1940 transitions.
Applied a total of 0 rules in 37 ms. Remains 615 /615 variables (removed 0) and now considering 1286/1286 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1250 ms. Remains : 615/664 places, 1286/1940 transitions.
Normalized transition count is 1277 out of 1286 initially.
// Phase 1: matrix 1277 rows 615 cols
[2023-03-23 00:39:54] [INFO ] Computed 82 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 68170 resets, run finished after 10075 ms. (steps per millisecond=99 ) properties (out of 8) seen :16
FORMULA PolyORBNT-COL-S10J30-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 8806 resets, run finished after 1889 ms. (steps per millisecond=529 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 5960 resets, run finished after 1699 ms. (steps per millisecond=588 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000001 steps, including 8912 resets, run finished after 1897 ms. (steps per millisecond=527 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 8739 resets, run finished after 2226 ms. (steps per millisecond=449 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 8728 resets, run finished after 2299 ms. (steps per millisecond=434 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 8843 resets, run finished after 1892 ms. (steps per millisecond=528 ) properties (out of 6) seen :11
[2023-03-23 00:40:16] [INFO ] Flow matrix only has 1277 transitions (discarded 9 similar events)
// Phase 1: matrix 1277 rows 615 cols
[2023-03-23 00:40:16] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-23 00:40:17] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2023-03-23 00:40:17] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 10 ms returned unsat
[2023-03-23 00:40:17] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2023-03-23 00:40:17] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 8 ms returned unsat
[2023-03-23 00:40:17] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2023-03-23 00:40:17] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-23 00:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:40:17] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2023-03-23 00:40:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:40:17] [INFO ] [Nat]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-23 00:40:17] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 11 ms returned sat
[2023-03-23 00:40:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:40:17] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2023-03-23 00:40:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:40:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 253 ms returned sat
[2023-03-23 00:40:18] [INFO ] Deduced a trap composed of 275 places in 287 ms of which 0 ms to minimize.
[2023-03-23 00:40:18] [INFO ] Deduced a trap composed of 273 places in 285 ms of which 2 ms to minimize.
[2023-03-23 00:40:19] [INFO ] Deduced a trap composed of 271 places in 285 ms of which 1 ms to minimize.
[2023-03-23 00:40:19] [INFO ] Deduced a trap composed of 275 places in 287 ms of which 0 ms to minimize.
[2023-03-23 00:40:19] [INFO ] Deduced a trap composed of 275 places in 286 ms of which 0 ms to minimize.
[2023-03-23 00:40:20] [INFO ] Deduced a trap composed of 279 places in 258 ms of which 1 ms to minimize.
[2023-03-23 00:40:20] [INFO ] Deduced a trap composed of 271 places in 292 ms of which 1 ms to minimize.
[2023-03-23 00:40:20] [INFO ] Deduced a trap composed of 279 places in 290 ms of which 1 ms to minimize.
[2023-03-23 00:40:21] [INFO ] Deduced a trap composed of 271 places in 261 ms of which 0 ms to minimize.
[2023-03-23 00:40:21] [INFO ] Deduced a trap composed of 273 places in 291 ms of which 0 ms to minimize.
[2023-03-23 00:40:21] [INFO ] Deduced a trap composed of 279 places in 287 ms of which 1 ms to minimize.
[2023-03-23 00:40:22] [INFO ] Deduced a trap composed of 283 places in 263 ms of which 1 ms to minimize.
[2023-03-23 00:40:22] [INFO ] Deduced a trap composed of 279 places in 257 ms of which 1 ms to minimize.
[2023-03-23 00:40:22] [INFO ] Deduced a trap composed of 277 places in 257 ms of which 0 ms to minimize.
[2023-03-23 00:40:23] [INFO ] Deduced a trap composed of 269 places in 289 ms of which 0 ms to minimize.
[2023-03-23 00:40:23] [INFO ] Deduced a trap composed of 285 places in 264 ms of which 0 ms to minimize.
[2023-03-23 00:40:24] [INFO ] Deduced a trap composed of 277 places in 289 ms of which 1 ms to minimize.
[2023-03-23 00:40:24] [INFO ] Deduced a trap composed of 275 places in 287 ms of which 1 ms to minimize.
[2023-03-23 00:40:24] [INFO ] Deduced a trap composed of 279 places in 289 ms of which 2 ms to minimize.
[2023-03-23 00:40:25] [INFO ] Deduced a trap composed of 281 places in 293 ms of which 0 ms to minimize.
[2023-03-23 00:40:25] [INFO ] Deduced a trap composed of 283 places in 292 ms of which 1 ms to minimize.
[2023-03-23 00:40:25] [INFO ] Deduced a trap composed of 279 places in 260 ms of which 0 ms to minimize.
[2023-03-23 00:40:26] [INFO ] Deduced a trap composed of 277 places in 263 ms of which 1 ms to minimize.
[2023-03-23 00:40:26] [INFO ] Deduced a trap composed of 279 places in 258 ms of which 1 ms to minimize.
[2023-03-23 00:40:26] [INFO ] Deduced a trap composed of 271 places in 267 ms of which 3 ms to minimize.
[2023-03-23 00:40:27] [INFO ] Deduced a trap composed of 283 places in 255 ms of which 1 ms to minimize.
[2023-03-23 00:40:27] [INFO ] Deduced a trap composed of 271 places in 254 ms of which 0 ms to minimize.
[2023-03-23 00:40:28] [INFO ] Deduced a trap composed of 277 places in 271 ms of which 0 ms to minimize.
[2023-03-23 00:40:28] [INFO ] Deduced a trap composed of 283 places in 265 ms of which 1 ms to minimize.
[2023-03-23 00:40:29] [INFO ] Deduced a trap composed of 281 places in 290 ms of which 1 ms to minimize.
[2023-03-23 00:40:30] [INFO ] Deduced a trap composed of 281 places in 266 ms of which 1 ms to minimize.
[2023-03-23 00:40:30] [INFO ] Deduced a trap composed of 279 places in 255 ms of which 0 ms to minimize.
[2023-03-23 00:40:31] [INFO ] Deduced a trap composed of 283 places in 255 ms of which 1 ms to minimize.
[2023-03-23 00:40:32] [INFO ] Deduced a trap composed of 290 places in 268 ms of which 1 ms to minimize.
[2023-03-23 00:40:32] [INFO ] Deduced a trap composed of 279 places in 260 ms of which 2 ms to minimize.
[2023-03-23 00:40:33] [INFO ] Deduced a trap composed of 277 places in 256 ms of which 0 ms to minimize.
[2023-03-23 00:40:33] [INFO ] Deduced a trap composed of 281 places in 259 ms of which 0 ms to minimize.
[2023-03-23 00:40:33] [INFO ] Deduced a trap composed of 271 places in 263 ms of which 0 ms to minimize.
[2023-03-23 00:40:34] [INFO ] Deduced a trap composed of 283 places in 259 ms of which 0 ms to minimize.
[2023-03-23 00:40:35] [INFO ] Deduced a trap composed of 275 places in 261 ms of which 0 ms to minimize.
[2023-03-23 00:40:35] [INFO ] Deduced a trap composed of 281 places in 255 ms of which 1 ms to minimize.
[2023-03-23 00:40:37] [INFO ] Deduced a trap composed of 277 places in 265 ms of which 1 ms to minimize.
[2023-03-23 00:40:39] [INFO ] Deduced a trap composed of 275 places in 261 ms of which 1 ms to minimize.
[2023-03-23 00:40:40] [INFO ] Deduced a trap composed of 275 places in 270 ms of which 0 ms to minimize.
[2023-03-23 00:40:41] [INFO ] Deduced a trap composed of 264 places in 259 ms of which 1 ms to minimize.
[2023-03-23 00:40:42] [INFO ] Deduced a trap composed of 275 places in 264 ms of which 1 ms to minimize.
[2023-03-23 00:40:45] [INFO ] Deduced a trap composed of 277 places in 267 ms of which 0 ms to minimize.
[2023-03-23 00:40:46] [INFO ] Deduced a trap composed of 279 places in 266 ms of which 1 ms to minimize.
[2023-03-23 00:40:48] [INFO ] Deduced a trap composed of 281 places in 271 ms of which 0 ms to minimize.
[2023-03-23 00:40:51] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 33750 ms
[2023-03-23 00:40:51] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-23 00:40:51] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-23 00:40:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:40:52] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2023-03-23 00:40:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:40:52] [INFO ] [Nat]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-23 00:40:52] [INFO ] [Nat]Absence check using 76 positive and 6 generalized place invariants in 5 ms returned unsat
[2023-03-23 00:40:52] [INFO ] [Real]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-23 00:40:52] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 10 ms returned unsat
[2023-03-23 00:40:52] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2023-03-23 00:40:52] [INFO ] [Real]Absence check using 76 positive and 6 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 10, 1, 1, 1] Max seen :[1, 4, 3, 1, 1, 1]
FORMULA PolyORBNT-COL-S10J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 615 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 615/615 places, 1286/1286 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 615 transition count 1285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 614 transition count 1285
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 2 place count 614 transition count 1254
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 64 place count 583 transition count 1254
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 68 place count 581 transition count 1252
Applied a total of 68 rules in 89 ms. Remains 581 /615 variables (removed 34) and now considering 1252/1286 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 581/615 places, 1252/1286 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 00:40:52] [INFO ] Computed 82 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 70293 resets, run finished after 9119 ms. (steps per millisecond=109 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8848 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties (out of 1) seen :3
[2023-03-23 00:41:03] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 00:41:03] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-23 00:41:03] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-23 00:41:03] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-23 00:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:41:04] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2023-03-23 00:41:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:41:04] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-23 00:41:04] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-23 00:41:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:41:04] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2023-03-23 00:41:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:41:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 50 ms returned sat
[2023-03-23 00:41:04] [INFO ] Deduced a trap composed of 240 places in 262 ms of which 2 ms to minimize.
[2023-03-23 00:41:05] [INFO ] Deduced a trap composed of 238 places in 256 ms of which 0 ms to minimize.
[2023-03-23 00:41:05] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 3 ms to minimize.
[2023-03-23 00:41:05] [INFO ] Deduced a trap composed of 244 places in 255 ms of which 1 ms to minimize.
[2023-03-23 00:41:06] [INFO ] Deduced a trap composed of 233 places in 245 ms of which 0 ms to minimize.
[2023-03-23 00:41:06] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 0 ms to minimize.
[2023-03-23 00:41:06] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2023-03-23 00:41:06] [INFO ] Deduced a trap composed of 234 places in 249 ms of which 1 ms to minimize.
[2023-03-23 00:41:07] [INFO ] Deduced a trap composed of 236 places in 247 ms of which 1 ms to minimize.
[2023-03-23 00:41:07] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 0 ms to minimize.
[2023-03-23 00:41:07] [INFO ] Deduced a trap composed of 228 places in 250 ms of which 1 ms to minimize.
[2023-03-23 00:41:08] [INFO ] Deduced a trap composed of 224 places in 247 ms of which 1 ms to minimize.
[2023-03-23 00:41:08] [INFO ] Deduced a trap composed of 224 places in 249 ms of which 0 ms to minimize.
[2023-03-23 00:41:08] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 1 ms to minimize.
[2023-03-23 00:41:09] [INFO ] Deduced a trap composed of 226 places in 246 ms of which 1 ms to minimize.
[2023-03-23 00:41:09] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2023-03-23 00:41:09] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 1 ms to minimize.
[2023-03-23 00:41:10] [INFO ] Deduced a trap composed of 232 places in 243 ms of which 0 ms to minimize.
[2023-03-23 00:41:10] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 1 ms to minimize.
[2023-03-23 00:41:10] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 1 ms to minimize.
[2023-03-23 00:41:11] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 1 ms to minimize.
[2023-03-23 00:41:11] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 1 ms to minimize.
[2023-03-23 00:41:11] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 0 ms to minimize.
[2023-03-23 00:41:12] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 1 ms to minimize.
[2023-03-23 00:41:12] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2023-03-23 00:41:12] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 0 ms to minimize.
[2023-03-23 00:41:13] [INFO ] Deduced a trap composed of 236 places in 249 ms of which 1 ms to minimize.
[2023-03-23 00:41:14] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 1 ms to minimize.
[2023-03-23 00:41:14] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 0 ms to minimize.
[2023-03-23 00:41:14] [INFO ] Deduced a trap composed of 224 places in 243 ms of which 0 ms to minimize.
[2023-03-23 00:41:14] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 1 ms to minimize.
[2023-03-23 00:41:15] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 1 ms to minimize.
[2023-03-23 00:41:15] [INFO ] Deduced a trap composed of 240 places in 243 ms of which 0 ms to minimize.
[2023-03-23 00:41:15] [INFO ] Deduced a trap composed of 234 places in 250 ms of which 1 ms to minimize.
[2023-03-23 00:41:16] [INFO ] Deduced a trap composed of 224 places in 248 ms of which 0 ms to minimize.
[2023-03-23 00:41:16] [INFO ] Deduced a trap composed of 228 places in 238 ms of which 1 ms to minimize.
[2023-03-23 00:41:16] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 0 ms to minimize.
[2023-03-23 00:41:17] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 1 ms to minimize.
[2023-03-23 00:41:18] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 0 ms to minimize.
[2023-03-23 00:41:18] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 1 ms to minimize.
[2023-03-23 00:41:19] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 0 ms to minimize.
[2023-03-23 00:41:19] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 1 ms to minimize.
[2023-03-23 00:41:19] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 1 ms to minimize.
[2023-03-23 00:41:20] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 0 ms to minimize.
[2023-03-23 00:41:20] [INFO ] Deduced a trap composed of 238 places in 260 ms of which 1 ms to minimize.
[2023-03-23 00:41:21] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 0 ms to minimize.
[2023-03-23 00:41:21] [INFO ] Deduced a trap composed of 228 places in 252 ms of which 1 ms to minimize.
[2023-03-23 00:41:21] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 1 ms to minimize.
[2023-03-23 00:41:22] [INFO ] Deduced a trap composed of 232 places in 240 ms of which 0 ms to minimize.
[2023-03-23 00:41:22] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 0 ms to minimize.
[2023-03-23 00:41:22] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 1 ms to minimize.
[2023-03-23 00:41:23] [INFO ] Deduced a trap composed of 226 places in 249 ms of which 1 ms to minimize.
[2023-03-23 00:41:23] [INFO ] Deduced a trap composed of 234 places in 249 ms of which 1 ms to minimize.
[2023-03-23 00:41:23] [INFO ] Deduced a trap composed of 234 places in 244 ms of which 1 ms to minimize.
[2023-03-23 00:41:23] [INFO ] Deduced a trap composed of 224 places in 245 ms of which 0 ms to minimize.
[2023-03-23 00:41:24] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 1 ms to minimize.
[2023-03-23 00:41:25] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 0 ms to minimize.
[2023-03-23 00:41:25] [INFO ] Deduced a trap composed of 226 places in 248 ms of which 1 ms to minimize.
[2023-03-23 00:41:26] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 1 ms to minimize.
[2023-03-23 00:41:26] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 0 ms to minimize.
[2023-03-23 00:41:27] [INFO ] Deduced a trap composed of 234 places in 269 ms of which 1 ms to minimize.
[2023-03-23 00:41:27] [INFO ] Deduced a trap composed of 232 places in 244 ms of which 0 ms to minimize.
[2023-03-23 00:41:28] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 0 ms to minimize.
[2023-03-23 00:41:28] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 1 ms to minimize.
[2023-03-23 00:41:28] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 0 ms to minimize.
[2023-03-23 00:41:29] [INFO ] Deduced a trap composed of 232 places in 246 ms of which 0 ms to minimize.
[2023-03-23 00:41:30] [INFO ] Deduced a trap composed of 236 places in 244 ms of which 0 ms to minimize.
[2023-03-23 00:41:31] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 0 ms to minimize.
[2023-03-23 00:41:31] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 0 ms to minimize.
[2023-03-23 00:41:31] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 0 ms to minimize.
[2023-03-23 00:41:32] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 1 ms to minimize.
[2023-03-23 00:41:33] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 1 ms to minimize.
[2023-03-23 00:41:34] [INFO ] Deduced a trap composed of 224 places in 250 ms of which 1 ms to minimize.
[2023-03-23 00:41:37] [INFO ] Trap strengthening (SAT) tested/added 73/73 trap constraints in 33288 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 25 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 24 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-23 00:41:37] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 00:41:37] [INFO ] Invariant cache hit.
[2023-03-23 00:41:38] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-23 00:41:38] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 00:41:38] [INFO ] Invariant cache hit.
[2023-03-23 00:41:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:41:41] [INFO ] Implicit Places using invariants and state equation in 2768 ms returned []
Implicit Place search using SMT with State Equation took 3179 ms to find 0 implicit places.
[2023-03-23 00:41:41] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-23 00:41:41] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 00:41:41] [INFO ] Invariant cache hit.
[2023-03-23 00:41:41] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3854 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J30-UpperBounds-08
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 00:41:41] [INFO ] Computed 82 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 694 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2023-03-23 00:41:41] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 00:41:41] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-23 00:41:41] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-23 00:41:41] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-23 00:41:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:41:42] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2023-03-23 00:41:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:41:42] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-23 00:41:42] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-23 00:41:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:41:42] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2023-03-23 00:41:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:41:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 52 ms returned sat
[2023-03-23 00:41:43] [INFO ] Deduced a trap composed of 240 places in 251 ms of which 0 ms to minimize.
[2023-03-23 00:41:43] [INFO ] Deduced a trap composed of 238 places in 253 ms of which 1 ms to minimize.
[2023-03-23 00:41:43] [INFO ] Deduced a trap composed of 238 places in 259 ms of which 0 ms to minimize.
[2023-03-23 00:41:43] [INFO ] Deduced a trap composed of 244 places in 254 ms of which 1 ms to minimize.
[2023-03-23 00:41:44] [INFO ] Deduced a trap composed of 233 places in 259 ms of which 1 ms to minimize.
[2023-03-23 00:41:44] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 0 ms to minimize.
[2023-03-23 00:41:44] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 1 ms to minimize.
[2023-03-23 00:41:45] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 0 ms to minimize.
[2023-03-23 00:41:45] [INFO ] Deduced a trap composed of 236 places in 247 ms of which 1 ms to minimize.
[2023-03-23 00:41:45] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 1 ms to minimize.
[2023-03-23 00:41:46] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 1 ms to minimize.
[2023-03-23 00:41:46] [INFO ] Deduced a trap composed of 224 places in 254 ms of which 1 ms to minimize.
[2023-03-23 00:41:46] [INFO ] Deduced a trap composed of 224 places in 248 ms of which 0 ms to minimize.
[2023-03-23 00:41:47] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2023-03-23 00:41:47] [INFO ] Deduced a trap composed of 226 places in 275 ms of which 1 ms to minimize.
[2023-03-23 00:41:47] [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 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 29 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-23 00:41:47] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 00:41:47] [INFO ] Invariant cache hit.
[2023-03-23 00:41:47] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 568 ms. Remains : 581/581 places, 1252/1252 transitions.
Normalized transition count is 1243 out of 1252 initially.
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 00:41:48] [INFO ] Computed 82 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 70482 resets, run finished after 9166 ms. (steps per millisecond=109 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 8928 resets, run finished after 1732 ms. (steps per millisecond=577 ) properties (out of 1) seen :3
[2023-03-23 00:41:58] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-23 00:41:58] [INFO ] Computed 82 place invariants in 24 ms
[2023-03-23 00:41:59] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2023-03-23 00:41:59] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-23 00:41:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 00:41:59] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2023-03-23 00:41:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 00:41:59] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-23 00:41:59] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-23 00:41:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 00:41:59] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2023-03-23 00:41:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:41:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 52 ms returned sat
[2023-03-23 00:42:00] [INFO ] Deduced a trap composed of 240 places in 251 ms of which 1 ms to minimize.
[2023-03-23 00:42:00] [INFO ] Deduced a trap composed of 238 places in 246 ms of which 0 ms to minimize.
[2023-03-23 00:42:00] [INFO ] Deduced a trap composed of 238 places in 252 ms of which 1 ms to minimize.
[2023-03-23 00:42:01] [INFO ] Deduced a trap composed of 244 places in 247 ms of which 1 ms to minimize.
[2023-03-23 00:42:01] [INFO ] Deduced a trap composed of 233 places in 257 ms of which 0 ms to minimize.
[2023-03-23 00:42:01] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 1 ms to minimize.
[2023-03-23 00:42:01] [INFO ] Deduced a trap composed of 232 places in 240 ms of which 0 ms to minimize.
[2023-03-23 00:42:02] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 1 ms to minimize.
[2023-03-23 00:42:02] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 0 ms to minimize.
[2023-03-23 00:42:02] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 1 ms to minimize.
[2023-03-23 00:42:03] [INFO ] Deduced a trap composed of 228 places in 243 ms of which 1 ms to minimize.
[2023-03-23 00:42:03] [INFO ] Deduced a trap composed of 224 places in 244 ms of which 1 ms to minimize.
[2023-03-23 00:42:03] [INFO ] Deduced a trap composed of 224 places in 249 ms of which 1 ms to minimize.
[2023-03-23 00:42:04] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 1 ms to minimize.
[2023-03-23 00:42:04] [INFO ] Deduced a trap composed of 226 places in 249 ms of which 1 ms to minimize.
[2023-03-23 00:42:04] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 1 ms to minimize.
[2023-03-23 00:42:04] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 0 ms to minimize.
[2023-03-23 00:42:05] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 1 ms to minimize.
[2023-03-23 00:42:05] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 1 ms to minimize.
[2023-03-23 00:42:06] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 0 ms to minimize.
[2023-03-23 00:42:06] [INFO ] Deduced a trap composed of 228 places in 250 ms of which 0 ms to minimize.
[2023-03-23 00:42:06] [INFO ] Deduced a trap composed of 232 places in 264 ms of which 1 ms to minimize.
[2023-03-23 00:42:07] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 1 ms to minimize.
[2023-03-23 00:42:07] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 0 ms to minimize.
[2023-03-23 00:42:07] [INFO ] Deduced a trap composed of 234 places in 240 ms of which 1 ms to minimize.
[2023-03-23 00:42:08] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 0 ms to minimize.
[2023-03-23 00:42:08] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 1 ms to minimize.
[2023-03-23 00:42:09] [INFO ] Deduced a trap composed of 224 places in 246 ms of which 1 ms to minimize.
[2023-03-23 00:42:09] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 0 ms to minimize.
[2023-03-23 00:42:09] [INFO ] Deduced a trap composed of 224 places in 247 ms of which 0 ms to minimize.
[2023-03-23 00:42:10] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 0 ms to minimize.
[2023-03-23 00:42:10] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 0 ms to minimize.
[2023-03-23 00:42:10] [INFO ] Deduced a trap composed of 240 places in 247 ms of which 0 ms to minimize.
[2023-03-23 00:42:11] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 0 ms to minimize.
[2023-03-23 00:42:11] [INFO ] Deduced a trap composed of 224 places in 249 ms of which 0 ms to minimize.
[2023-03-23 00:42:11] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 0 ms to minimize.
[2023-03-23 00:42:12] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 0 ms to minimize.
[2023-03-23 00:42:12] [INFO ] Deduced a trap composed of 234 places in 243 ms of which 1 ms to minimize.
[2023-03-23 00:42:13] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 1 ms to minimize.
[2023-03-23 00:42:13] [INFO ] Deduced a trap composed of 232 places in 244 ms of which 0 ms to minimize.
[2023-03-23 00:42:14] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 1 ms to minimize.
[2023-03-23 00:42:14] [INFO ] Deduced a trap composed of 226 places in 245 ms of which 0 ms to minimize.
[2023-03-23 00:42:15] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 0 ms to minimize.
[2023-03-23 00:42:15] [INFO ] Deduced a trap composed of 232 places in 247 ms of which 0 ms to minimize.
[2023-03-23 00:42:15] [INFO ] Deduced a trap composed of 238 places in 252 ms of which 1 ms to minimize.
[2023-03-23 00:42:16] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 0 ms to minimize.
[2023-03-23 00:42:16] [INFO ] Deduced a trap composed of 228 places in 268 ms of which 1 ms to minimize.
[2023-03-23 00:42:16] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 1 ms to minimize.
[2023-03-23 00:42:17] [INFO ] Deduced a trap composed of 232 places in 273 ms of which 0 ms to minimize.
[2023-03-23 00:42:17] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 0 ms to minimize.
[2023-03-23 00:42:17] [INFO ] Deduced a trap composed of 232 places in 269 ms of which 1 ms to minimize.
[2023-03-23 00:42:18] [INFO ] Deduced a trap composed of 226 places in 264 ms of which 0 ms to minimize.
[2023-03-23 00:42:18] [INFO ] Deduced a trap composed of 234 places in 266 ms of which 1 ms to minimize.
[2023-03-23 00:42:18] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 1 ms to minimize.
[2023-03-23 00:42:19] [INFO ] Deduced a trap composed of 224 places in 244 ms of which 1 ms to minimize.
[2023-03-23 00:42:20] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 1 ms to minimize.
[2023-03-23 00:42:20] [INFO ] Deduced a trap composed of 238 places in 272 ms of which 1 ms to minimize.
[2023-03-23 00:42:20] [INFO ] Deduced a trap composed of 226 places in 272 ms of which 1 ms to minimize.
[2023-03-23 00:42:21] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 1 ms to minimize.
[2023-03-23 00:42:22] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 1 ms to minimize.
[2023-03-23 00:42:22] [INFO ] Deduced a trap composed of 234 places in 267 ms of which 1 ms to minimize.
[2023-03-23 00:42:23] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 0 ms to minimize.
[2023-03-23 00:42:23] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 0 ms to minimize.
[2023-03-23 00:42:23] [INFO ] Deduced a trap composed of 230 places in 273 ms of which 1 ms to minimize.
[2023-03-23 00:42:24] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 0 ms to minimize.
[2023-03-23 00:42:24] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 0 ms to minimize.
[2023-03-23 00:42:26] [INFO ] Deduced a trap composed of 236 places in 278 ms of which 1 ms to minimize.
[2023-03-23 00:42:26] [INFO ] Deduced a trap composed of 232 places in 280 ms of which 1 ms to minimize.
[2023-03-23 00:42:26] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 0 ms to minimize.
[2023-03-23 00:42:27] [INFO ] Deduced a trap composed of 236 places in 247 ms of which 0 ms to minimize.
[2023-03-23 00:42:27] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 1 ms to minimize.
[2023-03-23 00:42:28] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 1 ms to minimize.
[2023-03-23 00:42:29] [INFO ] Deduced a trap composed of 224 places in 265 ms of which 1 ms to minimize.
[2023-03-23 00:42:32] [INFO ] Trap strengthening (SAT) tested/added 73/73 trap constraints in 33137 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 24 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 581/581 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Applied a total of 0 rules in 22 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-23 00:42:33] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 00:42:33] [INFO ] Invariant cache hit.
[2023-03-23 00:42:33] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-23 00:42:33] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 00:42:33] [INFO ] Invariant cache hit.
[2023-03-23 00:42:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 00:42:36] [INFO ] Implicit Places using invariants and state equation in 2663 ms returned []
Implicit Place search using SMT with State Equation took 3068 ms to find 0 implicit places.
[2023-03-23 00:42:36] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-23 00:42:36] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-23 00:42:36] [INFO ] Invariant cache hit.
[2023-03-23 00:42:36] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3701 ms. Remains : 581/581 places, 1252/1252 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J30-UpperBounds-08 in 54979 ms.
[2023-03-23 00:42:36] [INFO ] Flatten gal took : 173 ms
[2023-03-23 00:42:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-23 00:42:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 581 places, 1252 transitions and 7921 arcs took 9 ms.
Total runtime 203877 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (COL), instance S10J30
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 581 places, 1252 transitions, 7921 arcs.
Final Score: 90442.877
Took : 25 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10505576 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098888 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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-S10J30"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is PolyORBNT-COL-S10J30, 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 r299-tall-167873953300685"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J30.tgz
mv PolyORBNT-COL-S10J30 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;