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.r290-tajo-171654447000397.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 itstools
Input is PolyORBNT-COL-S05J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447000397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 12 09:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 09:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 09:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K 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.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 10:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 10:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 10:13 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 94K 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-S05J80-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716926146922

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J80
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-28 19:55:48] [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-28 19:55:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:55:48] [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-28 19:55:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 19:55:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 554 ms
[2024-05-28 19:55:48] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-28 19:55:48] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-28 19:55:48] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 19:55:48] [INFO ] Computed 13 invariants in 10 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 5] Max Struct:[+inf, 3, +inf, 10, +inf, 10, +inf, 10, +inf, 5, +inf, 3, 10, +inf, +inf, 5]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 19:55:48] [INFO ] Invariant cache hit.
[2024-05-28 19:55:49] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-28 19:55:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:55:49] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 19:55:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:49] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 19:55:49] [INFO ] Added : 36 causal constraints over 8 iterations in 51 ms. Result :sat
Minimization took 22 ms.
[2024-05-28 19:55:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 19:55:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 66 ms returned sat
[2024-05-28 19:55:49] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 15 ms to minimize.
[2024-05-28 19:55:49] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 2 ms to minimize.
[2024-05-28 19:55:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2024-05-28 19:55:49] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 19:55:49] [INFO ] Added : 21 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 170 ms.
[2024-05-28 19:55:49] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 19:55:49] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 19:55:49] [INFO ] Added : 4 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 14 ms.
[2024-05-28 19:55:49] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-28 19:55:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:50] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:55:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-28 19:55:50] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 19:55:50] [INFO ] Added : 22 causal constraints over 5 iterations in 417 ms. Result :sat
Minimization took 189 ms.
[2024-05-28 19:55:50] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:55:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-28 19:55:50] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 19:55:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:55:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:55:50] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-28 19:55:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 19:55:50] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 19:55:50] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 12 ms.
[2024-05-28 19:55:50] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:55:50] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:55:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-28 19:55:50] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:50] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:55:50] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-28 19:55:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 19:55:50] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:55:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-28 19:55:50] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 19:55:51] [INFO ] Added : 22 causal constraints over 5 iterations in 126 ms. Result :sat
Minimization took 58 ms.
[2024-05-28 19:55:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:51] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:55:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2024-05-28 19:55:51] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 19:55:51] [INFO ] Added : 20 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 17 ms.
[2024-05-28 19:55:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 19:55:51] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:55:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-28 19:55:51] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 19:55:51] [INFO ] Added : 22 causal constraints over 5 iterations in 289 ms. Result :sat
Minimization took 87 ms.
[2024-05-28 19:55:51] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2024-05-28 19:55:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-28 19:55:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:51] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 19:55:52] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-28 19:55:52] [INFO ] Added : 36 causal constraints over 8 iterations in 87 ms. Result :sat
Minimization took 101 ms.
[2024-05-28 19:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-28 19:55:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:52] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 3 ms to minimize.
[2024-05-28 19:55:52] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 7 ms to minimize.
[2024-05-28 19:55:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2024-05-28 19:55:52] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 19:55:52] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-28 19:55:52] [INFO ] Added : 36 causal constraints over 8 iterations in 87 ms. Result :sat
Minimization took 25 ms.
[2024-05-28 19:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-28 19:55:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 19:55:52] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-28 19:55:52] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 19:55:52] [INFO ] Added : 22 causal constraints over 5 iterations in 145 ms. Result :sat
Minimization took 17 ms.
[2024-05-28 19:55:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 19:55:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:52] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-28 19:55:52] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 19:55:53] [INFO ] Added : 22 causal constraints over 5 iterations in 383 ms. Result :sat
Minimization took 85 ms.
[2024-05-28 19:55:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 19:55:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-28 19:55:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:53] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-28 19:55:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:53] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:55:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-28 19:55:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 19:55:53] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:55:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-28 19:55:53] [INFO ] Added : 36 causal constraints over 8 iterations in 141 ms. Result :sat
Minimization took 18 ms.
[2024-05-28 19:55:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:53] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:55:53] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-28 19:55:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:55:53] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:55:53] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-28 19:55:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:55:53] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:55:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-28 19:55:53] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 19:55:53] [INFO ] Added : 36 causal constraints over 8 iterations in 29 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 3, +inf, 10, +inf, 10, +inf, 10, 10, 5, +inf, 3, 10, +inf, +inf]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 19:55:53] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 106 ms.
[2024-05-28 19:55:53] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 80 places in 15 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 3, +inf, 10, +inf, 10, +inf, 10, 5, +inf, 3, 10, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 3, +inf, 10, +inf, 10, +inf, 10, 5, +inf, 3, 10, +inf, +inf]
[2024-05-28 19:55:54] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2024-05-28 19:55:54] [INFO ] Computed 182 invariants in 118 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 3, 11, 10, 11, 10, 81, 10, 5, 82, 3, 10, 81, 81]
RANDOM walk for 10000 steps (683 resets) in 279 ms. (35 steps per ms)
FORMULA PolyORBNT-COL-S05J80-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120011 steps (1809 resets) in 736 ms. (162 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 4, 1, 3, 1, 4, 4, 1, 3, 1, 1] Max Struct:[11, 11, 10, 11, 10, 81, 10, 5, 82, 10, 81, 81]
[2024-05-28 19:55:55] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
[2024-05-28 19:55:55] [INFO ] Invariant cache hit.
[2024-05-28 19:55:55] [INFO ] [Real]Absence check using 175 positive place invariants in 37 ms returned sat
[2024-05-28 19:55:55] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 8 ms returned unsat
[2024-05-28 19:55:55] [INFO ] [Real]Absence check using 175 positive place invariants in 38 ms returned sat
[2024-05-28 19:55:55] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 9 ms returned unsat
[2024-05-28 19:55:55] [INFO ] [Real]Absence check using 175 positive place invariants in 84 ms returned sat
[2024-05-28 19:55:55] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 32 ms returned unsat
[2024-05-28 19:55:55] [INFO ] [Real]Absence check using 175 positive place invariants in 49 ms returned sat
[2024-05-28 19:55:55] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 8 ms returned unsat
[2024-05-28 19:55:56] [INFO ] [Real]Absence check using 175 positive place invariants in 38 ms returned sat
[2024-05-28 19:55:56] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-28 19:55:56] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2024-05-28 19:55:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:55:56] [INFO ] [Nat]Absence check using 175 positive place invariants in 64 ms returned sat
[2024-05-28 19:55:56] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 45 ms returned sat
[2024-05-28 19:55:58] [INFO ] [Nat]Absence check using state equation in 1498 ms returned sat
[2024-05-28 19:55:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:55:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 19:55:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 849 ms returned sat
[2024-05-28 19:55:59] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 187 ms.
[2024-05-28 19:56:00] [INFO ] Added : 19 causal constraints over 4 iterations in 1315 ms. Result :sat
Minimization took 694 ms.
[2024-05-28 19:56:01] [INFO ] [Real]Absence check using 175 positive place invariants in 56 ms returned sat
[2024-05-28 19:56:01] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned unsat
[2024-05-28 19:56:01] [INFO ] [Real]Absence check using 175 positive place invariants in 45 ms returned sat
[2024-05-28 19:56:01] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 23 ms returned unsat
[2024-05-28 19:56:01] [INFO ] [Real]Absence check using 175 positive place invariants in 43 ms returned sat
[2024-05-28 19:56:01] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-28 19:56:02] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2024-05-28 19:56:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:56:02] [INFO ] [Nat]Absence check using 175 positive place invariants in 61 ms returned sat
[2024-05-28 19:56:02] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-28 19:56:04] [INFO ] [Nat]Absence check using state equation in 1517 ms returned unknown
[2024-05-28 19:56:04] [INFO ] [Real]Absence check using 175 positive place invariants in 54 ms returned sat
[2024-05-28 19:56:04] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 28 ms returned unsat
[2024-05-28 19:56:04] [INFO ] [Real]Absence check using 175 positive place invariants in 52 ms returned sat
[2024-05-28 19:56:04] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-28 19:56:05] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2024-05-28 19:56:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:56:05] [INFO ] [Nat]Absence check using 175 positive place invariants in 44 ms returned sat
[2024-05-28 19:56:05] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-28 19:56:06] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2024-05-28 19:56:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 456 ms returned sat
[2024-05-28 19:56:06] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 156 ms.
[2024-05-28 19:56:07] [INFO ] Added : 16 causal constraints over 4 iterations in 969 ms. Result :sat
Minimization took 670 ms.
[2024-05-28 19:56:08] [INFO ] [Real]Absence check using 175 positive place invariants in 51 ms returned sat
[2024-05-28 19:56:08] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 26 ms returned unsat
[2024-05-28 19:56:08] [INFO ] [Real]Absence check using 175 positive place invariants in 51 ms returned sat
[2024-05-28 19:56:08] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 12 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 4, 1, 3, 1, 4, 4, 1, 3, 1, 1] Max Struct:[1, 1, 4, 1, 10, 1, 4, 5, 1, 10, 1, 1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 4, 3] Max Struct:[10, 5, 10]
Support contains 407 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 1184 transition count 1610
Reduce places removed 85 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 86 rules applied. Total rules applied 176 place count 1099 transition count 1609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 177 place count 1098 transition count 1525
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 345 place count 1014 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 346 place count 1013 transition count 1524
Iterating global reduction 3 with 1 rules applied. Total rules applied 347 place count 1013 transition count 1524
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 351 place count 1011 transition count 1522
Applied a total of 351 rules in 328 ms. Remains 1011 /1189 variables (removed 178) and now considering 1522/1695 (removed 173) transitions.
Running 1516 sub problems to find dead transitions.
[2024-05-28 19:56:09] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
// Phase 1: matrix 1518 rows 1011 cols
[2024-05-28 19:56:09] [INFO ] Computed 177 invariants in 54 ms
[2024-05-28 19:56:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 19:56:52] [INFO ] Deduced a trap composed of 220 places in 448 ms of which 7 ms to minimize.
[2024-05-28 19:56:52] [INFO ] Deduced a trap composed of 224 places in 442 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 174 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 2/2 constraints]
After SMT, in 45918ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 45965ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46337 ms. Remains : 1011/1189 places, 1522/1695 transitions.
[2024-05-28 19:56:55] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 19:56:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 4, 3] Max Struct:[10, 5, 10]
RANDOM walk for 1000000 steps (47166 resets) in 12379 ms. (80 steps per ms)
BEST_FIRST walk for 2765582 steps (7415 resets) in 9043 ms. (305 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 4, 3] Max Struct:[10, 5, 10]
[2024-05-28 19:57:16] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 19:57:16] [INFO ] Invariant cache hit.
[2024-05-28 19:57:16] [INFO ] [Real]Absence check using 170 positive place invariants in 42 ms returned sat
[2024-05-28 19:57:16] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-28 19:57:17] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2024-05-28 19:57:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:57:17] [INFO ] [Nat]Absence check using 170 positive place invariants in 28 ms returned sat
[2024-05-28 19:57:17] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-28 19:57:18] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2024-05-28 19:57:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:57:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 411 ms returned sat
[2024-05-28 19:57:18] [INFO ] Computed and/alt/rep : 777/2682/777 causal constraints (skipped 735 transitions) in 155 ms.
[2024-05-28 19:57:19] [INFO ] Added : 11 causal constraints over 3 iterations in 1257 ms. Result :sat
Minimization took 1700 ms.
[2024-05-28 19:57:21] [INFO ] [Real]Absence check using 170 positive place invariants in 41 ms returned sat
[2024-05-28 19:57:21] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-28 19:57:22] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2024-05-28 19:57:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:57:22] [INFO ] [Nat]Absence check using 170 positive place invariants in 42 ms returned sat
[2024-05-28 19:57:22] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-28 19:57:27] [INFO ] [Nat]Absence check using state equation in 5116 ms returned unsat
[2024-05-28 19:57:28] [INFO ] [Real]Absence check using 170 positive place invariants in 42 ms returned sat
[2024-05-28 19:57:28] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-28 19:57:28] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2024-05-28 19:57:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:57:28] [INFO ] [Nat]Absence check using 170 positive place invariants in 44 ms returned sat
[2024-05-28 19:57:28] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-28 19:57:29] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2024-05-28 19:57:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 34 ms returned sat
[2024-05-28 19:57:30] [INFO ] Deduced a trap composed of 248 places in 508 ms of which 7 ms to minimize.
[2024-05-28 19:57:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 674 ms
[2024-05-28 19:57:30] [INFO ] Computed and/alt/rep : 777/2682/777 causal constraints (skipped 735 transitions) in 116 ms.
[2024-05-28 19:57:31] [INFO ] Added : 11 causal constraints over 3 iterations in 856 ms. Result :sat
Minimization took 1744 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 4, 3] Max Struct:[10, 4, 10]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[10, 10]
Support contains 2 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 51 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1011/1011 places, 1522/1522 transitions.
[2024-05-28 19:57:32] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 19:57:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3] Max Struct:[10, 10]
RANDOM walk for 1000000 steps (47385 resets) in 6114 ms. (163 steps per ms)
BEST_FIRST walk for 2000002 steps (5372 resets) in 3084 ms. (648 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[10, 10]
[2024-05-28 19:57:42] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 19:57:42] [INFO ] Invariant cache hit.
[2024-05-28 19:57:42] [INFO ] [Real]Absence check using 170 positive place invariants in 33 ms returned sat
[2024-05-28 19:57:42] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-28 19:57:43] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2024-05-28 19:57:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:57:43] [INFO ] [Nat]Absence check using 170 positive place invariants in 48 ms returned sat
[2024-05-28 19:57:43] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-28 19:57:43] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2024-05-28 19:57:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:57:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 404 ms returned sat
[2024-05-28 19:57:44] [INFO ] Computed and/alt/rep : 777/2682/777 causal constraints (skipped 735 transitions) in 132 ms.
[2024-05-28 19:57:45] [INFO ] Added : 11 causal constraints over 3 iterations in 1024 ms. Result :sat
Minimization took 1558 ms.
[2024-05-28 19:57:47] [INFO ] [Real]Absence check using 170 positive place invariants in 40 ms returned sat
[2024-05-28 19:57:47] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-28 19:57:47] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2024-05-28 19:57:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:57:47] [INFO ] [Nat]Absence check using 170 positive place invariants in 46 ms returned sat
[2024-05-28 19:57:47] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-28 19:57:48] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2024-05-28 19:57:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2024-05-28 19:57:49] [INFO ] Deduced a trap composed of 248 places in 494 ms of which 5 ms to minimize.
[2024-05-28 19:57:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 633 ms
[2024-05-28 19:57:49] [INFO ] Computed and/alt/rep : 777/2682/777 causal constraints (skipped 735 transitions) in 104 ms.
[2024-05-28 19:57:50] [INFO ] Added : 11 causal constraints over 3 iterations in 695 ms. Result :sat
Minimization took 1304 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3] Max Struct:[10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[10, 10]
Support contains 2 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 60 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 58 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-28 19:57:51] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 19:57:51] [INFO ] Invariant cache hit.
[2024-05-28 19:57:53] [INFO ] Implicit Places using invariants in 1469 ms returned []
[2024-05-28 19:57:53] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 19:57:53] [INFO ] Invariant cache hit.
[2024-05-28 19:57:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:57:58] [INFO ] Implicit Places using invariants and state equation in 5904 ms returned []
Implicit Place search using SMT with State Equation took 7377 ms to find 0 implicit places.
[2024-05-28 19:57:59] [INFO ] Redundant transitions in 107 ms returned []
Running 1516 sub problems to find dead transitions.
[2024-05-28 19:57:59] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 19:57:59] [INFO ] Invariant cache hit.
[2024-05-28 19:57:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 19:58:38] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:58:53] [INFO ] Deduced a trap composed of 14 places in 350 ms of which 5 ms to minimize.
[2024-05-28 19:59:00] [INFO ] Deduced a trap composed of 236 places in 337 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1006 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 175 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 3/3 constraints]
After SMT, in 65076ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 65095ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72650 ms. Remains : 1011/1011 places, 1522/1522 transitions.
RANDOM walk for 40000 steps (1903 resets) in 1184 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (125 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
[2024-05-28 19:59:04] [INFO ] Flatten gal took : 307 ms
BEST_FIRST walk for 40004 steps (114 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (97 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (100 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
[2024-05-28 19:59:05] [INFO ] Flatten gal took : 238 ms
[2024-05-28 19:59:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15426844544842537865.gal : 57 ms
[2024-05-28 19:59:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8041210884995530861.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15426844544842537865.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8041210884995530861.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8041210884995530861.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :8 after 32
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :32 after 1.26358e+06
Interrupted probabilistic random walk after 167892 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 4
Probabilistic random walk after 167892 steps, saw 50879 distinct states, run finished after 3004 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-28 19:59:07] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 19:59:07] [INFO ] Invariant cache hit.
[2024-05-28 19:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 171/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 742/915 variables, 86/87 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/87 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/997 variables, 82/169 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/1008 variables, 6/175 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/175 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/1010 variables, 2/177 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1.26358e+06 after 4.68315e+06
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 0/1188 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/2529 variables, 1/1189 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2529/2529 variables, and 1189 constraints, problems are : Problem set: 2 solved, 2 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 170/170 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 171/173 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 742/915 variables, 86/87 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/87 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/997 variables, 82/169 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/1008 variables, 6/175 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/175 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/1010 variables, 2/177 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 1/1189 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 19:59:10] [INFO ] Deduced a trap composed of 233 places in 398 ms of which 5 ms to minimize.
[2024-05-28 19:59:10] [INFO ] Deduced a trap composed of 233 places in 383 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2528 variables, 2/1191 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :4.68315e+06 after 9.42563e+06
At refinement iteration 15 (INCLUDED_ONLY) 0/2528 variables, 0/1191 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2529 variables, 1/1192 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2529 variables, 1/1193 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2529 variables, 0/1193 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2529 variables, 0/1193 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2529/2529 variables, and 1193 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3286 ms.
Refiners :[Positive P Invariants (semi-flows): 170/170 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 4157ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 2 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 59 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Running 1516 sub problems to find dead transitions.
[2024-05-28 19:59:12] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 19:59:12] [INFO ] Invariant cache hit.
[2024-05-28 19:59:12] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :9.42563e+06 after 1.50965e+07
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.50965e+07 after 2.09532e+07
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2.09532e+07 after 2.64997e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 19:59:40] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 3 ms to minimize.
[2024-05-28 19:59:52] [INFO ] Deduced a trap composed of 14 places in 314 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 19:59:55] [INFO ] Flatten gal took : 169 ms
[2024-05-28 19:59:55] [INFO ] Applying decomposition
[2024-05-28 19:59:55] [INFO ] Flatten gal took : 165 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14581196648495602089.txt' '-o' '/tmp/graph14581196648495602089.bin' '-w' '/tmp/graph14581196648495602089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14581196648495602089.bin' '-l' '-1' '-v' '-w' '/tmp/graph14581196648495602089.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:59:56] [INFO ] Decomposing Gal with order
[2024-05-28 19:59:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:59:56] [INFO ] Removed a total of 1681 redundant transitions.
[2024-05-28 19:59:56] [INFO ] Flatten gal took : 336 ms
[2024-05-28 19:59:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 38 ms.
[2024-05-28 19:59:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14093636692674919612.gal : 23 ms
[2024-05-28 19:59:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16833771536562897303.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14093636692674919612.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16833771536562897303.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 174 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 2/2 constraints]
After SMT, in 44706ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 44726ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44794 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Loading property file /tmp/ReachabilityCardinality16833771536562897303.prop.
RANDOM walk for 40000 steps (1882 resets) in 507 ms. (78 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (102 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (110 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 66
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :66 after 68
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :68 after 83
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :83 after 115
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :115 after 183
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :183 after 273
Interrupted probabilistic random walk after 255499 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 255499 steps, saw 78199 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2024-05-28 20:00:00] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:00:00] [INFO ] Invariant cache hit.
[2024-05-28 20:00:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 171/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 742/915 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/997 variables, 82/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/1008 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/1010 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/2529 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2529/2529 variables, and 1189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 990 ms.
Refiners :[Positive P Invariants (semi-flows): 170/170 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 171/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 742/915 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 82/997 variables, 82/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/1008 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/1010 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 20:00:02] [INFO ] Deduced a trap composed of 233 places in 365 ms of which 6 ms to minimize.
[2024-05-28 20:00:03] [INFO ] Deduced a trap composed of 233 places in 348 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2528 variables, 2/1191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2528 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/2529 variables, 1/1192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2529 variables, 1/1193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2529 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2529 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2529/2529 variables, and 1193 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4353 ms.
Refiners :[Positive P Invariants (semi-flows): 170/170 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 5383ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 117 ms.
Support contains 2 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 46 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 45 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-28 20:00:05] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:00:05] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :273 after 8.35555e+07
[2024-05-28 20:00:07] [INFO ] Implicit Places using invariants in 1225 ms returned []
[2024-05-28 20:00:07] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:00:07] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8.35555e+07 after 8.35562e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :8.35562e+07 after 8.35563e+07
[2024-05-28 20:00:07] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :8.35563e+07 after 8.35564e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8.35564e+07 after 8.35566e+07
[2024-05-28 20:00:12] [INFO ] Implicit Places using invariants and state equation in 5934 ms returned []
Implicit Place search using SMT with State Equation took 7168 ms to find 0 implicit places.
[2024-05-28 20:00:13] [INFO ] Redundant transitions in 121 ms returned []
Running 1516 sub problems to find dead transitions.
[2024-05-28 20:00:13] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:00:13] [INFO ] Invariant cache hit.
[2024-05-28 20:00:13] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8.35566e+07 after 8.35578e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 20:00:52] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:01:06] [INFO ] Deduced a trap composed of 14 places in 476 ms of which 8 ms to minimize.
[2024-05-28 20:01:13] [INFO ] Deduced a trap composed of 236 places in 471 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1006 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 175 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 3/3 constraints]
After SMT, in 64905ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 64924ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72270 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 3] Max Struct:[10, 10]
Starting property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2024-05-28 20:01:18] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:01:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (469 resets) in 65 ms. (151 steps per ms)
BEST_FIRST walk for 10001 steps (26 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 20:01:18] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:01:18] [INFO ] Invariant cache hit.
[2024-05-28 20:01:18] [INFO ] [Real]Absence check using 170 positive place invariants in 39 ms returned sat
[2024-05-28 20:01:18] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-28 20:01:18] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2024-05-28 20:01:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:01:19] [INFO ] [Nat]Absence check using 170 positive place invariants in 50 ms returned sat
[2024-05-28 20:01:19] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-28 20:01:19] [INFO ] [Nat]Absence check using state equation in 612 ms returned sat
[2024-05-28 20:01:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:01:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 268 ms returned sat
[2024-05-28 20:01:20] [INFO ] Computed and/alt/rep : 777/2682/777 causal constraints (skipped 735 transitions) in 126 ms.
[2024-05-28 20:01:21] [INFO ] Added : 11 causal constraints over 3 iterations in 1129 ms. Result :sat
Minimization took 755 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 75 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Running 1516 sub problems to find dead transitions.
[2024-05-28 20:01:22] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:01:22] [INFO ] Invariant cache hit.
[2024-05-28 20:01:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 20:01:50] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 3 ms to minimize.
[2024-05-28 20:02:04] [INFO ] Deduced a trap composed of 14 places in 442 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 174 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 2/2 constraints]
After SMT, in 44819ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 44841ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44922 ms. Remains : 1011/1011 places, 1522/1522 transitions.
[2024-05-28 20:02:06] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:02:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (47141 resets) in 5984 ms. (167 steps per ms)
BEST_FIRST walk for 1000001 steps (2663 resets) in 1567 ms. (637 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 20:02:14] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:02:14] [INFO ] Invariant cache hit.
[2024-05-28 20:02:14] [INFO ] [Real]Absence check using 170 positive place invariants in 38 ms returned sat
[2024-05-28 20:02:14] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-28 20:02:15] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2024-05-28 20:02:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:02:15] [INFO ] [Nat]Absence check using 170 positive place invariants in 41 ms returned sat
[2024-05-28 20:02:15] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-28 20:02:16] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2024-05-28 20:02:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:02:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 270 ms returned sat
[2024-05-28 20:02:16] [INFO ] Computed and/alt/rep : 777/2682/777 causal constraints (skipped 735 transitions) in 106 ms.
[2024-05-28 20:02:17] [INFO ] Added : 11 causal constraints over 3 iterations in 888 ms. Result :sat
Minimization took 1906 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 48 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 43 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-28 20:02:19] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:02:19] [INFO ] Invariant cache hit.
[2024-05-28 20:02:20] [INFO ] Implicit Places using invariants in 1249 ms returned []
[2024-05-28 20:02:20] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:02:20] [INFO ] Invariant cache hit.
[2024-05-28 20:02:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:02:27] [INFO ] Implicit Places using invariants and state equation in 6236 ms returned []
Implicit Place search using SMT with State Equation took 7494 ms to find 0 implicit places.
[2024-05-28 20:02:27] [INFO ] Redundant transitions in 39 ms returned []
Running 1516 sub problems to find dead transitions.
[2024-05-28 20:02:27] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:02:27] [INFO ] Invariant cache hit.
[2024-05-28 20:02:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 20:03:06] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 3 ms to minimize.
[2024-05-28 20:03:20] [INFO ] Deduced a trap composed of 14 places in 470 ms of which 7 ms to minimize.
[2024-05-28 20:03:27] [INFO ] Deduced a trap composed of 236 places in 436 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1006 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 175 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 3/3 constraints]
After SMT, in 64967ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 64991ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72581 ms. Remains : 1011/1011 places, 1522/1522 transitions.
[2024-05-28 20:03:32] [INFO ] Flatten gal took : 112 ms
[2024-05-28 20:03:32] [INFO ] Flatten gal took : 78 ms
[2024-05-28 20:03:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15935587649570647160.gal : 13 ms
[2024-05-28 20:03:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14899078912874733163.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15935587649570647160.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14899078912874733163.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (1929 resets) in 663 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (97 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (122 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality14899078912874733163.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 1.26358e+06
Interrupted probabilistic random walk after 252484 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 2
Probabilistic random walk after 252484 steps, saw 77256 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-28 20:03:35] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:03:35] [INFO ] Invariant cache hit.
[2024-05-28 20:03:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 172/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 742/915 variables, 86/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/997 variables, 82/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1008 variables, 6/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/1010 variables, 2/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1.26358e+06 after 4.68315e+06
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 0/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2529 variables, 1/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2529/2529 variables, and 1189 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1151 ms.
Refiners :[Positive P Invariants (semi-flows): 170/170 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 172/173 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 742/915 variables, 86/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/997 variables, 82/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1008 variables, 6/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1010 variables, 2/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 20:03:38] [INFO ] Deduced a trap composed of 177 places in 540 ms of which 7 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :4.68315e+06 after 9.42563e+06
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 1/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2528 variables, 0/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2529 variables, 1/1190 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2529 variables, 1/1191 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2529 variables, 0/1191 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2529 variables, 0/1191 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2529/2529 variables, and 1191 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2127 ms.
Refiners :[Positive P Invariants (semi-flows): 170/170 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 3288ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 48 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Running 1516 sub problems to find dead transitions.
[2024-05-28 20:03:38] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:03:38] [INFO ] Invariant cache hit.
[2024-05-28 20:03:38] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9.42563e+06 after 1.50965e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.50965e+07 after 2.09532e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.09532e+07 after 2.64997e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 20:04:07] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 4 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 20:04:22] [INFO ] Flatten gal took : 55 ms
[2024-05-28 20:04:22] [INFO ] Applying decomposition
[2024-05-28 20:04:22] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11206179185415831508.txt' '-o' '/tmp/graph11206179185415831508.bin' '-w' '/tmp/graph11206179185415831508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11206179185415831508.bin' '-l' '-1' '-v' '-w' '/tmp/graph11206179185415831508.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:04:22] [INFO ] Decomposing Gal with order
[2024-05-28 20:04:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:04:22] [INFO ] Removed a total of 1681 redundant transitions.
[2024-05-28 20:04:22] [INFO ] Flatten gal took : 161 ms
[2024-05-28 20:04:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 214 labels/synchronizations in 33 ms.
[2024-05-28 20:04:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2951963189193587310.gal : 13 ms
[2024-05-28 20:04:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12096483141656689744.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2951963189193587310.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12096483141656689744.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2024-05-28 20:04:22] [INFO ] Deduced a trap composed of 14 places in 542 ms of which 6 ms to minimize.
Loading property file /tmp/ReachabilityCardinality12096483141656689744.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 67
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :67 after 1295
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1295 after 41897
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :41897 after 1.38654e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.38654e+06 after 3.99596e+06
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 174 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 2/2 constraints]
After SMT, in 44963ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 44988ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45040 ms. Remains : 1011/1011 places, 1522/1522 transitions.
RANDOM walk for 40000 steps (1864 resets) in 417 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (109 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 269436 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 1
Probabilistic random walk after 269436 steps, saw 82592 distinct states, run finished after 3002 ms. (steps per millisecond=89 ) properties seen :0
[2024-05-28 20:04:26] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:04:26] [INFO ] Invariant cache hit.
[2024-05-28 20:04:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 172/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 742/915 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/997 variables, 82/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1008 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1010 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2529 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2529/2529 variables, and 1189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 170/170 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 172/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 742/915 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/997 variables, 82/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1008 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1010 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:04:29] [INFO ] Deduced a trap composed of 177 places in 498 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2528 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/2529 variables, 1/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2529 variables, 1/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2529 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2529 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2529/2529 variables, and 1191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1851 ms.
Refiners :[Positive P Invariants (semi-flows): 170/170 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2820ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 69 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 55 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-28 20:04:29] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:04:29] [INFO ] Invariant cache hit.
[2024-05-28 20:04:31] [INFO ] Implicit Places using invariants in 1364 ms returned []
[2024-05-28 20:04:31] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:04:31] [INFO ] Invariant cache hit.
[2024-05-28 20:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:04:37] [INFO ] Implicit Places using invariants and state equation in 6320 ms returned []
Implicit Place search using SMT with State Equation took 7689 ms to find 0 implicit places.
[2024-05-28 20:04:37] [INFO ] Redundant transitions in 37 ms returned []
Running 1516 sub problems to find dead transitions.
[2024-05-28 20:04:37] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:04:37] [INFO ] Invariant cache hit.
[2024-05-28 20:04:37] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.99596e+06 after 4.38603e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.38603e+08 after 4.38742e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.38742e+08 after 4.39019e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.39019e+08 after 4.39434e+08
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.39434e+08 after 4.40403e+08
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 20:05:17] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 3 ms to minimize.
[2024-05-28 20:05:30] [INFO ] Deduced a trap composed of 14 places in 463 ms of which 6 ms to minimize.
[2024-05-28 20:05:36] [INFO ] Deduced a trap composed of 236 places in 485 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1006 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 175 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 3/3 constraints]
After SMT, in 65525ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 65547ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73347 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Ending property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-05 in 265170 ms.
Starting property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2024-05-28 20:05:43] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:05:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (467 resets) in 69 ms. (142 steps per ms)
BEST_FIRST walk for 10001 steps (34 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 20:05:43] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:05:43] [INFO ] Invariant cache hit.
[2024-05-28 20:05:43] [INFO ] [Real]Absence check using 170 positive place invariants in 39 ms returned sat
[2024-05-28 20:05:43] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-28 20:05:43] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2024-05-28 20:05:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:05:44] [INFO ] [Nat]Absence check using 170 positive place invariants in 41 ms returned sat
[2024-05-28 20:05:44] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-28 20:05:44] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2024-05-28 20:05:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:05:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 34 ms returned sat
[2024-05-28 20:05:45] [INFO ] Deduced a trap composed of 248 places in 558 ms of which 7 ms to minimize.
[2024-05-28 20:05:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 687 ms
[2024-05-28 20:05:45] [INFO ] Computed and/alt/rep : 777/2682/777 causal constraints (skipped 735 transitions) in 130 ms.
[2024-05-28 20:05:46] [INFO ] Added : 11 causal constraints over 3 iterations in 984 ms. Result :sat
Minimization took 804 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 45 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Running 1516 sub problems to find dead transitions.
[2024-05-28 20:05:47] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:05:47] [INFO ] Invariant cache hit.
[2024-05-28 20:05:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 20:06:17] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 3 ms to minimize.
[2024-05-28 20:06:33] [INFO ] Deduced a trap composed of 14 places in 522 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 1)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 4)
(s500 4)
(s501 4)
(s502 4)
(s503 4)
(s504 9)
(s505 0)
(s506 1)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 1)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 1)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 174 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 2/2 constraints]
After SMT, in 45928ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 45948ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45997 ms. Remains : 1011/1011 places, 1522/1522 transitions.
[2024-05-28 20:06:33] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:06:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (47373 resets) in 6533 ms. (153 steps per ms)
BEST_FIRST walk for 1000001 steps (2652 resets) in 1635 ms. (611 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 20:06:41] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:06:41] [INFO ] Invariant cache hit.
[2024-05-28 20:06:41] [INFO ] [Real]Absence check using 170 positive place invariants in 39 ms returned sat
[2024-05-28 20:06:41] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-28 20:06:42] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2024-05-28 20:06:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:06:42] [INFO ] [Nat]Absence check using 170 positive place invariants in 31 ms returned sat
[2024-05-28 20:06:42] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-28 20:06:43] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2024-05-28 20:06:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:06:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 42 ms returned sat
[2024-05-28 20:06:43] [INFO ] Deduced a trap composed of 248 places in 494 ms of which 6 ms to minimize.
[2024-05-28 20:06:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 617 ms
[2024-05-28 20:06:43] [INFO ] Computed and/alt/rep : 777/2682/777 causal constraints (skipped 735 transitions) in 135 ms.
[2024-05-28 20:06:44] [INFO ] Added : 11 causal constraints over 3 iterations in 1008 ms. Result :sat
Minimization took 1747 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 53 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 46 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-28 20:06:46] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:06:46] [INFO ] Invariant cache hit.
[2024-05-28 20:06:48] [INFO ] Implicit Places using invariants in 1523 ms returned []
[2024-05-28 20:06:48] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:06:48] [INFO ] Invariant cache hit.
[2024-05-28 20:06:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:06:54] [INFO ] Implicit Places using invariants and state equation in 6038 ms returned []
Implicit Place search using SMT with State Equation took 7563 ms to find 0 implicit places.
[2024-05-28 20:06:54] [INFO ] Redundant transitions in 28 ms returned []
Running 1516 sub problems to find dead transitions.
[2024-05-28 20:06:54] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:06:54] [INFO ] Invariant cache hit.
[2024-05-28 20:06:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 20:07:33] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 4 ms to minimize.
[2024-05-28 20:07:48] [INFO ] Deduced a trap composed of 14 places in 452 ms of which 7 ms to minimize.
[2024-05-28 20:07:55] [INFO ] Deduced a trap composed of 236 places in 449 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1006 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 175 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 3/3 constraints]
After SMT, in 66086ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 66109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73761 ms. Remains : 1011/1011 places, 1522/1522 transitions.
[2024-05-28 20:08:00] [INFO ] Flatten gal took : 67 ms
[2024-05-28 20:08:00] [INFO ] Flatten gal took : 59 ms
[2024-05-28 20:08:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality74975866892231433.gal : 9 ms
[2024-05-28 20:08:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18038416564538983295.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality74975866892231433.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18038416564538983295.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
RANDOM walk for 40000 steps (1869 resets) in 540 ms. (73 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (114 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (103 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality18038416564538983295.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 1.26358e+06
Interrupted probabilistic random walk after 221847 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 2
Probabilistic random walk after 221847 steps, saw 67705 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2024-05-28 20:08:03] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:08:03] [INFO ] Invariant cache hit.
[2024-05-28 20:08:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 172/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 742/915 variables, 86/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/997 variables, 82/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1008 variables, 6/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/1010 variables, 2/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1.26358e+06 after 4.68315e+06
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 0/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2529 variables, 1/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2529/2529 variables, and 1189 constraints, problems are : Problem set: 1 solved, 1 unsolved in 904 ms.
Refiners :[Positive P Invariants (semi-flows): 170/170 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 172/173 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 742/915 variables, 86/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/997 variables, 82/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1008 variables, 6/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1010 variables, 2/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 1/1189 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :4.68315e+06 after 9.42563e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2528/2529 variables, and 1189 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1945 ms.
Refiners :[Positive P Invariants (semi-flows): 170/170 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1010/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2875ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 61 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Running 1516 sub problems to find dead transitions.
[2024-05-28 20:08:06] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:08:06] [INFO ] Invariant cache hit.
[2024-05-28 20:08:06] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9.42563e+06 after 1.50965e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.50965e+07 after 2.09532e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.09532e+07 after 2.64997e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 20:08:36] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:08:50] [INFO ] Deduced a trap composed of 14 places in 360 ms of which 5 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 20:08:50] [INFO ] Flatten gal took : 57 ms
[2024-05-28 20:08:50] [INFO ] Applying decomposition
[2024-05-28 20:08:50] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10169253946160057269.txt' '-o' '/tmp/graph10169253946160057269.bin' '-w' '/tmp/graph10169253946160057269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10169253946160057269.bin' '-l' '-1' '-v' '-w' '/tmp/graph10169253946160057269.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:08:50] [INFO ] Decomposing Gal with order
[2024-05-28 20:08:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:08:51] [INFO ] Removed a total of 2200 redundant transitions.
[2024-05-28 20:08:51] [INFO ] Flatten gal took : 171 ms
[2024-05-28 20:08:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 42 ms.
[2024-05-28 20:08:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4728558396253619784.gal : 17 ms
[2024-05-28 20:08:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9069411667965788006.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4728558396253619784.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9069411667965788006.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality9069411667965788006.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1.39092e+07
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 174 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 2/2 constraints]
After SMT, in 46298ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 46319ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46384 ms. Remains : 1011/1011 places, 1522/1522 transitions.
RANDOM walk for 40000 steps (1856 resets) in 391 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (102 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1.39092e+07 after 1.39092e+07
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1.39092e+07 after 1.39092e+07
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.39092e+07 after 1.39092e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.39092e+07 after 1.39092e+07
Interrupted probabilistic random walk after 278402 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 278402 steps, saw 85358 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2024-05-28 20:08:56] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:08:56] [INFO ] Invariant cache hit.
[2024-05-28 20:08:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 172/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 742/915 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/997 variables, 82/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1008 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1010 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.39092e+07 after 1.39092e+07
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/2529 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/2529 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2529/2529 variables, and 1189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 976 ms.
Refiners :[Positive P Invariants (semi-flows): 170/170 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 172/173 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 742/915 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 82/997 variables, 82/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/997 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1008 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1008 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1010 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.39092e+07 after 1.39092e+07
At refinement iteration 11 (OVERLAPS) 1518/2528 variables, 1010/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2528 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2528 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.39092e+07 after 1.39092e+07
At refinement iteration 14 (INCLUDED_ONLY) 0/2528 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.39092e+07 after 1.39092e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.39092e+07 after 3.01936e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.01936e+07 after 3.01937e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3.01937e+07 after 3.66573e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.66573e+07 after 3.66584e+07
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2529/2529 variables, and 1190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11109 ms.
Refiners :[Positive P Invariants (semi-flows): 170/170 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1011/1011 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 12117ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 76 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1522/1522 transitions.
Applied a total of 0 rules in 53 ms. Remains 1011 /1011 variables (removed 0) and now considering 1522/1522 (removed 0) transitions.
[2024-05-28 20:09:08] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:09:08] [INFO ] Invariant cache hit.
[2024-05-28 20:09:09] [INFO ] Implicit Places using invariants in 1289 ms returned []
[2024-05-28 20:09:09] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:09:09] [INFO ] Invariant cache hit.
[2024-05-28 20:09:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:09:15] [INFO ] Implicit Places using invariants and state equation in 6062 ms returned []
Implicit Place search using SMT with State Equation took 7354 ms to find 0 implicit places.
[2024-05-28 20:09:15] [INFO ] Redundant transitions in 39 ms returned []
Running 1516 sub problems to find dead transitions.
[2024-05-28 20:09:15] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
[2024-05-28 20:09:15] [INFO ] Invariant cache hit.
[2024-05-28 20:09:15] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.66584e+07 after 6.77902e+07
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :6.77902e+07 after 6.78033e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1006/2529 variables, and 172 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1516/1516 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1516 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1006 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1006 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
[2024-05-28 20:09:55] [INFO ] Deduced a trap composed of 13 places in 278 ms of which 3 ms to minimize.
[2024-05-28 20:10:11] [INFO ] Deduced a trap composed of 14 places in 485 ms of which 5 ms to minimize.
[2024-05-28 20:10:18] [INFO ] Deduced a trap composed of 236 places in 462 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1006 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/2529 variables, and 175 constraints, problems are : Problem set: 0 solved, 1516 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 166/170 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/1011 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1516 constraints, Known Traps: 3/3 constraints]
After SMT, in 65410ms problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 65434ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72890 ms. Remains : 1011/1011 places, 1522/1522 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Ending property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-12 in 278027 ms.
[2024-05-28 20:10:21] [INFO ] Flatten gal took : 57 ms
[2024-05-28 20:10:21] [INFO ] Applying decomposition
[2024-05-28 20:10:21] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14796673578457094834.txt' '-o' '/tmp/graph14796673578457094834.bin' '-w' '/tmp/graph14796673578457094834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14796673578457094834.bin' '-l' '-1' '-v' '-w' '/tmp/graph14796673578457094834.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:10:21] [INFO ] Decomposing Gal with order
[2024-05-28 20:10:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:10:21] [INFO ] Removed a total of 1441 redundant transitions.
[2024-05-28 20:10:21] [INFO ] Flatten gal took : 282 ms
[2024-05-28 20:10:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 648 labels/synchronizations in 42 ms.
[2024-05-28 20:10:21] [INFO ] Time to serialize gal into /tmp/UpperBounds1430712711210575262.gal : 19 ms
[2024-05-28 20:10:21] [INFO ] Time to serialize properties into /tmp/UpperBounds6393881326374752246.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1430712711210575262.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6393881326374752246.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds6393881326374752246.prop.
ITS-tools command line returned an error code 137
[2024-05-28 20:20:57] [INFO ] Applying decomposition
[2024-05-28 20:20:57] [INFO ] Flatten gal took : 72 ms
[2024-05-28 20:20:57] [INFO ] Decomposing Gal with order
[2024-05-28 20:20:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:20:57] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to block in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[CreatedJobs_30],[CreatedJobs_31],[CreatedJobs_32],[CreatedJobs_33],[CreatedJobs_34],[CreatedJobs_35],[CreatedJobs_36],[CreatedJobs_37],[CreatedJobs_38],[CreatedJobs_39],[CreatedJobs_40],[CreatedJobs_41],[CreatedJobs_42],[CreatedJobs_43],[CreatedJobs_44],[CreatedJobs_45],[CreatedJobs_46],[CreatedJobs_47],[CreatedJobs_48],[CreatedJobs_49],[CreatedJobs_50],[CreatedJobs_51],[CreatedJobs_52],[CreatedJobs_53],[CreatedJobs_54],[CreatedJobs_55],[CreatedJobs_56],[CreatedJobs_57],[CreatedJobs_58],[CreatedJobs_59],[CreatedJobs_60],[CreatedJobs_61],[CreatedJobs_62],[CreatedJobs_63],[CreatedJobs_64],[CreatedJobs_65],[CreatedJobs_66],[CreatedJobs_67],[CreatedJobs_68],[CreatedJobs_69],[CreatedJobs_70],[CreatedJobs_71],[CreatedJobs_72],[CreatedJobs_73],[CreatedJobs_74],[CreatedJobs_75],[CreatedJobs_76],[CreatedJobs_77],[CreatedJobs_78],[CreatedJobs_79],[CreatedJobs_80],[CreatedJobs_81],[CreatedJobs_82],[CreatedJobs_83],[CreatedJobs_84],[CreatedJobs_85],[CreatedJobs_86],[CreatedJobs_87],[CreatedJobs_88],[CreatedJobs_89],[CreatedJobs_90],[CreatedJobs_91],[CreatedJobs_92],[CreatedJobs_93],[CreatedJobs_94],[CreatedJobs_95],[CreatedJobs_96],[CreatedJobs_97],[CreatedJobs_98],[CreatedJobs_99],[CreatedJobs_100],[CreatedJobs_101],[CreatedJobs_102],[CreatedJobs_103],[CreatedJobs_104],[CreatedJobs_105],[CreatedJobs_106],[CreatedJobs_107],[CreatedJobs_108],[CreatedJobs_109],[CreatedJobs_110],[CreatedJobs_111],[CreatedJobs_112],[CreatedJobs_113],[CreatedJobs_114],[CreatedJobs_115],[CreatedJobs_116],[CreatedJobs_117],[CreatedJobs_118],[CreatedJobs_119],[CreatedJobs_120],[CreatedJobs_121],[CreatedJobs_122],[CreatedJobs_123],[CreatedJobs_124],[CreatedJobs_125],[CreatedJobs_126],[CreatedJobs_127],[CreatedJobs_128],[CreatedJobs_129],[CreatedJobs_130],[CreatedJobs_131],[CreatedJobs_132],[CreatedJobs_133],[CreatedJobs_134],[CreatedJobs_135],[CreatedJobs_136],[CreatedJobs_137],[CreatedJobs_138],[CreatedJobs_139],[CreatedJobs_140],[CreatedJobs_141],[CreatedJobs_142],[CreatedJobs_143],[CreatedJobs_144],[CreatedJobs_145],[CreatedJobs_146],[CreatedJobs_147],[CreatedJobs_148],[CreatedJobs_149],[CreatedJobs_150],[CreatedJobs_151],[CreatedJobs_152],[CreatedJobs_153],[CreatedJobs_154],[CreatedJobs_155],[CreatedJobs_156],[CreatedJobs_157],[CreatedJobs_158],[CreatedJobs_159],[CreatedJobs_160],[CreatedJobs_161],[CreatedJobs_162],[CreatedJobs_163],[CreatedJobs_164],[CreatedJobs_165],[CreatedJobs_166],[CreatedJobs_167],[CreatedJobs_168],[CreatedJobs_169],[CreatedJobs_170],[CreatedJobs_171],[CreatedJobs_172],[CreatedJobs_173],[CreatedJobs_174],[CreatedJobs_175],[CreatedJobs_176],[CreatedJobs_177],[CreatedJobs_178],[CreatedJobs_179],[CreatedJobs_180],[CreatedJobs_181],[CreatedJobs_182],[CreatedJobs_183],[CreatedJobs_184],[CreatedJobs_185],[CreatedJobs_186],[CreatedJobs_187],[CreatedJobs_188],[CreatedJobs_189],[CreatedJobs_190],[CreatedJobs_191],[CreatedJobs_192],[CreatedJobs_193],[CreatedJobs_194],[CreatedJobs_195],[CreatedJobs_196],[CreatedJobs_197],[CreatedJobs_198],[CreatedJobs_199],[CreatedJobs_200],[CreatedJobs_201],[CreatedJobs_202],[CreatedJobs_203],[CreatedJobs_204],[CreatedJobs_205],[CreatedJobs_206],[CreatedJobs_207],[CreatedJobs_208],[CreatedJobs_209],[CreatedJobs_210],[CreatedJobs_211],[CreatedJobs_212],[CreatedJobs_213],[CreatedJobs_214],[CreatedJobs_215],[CreatedJobs_216],[CreatedJobs_217],[CreatedJobs_218],[CreatedJobs_219],[CreatedJobs_220],[CreatedJobs_221],[CreatedJobs_222],[CreatedJobs_223],[CreatedJobs_224],[CreatedJobs_225],[CreatedJobs_226],[CreatedJobs_227],[CreatedJobs_228],[CreatedJobs_229],[CreatedJobs_230],[CreatedJobs_231],[CreatedJobs_232],[CreatedJobs_233],[CreatedJobs_234],[CreatedJobs_235],[CreatedJobs_236],[CreatedJobs_237],[CreatedJobs_238],[CreatedJobs_239],[CreatedJobs_240],[CreatedJobs_241],[CreatedJobs_242],[CreatedJobs_243],[CreatedJobs_244],[CreatedJobs_245],[CreatedJobs_246],[CreatedJobs_247],[CreatedJobs_248],[CreatedJobs_249],[CreatedJobs_250],[CreatedJobs_251],[CreatedJobs_252],[CreatedJobs_253],[CreatedJobs_254],[CreatedJobs_255],[CreatedJobs_256],[CreatedJobs_257],[CreatedJobs_258],[CreatedJobs_259],[CreatedJobs_260],[CreatedJobs_261],[CreatedJobs_262],[CreatedJobs_263],[CreatedJobs_264],[CreatedJobs_265],[CreatedJobs_266],[CreatedJobs_267],[CreatedJobs_268],[CreatedJobs_269],[CreatedJobs_270],[CreatedJobs_271],[CreatedJobs_272],[CreatedJobs_273],[CreatedJobs_274],[CreatedJobs_275],[CreatedJobs_276],[CreatedJobs_277],[CreatedJobs_278],[CreatedJobs_279],[CreatedJobs_280],[CreatedJobs_281],[CreatedJobs_282],[CreatedJobs_283],[CreatedJobs_284],[CreatedJobs_285],[CreatedJobs_286],[CreatedJobs_287],[CreatedJobs_288],[CreatedJobs_289],[CreatedJobs_290],[CreatedJobs_291],[CreatedJobs_292],[CreatedJobs_293],[CreatedJobs_294],[CreatedJobs_295],[CreatedJobs_296],[CreatedJobs_297],[CreatedJobs_298],[CreatedJobs_299],[CreatedJobs_300],[CreatedJobs_301],[CreatedJobs_302],[CreatedJobs_303],[CreatedJobs_304],[CreatedJobs_305],[CreatedJobs_306],[CreatedJobs_307],[CreatedJobs_308],[CreatedJobs_309],[CreatedJobs_310],[CreatedJobs_311],[CreatedJobs_312],[CreatedJobs_313],[CreatedJobs_314],[CreatedJobs_315],[CreatedJobs_316],[CreatedJobs_317],[CreatedJobs_318],[CreatedJobs_319],[CreatedJobs_320],[CreatedJobs_321],[CreatedJobs_322],[CreatedJobs_323],[CreatedJobs_324],[CreatedJobs_325],[CreatedJobs_326],[CreatedJobs_327],[CreatedJobs_328],[CreatedJobs_329],[CreatedJobs_330],[CreatedJobs_331],[CreatedJobs_332],[CreatedJobs_333],[CreatedJobs_334],[CreatedJobs_335],[CreatedJobs_336],[CreatedJobs_337],[CreatedJobs_338],[CreatedJobs_339],[CreatedJobs_340],[CreatedJobs_341],[CreatedJobs_342],[CreatedJobs_343],[CreatedJobs_344],[CreatedJobs_345],[CreatedJobs_346],[CreatedJobs_347],[CreatedJobs_348],[CreatedJobs_349],[CreatedJobs_350],[CreatedJobs_351],[CreatedJobs_352],[CreatedJobs_353],[CreatedJobs_354],[CreatedJobs_355],[CreatedJobs_356],[CreatedJobs_357],[CreatedJobs_358],[CreatedJobs_359],[CreatedJobs_360],[CreatedJobs_361],[CreatedJobs_362],[CreatedJobs_363],[CreatedJobs_364],[CreatedJobs_365],[CreatedJobs_366],[CreatedJobs_367],[CreatedJobs_368],[CreatedJobs_369],[CreatedJobs_370],[CreatedJobs_371],[CreatedJobs_372],[CreatedJobs_373],[CreatedJobs_374],[CreatedJobs_375],[CreatedJobs_376],[CreatedJobs_377],[CreatedJobs_378],[CreatedJobs_379],[CreatedJobs_380],[CreatedJobs_381],[CreatedJobs_382],[CreatedJobs_383],[CreatedJobs_384],[CreatedJobs_385],[CreatedJobs_386],[CreatedJobs_387],[CreatedJobs_388],[CreatedJobs_389],[CreatedJobs_390],[CreatedJobs_391],[CreatedJobs_392],[CreatedJobs_393],[CreatedJobs_394],[CreatedJobs_395],[CreatedJobs_396],[CreatedJobs_397],[CreatedJobs_398],[CreatedJobs_399],[CreatedJobs_400],[CreatedJobs_401],[CreatedJobs_402],[CreatedJobs_403],[CreatedJobs_404],[f3_0, f2_0, f1_0, AvailableJobId_0],[f3_1, f2_1, f1_1, AvailableJobId_1],[f3_2, f2_2, f1_2, AvailableJobId_2],[f3_3, f2_3, f1_3, AvailableJobId_3],[f3_4, f2_4, f1_4, AvailableJobId_4],[f3_5, f2_5, f1_5, AvailableJobId_5],[f3_6, f2_6, f1_6, AvailableJobId_6],[f3_7, f2_7, f1_7, AvailableJobId_7],[f3_8, f2_8, f1_8, AvailableJobId_8],[f3_9, f2_9, f1_9, AvailableJobId_9],[f3_10, f2_10, f1_10, AvailableJobId_10],[f3_11, f2_11, f1_11, AvailableJobId_11],[f3_12, f2_12, f1_12, AvailableJobId_12],[f3_13, f2_13, f1_13, AvailableJobId_13],[f3_14, f2_14, f1_14, AvailableJobId_14],[f3_15, f2_15, f1_15, AvailableJobId_15],[f3_16, f2_16, f1_16, AvailableJobId_16],[f3_17, f2_17, f1_17, AvailableJobId_17],[f3_18, f2_18, f1_18, AvailableJobId_18],[f3_19, f2_19, f1_19, AvailableJobId_19],[f3_20, f2_20, f1_20, AvailableJobId_20],[f3_21, f2_21, f1_21, AvailableJobId_21],[f3_22, f2_22, f1_22, AvailableJobId_22],[f3_23, f2_23, f1_23, AvailableJobId_23],[f3_24, f2_24, f1_24, AvailableJobId_24],[f3_25, f2_25, f1_25, AvailableJobId_25],[f3_26, f2_26, f1_26, AvailableJobId_26],[f3_27, f2_27, f1_27, AvailableJobId_27],[f3_28, f2_28, f1_28, AvailableJobId_28],[f3_29, f2_29, f1_29, AvailableJobId_29],[f3_30, f2_30, f1_30, AvailableJobId_30],[f3_31, f2_31, f1_31, AvailableJobId_31],[f3_32, f2_32, f1_32, AvailableJobId_32],[f3_33, f2_33, f1_33, AvailableJobId_33],[f3_34, f2_34, f1_34, AvailableJobId_34],[f3_35, f2_35, f1_35, AvailableJobId_35],[f3_36, f2_36, f1_36, AvailableJobId_36],[f3_37, f2_37, f1_37, AvailableJobId_37],[f3_38, f2_38, f1_38, AvailableJobId_38],[f3_39, f2_39, f1_39, AvailableJobId_39],[f3_40, f2_40, f1_40, AvailableJobId_40],[f3_41, f2_41, f1_41, AvailableJobId_41],[f3_42, f2_42, f1_42, AvailableJobId_42],[f3_43, f2_43, f1_43, AvailableJobId_43],[f3_44, f2_44, f1_44, AvailableJobId_44],[f3_45, f2_45, f1_45, AvailableJobId_45],[f3_46, f2_46, f1_46, AvailableJobId_46],[f3_47, f2_47, f1_47, AvailableJobId_47],[f3_48, f2_48, f1_48, AvailableJobId_48],[f3_49, f2_49, f1_49, AvailableJobId_49],[f3_50, f2_50, f1_50, AvailableJobId_50],[f3_51, f2_51, f1_51, AvailableJobId_51],[f3_52, f2_52, f1_52, AvailableJobId_52],[f3_53, f2_53, f1_53, AvailableJobId_53],[f3_54, f2_54, f1_54, AvailableJobId_54],[f3_55, f2_55, f1_55, AvailableJobId_55],[f3_56, f2_56, f1_56, AvailableJobId_56],[f3_57, f2_57, f1_57, AvailableJobId_57],[f3_58, f2_58, f1_58, AvailableJobId_58],[f3_59, f2_59, f1_59, AvailableJobId_59],[f3_60, f2_60, f1_60, AvailableJobId_60],[f3_61, f2_61, f1_61, AvailableJobId_61],[f3_62, f2_62, f1_62, AvailableJobId_62],[f3_63, f2_63, f1_63, AvailableJobId_63],[f3_64, f2_64, f1_64, AvailableJobId_64],[f3_65, f2_65, f1_65, AvailableJobId_65],[f3_66, f2_66, f1_66, AvailableJobId_66],[f3_67, f2_67, f1_67, AvailableJobId_67],[f3_68, f2_68, f1_68, AvailableJobId_68],[f3_69, f2_69, f1_69, AvailableJobId_69],[f3_70, f2_70, f1_70, AvailableJobId_70],[f3_71, f2_71, f1_71, AvailableJobId_71],[f3_72, f2_72, f1_72, AvailableJobId_72],[f3_73, f2_73, f1_73, AvailableJobId_73],[f3_74, f2_74, f1_74, AvailableJobId_74],[f3_75, f2_75, f1_75, AvailableJobId_75],[f3_76, f2_76, f1_76, AvailableJobId_76],[f3_77, f2_77, f1_77, AvailableJobId_77],[f3_78, f2_78, f1_78, AvailableJobId_78],[f3_79, f2_79, f1_79, AvailableJobId_79],[f3_80, f2_80, f1_80, AvailableJobId_80],[FetchJobE_0, QueueJobB_0, NotifyEventJobQueuedB_0],[FetchJobE_1, QueueJobB_1, NotifyEventJobQueuedB_1],[FetchJobE_2, QueueJobB_2, NotifyEventJobQueuedB_2],[FetchJobE_3, QueueJobB_3, NotifyEventJobQueuedB_3],[FetchJobE_4, QueueJobB_4, NotifyEventJobQueuedB_4],[FetchJobE_5, QueueJobB_5, NotifyEventJobQueuedB_5],[FetchJobE_6, QueueJobB_6, NotifyEventJobQueuedB_6],[FetchJobE_7, QueueJobB_7, NotifyEventJobQueuedB_7],[FetchJobE_8, QueueJobB_8, NotifyEventJobQueuedB_8],[FetchJobE_9, QueueJobB_9, NotifyEventJobQueuedB_9],[FetchJobE_10, QueueJobB_10, NotifyEventJobQueuedB_10],[FetchJobE_11, QueueJobB_11, NotifyEventJobQueuedB_11],[FetchJobE_12, QueueJobB_12, NotifyEventJobQueuedB_12],[FetchJobE_13, QueueJobB_13, NotifyEventJobQueuedB_13],[FetchJobE_14, QueueJobB_14, NotifyEventJobQueuedB_14],[FetchJobE_15, QueueJobB_15, NotifyEventJobQueuedB_15],[FetchJobE_16, QueueJobB_16, NotifyEventJobQueuedB_16],[FetchJobE_17, QueueJobB_17, NotifyEventJobQueuedB_17],[FetchJobE_18, QueueJobB_18, NotifyEventJobQueuedB_18],[FetchJobE_19, QueueJobB_19, NotifyEventJobQueuedB_19],[FetchJobE_20, QueueJobB_20, NotifyEventJobQueuedB_20],[FetchJobE_21, QueueJobB_21, NotifyEventJobQueuedB_21],[FetchJobE_22, QueueJobB_22, NotifyEventJobQueuedB_22],[FetchJobE_23, QueueJobB_23, NotifyEventJobQueuedB_23],[FetchJobE_24, QueueJobB_24, NotifyEventJobQueuedB_24],[FetchJobE_25, QueueJobB_25, NotifyEventJobQueuedB_25],[FetchJobE_26, QueueJobB_26, NotifyEventJobQueuedB_26],[FetchJobE_27, QueueJobB_27, NotifyEventJobQueuedB_27],[FetchJobE_28, QueueJobB_28, NotifyEventJobQueuedB_28],[FetchJobE_29, QueueJobB_29, NotifyEventJobQueuedB_29],[FetchJobE_30, QueueJobB_30, NotifyEventJobQueuedB_30],[FetchJobE_31, QueueJobB_31, NotifyEventJobQueuedB_31],[FetchJobE_32, QueueJobB_32, NotifyEventJobQueuedB_32],[FetchJobE_33, QueueJobB_33, NotifyEventJobQueuedB_33],[FetchJobE_34, QueueJobB_34, NotifyEventJobQueuedB_34],[FetchJobE_35, QueueJobB_35, NotifyEventJobQueuedB_35],[FetchJobE_36, QueueJobB_36, NotifyEventJobQueuedB_36],[FetchJobE_37, QueueJobB_37, NotifyEventJobQueuedB_37],[FetchJobE_38, QueueJobB_38, NotifyEventJobQueuedB_38],[FetchJobE_39, QueueJobB_39, NotifyEventJobQueuedB_39],[FetchJobE_40, QueueJobB_40, NotifyEventJobQueuedB_40],[FetchJobE_41, QueueJobB_41, NotifyEventJobQueuedB_41],[FetchJobE_42, QueueJobB_42, NotifyEventJobQueuedB_42],[FetchJobE_43, QueueJobB_43, NotifyEventJobQueuedB_43],[FetchJobE_44, QueueJobB_44, NotifyEventJobQueuedB_44],[FetchJobE_45, QueueJobB_45, NotifyEventJobQueuedB_45],[FetchJobE_46, QueueJobB_46, NotifyEventJobQueuedB_46],[FetchJobE_47, QueueJobB_47, NotifyEventJobQueuedB_47],[FetchJobE_48, QueueJobB_48, NotifyEventJobQueuedB_48],[FetchJobE_49, QueueJobB_49, NotifyEventJobQueuedB_49],[FetchJobE_50, QueueJobB_50, NotifyEventJobQueuedB_50],[FetchJobE_51, QueueJobB_51, NotifyEventJobQueuedB_51],[FetchJobE_52, QueueJobB_52, NotifyEventJobQueuedB_52],[FetchJobE_53, QueueJobB_53, NotifyEventJobQueuedB_53],[FetchJobE_54, QueueJobB_54, NotifyEventJobQueuedB_54],[FetchJobE_55, QueueJobB_55, NotifyEventJobQueuedB_55],[FetchJobE_56, QueueJobB_56, NotifyEventJobQueuedB_56],[FetchJobE_57, QueueJobB_57, NotifyEventJobQueuedB_57],[FetchJobE_58, QueueJobB_58, NotifyEventJobQueuedB_58],[FetchJobE_59, QueueJobB_59, NotifyEventJobQueuedB_59],[FetchJobE_60, QueueJobB_60, NotifyEventJobQueuedB_60],[FetchJobE_61, QueueJobB_61, NotifyEventJobQueuedB_61],[FetchJobE_62, QueueJobB_62, NotifyEventJobQueuedB_62],[FetchJobE_63, QueueJobB_63, NotifyEventJobQueuedB_63],[FetchJobE_64, QueueJobB_64, NotifyEventJobQueuedB_64],[FetchJobE_65, QueueJobB_65, NotifyEventJobQueuedB_65],[FetchJobE_66, QueueJobB_66, NotifyEventJobQueuedB_66],[FetchJobE_67, QueueJobB_67, NotifyEventJobQueuedB_67],[FetchJobE_68, QueueJobB_68, NotifyEventJobQueuedB_68],[FetchJobE_69, QueueJobB_69, NotifyEventJobQueuedB_69],[FetchJobE_70, QueueJobB_70, NotifyEventJobQueuedB_70],[FetchJobE_71, QueueJobB_71, NotifyEventJobQueuedB_71],[FetchJobE_72, QueueJobB_72, NotifyEventJobQueuedB_72],[FetchJobE_73, QueueJobB_73, NotifyEventJobQueuedB_73],[FetchJobE_74, QueueJobB_74, NotifyEventJobQueuedB_74],[FetchJobE_75, QueueJobB_75, NotifyEventJobQueuedB_75],[FetchJobE_76, QueueJobB_76, NotifyEventJobQueuedB_76],[FetchJobE_77, QueueJobB_77, NotifyEventJobQueuedB_77],[FetchJobE_78, QueueJobB_78, NotifyEventJobQueuedB_78],[FetchJobE_79, QueueJobB_79, NotifyEventJobQueuedB_79],[FetchJobE_80, QueueJobB_80, NotifyEventJobQueuedB_80],[place_482_0],[place_482_1],[place_482_2],[place_482_3],[place_482_4],[ModifiedSrc_0, TheSour_0],[ModifiedSrc_1, TheSour_1],[ModifiedSrc_2, TheSour_2],[ModifiedSrc_3, TheSour_3],[ModifiedSrc_4, TheSour_4],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 20:20:58] [INFO ] Flatten gal took : 64 ms
[2024-05-28 20:20:58] [INFO ] Time to serialize gal into /tmp/UpperBounds14665058921270732762.gal : 11 ms
[2024-05-28 20:20:58] [INFO ] Time to serialize properties into /tmp/UpperBounds16690595536664047781.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14665058921270732762.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16690595536664047781.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds16690595536664047781.prop.
ITS-tools command line returned an error code 137
[2024-05-28 20:31:35] [INFO ] Flatten gal took : 90 ms
[2024-05-28 20:31:35] [INFO ] Input system was already deterministic with 1522 transitions.
[2024-05-28 20:31:35] [INFO ] Transformed 1011 places.
[2024-05-28 20:31:35] [INFO ] Transformed 1522 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-28 20:32:05] [INFO ] Time to serialize gal into /tmp/UpperBounds5656355653561692921.gal : 19 ms
[2024-05-28 20:32:05] [INFO ] Time to serialize properties into /tmp/UpperBounds13233090003565479576.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5656355653561692921.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13233090003565479576.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13233090003565479576.prop.
ITS-tools command line returned an error code 137
Total runtime 2714879 ms.

BK_STOP 1716928863250

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-S05J80"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J80, 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 r290-tajo-171654447000397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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