Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460800251.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBNT-COL-S10J20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460800251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.2K Apr 12 11:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 11:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 11:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 11:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K May 18 16:43 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-S10J20-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717128374444

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J20
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-31 04:06:16] [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]
[2024-05-31 04:06:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 04:06:16] [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.
[2024-05-31 04:06:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 04:06:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 567 ms
[2024-05-31 04:06:16] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 31 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
[2024-05-31 04:06:16] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2024-05-31 04:06:16] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-31 04:06:16] [INFO ] Computed 13 invariants in 9 ms
FORMULA PolyORBNT-COL-S10J20-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S10J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 04:06:16] [INFO ] Invariant cache hit.
[2024-05-31 04:06:16] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-31 04:06:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:06:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-31 04:06:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:06:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-31 04:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:17] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-31 04:06:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:06:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:06:17] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-31 04:06:17] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Minimization took 10 ms.
[2024-05-31 04:06:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:06:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 04:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:17] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 04:06:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:06:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-31 04:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:17] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 04:06:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:06:17] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 4 ms to minimize.
[2024-05-31 04:06:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-31 04:06:17] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-31 04:06:17] [INFO ] Added : 10 causal constraints over 2 iterations in 291 ms. Result :sat
Minimization took 56 ms.
[2024-05-31 04:06:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:06:17] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-31 04:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:17] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 04:06:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:06:17] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:17] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-31 04:06:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:06:17] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-31 04:06:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-31 04:06:17] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 04:06:17] [INFO ] Added : 36 causal constraints over 8 iterations in 69 ms. Result :sat
Minimization took 25 ms.
[2024-05-31 04:06:18] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 04:06:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:18] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 04:06:18] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-31 04:06:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-31 04:06:18] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 04:06:18] [INFO ] Added : 20 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 14 ms.
[2024-05-31 04:06:18] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:18] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 04:06:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:18] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-31 04:06:18] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-31 04:06:18] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-31 04:06:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2024-05-31 04:06:18] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:06:18] [INFO ] Added : 36 causal constraints over 8 iterations in 69 ms. Result :sat
Minimization took 24 ms.
[2024-05-31 04:06:18] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 04:06:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 04:06:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:06:18] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-31 04:06:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-31 04:06:18] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:06:19] [INFO ] Added : 14 causal constraints over 4 iterations in 327 ms. Result :sat
Minimization took 145 ms.
[2024-05-31 04:06:19] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:19] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 04:06:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:19] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:06:19] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:06:19] [INFO ] Added : 36 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 17 ms.
[2024-05-31 04:06:19] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:19] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 04:06:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:19] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:06:19] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-31 04:06:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-31 04:06:19] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 04:06:19] [INFO ] Added : 36 causal constraints over 8 iterations in 49 ms. Result :sat
Minimization took 14 ms.
[2024-05-31 04:06:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 04:06:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:19] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:06:19] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 04:06:19] [INFO ] Added : 36 causal constraints over 8 iterations in 89 ms. Result :sat
Minimization took 12 ms.
[2024-05-31 04:06:19] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:19] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-31 04:06:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:19] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 04:06:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 33 ms returned sat
[2024-05-31 04:06:19] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
[2024-05-31 04:06:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-31 04:06:19] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:06:19] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-31 04:06:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-31 04:06:19] [INFO ] Added : 36 causal constraints over 8 iterations in 133 ms. Result :sat
Minimization took 16 ms.
[2024-05-31 04:06:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:20] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-31 04:06:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:20] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 04:06:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 04:06:20] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-31 04:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-31 04:06:20] [INFO ] Added : 22 causal constraints over 5 iterations in 53 ms. Result :sat
Minimization took 14 ms.
[2024-05-31 04:06:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:20] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-31 04:06:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:20] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2024-05-31 04:06:20] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-31 04:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-05-31 04:06:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 04:06:20] [INFO ] Added : 20 causal constraints over 5 iterations in 70 ms. Result :sat
Minimization took 15 ms.
[2024-05-31 04:06:20] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:20] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-31 04:06:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:20] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:06:20] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-31 04:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-31 04:06:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 04:06:20] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-31 04:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-31 04:06:20] [INFO ] Added : 33 causal constraints over 7 iterations in 137 ms. Result :sat
Minimization took 23 ms.
[2024-05-31 04:06:20] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:20] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-31 04:06:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:20] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-31 04:06:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 04:06:20] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-31 04:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-31 04:06:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 04:06:20] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-31 04:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-31 04:06:20] [INFO ] Added : 36 causal constraints over 8 iterations in 81 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [10, 10, -1, 2, -1, 10, -1, -1, -1, 1, 3, 2, 1, 1]
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-31 04:06:21] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 198 ms.
[2024-05-31 04:06:21] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 35 ms
Reduce places removed 20 places and 20 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 286 ms. (steps per millisecond=34 ) properties (out of 14) seen :10
FORMULA PolyORBNT-COL-S10J20-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
[2024-05-31 04:06:21] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-05-31 04:06:21] [INFO ] Computed 72 invariants in 58 ms
[2024-05-31 04:06:22] [INFO ] [Real]Absence check using 65 positive place invariants in 91 ms returned sat
[2024-05-31 04:06:22] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 04:06:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:22] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2024-05-31 04:06:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:22] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2024-05-31 04:06:22] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-31 04:06:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:27] [INFO ] [Nat]Absence check using state equation in 4915 ms returned unknown
[2024-05-31 04:06:27] [INFO ] [Real]Absence check using 65 positive place invariants in 21 ms returned sat
[2024-05-31 04:06:27] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 04:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:28] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2024-05-31 04:06:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:28] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2024-05-31 04:06:28] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:06:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:29] [INFO ] [Nat]Absence check using state equation in 880 ms returned sat
[2024-05-31 04:06:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:06:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 73 ms returned sat
[2024-05-31 04:06:29] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 180 ms.
[2024-05-31 04:06:33] [INFO ] Added : 15 causal constraints over 3 iterations in 3883 ms. Result :unknown
[2024-05-31 04:06:33] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2024-05-31 04:06:33] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 04:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:33] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2024-05-31 04:06:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:34] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2024-05-31 04:06:34] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 04:06:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:36] [INFO ] [Nat]Absence check using state equation in 2206 ms returned sat
[2024-05-31 04:06:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-31 04:06:36] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 350 ms.
[2024-05-31 04:06:36] [INFO ] Added : 6 causal constraints over 2 iterations in 632 ms. Result :sat
Minimization took 367 ms.
[2024-05-31 04:06:37] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2024-05-31 04:06:37] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:06:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:37] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2024-05-31 04:06:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:37] [INFO ] [Nat]Absence check using 65 positive place invariants in 21 ms returned sat
[2024-05-31 04:06:37] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 04:06:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:38] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2024-05-31 04:06:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 450 ms returned sat
[2024-05-31 04:06:39] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 153 ms.
[2024-05-31 04:06:40] [INFO ] Deduced a trap composed of 19 places in 665 ms of which 1 ms to minimize.
[2024-05-31 04:06:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 820 ms
[2024-05-31 04:06:40] [INFO ] Added : 28 causal constraints over 7 iterations in 1786 ms. Result :sat
Minimization took 477 ms.
[2024-05-31 04:06:41] [INFO ] [Real]Absence check using 65 positive place invariants in 38 ms returned sat
[2024-05-31 04:06:41] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-31 04:06:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:41] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2024-05-31 04:06:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2024-05-31 04:06:41] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-31 04:06:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:46] [INFO ] [Nat]Absence check using state equation in 4660 ms returned sat
[2024-05-31 04:06:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 42 ms returned sat
[2024-05-31 04:06:47] [INFO ] Deduced a trap composed of 131 places in 500 ms of which 0 ms to minimize.
[2024-05-31 04:06: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 4
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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 04:06:47] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2024-05-31 04:06:47] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 04:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:47] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2024-05-31 04:06:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:48] [INFO ] [Nat]Absence check using 65 positive place invariants in 23 ms returned sat
[2024-05-31 04:06:48] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 04:06:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:48] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2024-05-31 04:06:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 496 ms returned sat
[2024-05-31 04:06:49] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 194 ms.
[2024-05-31 04:06:50] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 0 ms to minimize.
[2024-05-31 04:06:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 642 ms
[2024-05-31 04:06:50] [INFO ] Added : 28 causal constraints over 6 iterations in 1503 ms. Result :sat
Minimization took 984 ms.
[2024-05-31 04:06:51] [INFO ] [Real]Absence check using 65 positive place invariants in 22 ms returned sat
[2024-05-31 04:06:51] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 04:06:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:52] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2024-05-31 04:06:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 22 ms returned sat
[2024-05-31 04:06:52] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 04:06:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:53] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2024-05-31 04:06:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 117 ms returned sat
[2024-05-31 04:06:53] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 127 ms.
[2024-05-31 04:06:54] [INFO ] Deduced a trap composed of 19 places in 518 ms of which 1 ms to minimize.
[2024-05-31 04:06:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 714 ms
[2024-05-31 04:06:54] [INFO ] Added : 28 causal constraints over 6 iterations in 1455 ms. Result :sat
Minimization took 1084 ms.
[2024-05-31 04:06:55] [INFO ] [Real]Absence check using 65 positive place invariants in 21 ms returned sat
[2024-05-31 04:06:55] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 04:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:56] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2024-05-31 04:06:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:06:56] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2024-05-31 04:06:56] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 04:06:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:06:56] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2024-05-31 04:06:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 474 ms returned sat
[2024-05-31 04:06:57] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 173 ms.
[2024-05-31 04:06:58] [INFO ] Deduced a trap composed of 19 places in 358 ms of which 1 ms to minimize.
[2024-05-31 04:06:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 534 ms
[2024-05-31 04:06:59] [INFO ] Added : 27 causal constraints over 6 iterations in 1578 ms. Result :sat
Minimization took 832 ms.
[2024-05-31 04:07:00] [INFO ] [Real]Absence check using 65 positive place invariants in 22 ms returned sat
[2024-05-31 04:07:00] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 04:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:07:00] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2024-05-31 04:07:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:07:00] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2024-05-31 04:07:00] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:07:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:07:01] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2024-05-31 04:07:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 366 ms returned sat
[2024-05-31 04:07:01] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 105 ms.
[2024-05-31 04:07:04] [INFO ] Added : 15 causal constraints over 3 iterations in 3363 ms. Result :sat
Minimization took 406 ms.
[2024-05-31 04:07:05] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2024-05-31 04:07:05] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-31 04:07:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:07:05] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2024-05-31 04:07:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:07:05] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2024-05-31 04:07:05] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 04:07:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:07:06] [INFO ] [Nat]Absence check using state equation in 1021 ms returned sat
[2024-05-31 04:07:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2024-05-31 04:07:07] [INFO ] Deduced a trap composed of 218 places in 321 ms of which 1 ms to minimize.
[2024-05-31 04:07:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 641 ms
[2024-05-31 04:07:07] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 188 ms.
[2024-05-31 04:07:10] [INFO ] Added : 0 causal constraints over 0 iterations in 3240 ms. Result :unknown
[2024-05-31 04:07:10] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2024-05-31 04:07:10] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-31 04:07:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:07:11] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2024-05-31 04:07:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:07:11] [INFO ] [Nat]Absence check using 65 positive place invariants in 24 ms returned sat
[2024-05-31 04:07:11] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 04:07:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:07:12] [INFO ] [Nat]Absence check using state equation in 1123 ms returned sat
[2024-05-31 04:07:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1479 ms returned sat
[2024-05-31 04:07:14] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 124 ms.
[2024-05-31 04:07:14] [INFO ] Added : 7 causal constraints over 2 iterations in 478 ms. Result :sat
Minimization took 465 ms.
[2024-05-31 04:07:15] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2024-05-31 04:07:15] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:07:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:07:15] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2024-05-31 04:07:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:07:15] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2024-05-31 04:07:15] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 04:07:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:07:15] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2024-05-31 04:07:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 181 ms returned sat
[2024-05-31 04:07:16] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 136 ms.
[2024-05-31 04:07:18] [INFO ] Added : 30 causal constraints over 6 iterations in 2356 ms. Result :sat
Minimization took 403 ms.
[2024-05-31 04:07:19] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2024-05-31 04:07:19] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 04:07:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:07:19] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2024-05-31 04:07:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:07:19] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2024-05-31 04:07:19] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:07:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:07:20] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2024-05-31 04:07:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 82 ms returned sat
[2024-05-31 04:07:20] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 134 ms.
[2024-05-31 04:07:20] [INFO ] Added : 8 causal constraints over 2 iterations in 468 ms. Result :sat
Minimization took 277 ms.
Current structural bounds on expressions (after SMT) : [10, 2147483647, 2, 2147483647, 10, 2147483647, 2147483647, 2147483647, 1, 3, 2, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 68 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 464 transition count 1626
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 60 place count 440 transition count 1624
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 438 transition count 1624
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 62 place count 438 transition count 1600
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 110 place count 414 transition count 1600
Applied a total of 110 rules in 316 ms. Remains 414 /474 variables (removed 60) and now considering 1600/1650 (removed 50) transitions.
[2024-05-31 04:07:22] [INFO ] Flow matrix only has 1591 transitions (discarded 9 similar events)
// Phase 1: matrix 1591 rows 414 cols
[2024-05-31 04:07:22] [INFO ] Computed 62 invariants in 67 ms
[2024-05-31 04:07:23] [INFO ] Dead Transitions using invariants and state equation in 807 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 : 414/474 places, 985/1650 transitions.
Applied a total of 0 rules in 28 ms. Remains 414 /414 variables (removed 0) and now considering 985/985 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1161 ms. Remains : 414/474 places, 985/1650 transitions.
Normalized transition count is 976 out of 985 initially.
// Phase 1: matrix 976 rows 414 cols
[2024-05-31 04:07:23] [INFO ] Computed 62 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 68457 resets, run finished after 8904 ms. (steps per millisecond=112 ) properties (out of 8) seen :15
FORMULA PolyORBNT-COL-S10J20-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 8934 resets, run finished after 1786 ms. (steps per millisecond=559 ) properties (out of 7) seen :10
Incomplete Best-First random walk after 1000000 steps, including 9547 resets, run finished after 2105 ms. (steps per millisecond=475 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 1000001 steps, including 9667 resets, run finished after 2039 ms. (steps per millisecond=490 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 1000001 steps, including 9618 resets, run finished after 2159 ms. (steps per millisecond=463 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 1000001 steps, including 9511 resets, run finished after 1772 ms. (steps per millisecond=564 ) properties (out of 7) seen :12
Incomplete Best-First random walk after 1000001 steps, including 9560 resets, run finished after 1930 ms. (steps per millisecond=518 ) properties (out of 7) seen :11
Incomplete Best-First random walk after 1000001 steps, including 9669 resets, run finished after 1708 ms. (steps per millisecond=585 ) properties (out of 7) seen :12
[2024-05-31 04:07:45] [INFO ] Flow matrix only has 976 transitions (discarded 9 similar events)
// Phase 1: matrix 976 rows 414 cols
[2024-05-31 04:07:45] [INFO ] Computed 62 invariants in 10 ms
[2024-05-31 04:07:45] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2024-05-31 04:07:45] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned unsat
[2024-05-31 04:07:45] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2024-05-31 04:07:45] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 04:07:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:07:46] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-05-31 04:07:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:07:46] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2024-05-31 04:07:46] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned unsat
[2024-05-31 04:07:46] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2024-05-31 04:07:46] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned unsat
[2024-05-31 04:07:46] [INFO ] [Real]Absence check using 55 positive place invariants in 9 ms returned sat
[2024-05-31 04:07:46] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 04:07:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:07:46] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2024-05-31 04:07:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:07:46] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2024-05-31 04:07:46] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 04:07:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:07:46] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2024-05-31 04:07:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:07:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 147 ms returned sat
[2024-05-31 04:07:47] [INFO ] Deduced a trap composed of 155 places in 194 ms of which 1 ms to minimize.
[2024-05-31 04:07:47] [INFO ] Deduced a trap composed of 171 places in 221 ms of which 0 ms to minimize.
[2024-05-31 04:07:47] [INFO ] Deduced a trap composed of 163 places in 221 ms of which 0 ms to minimize.
[2024-05-31 04:07:48] [INFO ] Deduced a trap composed of 157 places in 207 ms of which 0 ms to minimize.
[2024-05-31 04:07:48] [INFO ] Deduced a trap composed of 171 places in 194 ms of which 0 ms to minimize.
[2024-05-31 04:07:48] [INFO ] Deduced a trap composed of 163 places in 209 ms of which 1 ms to minimize.
[2024-05-31 04:07:48] [INFO ] Deduced a trap composed of 163 places in 202 ms of which 0 ms to minimize.
[2024-05-31 04:07:48] [INFO ] Deduced a trap composed of 161 places in 198 ms of which 1 ms to minimize.
[2024-05-31 04:07:49] [INFO ] Deduced a trap composed of 171 places in 200 ms of which 1 ms to minimize.
[2024-05-31 04:07:49] [INFO ] Deduced a trap composed of 167 places in 210 ms of which 0 ms to minimize.
[2024-05-31 04:07:49] [INFO ] Deduced a trap composed of 167 places in 206 ms of which 0 ms to minimize.
[2024-05-31 04:07:49] [INFO ] Deduced a trap composed of 159 places in 205 ms of which 0 ms to minimize.
[2024-05-31 04:07:50] [INFO ] Deduced a trap composed of 167 places in 217 ms of which 12 ms to minimize.
[2024-05-31 04:07:50] [INFO ] Deduced a trap composed of 171 places in 219 ms of which 4 ms to minimize.
[2024-05-31 04:07:50] [INFO ] Deduced a trap composed of 165 places in 204 ms of which 0 ms to minimize.
[2024-05-31 04:07:50] [INFO ] Deduced a trap composed of 171 places in 206 ms of which 1 ms to minimize.
[2024-05-31 04:07:51] [INFO ] Deduced a trap composed of 163 places in 195 ms of which 1 ms to minimize.
[2024-05-31 04:07:51] [INFO ] Deduced a trap composed of 161 places in 210 ms of which 0 ms to minimize.
[2024-05-31 04:07:51] [INFO ] Deduced a trap composed of 169 places in 193 ms of which 1 ms to minimize.
[2024-05-31 04:07:51] [INFO ] Deduced a trap composed of 167 places in 190 ms of which 0 ms to minimize.
[2024-05-31 04:07:52] [INFO ] Deduced a trap composed of 175 places in 217 ms of which 1 ms to minimize.
[2024-05-31 04:07:52] [INFO ] Deduced a trap composed of 173 places in 205 ms of which 0 ms to minimize.
[2024-05-31 04:07:52] [INFO ] Deduced a trap composed of 169 places in 177 ms of which 1 ms to minimize.
[2024-05-31 04:07:53] [INFO ] Deduced a trap composed of 167 places in 230 ms of which 1 ms to minimize.
[2024-05-31 04:07:53] [INFO ] Deduced a trap composed of 169 places in 197 ms of which 0 ms to minimize.
[2024-05-31 04:07:53] [INFO ] Deduced a trap composed of 165 places in 184 ms of which 0 ms to minimize.
[2024-05-31 04:07:54] [INFO ] Deduced a trap composed of 169 places in 194 ms of which 0 ms to minimize.
[2024-05-31 04:07:54] [INFO ] Deduced a trap composed of 161 places in 219 ms of which 1 ms to minimize.
[2024-05-31 04:07:56] [INFO ] Deduced a trap composed of 171 places in 192 ms of which 0 ms to minimize.
[2024-05-31 04:07:56] [INFO ] Deduced a trap composed of 165 places in 209 ms of which 1 ms to minimize.
[2024-05-31 04:07:56] [INFO ] Deduced a trap composed of 173 places in 187 ms of which 1 ms to minimize.
[2024-05-31 04:07:57] [INFO ] Deduced a trap composed of 169 places in 208 ms of which 1 ms to minimize.
[2024-05-31 04:07:59] [INFO ] Deduced a trap composed of 169 places in 207 ms of which 1 ms to minimize.
[2024-05-31 04:08:01] [INFO ] Deduced a trap composed of 167 places in 238 ms of which 0 ms to minimize.
[2024-05-31 04:08:01] [INFO ] Deduced a trap composed of 167 places in 223 ms of which 11 ms to minimize.
[2024-05-31 04:08:01] [INFO ] Deduced a trap composed of 163 places in 209 ms of which 1 ms to minimize.
[2024-05-31 04:08:02] [INFO ] Deduced a trap composed of 163 places in 258 ms of which 0 ms to minimize.
[2024-05-31 04:08:02] [INFO ] Deduced a trap composed of 157 places in 182 ms of which 1 ms to minimize.
[2024-05-31 04:08:03] [INFO ] Deduced a trap composed of 161 places in 250 ms of which 0 ms to minimize.
[2024-05-31 04:08:03] [INFO ] Deduced a trap composed of 171 places in 226 ms of which 1 ms to minimize.
[2024-05-31 04:08:03] [INFO ] Deduced a trap composed of 173 places in 226 ms of which 1 ms to minimize.
[2024-05-31 04:08:04] [INFO ] Deduced a trap composed of 167 places in 204 ms of which 0 ms to minimize.
[2024-05-31 04:08:04] [INFO ] Deduced a trap composed of 167 places in 204 ms of which 1 ms to minimize.
[2024-05-31 04:08:04] [INFO ] Deduced a trap composed of 173 places in 198 ms of which 7 ms to minimize.
[2024-05-31 04:08:04] [INFO ] Deduced a trap composed of 169 places in 171 ms of which 0 ms to minimize.
[2024-05-31 04:08:05] [INFO ] Deduced a trap composed of 171 places in 195 ms of which 1 ms to minimize.
[2024-05-31 04:08:05] [INFO ] Deduced a trap composed of 169 places in 191 ms of which 1 ms to minimize.
[2024-05-31 04:08:05] [INFO ] Deduced a trap composed of 167 places in 190 ms of which 0 ms to minimize.
[2024-05-31 04:08:05] [INFO ] Deduced a trap composed of 171 places in 200 ms of which 13 ms to minimize.
[2024-05-31 04:08:06] [INFO ] Deduced a trap composed of 167 places in 170 ms of which 1 ms to minimize.
[2024-05-31 04:08:06] [INFO ] Deduced a trap composed of 169 places in 193 ms of which 0 ms to minimize.
[2024-05-31 04:08:06] [INFO ] Deduced a trap composed of 173 places in 204 ms of which 1 ms to minimize.
[2024-05-31 04:08:07] [INFO ] Deduced a trap composed of 167 places in 207 ms of which 0 ms to minimize.
[2024-05-31 04:08:07] [INFO ] Deduced a trap composed of 161 places in 217 ms of which 1 ms to minimize.
[2024-05-31 04:08:07] [INFO ] Deduced a trap composed of 167 places in 191 ms of which 0 ms to minimize.
[2024-05-31 04:08:08] [INFO ] Deduced a trap composed of 165 places in 201 ms of which 0 ms to minimize.
[2024-05-31 04:08:08] [INFO ] Deduced a trap composed of 167 places in 246 ms of which 1 ms to minimize.
[2024-05-31 04:08:08] [INFO ] Deduced a trap composed of 163 places in 197 ms of which 0 ms to minimize.
[2024-05-31 04:08:09] [INFO ] Deduced a trap composed of 171 places in 276 ms of which 0 ms to minimize.
[2024-05-31 04:08:10] [INFO ] Deduced a trap composed of 165 places in 231 ms of which 1 ms to minimize.
[2024-05-31 04:08:10] [INFO ] Deduced a trap composed of 169 places in 191 ms of which 13 ms to minimize.
[2024-05-31 04:08:10] [INFO ] Deduced a trap composed of 163 places in 220 ms of which 0 ms to minimize.
[2024-05-31 04:08:11] [INFO ] Deduced a trap composed of 161 places in 238 ms of which 0 ms to minimize.
[2024-05-31 04:08:11] [INFO ] Deduced a trap composed of 165 places in 210 ms of which 0 ms to minimize.
[2024-05-31 04:08:11] [INFO ] Deduced a trap composed of 163 places in 197 ms of which 0 ms to minimize.
[2024-05-31 04:08:11] [INFO ] Deduced a trap composed of 169 places in 182 ms of which 1 ms to minimize.
[2024-05-31 04:08:12] [INFO ] Deduced a trap composed of 173 places in 195 ms of which 0 ms to minimize.
[2024-05-31 04:08:12] [INFO ] Deduced a trap composed of 169 places in 200 ms of which 1 ms to minimize.
[2024-05-31 04:08:12] [INFO ] Deduced a trap composed of 167 places in 214 ms of which 1 ms to minimize.
[2024-05-31 04:08:13] [INFO ] Deduced a trap composed of 169 places in 194 ms of which 0 ms to minimize.
[2024-05-31 04:08:13] [INFO ] Deduced a trap composed of 175 places in 193 ms of which 1 ms to minimize.
[2024-05-31 04:08:13] [INFO ] Deduced a trap composed of 173 places in 224 ms of which 0 ms to minimize.
[2024-05-31 04:08:14] [INFO ] Deduced a trap composed of 167 places in 188 ms of which 0 ms to minimize.
[2024-05-31 04:08:14] [INFO ] Deduced a trap composed of 169 places in 218 ms of which 0 ms to minimize.
[2024-05-31 04:08:14] [INFO ] Deduced a trap composed of 165 places in 179 ms of which 0 ms to minimize.
[2024-05-31 04:08:15] [INFO ] Deduced a trap composed of 173 places in 195 ms of which 1 ms to minimize.
[2024-05-31 04:08:16] [INFO ] Deduced a trap composed of 171 places in 198 ms of which 0 ms to minimize.
[2024-05-31 04:08:16] [INFO ] Deduced a trap composed of 167 places in 192 ms of which 1 ms to minimize.
[2024-05-31 04:08:16] [INFO ] Deduced a trap composed of 167 places in 241 ms of which 1 ms to minimize.
[2024-05-31 04:08:17] [INFO ] Deduced a trap composed of 165 places in 172 ms of which 0 ms to minimize.
[2024-05-31 04:08:18] [INFO ] Deduced a trap composed of 165 places in 257 ms of which 0 ms to minimize.
[2024-05-31 04:08:18] [INFO ] Deduced a trap composed of 167 places in 220 ms of which 0 ms to minimize.
[2024-05-31 04:08:19] [INFO ] Deduced a trap composed of 169 places in 222 ms of which 1 ms to minimize.
[2024-05-31 04:08:19] [INFO ] Deduced a trap composed of 165 places in 185 ms of which 1 ms to minimize.
[2024-05-31 04:08:21] [INFO ] Deduced a trap composed of 169 places in 201 ms of which 0 ms to minimize.
[2024-05-31 04:08:22] [INFO ] Deduced a trap composed of 167 places in 209 ms of which 1 ms to minimize.
[2024-05-31 04:08:24] [INFO ] Deduced a trap composed of 165 places in 254 ms of which 0 ms to minimize.
[2024-05-31 04:08:24] [INFO ] Deduced a trap composed of 167 places in 240 ms of which 0 ms to minimize.
[2024-05-31 04:08:24] [INFO ] Deduced a trap composed of 169 places in 231 ms of which 0 ms to minimize.
[2024-05-31 04:08:25] [INFO ] Deduced a trap composed of 167 places in 225 ms of which 0 ms to minimize.
[2024-05-31 04:08:25] [INFO ] Deduced a trap composed of 163 places in 203 ms of which 0 ms to minimize.
[2024-05-31 04:08:26] [INFO ] Deduced a trap composed of 167 places in 187 ms of which 0 ms to minimize.
[2024-05-31 04:08:26] [INFO ] Deduced a trap composed of 171 places in 217 ms of which 1 ms to minimize.
[2024-05-31 04:08:26] [INFO ] Deduced a trap composed of 169 places in 211 ms of which 1 ms to minimize.
[2024-05-31 04:08:27] [INFO ] Deduced a trap composed of 167 places in 193 ms of which 1 ms to minimize.
[2024-05-31 04:08:27] [INFO ] Deduced a trap composed of 167 places in 201 ms of which 0 ms to minimize.
[2024-05-31 04:08:28] [INFO ] Deduced a trap composed of 169 places in 241 ms of which 0 ms to minimize.
[2024-05-31 04:08:28] [INFO ] Deduced a trap composed of 171 places in 237 ms of which 0 ms to minimize.
[2024-05-31 04:08:29] [INFO ] Deduced a trap composed of 171 places in 249 ms of which 0 ms to minimize.
[2024-05-31 04:08:29] [INFO ] Deduced a trap composed of 165 places in 190 ms of which 0 ms to minimize.
[2024-05-31 04:08:30] [INFO ] Deduced a trap composed of 165 places in 202 ms of which 0 ms to minimize.
[2024-05-31 04:08:30] [INFO ] Deduced a trap composed of 161 places in 198 ms of which 14 ms to minimize.
[2024-05-31 04:08:31] [INFO ] Trap strengthening (SAT) tested/added 102/102 trap constraints in 44608 ms
[2024-05-31 04:08:31] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2024-05-31 04:08:31] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned unsat
[2024-05-31 04:08:31] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2024-05-31 04:08:31] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 04:08:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:08:32] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2024-05-31 04:08:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:08:32] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2024-05-31 04:08:32] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 3 ms returned unsat
[2024-05-31 04:08:32] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2024-05-31 04:08:32] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 1, 10, 1, 1, 1] Max seen :[4, 1, 1, 3, 1, 1, 1]
FORMULA PolyORBNT-COL-S10J20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J20-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 985/985 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 413 transition count 984
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 413 transition count 984
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 411 transition count 982
Applied a total of 6 rules in 94 ms. Remains 411 /414 variables (removed 3) and now considering 982/985 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 411/414 places, 982/985 transitions.
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2024-05-31 04:08:32] [INFO ] Computed 62 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 70497 resets, run finished after 8232 ms. (steps per millisecond=121 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9674 resets, run finished after 1900 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2024-05-31 04:08:42] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2024-05-31 04:08:42] [INFO ] Computed 62 invariants in 17 ms
[2024-05-31 04:08:42] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2024-05-31 04:08:42] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:08:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:08:42] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2024-05-31 04:08:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:08:43] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2024-05-31 04:08:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:08:43] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2024-05-31 04:08:43] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 04:08:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:08:43] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2024-05-31 04:08:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 33 ms returned sat
[2024-05-31 04:08:43] [INFO ] Deduced a trap composed of 177 places in 247 ms of which 0 ms to minimize.
[2024-05-31 04:08:43] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 1 ms to minimize.
[2024-05-31 04:08:44] [INFO ] Deduced a trap composed of 175 places in 201 ms of which 0 ms to minimize.
[2024-05-31 04:08:44] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 1 ms to minimize.
[2024-05-31 04:08:44] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 1 ms to minimize.
[2024-05-31 04:08:44] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 1 ms to minimize.
[2024-05-31 04:08:45] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2024-05-31 04:08:45] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2024-05-31 04:08:45] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 0 ms to minimize.
[2024-05-31 04:08:45] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 0 ms to minimize.
[2024-05-31 04:08:46] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2024-05-31 04:08:46] [INFO ] Deduced a trap composed of 154 places in 206 ms of which 0 ms to minimize.
[2024-05-31 04:08:46] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2024-05-31 04:08:46] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2024-05-31 04:08:47] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 0 ms to minimize.
[2024-05-31 04:08:47] [INFO ] Deduced a trap composed of 154 places in 190 ms of which 1 ms to minimize.
[2024-05-31 04:08:47] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 0 ms to minimize.
[2024-05-31 04:08:48] [INFO ] Deduced a trap composed of 164 places in 262 ms of which 0 ms to minimize.
[2024-05-31 04:08:48] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 1 ms to minimize.
[2024-05-31 04:08:48] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 2 ms to minimize.
[2024-05-31 04:08:48] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 0 ms to minimize.
[2024-05-31 04:08:49] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 1 ms to minimize.
[2024-05-31 04:08:49] [INFO ] Deduced a trap composed of 160 places in 240 ms of which 0 ms to minimize.
[2024-05-31 04:08:49] [INFO ] Deduced a trap composed of 152 places in 170 ms of which 0 ms to minimize.
[2024-05-31 04:08:49] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 1 ms to minimize.
[2024-05-31 04:08:50] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 1 ms to minimize.
[2024-05-31 04:08:50] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 0 ms to minimize.
[2024-05-31 04:08:50] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 0 ms to minimize.
[2024-05-31 04:08:50] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2024-05-31 04:08:51] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 0 ms to minimize.
[2024-05-31 04:08:51] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 1 ms to minimize.
[2024-05-31 04:08:51] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 0 ms to minimize.
[2024-05-31 04:08:51] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2024-05-31 04:08:52] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 0 ms to minimize.
[2024-05-31 04:08:52] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 0 ms to minimize.
[2024-05-31 04:08:52] [INFO ] Deduced a trap composed of 158 places in 182 ms of which 1 ms to minimize.
[2024-05-31 04:08:53] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 0 ms to minimize.
[2024-05-31 04:08:53] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2024-05-31 04:08:53] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 1 ms to minimize.
[2024-05-31 04:08:53] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2024-05-31 04:08:54] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 1 ms to minimize.
[2024-05-31 04:08:54] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 0 ms to minimize.
[2024-05-31 04:08:54] [INFO ] Deduced a trap composed of 162 places in 242 ms of which 0 ms to minimize.
[2024-05-31 04:08:55] [INFO ] Deduced a trap composed of 164 places in 263 ms of which 0 ms to minimize.
[2024-05-31 04:08:55] [INFO ] Deduced a trap composed of 156 places in 237 ms of which 1 ms to minimize.
[2024-05-31 04:08:55] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 0 ms to minimize.
[2024-05-31 04:08:56] [INFO ] Deduced a trap composed of 156 places in 241 ms of which 0 ms to minimize.
[2024-05-31 04:08:56] [INFO ] Deduced a trap composed of 158 places in 255 ms of which 1 ms to minimize.
[2024-05-31 04:08:57] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2024-05-31 04:08:58] [INFO ] Deduced a trap composed of 162 places in 253 ms of which 1 ms to minimize.
[2024-05-31 04:08:59] [INFO ] Deduced a trap composed of 166 places in 260 ms of which 1 ms to minimize.
[2024-05-31 04:08:59] [INFO ] Deduced a trap composed of 160 places in 239 ms of which 1 ms to minimize.
[2024-05-31 04:08:59] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2024-05-31 04:08:59] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 0 ms to minimize.
[2024-05-31 04:09:02] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 1 ms to minimize.
[2024-05-31 04:09:02] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 1 ms to minimize.
[2024-05-31 04:09:05] [INFO ] Trap strengthening (SAT) tested/added 56/56 trap constraints in 22133 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, 982/982 transitions.
Applied a total of 0 rules in 24 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 26 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2024-05-31 04:09:05] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-31 04:09:05] [INFO ] Invariant cache hit.
[2024-05-31 04:09:06] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-31 04:09:06] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-31 04:09:06] [INFO ] Invariant cache hit.
[2024-05-31 04:09:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:09:07] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
[2024-05-31 04:09:07] [INFO ] Redundant transitions in 52 ms returned []
[2024-05-31 04:09:07] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-31 04:09:07] [INFO ] Invariant cache hit.
[2024-05-31 04:09:08] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2698 ms. Remains : 411/411 places, 982/982 transitions.
Starting property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-06
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2024-05-31 04:09:08] [INFO ] Computed 62 invariants in 15 ms
Incomplete random walk after 10000 steps, including 705 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :3
[2024-05-31 04:09:08] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2024-05-31 04:09:08] [INFO ] Computed 62 invariants in 20 ms
[2024-05-31 04:09:08] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2024-05-31 04:09:08] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 04:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:08] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-05-31 04:09:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:09:08] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-31 04:09:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:08] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2024-05-31 04:09:08] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-31 04:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:09] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2024-05-31 04:09:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 31 ms returned sat
[2024-05-31 04:09:09] [INFO ] Deduced a trap composed of 177 places in 192 ms of which 0 ms to minimize.
[2024-05-31 04:09:09] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2024-05-31 04:09:09] [INFO ] Deduced a trap composed of 175 places in 190 ms of which 1 ms to minimize.
[2024-05-31 04:09:10] [INFO ] Deduced a trap composed of 168 places in 227 ms of which 1 ms to minimize.
[2024-05-31 04:09:10] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 1 ms to minimize.
[2024-05-31 04:09:10] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 0 ms to minimize.
[2024-05-31 04:09:10] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 0 ms to minimize.
[2024-05-31 04:09:11] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 0 ms to minimize.
[2024-05-31 04:09:11] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 1 ms to minimize.
[2024-05-31 04:09:11] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 1 ms to minimize.
[2024-05-31 04:09:11] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 0 ms to minimize.
[2024-05-31 04:09:11] [INFO ] Deduced a trap composed of 154 places in 199 ms of which 0 ms to minimize.
[2024-05-31 04:09:12] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2024-05-31 04:09:12] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2024-05-31 04:09:12] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 0 ms to minimize.
[2024-05-31 04:09:13] [INFO ] Deduced a trap composed of 154 places in 198 ms of which 1 ms to minimize.
[2024-05-31 04:09:13] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2024-05-31 04:09:13] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 0 ms to minimize.
[2024-05-31 04:09:13] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 0 ms to minimize.
[2024-05-31 04:09:13] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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, 982/982 transitions.
Applied a total of 0 rules in 34 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2024-05-31 04:09:13] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-31 04:09:13] [INFO ] Invariant cache hit.
[2024-05-31 04:09:14] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 637 ms. Remains : 411/411 places, 982/982 transitions.
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2024-05-31 04:09:14] [INFO ] Computed 62 invariants in 20 ms
Incomplete random walk after 1000000 steps, including 70441 resets, run finished after 8479 ms. (steps per millisecond=117 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9581 resets, run finished after 1736 ms. (steps per millisecond=576 ) properties (out of 1) seen :3
[2024-05-31 04:09:24] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2024-05-31 04:09:24] [INFO ] Computed 62 invariants in 21 ms
[2024-05-31 04:09:24] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2024-05-31 04:09:24] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 04:09:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:25] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-05-31 04:09:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:09:25] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-31 04:09:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 04:09:25] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2024-05-31 04:09:25] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 04:09:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 04:09:25] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2024-05-31 04:09:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2024-05-31 04:09:25] [INFO ] Deduced a trap composed of 177 places in 235 ms of which 1 ms to minimize.
[2024-05-31 04:09:25] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 1 ms to minimize.
[2024-05-31 04:09:26] [INFO ] Deduced a trap composed of 175 places in 242 ms of which 1 ms to minimize.
[2024-05-31 04:09:26] [INFO ] Deduced a trap composed of 168 places in 222 ms of which 0 ms to minimize.
[2024-05-31 04:09:26] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 1 ms to minimize.
[2024-05-31 04:09:27] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 0 ms to minimize.
[2024-05-31 04:09:27] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 1 ms to minimize.
[2024-05-31 04:09:27] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 0 ms to minimize.
[2024-05-31 04:09:27] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 0 ms to minimize.
[2024-05-31 04:09:28] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 0 ms to minimize.
[2024-05-31 04:09:28] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2024-05-31 04:09:28] [INFO ] Deduced a trap composed of 154 places in 187 ms of which 1 ms to minimize.
[2024-05-31 04:09:28] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 1 ms to minimize.
[2024-05-31 04:09:28] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 1 ms to minimize.
[2024-05-31 04:09:29] [INFO ] Deduced a trap composed of 156 places in 232 ms of which 0 ms to minimize.
[2024-05-31 04:09:29] [INFO ] Deduced a trap composed of 154 places in 196 ms of which 0 ms to minimize.
[2024-05-31 04:09:29] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 1 ms to minimize.
[2024-05-31 04:09:30] [INFO ] Deduced a trap composed of 164 places in 236 ms of which 1 ms to minimize.
[2024-05-31 04:09:30] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 0 ms to minimize.
[2024-05-31 04:09:30] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 0 ms to minimize.
[2024-05-31 04:09:30] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2024-05-31 04:09:31] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2024-05-31 04:09:31] [INFO ] Deduced a trap composed of 160 places in 258 ms of which 0 ms to minimize.
[2024-05-31 04:09:31] [INFO ] Deduced a trap composed of 152 places in 198 ms of which 1 ms to minimize.
[2024-05-31 04:09:31] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 0 ms to minimize.
[2024-05-31 04:09:32] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 0 ms to minimize.
[2024-05-31 04:09:32] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2024-05-31 04:09:32] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2024-05-31 04:09:32] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 0 ms to minimize.
[2024-05-31 04:09:33] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 1 ms to minimize.
[2024-05-31 04:09:33] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 0 ms to minimize.
[2024-05-31 04:09:33] [INFO ] Deduced a trap composed of 170 places in 190 ms of which 1 ms to minimize.
[2024-05-31 04:09:33] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 1 ms to minimize.
[2024-05-31 04:09:34] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 13 ms to minimize.
[2024-05-31 04:09:34] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 0 ms to minimize.
[2024-05-31 04:09:34] [INFO ] Deduced a trap composed of 158 places in 228 ms of which 1 ms to minimize.
[2024-05-31 04:09:35] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 0 ms to minimize.
[2024-05-31 04:09:35] [INFO ] Deduced a trap composed of 166 places in 182 ms of which 0 ms to minimize.
[2024-05-31 04:09:35] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 0 ms to minimize.
[2024-05-31 04:09:35] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 1 ms to minimize.
[2024-05-31 04:09:36] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 0 ms to minimize.
[2024-05-31 04:09:36] [INFO ] Deduced a trap composed of 160 places in 246 ms of which 0 ms to minimize.
[2024-05-31 04:09:36] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2024-05-31 04:09:37] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2024-05-31 04:09:37] [INFO ] Deduced a trap composed of 156 places in 227 ms of which 0 ms to minimize.
[2024-05-31 04:09:37] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 0 ms to minimize.
[2024-05-31 04:09:38] [INFO ] Deduced a trap composed of 156 places in 251 ms of which 1 ms to minimize.
[2024-05-31 04:09:38] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 0 ms to minimize.
[2024-05-31 04:09:39] [INFO ] Deduced a trap composed of 160 places in 237 ms of which 13 ms to minimize.
[2024-05-31 04:09:40] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 1 ms to minimize.
[2024-05-31 04:09:40] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 2 ms to minimize.
[2024-05-31 04:09:40] [INFO ] Deduced a trap composed of 160 places in 234 ms of which 0 ms to minimize.
[2024-05-31 04:09:41] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 1 ms to minimize.
[2024-05-31 04:09:41] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 0 ms to minimize.
[2024-05-31 04:09:43] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 1 ms to minimize.
[2024-05-31 04:09:44] [INFO ] Deduced a trap composed of 158 places in 254 ms of which 7 ms to minimize.
[2024-05-31 04:09:47] [INFO ] Trap strengthening (SAT) tested/added 56/56 trap constraints in 21757 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, 982/982 transitions.
Applied a total of 0 rules in 33 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 27 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2024-05-31 04:09:47] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-31 04:09:47] [INFO ] Invariant cache hit.
[2024-05-31 04:09:47] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-31 04:09:47] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-31 04:09:47] [INFO ] Invariant cache hit.
[2024-05-31 04:09:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 04:09:48] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
[2024-05-31 04:09:49] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-31 04:09:49] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-31 04:09:49] [INFO ] Invariant cache hit.
[2024-05-31 04:09:49] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2288 ms. Remains : 411/411 places, 982/982 transitions.
Ending property specific reduction for PolyORBNT-COL-S10J20-UpperBounds-06 in 41159 ms.
[2024-05-31 04:09:49] [INFO ] Flatten gal took : 145 ms
[2024-05-31 04:09:49] [INFO ] Applying decomposition
[2024-05-31 04:09:49] [INFO ] Flatten gal took : 93 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6028668344970539505.txt' '-o' '/tmp/graph6028668344970539505.bin' '-w' '/tmp/graph6028668344970539505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6028668344970539505.bin' '-l' '-1' '-v' '-w' '/tmp/graph6028668344970539505.weights' '-q' '0' '-e' '0.001'
[2024-05-31 04:09:50] [INFO ] Decomposing Gal with order
[2024-05-31 04:09:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:09:50] [INFO ] Removed a total of 2740 redundant transitions.
[2024-05-31 04:09:50] [INFO ] Flatten gal took : 510 ms
[2024-05-31 04:09:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 273 labels/synchronizations in 105 ms.
[2024-05-31 04:09:51] [INFO ] Time to serialize gal into /tmp/UpperBounds12049116362995030313.gal : 34 ms
[2024-05-31 04:09:51] [INFO ] Time to serialize properties into /tmp/UpperBounds11837854021106434028.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12049116362995030313.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11837854021106434028.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds11837854021106434028.prop.
Detected timeout of ITS tools.
[2024-05-31 04:31:08] [INFO ] Applying decomposition
[2024-05-31 04:31:09] [INFO ] Flatten gal took : 650 ms
[2024-05-31 04:31:09] [INFO ] Decomposing Gal with order
[2024-05-31 04:31:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 04:31:11] [INFO ] Removed a total of 5759 redundant transitions.
[2024-05-31 04:31:11] [INFO ] Flatten gal took : 1667 ms
[2024-05-31 04:31:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 71 ms.
[2024-05-31 04:31:11] [INFO ] Time to serialize gal into /tmp/UpperBounds9422377398638229608.gal : 57 ms
[2024-05-31 04:31:11] [INFO ] Time to serialize properties into /tmp/UpperBounds1581078283356056665.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9422377398638229608.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1581078283356056665.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds1581078283356056665.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.01779e+10,1091.54,11752244,5.2833e+06,32,2.65297e+07,4933,1823,1.75823e+07,48,4651,0
Total reachable state count : 30177920505

Verifying 1 reachability properties.
Detected timeout of ITS tools.
[2024-05-31 04:52:23] [INFO ] Flatten gal took : 90 ms
[2024-05-31 04:52:23] [INFO ] Input system was already deterministic with 982 transitions.
[2024-05-31 04:52:23] [INFO ] Transformed 411 places.
[2024-05-31 04:52:23] [INFO ] Transformed 982 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 04:52:53] [INFO ] Time to serialize gal into /tmp/UpperBounds7746930620833131003.gal : 26 ms
[2024-05-31 04:52:53] [INFO ] Time to serialize properties into /tmp/UpperBounds17327747399430442960.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7746930620833131003.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17327747399430442960.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17327747399430442960.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 160196 kB
After kill :
MemTotal: 16393340 kB
MemFree: 15880792 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-S10J20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBNT-COL-S10J20, 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 r307-tajo-171654460800251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 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 ;