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-171654460700231.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-S05J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460700231
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.8K Apr 12 09:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 09:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 09:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 09:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 10:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Apr 12 10:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 10:00 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-S05J30-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717125692158

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-S05J30
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-31 03:21:34] [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 03:21:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 03:21:34] [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 03:21:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 03:21:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 694 ms
[2024-05-31 03:21:35] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 519 PT places and 1492.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
[2024-05-31 03:21:35] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-31 03:21:35] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-31 03:21:35] [INFO ] Computed 13 invariants in 10 ms
FORMULA PolyORBNT-COL-S05J30-UpperBounds-15 31 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-31 03:21:35] [INFO ] Invariant cache hit.
[2024-05-31 03:21:35] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-31 03:21:35] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-31 03:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:35] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 03:21:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:21:35] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:35] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-31 03:21:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:21:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-31 03:21:35] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2024-05-31 03:21:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-31 03:21:35] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 03:21:35] [INFO ] Added : 18 causal constraints over 4 iterations in 337 ms. Result :sat
Minimization took 65 ms.
[2024-05-31 03:21:35] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 03:21:35] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:36] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 03:21:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:21:36] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:36] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-31 03:21:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:21:36] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 03:21:36] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2024-05-31 03:21:36] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:21:36] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:36] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-31 03:21:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:21:36] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:36] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-31 03:21:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:21:36] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-31 03:21:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-31 03:21:36] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:21:36] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-31 03:21:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-31 03:21:36] [INFO ] Added : 36 causal constraints over 8 iterations in 208 ms. Result :sat
Minimization took 10 ms.
[2024-05-31 03:21:36] [INFO ] [Real]Absence check using 6 positive place invariants in 53 ms returned sat
[2024-05-31 03:21:36] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 52 ms returned sat
[2024-05-31 03:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:37] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2024-05-31 03:21:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:21:37] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:37] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-31 03:21:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:21:37] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-31 03:21:37] [INFO ] Added : 3 causal constraints over 1 iterations in 65 ms. Result :sat
Minimization took 16 ms.
[2024-05-31 03:21:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:21:37] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:37] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 03:21:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:21:37] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:37] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 03:21:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:21:37] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:21:37] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 17 ms.
[2024-05-31 03:21:37] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 03:21:37] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-31 03:21:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:21:37] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:37] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 03:21:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-31 03:21:37] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 03:21:37] [INFO ] Added : 21 causal constraints over 5 iterations in 302 ms. Result :sat
Minimization took 172 ms.
[2024-05-31 03:21:38] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:21:38] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-31 03:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-31 03:21:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:21:38] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-31 03:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:38] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-31 03:21:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2024-05-31 03:21:38] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:21:38] [INFO ] Added : 4 causal constraints over 1 iterations in 37 ms. Result :sat
Minimization took 26 ms.
[2024-05-31 03:21:38] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:21:38] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:38] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-31 03:21:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:21:38] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 26 ms returned sat
[2024-05-31 03:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:38] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-31 03:21:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2024-05-31 03:21:38] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 5 ms to minimize.
[2024-05-31 03:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-31 03:21:38] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-31 03:21:38] [INFO ] Added : 36 causal constraints over 8 iterations in 153 ms. Result :sat
Minimization took 26 ms.
[2024-05-31 03:21:38] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2024-05-31 03:21:38] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-31 03:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:38] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 03:21:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:21:38] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 26 ms returned sat
[2024-05-31 03:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:39] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-31 03:21:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2024-05-31 03:21:39] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:21:39] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 18 ms.
[2024-05-31 03:21:39] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:21:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 03:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-31 03:21:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:21:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:39] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-31 03:21:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 03:21:39] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-31 03:21:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-31 03:21:39] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:21:39] [INFO ] Added : 21 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 224 ms.
[2024-05-31 03:21:39] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:21:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:39] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 03:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:21:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:21:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:39] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 03:21:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 49 ms returned sat
[2024-05-31 03:21:39] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-31 03:21:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-31 03:21:39] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-31 03:21:40] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-31 03:21:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-31 03:21:40] [INFO ] Added : 36 causal constraints over 8 iterations in 257 ms. Result :sat
Minimization took 16 ms.
[2024-05-31 03:21:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:21:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 03:21:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-31 03:21:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:21:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:40] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 03:21:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-31 03:21:40] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-31 03:21:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-31 03:21:40] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:21:40] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-31 03:21:40] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-31 03:21:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2024-05-31 03:21:40] [INFO ] Added : 36 causal constraints over 8 iterations in 284 ms. Result :sat
Minimization took 277 ms.
[2024-05-31 03:21:40] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 03:21:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-31 03:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:40] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 03:21:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-31 03:21:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-31 03:21:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:40] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-31 03:21:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-31 03:21:40] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 03:21:41] [INFO ] Added : 36 causal constraints over 8 iterations in 126 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [10, -1, 1, -1, -1, 5, -1, -1, -1, 10, 1, 10, -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 03:21:41] [INFO ] Unfolded HLPN to a Petri net with 519 places and 1430 transitions 9824 arcs in 67 ms.
[2024-05-31 03:21:41] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 30 places in 17 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 712 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 13) seen :24
FORMULA PolyORBNT-COL-S05J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 172 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10000 steps, including 252 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 253 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :15
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 10001 steps, including 250 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10000 steps, including 152 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :19
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :22
[2024-05-31 03:21:41] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2024-05-31 03:21:41] [INFO ] Computed 82 invariants in 66 ms
[2024-05-31 03:21:42] [INFO ] [Real]Absence check using 75 positive place invariants in 466 ms returned sat
[2024-05-31 03:21:42] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 33 ms returned unsat
[2024-05-31 03:21:42] [INFO ] [Real]Absence check using 75 positive place invariants in 22 ms returned sat
[2024-05-31 03:21:42] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned unsat
[2024-05-31 03:21:42] [INFO ] [Real]Absence check using 75 positive place invariants in 23 ms returned sat
[2024-05-31 03:21:42] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 5 ms returned unsat
[2024-05-31 03:21:42] [INFO ] [Real]Absence check using 75 positive place invariants in 22 ms returned sat
[2024-05-31 03:21:42] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 7 ms returned unsat
[2024-05-31 03:21:42] [INFO ] [Real]Absence check using 75 positive place invariants in 21 ms returned sat
[2024-05-31 03:21:42] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned unsat
[2024-05-31 03:21:42] [INFO ] [Real]Absence check using 75 positive place invariants in 20 ms returned sat
[2024-05-31 03:21:42] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 5 ms returned unsat
[2024-05-31 03:21:43] [INFO ] [Real]Absence check using 75 positive place invariants in 32 ms returned sat
[2024-05-31 03:21:43] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 8 ms returned unsat
[2024-05-31 03:21:43] [INFO ] [Real]Absence check using 75 positive place invariants in 19 ms returned sat
[2024-05-31 03:21:43] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 3 ms returned unsat
[2024-05-31 03:21:43] [INFO ] [Real]Absence check using 75 positive place invariants in 29 ms returned sat
[2024-05-31 03:21:43] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-31 03:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:43] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2024-05-31 03:21:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:43] [INFO ] [Nat]Absence check using 75 positive place invariants in 25 ms returned sat
[2024-05-31 03:21:43] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 03:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:44] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2024-05-31 03:21:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:21:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 23 ms returned sat
[2024-05-31 03:21:44] [INFO ] Computed and/alt/rep : 449/1109/449 causal constraints (skipped 286 transitions) in 94 ms.
[2024-05-31 03:21:45] [INFO ] Added : 14 causal constraints over 3 iterations in 343 ms. Result :sat
Minimization took 182 ms.
[2024-05-31 03:21:45] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2024-05-31 03:21:45] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-31 03:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:45] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-05-31 03:21:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:45] [INFO ] [Nat]Absence check using 75 positive place invariants in 23 ms returned sat
[2024-05-31 03:21:45] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 03:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:50] [INFO ] [Nat]Absence check using state equation in 4876 ms returned unknown
[2024-05-31 03:21:50] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2024-05-31 03:21:50] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 1, 1, 4, 1, 1, 1, 10, 10, 1] Max seen :[4, 1, 1, 1, 4, 1, 1, 1, 3, 4, 1]
FORMULA PolyORBNT-COL-S05J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J30-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 484 transition count 709
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 77 place count 448 transition count 709
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 77 place count 448 transition count 675
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 145 place count 414 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 413 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 413 transition count 674
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 151 place count 411 transition count 672
Applied a total of 151 rules in 125 ms. Remains 411 /489 variables (removed 78) and now considering 672/745 (removed 73) transitions.
[2024-05-31 03:21:51] [INFO ] Flow matrix only has 668 transitions (discarded 4 similar events)
// Phase 1: matrix 668 rows 411 cols
[2024-05-31 03:21:51] [INFO ] Computed 77 invariants in 16 ms
[2024-05-31 03:21:51] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 411/489 places, 577/745 transitions.
Applied a total of 0 rules in 54 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 720 ms. Remains : 411/489 places, 577/745 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 03:21:51] [INFO ] Computed 77 invariants in 13 ms
Incomplete random walk after 1000000 steps, including 47057 resets, run finished after 3309 ms. (steps per millisecond=302 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 5588 resets, run finished after 993 ms. (steps per millisecond=1007 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 4137 resets, run finished after 1042 ms. (steps per millisecond=959 ) properties (out of 2) seen :7
[2024-05-31 03:21:57] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 03:21:57] [INFO ] Computed 77 invariants in 9 ms
[2024-05-31 03:21:57] [INFO ] [Real]Absence check using 70 positive place invariants in 16 ms returned sat
[2024-05-31 03:21:57] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 03:21:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:57] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 03:21:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:21:57] [INFO ] [Nat]Absence check using 70 positive place invariants in 17 ms returned sat
[2024-05-31 03:21:57] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 03:21:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:21:57] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2024-05-31 03:21:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:21:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 78 ms returned sat
[2024-05-31 03:21:57] [INFO ] Deduced a trap composed of 89 places in 189 ms of which 0 ms to minimize.
[2024-05-31 03:21:58] [INFO ] Deduced a trap composed of 128 places in 150 ms of which 1 ms to minimize.
[2024-05-31 03:21:58] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 2 ms to minimize.
[2024-05-31 03:21:58] [INFO ] Deduced a trap composed of 128 places in 179 ms of which 1 ms to minimize.
[2024-05-31 03:21:58] [INFO ] Deduced a trap composed of 143 places in 219 ms of which 1 ms to minimize.
[2024-05-31 03:21:59] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 0 ms to minimize.
[2024-05-31 03:21:59] [INFO ] Deduced a trap composed of 114 places in 169 ms of which 1 ms to minimize.
[2024-05-31 03:21:59] [INFO ] Deduced a trap composed of 122 places in 159 ms of which 0 ms to minimize.
[2024-05-31 03:22:00] [INFO ] Deduced a trap composed of 131 places in 273 ms of which 1 ms to minimize.
[2024-05-31 03:22:00] [INFO ] Deduced a trap composed of 146 places in 196 ms of which 0 ms to minimize.
[2024-05-31 03:22:00] [INFO ] Deduced a trap composed of 125 places in 211 ms of which 1 ms to minimize.
[2024-05-31 03:22:00] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 2 ms to minimize.
[2024-05-31 03:22:00] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 1 ms to minimize.
[2024-05-31 03:22:01] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 0 ms to minimize.
[2024-05-31 03:22:01] [INFO ] Deduced a trap composed of 125 places in 215 ms of which 1 ms to minimize.
[2024-05-31 03:22:01] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 1 ms to minimize.
[2024-05-31 03:22:01] [INFO ] Deduced a trap composed of 119 places in 179 ms of which 1 ms to minimize.
[2024-05-31 03:22:01] [INFO ] Deduced a trap composed of 134 places in 153 ms of which 1 ms to minimize.
[2024-05-31 03:22:02] [INFO ] Deduced a trap composed of 131 places in 198 ms of which 1 ms to minimize.
[2024-05-31 03:22:02] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 0 ms to minimize.
[2024-05-31 03:22:02] [INFO ] Deduced a trap composed of 128 places in 193 ms of which 0 ms to minimize.
[2024-05-31 03:22:02] [INFO ] Deduced a trap composed of 131 places in 201 ms of which 0 ms to minimize.
[2024-05-31 03:22:03] [INFO ] Deduced a trap composed of 119 places in 182 ms of which 1 ms to minimize.
[2024-05-31 03:22:03] [INFO ] Deduced a trap composed of 128 places in 184 ms of which 1 ms to minimize.
[2024-05-31 03:22:03] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 0 ms to minimize.
[2024-05-31 03:22:03] [INFO ] Deduced a trap composed of 116 places in 130 ms of which 1 ms to minimize.
[2024-05-31 03:22:03] [INFO ] Deduced a trap composed of 128 places in 173 ms of which 0 ms to minimize.
[2024-05-31 03:22:04] [INFO ] Deduced a trap composed of 128 places in 175 ms of which 1 ms to minimize.
[2024-05-31 03:22:04] [INFO ] Deduced a trap composed of 116 places in 213 ms of which 1 ms to minimize.
[2024-05-31 03:22:05] [INFO ] Deduced a trap composed of 128 places in 590 ms of which 0 ms to minimize.
[2024-05-31 03:22:05] [INFO ] Deduced a trap composed of 128 places in 169 ms of which 1 ms to minimize.
[2024-05-31 03:22:05] [INFO ] Deduced a trap composed of 137 places in 181 ms of which 1 ms to minimize.
[2024-05-31 03:22:06] [INFO ] Deduced a trap composed of 128 places in 238 ms of which 0 ms to minimize.
[2024-05-31 03:22:06] [INFO ] Deduced a trap composed of 122 places in 186 ms of which 1 ms to minimize.
[2024-05-31 03:22:07] [INFO ] Deduced a trap composed of 119 places in 258 ms of which 1 ms to minimize.
[2024-05-31 03:22:07] [INFO ] Deduced a trap composed of 131 places in 188 ms of which 0 ms to minimize.
[2024-05-31 03:22:07] [INFO ] Deduced a trap composed of 131 places in 250 ms of which 1 ms to minimize.
[2024-05-31 03:22:08] [INFO ] Deduced a trap composed of 125 places in 193 ms of which 1 ms to minimize.
[2024-05-31 03:22:08] [INFO ] Deduced a trap composed of 144 places in 165 ms of which 1 ms to minimize.
[2024-05-31 03:22:08] [INFO ] Deduced a trap composed of 125 places in 204 ms of which 0 ms to minimize.
[2024-05-31 03:22:08] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 13 ms to minimize.
[2024-05-31 03:22:09] [INFO ] Deduced a trap composed of 131 places in 177 ms of which 1 ms to minimize.
[2024-05-31 03:22:09] [INFO ] Deduced a trap composed of 125 places in 178 ms of which 1 ms to minimize.
[2024-05-31 03:22:10] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 1 ms to minimize.
[2024-05-31 03:22:10] [INFO ] Deduced a trap composed of 119 places in 186 ms of which 1 ms to minimize.
[2024-05-31 03:22:11] [INFO ] Deduced a trap composed of 131 places in 182 ms of which 1 ms to minimize.
[2024-05-31 03:22:11] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 9 ms to minimize.
[2024-05-31 03:22:11] [INFO ] Deduced a trap composed of 134 places in 145 ms of which 1 ms to minimize.
[2024-05-31 03:22:11] [INFO ] Deduced a trap composed of 131 places in 189 ms of which 0 ms to minimize.
[2024-05-31 03:22:12] [INFO ] Deduced a trap composed of 125 places in 162 ms of which 1 ms to minimize.
[2024-05-31 03:22:15] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 17329 ms
[2024-05-31 03:22:15] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2024-05-31 03:22:15] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 03:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:22:15] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-31 03:22:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:22:15] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2024-05-31 03:22:15] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 03:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:22:15] [INFO ] [Nat]Absence check using state equation in 342 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 4] Max seen :[3, 4]
FORMULA PolyORBNT-COL-S05J30-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 41 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 411/411 places, 577/577 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 03:22:15] [INFO ] Computed 77 invariants in 18 ms
Incomplete random walk after 1000000 steps, including 47204 resets, run finished after 3358 ms. (steps per millisecond=297 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5493 resets, run finished after 832 ms. (steps per millisecond=1201 ) properties (out of 1) seen :3
[2024-05-31 03:22:20] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 03:22:20] [INFO ] Computed 77 invariants in 18 ms
[2024-05-31 03:22:20] [INFO ] [Real]Absence check using 70 positive place invariants in 18 ms returned sat
[2024-05-31 03:22:20] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 03:22:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:22:20] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-31 03:22:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:22:20] [INFO ] [Nat]Absence check using 70 positive place invariants in 11 ms returned sat
[2024-05-31 03:22:20] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 03:22:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:22:20] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 03:22:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:22:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 55 ms returned sat
[2024-05-31 03:22:20] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 1 ms to minimize.
[2024-05-31 03:22:20] [INFO ] Deduced a trap composed of 128 places in 177 ms of which 0 ms to minimize.
[2024-05-31 03:22:21] [INFO ] Deduced a trap composed of 143 places in 121 ms of which 1 ms to minimize.
[2024-05-31 03:22:21] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 1 ms to minimize.
[2024-05-31 03:22:21] [INFO ] Deduced a trap composed of 143 places in 209 ms of which 1 ms to minimize.
[2024-05-31 03:22:21] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 3 ms to minimize.
[2024-05-31 03:22:21] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 0 ms to minimize.
[2024-05-31 03:22:22] [INFO ] Deduced a trap composed of 122 places in 195 ms of which 13 ms to minimize.
[2024-05-31 03:22:22] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 0 ms to minimize.
[2024-05-31 03:22:22] [INFO ] Deduced a trap composed of 146 places in 139 ms of which 1 ms to minimize.
[2024-05-31 03:22:23] [INFO ] Deduced a trap composed of 125 places in 167 ms of which 1 ms to minimize.
[2024-05-31 03:22:23] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 1 ms to minimize.
[2024-05-31 03:22:23] [INFO ] Deduced a trap composed of 128 places in 185 ms of which 0 ms to minimize.
[2024-05-31 03:22:23] [INFO ] Deduced a trap composed of 131 places in 159 ms of which 1 ms to minimize.
[2024-05-31 03:22:23] [INFO ] Deduced a trap composed of 125 places in 197 ms of which 0 ms to minimize.
[2024-05-31 03:22:24] [INFO ] Deduced a trap composed of 122 places in 167 ms of which 0 ms to minimize.
[2024-05-31 03:22:24] [INFO ] Deduced a trap composed of 119 places in 160 ms of which 0 ms to minimize.
[2024-05-31 03:22:24] [INFO ] Deduced a trap composed of 134 places in 196 ms of which 1 ms to minimize.
[2024-05-31 03:22:24] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 1 ms to minimize.
[2024-05-31 03:22:24] [INFO ] Deduced a trap composed of 119 places in 148 ms of which 1 ms to minimize.
[2024-05-31 03:22:25] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 2 ms to minimize.
[2024-05-31 03:22:25] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 1 ms to minimize.
[2024-05-31 03:22:25] [INFO ] Deduced a trap composed of 119 places in 167 ms of which 0 ms to minimize.
[2024-05-31 03:22:25] [INFO ] Deduced a trap composed of 128 places in 189 ms of which 1 ms to minimize.
[2024-05-31 03:22:26] [INFO ] Deduced a trap composed of 125 places in 195 ms of which 1 ms to minimize.
[2024-05-31 03:22:26] [INFO ] Deduced a trap composed of 116 places in 167 ms of which 1 ms to minimize.
[2024-05-31 03:22:26] [INFO ] Deduced a trap composed of 128 places in 150 ms of which 0 ms to minimize.
[2024-05-31 03:22:26] [INFO ] Deduced a trap composed of 128 places in 165 ms of which 0 ms to minimize.
[2024-05-31 03:22:27] [INFO ] Deduced a trap composed of 116 places in 195 ms of which 0 ms to minimize.
[2024-05-31 03:22:27] [INFO ] Deduced a trap composed of 128 places in 183 ms of which 0 ms to minimize.
[2024-05-31 03:22:27] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 0 ms to minimize.
[2024-05-31 03:22:28] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 1 ms to minimize.
[2024-05-31 03:22:28] [INFO ] Deduced a trap composed of 128 places in 176 ms of which 1 ms to minimize.
[2024-05-31 03:22:28] [INFO ] Deduced a trap composed of 122 places in 180 ms of which 0 ms to minimize.
[2024-05-31 03:22:29] [INFO ] Deduced a trap composed of 119 places in 194 ms of which 1 ms to minimize.
[2024-05-31 03:22:29] [INFO ] Deduced a trap composed of 131 places in 184 ms of which 1 ms to minimize.
[2024-05-31 03:22:29] [INFO ] Deduced a trap composed of 131 places in 189 ms of which 1 ms to minimize.
[2024-05-31 03:22:30] [INFO ] Deduced a trap composed of 125 places in 167 ms of which 1 ms to minimize.
[2024-05-31 03:22:30] [INFO ] Deduced a trap composed of 144 places in 174 ms of which 1 ms to minimize.
[2024-05-31 03:22:30] [INFO ] Deduced a trap composed of 125 places in 204 ms of which 0 ms to minimize.
[2024-05-31 03:22:30] [INFO ] Deduced a trap composed of 131 places in 185 ms of which 2 ms to minimize.
[2024-05-31 03:22:31] [INFO ] Deduced a trap composed of 131 places in 191 ms of which 0 ms to minimize.
[2024-05-31 03:22:31] [INFO ] Deduced a trap composed of 125 places in 198 ms of which 1 ms to minimize.
[2024-05-31 03:22:32] [INFO ] Deduced a trap composed of 138 places in 332 ms of which 1 ms to minimize.
[2024-05-31 03:22:33] [INFO ] Deduced a trap composed of 119 places in 236 ms of which 1 ms to minimize.
[2024-05-31 03:22:33] [INFO ] Deduced a trap composed of 131 places in 203 ms of which 0 ms to minimize.
[2024-05-31 03:22:33] [INFO ] Deduced a trap composed of 137 places in 197 ms of which 0 ms to minimize.
[2024-05-31 03:22:33] [INFO ] Deduced a trap composed of 134 places in 204 ms of which 1 ms to minimize.
[2024-05-31 03:22:34] [INFO ] Deduced a trap composed of 131 places in 194 ms of which 1 ms to minimize.
[2024-05-31 03:22:34] [INFO ] Deduced a trap composed of 125 places in 212 ms of which 1 ms to minimize.
[2024-05-31 03:22:37] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 16966 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 18 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 411/411 places, 577/577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 18 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2024-05-31 03:22:37] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:22:37] [INFO ] Invariant cache hit.
[2024-05-31 03:22:38] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-05-31 03:22:38] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:22:38] [INFO ] Invariant cache hit.
[2024-05-31 03:22:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:22:39] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 1913 ms to find 0 implicit places.
[2024-05-31 03:22:39] [INFO ] Redundant transitions in 44 ms returned []
[2024-05-31 03:22:39] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:22:39] [INFO ] Invariant cache hit.
[2024-05-31 03:22:39] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2332 ms. Remains : 411/411 places, 577/577 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J30-UpperBounds-09
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 03:22:39] [INFO ] Computed 77 invariants in 9 ms
Incomplete random walk after 10000 steps, including 473 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :3
[2024-05-31 03:22:40] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 03:22:40] [INFO ] Computed 77 invariants in 15 ms
[2024-05-31 03:22:40] [INFO ] [Real]Absence check using 70 positive place invariants in 11 ms returned sat
[2024-05-31 03:22:40] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 03:22:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:22:40] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-05-31 03:22:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:22:40] [INFO ] [Nat]Absence check using 70 positive place invariants in 16 ms returned sat
[2024-05-31 03:22:40] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 9 ms returned sat
[2024-05-31 03:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:22:40] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2024-05-31 03:22:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:22:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 69 ms returned sat
[2024-05-31 03:22:40] [INFO ] Deduced a trap composed of 89 places in 210 ms of which 1 ms to minimize.
[2024-05-31 03:22:41] [INFO ] Deduced a trap composed of 128 places in 192 ms of which 1 ms to minimize.
[2024-05-31 03:22:41] [INFO ] Deduced a trap composed of 143 places in 164 ms of which 0 ms to minimize.
[2024-05-31 03:22:41] [INFO ] Deduced a trap composed of 128 places in 176 ms of which 0 ms to minimize.
[2024-05-31 03:22:41] [INFO ] Deduced a trap composed of 143 places in 215 ms of which 1 ms to minimize.
[2024-05-31 03:22:42] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 0 ms to minimize.
[2024-05-31 03:22:42] [INFO ] Deduced a trap composed of 114 places in 153 ms of which 0 ms to minimize.
[2024-05-31 03:22:42] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 3 ms to minimize.
[2024-05-31 03:22:42] [INFO ] Deduced a trap composed of 131 places in 199 ms of which 1 ms to minimize.
[2024-05-31 03:22:43] [INFO ] Deduced a trap composed of 146 places in 157 ms of which 0 ms to minimize.
[2024-05-31 03:22:43] [INFO ] Deduced a trap composed of 125 places in 159 ms of which 0 ms to minimize.
[2024-05-31 03:22:43] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 1 ms to minimize.
[2024-05-31 03:22:43] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 0 ms to minimize.
[2024-05-31 03:22:43] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 1 ms to minimize.
[2024-05-31 03:22:44] [INFO ] Deduced a trap composed of 125 places in 170 ms of which 0 ms to minimize.
[2024-05-31 03:22:44] [INFO ] Deduced a trap composed of 122 places in 150 ms of which 1 ms to minimize.
[2024-05-31 03:22:44] [INFO ] Deduced a trap composed of 119 places in 156 ms of which 0 ms to minimize.
[2024-05-31 03:22:44] [INFO ] Deduced a trap composed of 134 places in 189 ms of which 1 ms to minimize.
[2024-05-31 03:22:44] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 0 ms to minimize.
[2024-05-31 03:22:45] [INFO ] Deduced a trap composed of 119 places in 149 ms of which 3 ms to minimize.
[2024-05-31 03:22:45] [INFO ] Deduced a trap composed of 128 places in 146 ms of which 1 ms to minimize.
[2024-05-31 03:22:45] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 0 ms to minimize.
[2024-05-31 03:22:45] [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, 577/577 transitions.
Applied a total of 0 rules in 17 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2024-05-31 03:22:45] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:22:45] [INFO ] Invariant cache hit.
[2024-05-31 03:22:45] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 411/411 places, 577/577 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 03:22:45] [INFO ] Computed 77 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47303 resets, run finished after 2808 ms. (steps per millisecond=356 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 5518 resets, run finished after 786 ms. (steps per millisecond=1272 ) properties (out of 1) seen :3
[2024-05-31 03:22:49] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-31 03:22:49] [INFO ] Computed 77 invariants in 10 ms
[2024-05-31 03:22:49] [INFO ] [Real]Absence check using 70 positive place invariants in 13 ms returned sat
[2024-05-31 03:22:49] [INFO ] [Real]Absence check using 70 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 03:22:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 03:22:49] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-05-31 03:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 03:22:49] [INFO ] [Nat]Absence check using 70 positive place invariants in 19 ms returned sat
[2024-05-31 03:22:49] [INFO ] [Nat]Absence check using 70 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 03:22:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 03:22:49] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2024-05-31 03:22:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:22:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 77 ms returned sat
[2024-05-31 03:22:50] [INFO ] Deduced a trap composed of 89 places in 216 ms of which 1 ms to minimize.
[2024-05-31 03:22:50] [INFO ] Deduced a trap composed of 128 places in 166 ms of which 1 ms to minimize.
[2024-05-31 03:22:50] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 0 ms to minimize.
[2024-05-31 03:22:50] [INFO ] Deduced a trap composed of 128 places in 178 ms of which 0 ms to minimize.
[2024-05-31 03:22:51] [INFO ] Deduced a trap composed of 143 places in 210 ms of which 0 ms to minimize.
[2024-05-31 03:22:51] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 1 ms to minimize.
[2024-05-31 03:22:51] [INFO ] Deduced a trap composed of 114 places in 170 ms of which 0 ms to minimize.
[2024-05-31 03:22:51] [INFO ] Deduced a trap composed of 122 places in 159 ms of which 1 ms to minimize.
[2024-05-31 03:22:52] [INFO ] Deduced a trap composed of 131 places in 198 ms of which 1 ms to minimize.
[2024-05-31 03:22:52] [INFO ] Deduced a trap composed of 146 places in 174 ms of which 0 ms to minimize.
[2024-05-31 03:22:52] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 2 ms to minimize.
[2024-05-31 03:22:52] [INFO ] Deduced a trap composed of 131 places in 163 ms of which 0 ms to minimize.
[2024-05-31 03:22:53] [INFO ] Deduced a trap composed of 128 places in 282 ms of which 1 ms to minimize.
[2024-05-31 03:22:53] [INFO ] Deduced a trap composed of 131 places in 205 ms of which 1 ms to minimize.
[2024-05-31 03:22:53] [INFO ] Deduced a trap composed of 125 places in 205 ms of which 1 ms to minimize.
[2024-05-31 03:22:53] [INFO ] Deduced a trap composed of 122 places in 203 ms of which 1 ms to minimize.
[2024-05-31 03:22:54] [INFO ] Deduced a trap composed of 119 places in 198 ms of which 1 ms to minimize.
[2024-05-31 03:22:54] [INFO ] Deduced a trap composed of 134 places in 189 ms of which 1 ms to minimize.
[2024-05-31 03:22:54] [INFO ] Deduced a trap composed of 131 places in 200 ms of which 1 ms to minimize.
[2024-05-31 03:22:54] [INFO ] Deduced a trap composed of 119 places in 200 ms of which 1 ms to minimize.
[2024-05-31 03:22:55] [INFO ] Deduced a trap composed of 128 places in 198 ms of which 0 ms to minimize.
[2024-05-31 03:22:55] [INFO ] Deduced a trap composed of 131 places in 213 ms of which 0 ms to minimize.
[2024-05-31 03:22:55] [INFO ] Deduced a trap composed of 119 places in 195 ms of which 0 ms to minimize.
[2024-05-31 03:22:55] [INFO ] Deduced a trap composed of 128 places in 199 ms of which 1 ms to minimize.
[2024-05-31 03:22:56] [INFO ] Deduced a trap composed of 125 places in 171 ms of which 0 ms to minimize.
[2024-05-31 03:22:56] [INFO ] Deduced a trap composed of 116 places in 177 ms of which 1 ms to minimize.
[2024-05-31 03:22:56] [INFO ] Deduced a trap composed of 128 places in 193 ms of which 0 ms to minimize.
[2024-05-31 03:22:56] [INFO ] Deduced a trap composed of 128 places in 171 ms of which 1 ms to minimize.
[2024-05-31 03:22:57] [INFO ] Deduced a trap composed of 116 places in 199 ms of which 1 ms to minimize.
[2024-05-31 03:22:57] [INFO ] Deduced a trap composed of 128 places in 195 ms of which 0 ms to minimize.
[2024-05-31 03:22:58] [INFO ] Deduced a trap composed of 128 places in 207 ms of which 1 ms to minimize.
[2024-05-31 03:22:58] [INFO ] Deduced a trap composed of 137 places in 206 ms of which 0 ms to minimize.
[2024-05-31 03:22:58] [INFO ] Deduced a trap composed of 128 places in 211 ms of which 0 ms to minimize.
[2024-05-31 03:22:59] [INFO ] Deduced a trap composed of 122 places in 196 ms of which 0 ms to minimize.
[2024-05-31 03:23:00] [INFO ] Deduced a trap composed of 119 places in 305 ms of which 1 ms to minimize.
[2024-05-31 03:23:00] [INFO ] Deduced a trap composed of 131 places in 183 ms of which 0 ms to minimize.
[2024-05-31 03:23:00] [INFO ] Deduced a trap composed of 131 places in 250 ms of which 1 ms to minimize.
[2024-05-31 03:23:01] [INFO ] Deduced a trap composed of 125 places in 222 ms of which 0 ms to minimize.
[2024-05-31 03:23:01] [INFO ] Deduced a trap composed of 144 places in 173 ms of which 0 ms to minimize.
[2024-05-31 03:23:01] [INFO ] Deduced a trap composed of 125 places in 172 ms of which 0 ms to minimize.
[2024-05-31 03:23:01] [INFO ] Deduced a trap composed of 131 places in 191 ms of which 1 ms to minimize.
[2024-05-31 03:23:02] [INFO ] Deduced a trap composed of 131 places in 188 ms of which 0 ms to minimize.
[2024-05-31 03:23:02] [INFO ] Deduced a trap composed of 125 places in 152 ms of which 0 ms to minimize.
[2024-05-31 03:23:03] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 1 ms to minimize.
[2024-05-31 03:23:03] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 1 ms to minimize.
[2024-05-31 03:23:03] [INFO ] Deduced a trap composed of 131 places in 177 ms of which 0 ms to minimize.
[2024-05-31 03:23:04] [INFO ] Deduced a trap composed of 137 places in 219 ms of which 1 ms to minimize.
[2024-05-31 03:23:04] [INFO ] Deduced a trap composed of 134 places in 170 ms of which 1 ms to minimize.
[2024-05-31 03:23:04] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 0 ms to minimize.
[2024-05-31 03:23:04] [INFO ] Deduced a trap composed of 125 places in 193 ms of which 1 ms to minimize.
[2024-05-31 03:23:08] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 18017 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 20 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 411/411 places, 577/577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 18 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2024-05-31 03:23:08] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:23:08] [INFO ] Invariant cache hit.
[2024-05-31 03:23:08] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-31 03:23:08] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:23:08] [INFO ] Invariant cache hit.
[2024-05-31 03:23:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 03:23:10] [INFO ] Implicit Places using invariants and state equation in 2184 ms returned []
Implicit Place search using SMT with State Equation took 2623 ms to find 0 implicit places.
[2024-05-31 03:23:10] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-31 03:23:10] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2024-05-31 03:23:10] [INFO ] Invariant cache hit.
[2024-05-31 03:23:11] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3152 ms. Remains : 411/411 places, 577/577 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J30-UpperBounds-09 in 31270 ms.
[2024-05-31 03:23:11] [INFO ] Flatten gal took : 103 ms
[2024-05-31 03:23:11] [INFO ] Applying decomposition
[2024-05-31 03:23:11] [INFO ] Flatten gal took : 43 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/graph16228500570669234485.txt' '-o' '/tmp/graph16228500570669234485.bin' '-w' '/tmp/graph16228500570669234485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16228500570669234485.bin' '-l' '-1' '-v' '-w' '/tmp/graph16228500570669234485.weights' '-q' '0' '-e' '0.001'
[2024-05-31 03:23:11] [INFO ] Decomposing Gal with order
[2024-05-31 03:23:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:23:11] [INFO ] Removed a total of 541 redundant transitions.
[2024-05-31 03:23:11] [INFO ] Flatten gal took : 174 ms
[2024-05-31 03:23:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 244 labels/synchronizations in 21 ms.
[2024-05-31 03:23:12] [INFO ] Time to serialize gal into /tmp/UpperBounds17244762823925703039.gal : 12 ms
[2024-05-31 03:23:12] [INFO ] Time to serialize properties into /tmp/UpperBounds1403322332486061566.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/UpperBounds17244762823925703039.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1403322332486061566.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 ...284
Loading property file /tmp/UpperBounds1403322332486061566.prop.
Detected timeout of ITS tools.
[2024-05-31 03:43:48] [INFO ] Applying decomposition
[2024-05-31 03:43:48] [INFO ] Flatten gal took : 375 ms
[2024-05-31 03:43:48] [INFO ] Decomposing Gal with order
[2024-05-31 03:43:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 03:43:50] [INFO ] Removed a total of 2114 redundant transitions.
[2024-05-31 03:43:50] [INFO ] Flatten gal took : 1002 ms
[2024-05-31 03:43:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 77 ms.
[2024-05-31 03:43:50] [INFO ] Time to serialize gal into /tmp/UpperBounds12344816600124048010.gal : 122 ms
[2024-05-31 03:43:50] [INFO ] Time to serialize properties into /tmp/UpperBounds5011371295162395671.prop : 2 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/UpperBounds12344816600124048010.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5011371295162395671.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 ...284
Loading property file /tmp/UpperBounds5011371295162395671.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.48727e+09,224.424,3064200,1.01021e+06,25,7.74664e+06,2072,1408,7.37857e+06,48,1885,0
Total reachable state count : 3487273800

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property PolyORBNT-COL-S05J30-UpperBounds-09 :0 <= QueueJobE.QueueJobE_0 <= 3
FORMULA PolyORBNT-COL-S05J30-UpperBounds-09 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBNT-COL-S05J30-UpperBounds-09,0,292.911,3069860,1,0,7.74664e+06,2072,2920,1.39537e+07,60,1885,34008
Total runtime 1630264 ms.

BK_STOP 1717127325362

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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-S05J30"
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-S05J30, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r307-tajo-171654460700231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;