Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447000389.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-S05J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447000389
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 10:07 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-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716925615521

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-S05J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-28 19:46:56] [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:46:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:46:57] [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:46:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 19:46:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 580 ms
[2024-05-28 19:46:57] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-28 19:46:57] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 8 ms.
[2024-05-28 19:46:57] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 19:46:57] [INFO ] Computed 13 invariants in 29 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 1, 61, 0, 1, 0, 0, 0, 0, 0, 10, 5, 0, 0, 1] Max Struct:[+inf, +inf, 1, 61, 4, +inf, 4, 5, +inf, 10, +inf, +inf, 5, +inf, 1, +inf]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-03 61 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 19:46:57] [INFO ] Invariant cache hit.
[2024-05-28 19:46:58] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-05-28 19:46:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 24 ms returned sat
[2024-05-28 19:46:58] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-28 19:46:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:46:58] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 19:46:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:46:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 19:46:58] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-28 19:46:58] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-28 19:46:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:46:58] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-28 19:46:58] [INFO ] Added : 3 causal constraints over 1 iterations in 34 ms. Result :sat
Minimization took 18 ms.
[2024-05-28 19:46:58] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:46:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:46:58] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-28 19:46:58] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 19:46:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:46:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:46:58] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:46:58] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-28 19:46:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:46:58] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 18 ms to minimize.
[2024-05-28 19:46:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2024-05-28 19:46:58] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 19:46:58] [INFO ] Added : 20 causal constraints over 4 iterations in 62 ms. Result :sat
Minimization took 24 ms.
[2024-05-28 19:46:58] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 19:46:58] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:46:58] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-28 19:46:58] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:46:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:46:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2024-05-28 19:46:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:46:59] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-28 19:46:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:46:59] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-28 19:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-28 19:46:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 19:46:59] [INFO ] Added : 20 causal constraints over 4 iterations in 208 ms. Result :sat
Minimization took 74 ms.
[2024-05-28 19:46:59] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 19:46:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2024-05-28 19:46:59] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-05-28 19:46:59] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 19:46:59] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-28 19:46:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:46:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:46:59] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-28 19:46:59] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-28 19:46:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:46:59] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:46:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-28 19:46:59] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 19:46:59] [INFO ] Added : 22 causal constraints over 5 iterations in 152 ms. Result :sat
Minimization took 107 ms.
[2024-05-28 19:47:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:47:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:47:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:47:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 19:47:00] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:47:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-28 19:47:00] [INFO ] Added : 36 causal constraints over 8 iterations in 115 ms. Result :sat
Minimization took 102 ms.
[2024-05-28 19:47:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-28 19:47:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:47:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 19:47:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-28 19:47:00] [INFO ] Added : 36 causal constraints over 8 iterations in 67 ms. Result :sat
Minimization took 21 ms.
[2024-05-28 19:47:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:47:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:47:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-28 19:47:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-28 19:47:00] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:47:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-28 19:47:00] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 19:47:01] [INFO ] Added : 22 causal constraints over 5 iterations in 404 ms. Result :sat
Minimization took 177 ms.
[2024-05-28 19:47:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:47:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:47:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:47:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 19:47:01] [INFO ] Added : 4 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 14 ms.
[2024-05-28 19:47:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2024-05-28 19:47:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:47:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:47:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:47:01] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 19:47:01] [INFO ] Added : 3 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 13 ms.
[2024-05-28 19:47:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:47:01] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:47:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:47:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 19:47:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 19:47:01] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:47:01] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:47:01] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:47:01] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:47:02] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:47:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 147 ms
[2024-05-28 19:47:02] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 19:47:02] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:47:02] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:47:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2024-05-28 19:47:02] [INFO ] Added : 36 causal constraints over 8 iterations in 104 ms. Result :sat
Minimization took 29 ms.
[2024-05-28 19:47:02] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 19:47:02] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 10, 0, 0, 1] Max Struct:[+inf, +inf, 4, 1, 4, 5, +inf, 10, +inf, 10, +inf, 1, 1]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-UpperBounds-05 1 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:47:02] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 104 ms.
[2024-05-28 19:47:02] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Deduced a syphon composed of 60 places in 10 ms
Reduce places removed 60 places and 60 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] Max Struct:[+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] Max Struct:[+inf, +inf, 4, 4, 5, +inf, 10, +inf, +inf, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 4, 4, 5, +inf, 10, +inf, +inf, 1]
[2024-05-28 19:47:02] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-28 19:47:02] [INFO ] Computed 142 invariants in 94 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[11, 61, 4, 4, 5, 244, 10, 11, 61, 1]
RANDOM walk for 10000 steps (690 resets) in 322 ms. (30 steps per ms)
FORMULA PolyORBNT-COL-S05J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (1205 resets) in 483 ms. (165 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 3, 4, 1, 4, 1, 1] Max Struct:[11, 61, 4, 5, 244, 10, 11, 61]
[2024-05-28 19:47:03] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 19:47:03] [INFO ] Invariant cache hit.
[2024-05-28 19:47:03] [INFO ] [Real]Absence check using 135 positive place invariants in 35 ms returned sat
[2024-05-28 19:47:03] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 13 ms returned unsat
[2024-05-28 19:47:03] [INFO ] [Real]Absence check using 135 positive place invariants in 37 ms returned sat
[2024-05-28 19:47:03] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 20 ms returned unsat
[2024-05-28 19:47:03] [INFO ] [Real]Absence check using 135 positive place invariants in 30 ms returned sat
[2024-05-28 19:47:03] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-28 19:47:04] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2024-05-28 19:47:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:47:04] [INFO ] [Nat]Absence check using 135 positive place invariants in 46 ms returned sat
[2024-05-28 19:47:04] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2024-05-28 19:47:04] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2024-05-28 19:47:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:47:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 16 ms returned sat
[2024-05-28 19:47:05] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 222 ms.
[2024-05-28 19:47:06] [INFO ] Deduced a trap composed of 507 places in 504 ms of which 7 ms to minimize.
[2024-05-28 19:47:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 843 ms
[2024-05-28 19:47:06] [INFO ] Added : 19 causal constraints over 4 iterations in 1750 ms. Result :sat
Minimization took 629 ms.
[2024-05-28 19:47:07] [INFO ] [Real]Absence check using 135 positive place invariants in 48 ms returned sat
[2024-05-28 19:47:07] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-28 19:47:08] [INFO ] [Real]Absence check using state equation in 785 ms returned sat
[2024-05-28 19:47:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:47:08] [INFO ] [Nat]Absence check using 135 positive place invariants in 40 ms returned sat
[2024-05-28 19:47:08] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 19:47:09] [INFO ] [Nat]Absence check using state equation in 935 ms returned sat
[2024-05-28 19:47:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 177 ms returned sat
[2024-05-28 19:47:09] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 129 ms.
[2024-05-28 19:47:10] [INFO ] Added : 5 causal constraints over 1 iterations in 1110 ms. Result :sat
Minimization took 534 ms.
[2024-05-28 19:47:11] [INFO ] [Real]Absence check using 135 positive place invariants in 58 ms returned sat
[2024-05-28 19:47:11] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned unsat
[2024-05-28 19:47:11] [INFO ] [Real]Absence check using 135 positive place invariants in 42 ms returned sat
[2024-05-28 19:47:11] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 17 ms returned unsat
[2024-05-28 19:47:12] [INFO ] [Real]Absence check using 135 positive place invariants in 38 ms returned sat
[2024-05-28 19:47:12] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned unsat
[2024-05-28 19:47:12] [INFO ] [Real]Absence check using 135 positive place invariants in 38 ms returned sat
[2024-05-28 19:47:12] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 18 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 3, 4, 1, 4, 1, 1] Max Struct:[1, 1, 4, 5, 1, 4, 1, 1]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 4] Max Struct:[4, 5]
Support contains 306 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 411 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
Running 1175 sub problems to find dead transitions.
[2024-05-28 19:47:12] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2024-05-28 19:47:12] [INFO ] Computed 137 invariants in 87 ms
[2024-05-28 19:47:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 (/ 2.0 3.0))
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 (/ 2.0 3.0))
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 (/ 1.0 3.0))
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 (/ 1.0 3.0))
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 4.0)
(s379 4.0)
(s380 4.0)
(s381 4.0)
(s382 4.0)
(s383 9.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1947 variables, and 132 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-05-28 19:47:48] [INFO ] Deduced a trap composed of 13 places in 412 ms of which 6 ms to minimize.
[2024-05-28 19:47:52] [INFO ] Deduced a trap composed of 285 places in 381 ms of which 7 ms to minimize.
[2024-05-28 19:47:52] [INFO ] Deduced a trap composed of 188 places in 277 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-05-28 19:47:54] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 136 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 4/4 constraints]
After SMT, in 43652ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 43710ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44190 ms. Remains : 770/909 places, 1181/1315 transitions.
[2024-05-28 19:47:56] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 19:47:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 4] Max Struct:[4, 5]
RANDOM walk for 1000000 steps (52173 resets) in 10486 ms. (95 steps per ms)
BEST_FIRST walk for 2000002 steps (6826 resets) in 6678 ms. (299 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 4] Max Struct:[4, 5]
[2024-05-28 19:48:13] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 19:48:13] [INFO ] Invariant cache hit.
[2024-05-28 19:48:13] [INFO ] [Real]Absence check using 130 positive place invariants in 35 ms returned sat
[2024-05-28 19:48:13] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2024-05-28 19:48:14] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2024-05-28 19:48:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:48:14] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2024-05-28 19:48:14] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-28 19:48:14] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2024-05-28 19:48:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:48:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 55 ms returned sat
[2024-05-28 19:48:15] [INFO ] Deduced a trap composed of 168 places in 464 ms of which 5 ms to minimize.
[2024-05-28 19:48:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 561 ms
[2024-05-28 19:48:15] [INFO ] Computed and/alt/rep : 616/2116/616 causal constraints (skipped 555 transitions) in 132 ms.
[2024-05-28 19:48:16] [INFO ] Added : 11 causal constraints over 3 iterations in 715 ms. Result :sat
Minimization took 2081 ms.
[2024-05-28 19:48:18] [INFO ] [Real]Absence check using 130 positive place invariants in 33 ms returned sat
[2024-05-28 19:48:18] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-28 19:48:18] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2024-05-28 19:48:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:48:19] [INFO ] [Nat]Absence check using 130 positive place invariants in 34 ms returned sat
[2024-05-28 19:48:19] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 19:48:22] [INFO ] [Nat]Absence check using state equation in 3040 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 4] Max Struct:[4, 4]
FORMULA PolyORBNT-COL-S05J60-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 71 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 770/770 places, 1181/1181 transitions.
[2024-05-28 19:48:22] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 19:48:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (51942 resets) in 5808 ms. (172 steps per ms)
BEST_FIRST walk for 1000000 steps (3358 resets) in 1321 ms. (756 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 19:48:29] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 19:48:29] [INFO ] Invariant cache hit.
[2024-05-28 19:48:29] [INFO ] [Real]Absence check using 130 positive place invariants in 32 ms returned sat
[2024-05-28 19:48:29] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-28 19:48:30] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2024-05-28 19:48:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:48:30] [INFO ] [Nat]Absence check using 130 positive place invariants in 34 ms returned sat
[2024-05-28 19:48:30] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-28 19:48:30] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2024-05-28 19:48:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:48:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 63 ms returned sat
[2024-05-28 19:48:31] [INFO ] Deduced a trap composed of 168 places in 331 ms of which 4 ms to minimize.
[2024-05-28 19:48:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 446 ms
[2024-05-28 19:48:31] [INFO ] Computed and/alt/rep : 616/2116/616 causal constraints (skipped 555 transitions) in 94 ms.
[2024-05-28 19:48:31] [INFO ] Added : 11 causal constraints over 3 iterations in 727 ms. Result :sat
Minimization took 2635 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 63 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 770/770 places, 1181/1181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 48 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
[2024-05-28 19:48:34] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 19:48:34] [INFO ] Invariant cache hit.
[2024-05-28 19:48:35] [INFO ] Implicit Places using invariants in 1051 ms returned []
[2024-05-28 19:48:35] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 19:48:35] [INFO ] Invariant cache hit.
[2024-05-28 19:48:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:48:41] [INFO ] Implicit Places using invariants and state equation in 6183 ms returned []
Implicit Place search using SMT with State Equation took 7242 ms to find 0 implicit places.
[2024-05-28 19:48:42] [INFO ] Redundant transitions in 105 ms returned []
Running 1175 sub problems to find dead transitions.
[2024-05-28 19:48:42] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 19:48:42] [INFO ] Invariant cache hit.
[2024-05-28 19:48:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 4/769 variables, 4/136 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1947 variables, and 136 constraints, problems are : Problem set: 78 solved, 1097 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
[2024-05-28 19:49:17] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 0/133 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 4 (OVERLAPS) 4/769 variables, 4/137 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1947 variables, and 137 constraints, problems are : Problem set: 78 solved, 1097 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 1/1 constraints]
After SMT, in 63437ms problems are : Problem set: 78 solved, 1097 unsolved
Search for dead transitions found 78 dead transitions in 63459ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 770/770 places, 1103/1181 transitions.
Applied a total of 0 rules in 29 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-28 19:49:45] [INFO ] Redundant transitions in 37 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 70945 ms. Remains : 770/770 places, 1103/1181 transitions.
[2024-05-28 19:49:45] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 19:49:45] [INFO ] Computed 137 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (52191 resets) in 5053 ms. (197 steps per ms)
BEST_FIRST walk for 1000000 steps (3337 resets) in 1305 ms. (765 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 19:49:52] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:49:52] [INFO ] Invariant cache hit.
[2024-05-28 19:49:52] [INFO ] [Real]Absence check using 130 positive place invariants in 31 ms returned sat
[2024-05-28 19:49:52] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-28 19:49:52] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2024-05-28 19:49:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:49:52] [INFO ] [Nat]Absence check using 130 positive place invariants in 30 ms returned sat
[2024-05-28 19:49:52] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-28 19:49:53] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2024-05-28 19:49:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:49:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 89 ms returned sat
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 156 places in 334 ms of which 5 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 558 ms
[2024-05-28 19:49:53] [INFO ] Computed and/alt/rep : 538/1870/538 causal constraints (skipped 555 transitions) in 91 ms.
[2024-05-28 19:49:54] [INFO ] Added : 5 causal constraints over 1 iterations in 540 ms. Result :sat
Minimization took 1465 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 25 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 24 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-28 19:49:55] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:49:55] [INFO ] Invariant cache hit.
[2024-05-28 19:49:56] [INFO ] Implicit Places using invariants in 924 ms returned []
[2024-05-28 19:49:56] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:49:56] [INFO ] Invariant cache hit.
[2024-05-28 19:49:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:50:03] [INFO ] Implicit Places using invariants and state equation in 6715 ms returned []
Implicit Place search using SMT with State Equation took 7645 ms to find 0 implicit places.
[2024-05-28 19:50:03] [INFO ] Redundant transitions in 35 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:50:03] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:50:03] [INFO ] Invariant cache hit.
[2024-05-28 19:50:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:50:17] [INFO ] Deduced a trap composed of 245 places in 318 ms of which 5 ms to minimize.
[2024-05-28 19:50:17] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 19:50:17] [INFO ] Deduced a trap composed of 233 places in 350 ms of which 5 ms to minimize.
[2024-05-28 19:50:18] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 4 ms to minimize.
[2024-05-28 19:50:18] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 4 ms to minimize.
[2024-05-28 19:50:18] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 5 ms to minimize.
[2024-05-28 19:50:19] [INFO ] Deduced a trap composed of 196 places in 336 ms of which 5 ms to minimize.
[2024-05-28 19:50:19] [INFO ] Deduced a trap composed of 245 places in 337 ms of which 5 ms to minimize.
[2024-05-28 19:50:19] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 5 ms to minimize.
[2024-05-28 19:50:20] [INFO ] Deduced a trap composed of 196 places in 344 ms of which 5 ms to minimize.
[2024-05-28 19:50:20] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 6 ms to minimize.
[2024-05-28 19:50:21] [INFO ] Deduced a trap composed of 196 places in 364 ms of which 6 ms to minimize.
[2024-05-28 19:50:21] [INFO ] Deduced a trap composed of 196 places in 360 ms of which 9 ms to minimize.
[2024-05-28 19:50:21] [INFO ] Deduced a trap composed of 254 places in 367 ms of which 5 ms to minimize.
[2024-05-28 19:50:22] [INFO ] Deduced a trap composed of 196 places in 336 ms of which 6 ms to minimize.
[2024-05-28 19:50:22] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 8 ms to minimize.
[2024-05-28 19:50:22] [INFO ] Deduced a trap composed of 242 places in 318 ms of which 6 ms to minimize.
[2024-05-28 19:50:23] [INFO ] Deduced a trap composed of 196 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:50:23] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 5 ms to minimize.
[2024-05-28 19:50:24] [INFO ] Deduced a trap composed of 242 places in 295 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:50:24] [INFO ] Deduced a trap composed of 254 places in 312 ms of which 5 ms to minimize.
[2024-05-28 19:50:25] [INFO ] Deduced a trap composed of 245 places in 319 ms of which 5 ms to minimize.
[2024-05-28 19:50:25] [INFO ] Deduced a trap composed of 248 places in 320 ms of which 5 ms to minimize.
[2024-05-28 19:50:26] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 6 ms to minimize.
[2024-05-28 19:50:26] [INFO ] Deduced a trap composed of 251 places in 294 ms of which 5 ms to minimize.
[2024-05-28 19:50:26] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 4 ms to minimize.
[2024-05-28 19:50:27] [INFO ] Deduced a trap composed of 233 places in 273 ms of which 3 ms to minimize.
[2024-05-28 19:50:27] [INFO ] Deduced a trap composed of 236 places in 349 ms of which 5 ms to minimize.
[2024-05-28 19:50:27] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 19:50:28] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 3 ms to minimize.
[2024-05-28 19:50:28] [INFO ] Deduced a trap composed of 260 places in 234 ms of which 3 ms to minimize.
[2024-05-28 19:50:28] [INFO ] Deduced a trap composed of 236 places in 301 ms of which 4 ms to minimize.
[2024-05-28 19:50:28] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:50:29] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 7 ms to minimize.
[2024-05-28 19:50:29] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 6 ms to minimize.
[2024-05-28 19:50:29] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 5 ms to minimize.
[2024-05-28 19:50:30] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:50:30] [INFO ] Deduced a trap composed of 196 places in 363 ms of which 6 ms to minimize.
[2024-05-28 19:50:30] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 5 ms to minimize.
[2024-05-28 19:50:31] [INFO ] Deduced a trap composed of 196 places in 322 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:50:41] [INFO ] Deduced a trap composed of 200 places in 345 ms of which 5 ms to minimize.
[2024-05-28 19:50:41] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:50:42] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 4 ms to minimize.
[2024-05-28 19:50:42] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:50:42] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-05-28 19:50:43] [INFO ] Deduced a trap composed of 200 places in 335 ms of which 5 ms to minimize.
[2024-05-28 19:50:43] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 6 ms to minimize.
[2024-05-28 19:50:43] [INFO ] Deduced a trap composed of 200 places in 362 ms of which 6 ms to minimize.
[2024-05-28 19:50:44] [INFO ] Deduced a trap composed of 196 places in 343 ms of which 6 ms to minimize.
[2024-05-28 19:50:44] [INFO ] Deduced a trap composed of 200 places in 367 ms of which 6 ms to minimize.
[2024-05-28 19:50:44] [INFO ] Deduced a trap composed of 196 places in 347 ms of which 5 ms to minimize.
[2024-05-28 19:50:45] [INFO ] Deduced a trap composed of 200 places in 324 ms of which 5 ms to minimize.
[2024-05-28 19:50:45] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2024-05-28 19:50:45] [INFO ] Deduced a trap composed of 200 places in 312 ms of which 5 ms to minimize.
[2024-05-28 19:50:46] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 5 ms to minimize.
[2024-05-28 19:50:46] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 5 ms to minimize.
[2024-05-28 19:50:46] [INFO ] Deduced a trap composed of 200 places in 368 ms of which 5 ms to minimize.
[2024-05-28 19:50:47] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 4 ms to minimize.
[2024-05-28 19:50:47] [INFO ] Deduced a trap composed of 200 places in 277 ms of which 4 ms to minimize.
[2024-05-28 19:50:47] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:50:50] [INFO ] Deduced a trap composed of 345 places in 313 ms of which 5 ms to minimize.
[2024-05-28 19:50:50] [INFO ] Deduced a trap composed of 335 places in 315 ms of which 5 ms to minimize.
[2024-05-28 19:50:51] [INFO ] Deduced a trap composed of 246 places in 301 ms of which 6 ms to minimize.
[2024-05-28 19:50:51] [INFO ] Deduced a trap composed of 239 places in 277 ms of which 5 ms to minimize.
[2024-05-28 19:50:51] [INFO ] Deduced a trap composed of 246 places in 288 ms of which 5 ms to minimize.
[2024-05-28 19:50:52] [INFO ] Deduced a trap composed of 245 places in 267 ms of which 5 ms to minimize.
[2024-05-28 19:50:52] [INFO ] Deduced a trap composed of 248 places in 291 ms of which 4 ms to minimize.
[2024-05-28 19:50:52] [INFO ] Deduced a trap composed of 258 places in 318 ms of which 3 ms to minimize.
[2024-05-28 19:50:53] [INFO ] Deduced a trap composed of 239 places in 323 ms of which 4 ms to minimize.
[2024-05-28 19:50:53] [INFO ] Deduced a trap composed of 242 places in 303 ms of which 4 ms to minimize.
[2024-05-28 19:50:53] [INFO ] Deduced a trap composed of 248 places in 301 ms of which 4 ms to minimize.
[2024-05-28 19:50:54] [INFO ] Deduced a trap composed of 306 places in 284 ms of which 4 ms to minimize.
[2024-05-28 19:50:54] [INFO ] Deduced a trap composed of 236 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:50:54] [INFO ] Deduced a trap composed of 242 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:50:55] [INFO ] Deduced a trap composed of 251 places in 272 ms of which 3 ms to minimize.
[2024-05-28 19:50:55] [INFO ] Deduced a trap composed of 248 places in 336 ms of which 5 ms to minimize.
[2024-05-28 19:50:55] [INFO ] Deduced a trap composed of 236 places in 318 ms of which 6 ms to minimize.
[2024-05-28 19:50:56] [INFO ] Deduced a trap composed of 234 places in 377 ms of which 5 ms to minimize.
[2024-05-28 19:50:56] [INFO ] Deduced a trap composed of 242 places in 339 ms of which 5 ms to minimize.
[2024-05-28 19:50:57] [INFO ] Deduced a trap composed of 251 places in 375 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:51:02] [INFO ] Deduced a trap composed of 196 places in 376 ms of which 5 ms to minimize.
[2024-05-28 19:51:02] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 5 ms to minimize.
[2024-05-28 19:51:03] [INFO ] Deduced a trap composed of 196 places in 351 ms of which 5 ms to minimize.
[2024-05-28 19:51:03] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:51:03] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 5 ms to minimize.
[2024-05-28 19:51:04] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-05-28 19:51:04] [INFO ] Deduced a trap composed of 196 places in 327 ms of which 5 ms to minimize.
[2024-05-28 19:51:04] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 5 ms to minimize.
[2024-05-28 19:51:05] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 4 ms to minimize.
[2024-05-28 19:51:05] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 3 ms to minimize.
[2024-05-28 19:51:05] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 4 ms to minimize.
[2024-05-28 19:51:06] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 19:51:06] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 5 ms to minimize.
SMT process timed out in 62879ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62899ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70621 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 40000 steps (2143 resets) in 1061 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (107 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (125 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
[2024-05-28 19:51:07] [INFO ] Flatten gal took : 323 ms
[2024-05-28 19:51:07] [INFO ] Flatten gal took : 188 ms
[2024-05-28 19:51:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4074850819848871200.gal : 52 ms
[2024-05-28 19:51:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4453783185397884321.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/ReachabilityCardinality4074850819848871200.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4453783185397884321.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 ...328
Loading property file /tmp/ReachabilityCardinality4453783185397884321.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 868813
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :868813 after 2.58101e+06
Interrupted probabilistic random walk after 265584 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 265584 steps, saw 80739 distinct states, run finished after 3007 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-28 19:51:10] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:51:10] [INFO ] Invariant cache hit.
[2024-05-28 19:51:10] [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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.58101e+06 after 4.82519e+06
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1024 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4.82519e+06 after 6.55947e+06
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 910 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1232 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2277ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 36 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:51:12] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:51:12] [INFO ] Invariant cache hit.
[2024-05-28 19:51:12] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6.55947e+06 after 8.369e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8.369e+06 after 2.05757e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:51:26] [INFO ] Deduced a trap composed of 245 places in 320 ms of which 5 ms to minimize.
[2024-05-28 19:51:26] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 5 ms to minimize.
[2024-05-28 19:51:26] [INFO ] Deduced a trap composed of 233 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:51:27] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 5 ms to minimize.
[2024-05-28 19:51:27] [INFO ] Deduced a trap composed of 230 places in 311 ms of which 5 ms to minimize.
[2024-05-28 19:51:27] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:51:28] [INFO ] Deduced a trap composed of 196 places in 298 ms of which 5 ms to minimize.
[2024-05-28 19:51:28] [INFO ] Deduced a trap composed of 245 places in 318 ms of which 5 ms to minimize.
[2024-05-28 19:51:28] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 5 ms to minimize.
[2024-05-28 19:51:29] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 5 ms to minimize.
[2024-05-28 19:51:29] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 5 ms to minimize.
[2024-05-28 19:51:29] [INFO ] Deduced a trap composed of 196 places in 295 ms of which 5 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 254 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 196 places in 295 ms of which 5 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 4 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 242 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 4 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:51:32] [INFO ] Deduced a trap composed of 242 places in 244 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:51:32] [INFO ] Deduced a trap composed of 254 places in 298 ms of which 5 ms to minimize.
[2024-05-28 19:51:33] [INFO ] Deduced a trap composed of 245 places in 288 ms of which 6 ms to minimize.
[2024-05-28 19:51:33] [INFO ] Deduced a trap composed of 248 places in 296 ms of which 5 ms to minimize.
[2024-05-28 19:51:33] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 5 ms to minimize.
[2024-05-28 19:51:34] [INFO ] Deduced a trap composed of 251 places in 289 ms of which 5 ms to minimize.
[2024-05-28 19:51:34] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 5 ms to minimize.
[2024-05-28 19:51:34] [INFO ] Deduced a trap composed of 233 places in 289 ms of which 5 ms to minimize.
[2024-05-28 19:51:35] [INFO ] Deduced a trap composed of 236 places in 312 ms of which 6 ms to minimize.
SMT process timed out in 22904ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 22923ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22968 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 40000 steps (2099 resets) in 362 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (143 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (153 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 290959 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 2
Probabilistic random walk after 290959 steps, saw 88473 distinct states, run finished after 3002 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-28 19:51:38] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:51:38] [INFO ] Invariant cache hit.
[2024-05-28 19:51:38] [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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 910 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1953ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 64 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 41 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-28 19:51:40] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:51:40] [INFO ] Invariant cache hit.
[2024-05-28 19:51:41] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2024-05-28 19:51:41] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:51:41] [INFO ] Invariant cache hit.
[2024-05-28 19:51:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:51:48] [INFO ] Implicit Places using invariants and state equation in 6841 ms returned []
Implicit Place search using SMT with State Equation took 7910 ms to find 0 implicit places.
[2024-05-28 19:51:48] [INFO ] Redundant transitions in 26 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:51:48] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:51:48] [INFO ] Invariant cache hit.
[2024-05-28 19:51:48] [INFO ] State equation strengthened by 1 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-28 19:51:57] [INFO ] Flatten gal took : 72 ms
[2024-05-28 19:51:57] [INFO ] Applying decomposition
[2024-05-28 19:51:57] [INFO ] Flatten gal took : 64 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/graph1360211608850260786.txt' '-o' '/tmp/graph1360211608850260786.bin' '-w' '/tmp/graph1360211608850260786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1360211608850260786.bin' '-l' '-1' '-v' '-w' '/tmp/graph1360211608850260786.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:51:57] [INFO ] Decomposing Gal with order
[2024-05-28 19:51:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:51:58] [INFO ] Removed a total of 1084 redundant transitions.
[2024-05-28 19:51:58] [INFO ] Flatten gal took : 374 ms
[2024-05-28 19:51:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 487 labels/synchronizations in 59 ms.
[2024-05-28 19:51:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6276627325040261670.gal : 25 ms
[2024-05-28 19:51:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4889163726416743032.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/ReachabilityCardinality6276627325040261670.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4889163726416743032.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/ReachabilityCardinality4889163726416743032.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 66
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:52:02] [INFO ] Deduced a trap composed of 245 places in 266 ms of which 5 ms to minimize.
[2024-05-28 19:52:03] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:52:03] [INFO ] Deduced a trap composed of 233 places in 291 ms of which 5 ms to minimize.
[2024-05-28 19:52:03] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 5 ms to minimize.
[2024-05-28 19:52:04] [INFO ] Deduced a trap composed of 230 places in 294 ms of which 5 ms to minimize.
[2024-05-28 19:52:04] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:52:04] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 5 ms to minimize.
[2024-05-28 19:52:05] [INFO ] Deduced a trap composed of 245 places in 290 ms of which 4 ms to minimize.
[2024-05-28 19:52:05] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 5 ms to minimize.
[2024-05-28 19:52:05] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 19:52:05] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 5 ms to minimize.
[2024-05-28 19:52:06] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 5 ms to minimize.
[2024-05-28 19:52:06] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 4 ms to minimize.
[2024-05-28 19:52:06] [INFO ] Deduced a trap composed of 254 places in 263 ms of which 5 ms to minimize.
[2024-05-28 19:52:07] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 5 ms to minimize.
[2024-05-28 19:52:07] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 4 ms to minimize.
[2024-05-28 19:52:07] [INFO ] Deduced a trap composed of 242 places in 211 ms of which 4 ms to minimize.
[2024-05-28 19:52:07] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:52:08] [INFO ] Deduced a trap composed of 196 places in 210 ms of which 4 ms to minimize.
[2024-05-28 19:52:08] [INFO ] Deduced a trap composed of 242 places in 210 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:52:09] [INFO ] Deduced a trap composed of 254 places in 283 ms of which 5 ms to minimize.
[2024-05-28 19:52:09] [INFO ] Deduced a trap composed of 245 places in 271 ms of which 5 ms to minimize.
[2024-05-28 19:52:09] [INFO ] Deduced a trap composed of 248 places in 386 ms of which 5 ms to minimize.
[2024-05-28 19:52:10] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 5 ms to minimize.
[2024-05-28 19:52:10] [INFO ] Deduced a trap composed of 251 places in 245 ms of which 4 ms to minimize.
[2024-05-28 19:52:10] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 5 ms to minimize.
[2024-05-28 19:52:11] [INFO ] Deduced a trap composed of 233 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:52:11] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 4 ms to minimize.
[2024-05-28 19:52:11] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-05-28 19:52:11] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:52:12] [INFO ] Deduced a trap composed of 260 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:52:12] [INFO ] Deduced a trap composed of 236 places in 271 ms of which 4 ms to minimize.
[2024-05-28 19:52:12] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:52:12] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:52:13] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:52:13] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:52:13] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:52:14] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:52:14] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 3 ms to minimize.
[2024-05-28 19:52:14] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:52:26] [INFO ] Deduced a trap composed of 200 places in 323 ms of which 5 ms to minimize.
[2024-05-28 19:52:26] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 5 ms to minimize.
[2024-05-28 19:52:27] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:52:27] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 3 ms to minimize.
[2024-05-28 19:52:27] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 3 ms to minimize.
[2024-05-28 19:52:27] [INFO ] Deduced a trap composed of 200 places in 251 ms of which 3 ms to minimize.
[2024-05-28 19:52:28] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-05-28 19:52:28] [INFO ] Deduced a trap composed of 200 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:52:28] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:52:29] [INFO ] Deduced a trap composed of 200 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:52:29] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:52:29] [INFO ] Deduced a trap composed of 200 places in 254 ms of which 7 ms to minimize.
[2024-05-28 19:52:29] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:52:30] [INFO ] Deduced a trap composed of 200 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:52:30] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:52:30] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:52:30] [INFO ] Deduced a trap composed of 200 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:52:31] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:52:31] [INFO ] Deduced a trap composed of 200 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:52:31] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:52:34] [INFO ] Deduced a trap composed of 345 places in 362 ms of which 6 ms to minimize.
[2024-05-28 19:52:34] [INFO ] Deduced a trap composed of 335 places in 319 ms of which 5 ms to minimize.
[2024-05-28 19:52:35] [INFO ] Deduced a trap composed of 246 places in 329 ms of which 6 ms to minimize.
[2024-05-28 19:52:35] [INFO ] Deduced a trap composed of 239 places in 242 ms of which 3 ms to minimize.
[2024-05-28 19:52:35] [INFO ] Deduced a trap composed of 246 places in 293 ms of which 5 ms to minimize.
[2024-05-28 19:52:36] [INFO ] Deduced a trap composed of 245 places in 272 ms of which 5 ms to minimize.
[2024-05-28 19:52:36] [INFO ] Deduced a trap composed of 248 places in 294 ms of which 4 ms to minimize.
[2024-05-28 19:52:36] [INFO ] Deduced a trap composed of 258 places in 267 ms of which 4 ms to minimize.
[2024-05-28 19:52:36] [INFO ] Deduced a trap composed of 239 places in 246 ms of which 3 ms to minimize.
[2024-05-28 19:52:37] [INFO ] Deduced a trap composed of 242 places in 250 ms of which 3 ms to minimize.
[2024-05-28 19:52:37] [INFO ] Deduced a trap composed of 248 places in 251 ms of which 3 ms to minimize.
[2024-05-28 19:52:37] [INFO ] Deduced a trap composed of 306 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:52:38] [INFO ] Deduced a trap composed of 236 places in 244 ms of which 4 ms to minimize.
[2024-05-28 19:52:38] [INFO ] Deduced a trap composed of 242 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:52:38] [INFO ] Deduced a trap composed of 251 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:52:38] [INFO ] Deduced a trap composed of 248 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:52:39] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:52:39] [INFO ] Deduced a trap composed of 234 places in 326 ms of which 3 ms to minimize.
[2024-05-28 19:52:39] [INFO ] Deduced a trap composed of 242 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:52:40] [INFO ] Deduced a trap composed of 251 places in 319 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:52:44] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 5 ms to minimize.
[2024-05-28 19:52:45] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 5 ms to minimize.
[2024-05-28 19:52:45] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-05-28 19:52:45] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:52:45] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 3 ms to minimize.
[2024-05-28 19:52:46] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 4 ms to minimize.
[2024-05-28 19:52:46] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:52:46] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-05-28 19:52:47] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:52:47] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:52:47] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:52:48] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 5 ms to minimize.
[2024-05-28 19:52:48] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
Detected timeout of ITS tools.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 225 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 93/93 constraints]
After SMT, in 63468ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63491ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71480 ms. Remains : 770/770 places, 1103/1103 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Starting property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-06
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:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-05-28 19:52:52] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:52:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (515 resets) in 55 ms. (178 steps per ms)
BEST_FIRST walk for 10001 steps (34 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 19:52:52] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:52:52] [INFO ] Invariant cache hit.
[2024-05-28 19:52:52] [INFO ] [Real]Absence check using 130 positive place invariants in 21 ms returned sat
[2024-05-28 19:52:52] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-28 19:52:52] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2024-05-28 19:52:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:52:52] [INFO ] [Nat]Absence check using 130 positive place invariants in 20 ms returned sat
[2024-05-28 19:52:52] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-28 19:52:53] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2024-05-28 19:52:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:52:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 74 ms returned sat
[2024-05-28 19:52:53] [INFO ] Deduced a trap composed of 156 places in 387 ms of which 5 ms to minimize.
[2024-05-28 19:52:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 594 ms
[2024-05-28 19:52:54] [INFO ] Computed and/alt/rep : 538/1870/538 causal constraints (skipped 555 transitions) in 95 ms.
[2024-05-28 19:52:54] [INFO ] Added : 5 causal constraints over 1 iterations in 522 ms. Result :sat
Minimization took 568 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 50 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:52:55] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:52:55] [INFO ] Invariant cache hit.
[2024-05-28 19:52:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:53:07] [INFO ] Deduced a trap composed of 245 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:53:07] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 3 ms to minimize.
[2024-05-28 19:53:07] [INFO ] Deduced a trap composed of 233 places in 322 ms of which 5 ms to minimize.
[2024-05-28 19:53:08] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:53:08] [INFO ] Deduced a trap composed of 230 places in 227 ms of which 4 ms to minimize.
[2024-05-28 19:53:08] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:53:09] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2024-05-28 19:53:09] [INFO ] Deduced a trap composed of 245 places in 296 ms of which 3 ms to minimize.
[2024-05-28 19:53:09] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 19:53:10] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:53:10] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 5 ms to minimize.
[2024-05-28 19:53:10] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 6 ms to minimize.
[2024-05-28 19:53:11] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 6 ms to minimize.
[2024-05-28 19:53:11] [INFO ] Deduced a trap composed of 254 places in 297 ms of which 5 ms to minimize.
[2024-05-28 19:53:11] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 5 ms to minimize.
[2024-05-28 19:53:12] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:53:12] [INFO ] Deduced a trap composed of 242 places in 285 ms of which 4 ms to minimize.
[2024-05-28 19:53:12] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-05-28 19:53:13] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 7 ms to minimize.
[2024-05-28 19:53:13] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:53:14] [INFO ] Deduced a trap composed of 254 places in 313 ms of which 8 ms to minimize.
[2024-05-28 19:53:14] [INFO ] Deduced a trap composed of 245 places in 297 ms of which 5 ms to minimize.
[2024-05-28 19:53:14] [INFO ] Deduced a trap composed of 248 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 196 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 251 places in 223 ms of which 3 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 3 ms to minimize.
[2024-05-28 19:53:15] [INFO ] Deduced a trap composed of 233 places in 320 ms of which 5 ms to minimize.
[2024-05-28 19:53:16] [INFO ] Deduced a trap composed of 236 places in 220 ms of which 3 ms to minimize.
[2024-05-28 19:53:16] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:53:16] [INFO ] Deduced a trap composed of 230 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:53:16] [INFO ] Deduced a trap composed of 260 places in 237 ms of which 3 ms to minimize.
[2024-05-28 19:53:17] [INFO ] Deduced a trap composed of 236 places in 302 ms of which 5 ms to minimize.
[2024-05-28 19:53:17] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:53:17] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 3 ms to minimize.
[2024-05-28 19:53:18] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 5 ms to minimize.
SMT process timed out in 23008ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23027ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23081 ms. Remains : 770/770 places, 1103/1103 transitions.
[2024-05-28 19:53:18] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:53:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[4]
RANDOM walk for 1000000 steps (51981 resets) in 4574 ms. (218 steps per ms)
BEST_FIRST walk for 1000001 steps (3393 resets) in 1225 ms. (815 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[4]
[2024-05-28 19:53:23] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:53:23] [INFO ] Invariant cache hit.
[2024-05-28 19:53:24] [INFO ] [Real]Absence check using 130 positive place invariants in 30 ms returned sat
[2024-05-28 19:53:24] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-28 19:53:24] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2024-05-28 19:53:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 19:53:24] [INFO ] [Nat]Absence check using 130 positive place invariants in 33 ms returned sat
[2024-05-28 19:53:24] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-28 19:53:25] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-05-28 19:53:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:53:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 82 ms returned sat
[2024-05-28 19:53:25] [INFO ] Deduced a trap composed of 156 places in 387 ms of which 5 ms to minimize.
[2024-05-28 19:53:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 614 ms
[2024-05-28 19:53:25] [INFO ] Computed and/alt/rep : 538/1870/538 causal constraints (skipped 555 transitions) in 100 ms.
[2024-05-28 19:53:26] [INFO ] Added : 5 causal constraints over 1 iterations in 603 ms. Result :sat
Minimization took 1811 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[4]
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 39 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 33 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-28 19:53:28] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:53:28] [INFO ] Invariant cache hit.
[2024-05-28 19:53:29] [INFO ] Implicit Places using invariants in 853 ms returned []
[2024-05-28 19:53:29] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:53:29] [INFO ] Invariant cache hit.
[2024-05-28 19:53:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:53:36] [INFO ] Implicit Places using invariants and state equation in 6847 ms returned []
Implicit Place search using SMT with State Equation took 7702 ms to find 0 implicit places.
[2024-05-28 19:53:36] [INFO ] Redundant transitions in 26 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:53:36] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:53:36] [INFO ] Invariant cache hit.
[2024-05-28 19:53:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:53:50] [INFO ] Deduced a trap composed of 245 places in 354 ms of which 5 ms to minimize.
[2024-05-28 19:53:50] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 19:53:51] [INFO ] Deduced a trap composed of 233 places in 290 ms of which 3 ms to minimize.
[2024-05-28 19:53:51] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 3 ms to minimize.
[2024-05-28 19:53:51] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:53:52] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 4 ms to minimize.
[2024-05-28 19:53:52] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 3 ms to minimize.
[2024-05-28 19:53:52] [INFO ] Deduced a trap composed of 245 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:53:53] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:53:53] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 4 ms to minimize.
[2024-05-28 19:53:53] [INFO ] Deduced a trap composed of 196 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:53:53] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:53:54] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:53:54] [INFO ] Deduced a trap composed of 254 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:53:54] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 5 ms to minimize.
[2024-05-28 19:53:54] [INFO ] Deduced a trap composed of 196 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:53:55] [INFO ] Deduced a trap composed of 242 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:53:55] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-05-28 19:53:55] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 3 ms to minimize.
[2024-05-28 19:53:56] [INFO ] Deduced a trap composed of 242 places in 226 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:53:56] [INFO ] Deduced a trap composed of 254 places in 277 ms of which 3 ms to minimize.
[2024-05-28 19:53:57] [INFO ] Deduced a trap composed of 245 places in 293 ms of which 5 ms to minimize.
[2024-05-28 19:53:57] [INFO ] Deduced a trap composed of 248 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:53:58] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 5 ms to minimize.
[2024-05-28 19:53:58] [INFO ] Deduced a trap composed of 251 places in 268 ms of which 5 ms to minimize.
[2024-05-28 19:53:58] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:53:59] [INFO ] Deduced a trap composed of 233 places in 251 ms of which 3 ms to minimize.
[2024-05-28 19:53:59] [INFO ] Deduced a trap composed of 236 places in 317 ms of which 6 ms to minimize.
[2024-05-28 19:53:59] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 6 ms to minimize.
[2024-05-28 19:54:00] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 5 ms to minimize.
[2024-05-28 19:54:00] [INFO ] Deduced a trap composed of 260 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:54:00] [INFO ] Deduced a trap composed of 236 places in 323 ms of which 3 ms to minimize.
[2024-05-28 19:54:01] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 3 ms to minimize.
[2024-05-28 19:54:01] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 4 ms to minimize.
[2024-05-28 19:54:01] [INFO ] Deduced a trap composed of 196 places in 213 ms of which 3 ms to minimize.
[2024-05-28 19:54:01] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:54:02] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:54:02] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 3 ms to minimize.
[2024-05-28 19:54:02] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 3 ms to minimize.
[2024-05-28 19:54:02] [INFO ] Deduced a trap composed of 196 places in 224 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:54:14] [INFO ] Deduced a trap composed of 200 places in 399 ms of which 5 ms to minimize.
[2024-05-28 19:54:14] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 5 ms to minimize.
[2024-05-28 19:54:14] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:54:14] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-05-28 19:54:15] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 3 ms to minimize.
[2024-05-28 19:54:15] [INFO ] Deduced a trap composed of 200 places in 218 ms of which 4 ms to minimize.
[2024-05-28 19:54:15] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:54:15] [INFO ] Deduced a trap composed of 200 places in 228 ms of which 3 ms to minimize.
[2024-05-28 19:54:16] [INFO ] Deduced a trap composed of 196 places in 227 ms of which 3 ms to minimize.
[2024-05-28 19:54:16] [INFO ] Deduced a trap composed of 200 places in 229 ms of which 4 ms to minimize.
[2024-05-28 19:54:16] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:54:16] [INFO ] Deduced a trap composed of 200 places in 232 ms of which 3 ms to minimize.
[2024-05-28 19:54:17] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 3 ms to minimize.
[2024-05-28 19:54:17] [INFO ] Deduced a trap composed of 200 places in 307 ms of which 5 ms to minimize.
[2024-05-28 19:54:17] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 5 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 200 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:54:19] [INFO ] Deduced a trap composed of 200 places in 303 ms of which 4 ms to minimize.
[2024-05-28 19:54:19] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:54:22] [INFO ] Deduced a trap composed of 345 places in 354 ms of which 5 ms to minimize.
[2024-05-28 19:54:22] [INFO ] Deduced a trap composed of 335 places in 342 ms of which 5 ms to minimize.
[2024-05-28 19:54:23] [INFO ] Deduced a trap composed of 246 places in 318 ms of which 5 ms to minimize.
[2024-05-28 19:54:23] [INFO ] Deduced a trap composed of 239 places in 327 ms of which 5 ms to minimize.
[2024-05-28 19:54:23] [INFO ] Deduced a trap composed of 246 places in 340 ms of which 5 ms to minimize.
[2024-05-28 19:54:24] [INFO ] Deduced a trap composed of 245 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:54:24] [INFO ] Deduced a trap composed of 248 places in 344 ms of which 5 ms to minimize.
[2024-05-28 19:54:24] [INFO ] Deduced a trap composed of 258 places in 315 ms of which 5 ms to minimize.
[2024-05-28 19:54:25] [INFO ] Deduced a trap composed of 239 places in 295 ms of which 5 ms to minimize.
[2024-05-28 19:54:25] [INFO ] Deduced a trap composed of 242 places in 332 ms of which 5 ms to minimize.
[2024-05-28 19:54:25] [INFO ] Deduced a trap composed of 248 places in 319 ms of which 5 ms to minimize.
[2024-05-28 19:54:26] [INFO ] Deduced a trap composed of 306 places in 309 ms of which 5 ms to minimize.
[2024-05-28 19:54:26] [INFO ] Deduced a trap composed of 236 places in 309 ms of which 6 ms to minimize.
[2024-05-28 19:54:26] [INFO ] Deduced a trap composed of 242 places in 314 ms of which 5 ms to minimize.
[2024-05-28 19:54:27] [INFO ] Deduced a trap composed of 251 places in 305 ms of which 5 ms to minimize.
[2024-05-28 19:54:27] [INFO ] Deduced a trap composed of 248 places in 336 ms of which 5 ms to minimize.
[2024-05-28 19:54:27] [INFO ] Deduced a trap composed of 236 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:54:28] [INFO ] Deduced a trap composed of 234 places in 341 ms of which 5 ms to minimize.
[2024-05-28 19:54:28] [INFO ] Deduced a trap composed of 242 places in 311 ms of which 5 ms to minimize.
[2024-05-28 19:54:29] [INFO ] Deduced a trap composed of 251 places in 377 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:54:34] [INFO ] Deduced a trap composed of 196 places in 377 ms of which 5 ms to minimize.
[2024-05-28 19:54:34] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 5 ms to minimize.
[2024-05-28 19:54:34] [INFO ] Deduced a trap composed of 196 places in 347 ms of which 5 ms to minimize.
[2024-05-28 19:54:35] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 5 ms to minimize.
[2024-05-28 19:54:35] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 4 ms to minimize.
[2024-05-28 19:54:35] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:54:36] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:54:36] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 4 ms to minimize.
[2024-05-28 19:54:36] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 4 ms to minimize.
[2024-05-28 19:54:37] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 3 ms to minimize.
[2024-05-28 19:54:37] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 19:54:37] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2024-05-28 19:54:37] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 225 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 93/93 constraints]
After SMT, in 62996ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63043ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70815 ms. Remains : 770/770 places, 1103/1103 transitions.
[2024-05-28 19:54:39] [INFO ] Flatten gal took : 97 ms
[2024-05-28 19:54:39] [INFO ] Flatten gal took : 93 ms
[2024-05-28 19:54:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7846937080571361492.gal : 10 ms
[2024-05-28 19:54:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8548202086941665475.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7846937080571361492.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8548202086941665475.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 ...328
RANDOM walk for 40002 steps (2137 resets) in 711 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (148 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (113 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality8548202086941665475.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 868813
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :868813 after 2.58101e+06
Interrupted probabilistic random walk after 284576 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 2
Probabilistic random walk after 284576 steps, saw 86519 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-05-28 19:54:42] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:54:42] [INFO ] Invariant cache hit.
[2024-05-28 19:54:42] [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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :2.58101e+06 after 4.82519e+06
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 829 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 910 constraints, problems are : Problem set: 0 solved, 2 unsolved in 954 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1810ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 134 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 31 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:54:44] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:54:44] [INFO ] Invariant cache hit.
[2024-05-28 19:54:44] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4.82519e+06 after 6.55947e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6.55947e+06 after 8.369e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8.369e+06 after 2.05757e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:54:57] [INFO ] Deduced a trap composed of 245 places in 334 ms of which 5 ms to minimize.
[2024-05-28 19:54:58] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
[2024-05-28 19:54:58] [INFO ] Deduced a trap composed of 233 places in 320 ms of which 5 ms to minimize.
[2024-05-28 19:55:03] [INFO ] Deduced a trap composed of 196 places in 5256 ms of which 5 ms to minimize.
[2024-05-28 19:55:04] [INFO ] Deduced a trap composed of 230 places in 299 ms of which 5 ms to minimize.
[2024-05-28 19:55:04] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:55:04] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 5 ms to minimize.
[2024-05-28 19:55:05] [INFO ] Deduced a trap composed of 245 places in 313 ms of which 5 ms to minimize.
[2024-05-28 19:55:05] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-05-28 19:55:06] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 5 ms to minimize.
[2024-05-28 19:55:06] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 3 ms to minimize.
[2024-05-28 19:55:06] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 3 ms to minimize.
[2024-05-28 19:55:06] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
(s565 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 4.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 9.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 1.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 1.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 1.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 145 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 13/145 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:55:08] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:55:08] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 3 ms to minimize.
[2024-05-28 19:55:08] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:55:09] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:55:09] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:55:09] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:55:09] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 4 ms to minimize.
[2024-05-28 19:55:10] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:55:10] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:55:10] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:55:10] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:55:11] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 3 ms to minimize.
[2024-05-28 19:55:11] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:55:11] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:55:12] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:55:12] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:55:12] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:55:12] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:55:13] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 3 ms to minimize.
[2024-05-28 19:55:13] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:55:15] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 2 ms to minimize.
[2024-05-28 19:55:16] [INFO ] Deduced a trap composed of 230 places in 214 ms of which 3 ms to minimize.
[2024-05-28 19:55:17] [INFO ] Deduced a trap composed of 196 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:55:17] [INFO ] Deduced a trap composed of 196 places in 211 ms of which 3 ms to minimize.
[2024-05-28 19:55:17] [INFO ] Deduced a trap composed of 196 places in 222 ms of which 3 ms to minimize.
[2024-05-28 19:55:17] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 3 ms to minimize.
[2024-05-28 19:55:17] [INFO ] Deduced a trap composed of 196 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 196 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 200 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 196 places in 197 ms of which 3 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 200 places in 224 ms of which 4 ms to minimize.
[2024-05-28 19:55:19] [INFO ] Deduced a trap composed of 196 places in 222 ms of which 3 ms to minimize.
[2024-05-28 19:55:19] [INFO ] Deduced a trap composed of 200 places in 207 ms of which 3 ms to minimize.
[2024-05-28 19:55:19] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 3 ms to minimize.
[2024-05-28 19:55:19] [INFO ] Deduced a trap composed of 196 places in 206 ms of which 4 ms to minimize.
[2024-05-28 19:55:20] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:55:20] [INFO ] Deduced a trap composed of 196 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:55:20] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 3 ms to minimize.
[2024-05-28 19:55:20] [INFO ] Deduced a trap composed of 200 places in 213 ms of which 3 ms to minimize.
[2024-05-28 19:55:20] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:55:24] [INFO ] Deduced a trap composed of 252 places in 271 ms of which 4 ms to minimize.
[2024-05-28 19:55:24] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:55:25] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:55:25] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:55:25] [INFO ] Deduced a trap composed of 200 places in 247 ms of which 4 ms to minimize.
[2024-05-28 19:55:25] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 3 ms to minimize.
[2024-05-28 19:55:26] [INFO ] Deduced a trap composed of 200 places in 255 ms of which 3 ms to minimize.
[2024-05-28 19:55:26] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 3 ms to minimize.
[2024-05-28 19:55:26] [INFO ] Deduced a trap composed of 200 places in 275 ms of which 3 ms to minimize.
[2024-05-28 19:55:27] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
SMT process timed out in 42414ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 42427ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42461 ms. Remains : 770/770 places, 1103/1103 transitions.
RANDOM walk for 40000 steps (2059 resets) in 378 ms. (105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (133 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (146 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
Detected timeout of ITS tools.
[2024-05-28 19:55:29] [INFO ] Flatten gal took : 92 ms
[2024-05-28 19:55:29] [INFO ] Applying decomposition
[2024-05-28 19:55:29] [INFO ] Flatten gal took : 38 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/graph6485403086341127386.txt' '-o' '/tmp/graph6485403086341127386.bin' '-w' '/tmp/graph6485403086341127386.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6485403086341127386.bin' '-l' '-1' '-v' '-w' '/tmp/graph6485403086341127386.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:55:29] [INFO ] Decomposing Gal with order
[2024-05-28 19:55:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:55:30] [INFO ] Removed a total of 1264 redundant transitions.
[2024-05-28 19:55:30] [INFO ] Flatten gal took : 261 ms
Interrupted probabilistic random walk after 273813 steps, run timeout after 3013 ms. (steps per millisecond=90 ) properties seen :0 out of 2
Probabilistic random walk after 273813 steps, saw 83247 distinct states, run finished after 3013 ms. (steps per millisecond=90 ) properties seen :0
[2024-05-28 19:55:30] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:55:30] [INFO ] Invariant cache hit.
[2024-05-28 19:55:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:55:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 49 ms.
[2024-05-28 19:55:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12482712192624093106.gal : 21 ms
[2024-05-28 19:55:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2907105944177871333.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/ReachabilityCardinality12482712192624093106.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2907105944177871333.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
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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality2907105944177871333.prop.
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 124
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :124 after 125
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :125 after 125
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :125 after 126
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :126 after 126
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :126 after 162
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :162 after 164
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :164 after 167
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :167 after 174
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :174 after 190
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :190 after 196
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2072 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 2/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 910 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1581 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3697ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 36 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 28 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-28 19:55:34] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:55:34] [INFO ] Invariant cache hit.
[2024-05-28 19:55:35] [INFO ] Implicit Places using invariants in 1030 ms returned []
[2024-05-28 19:55:35] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:55:35] [INFO ] Invariant cache hit.
[2024-05-28 19:55:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:55:41] [INFO ] Implicit Places using invariants and state equation in 6560 ms returned []
Implicit Place search using SMT with State Equation took 7605 ms to find 0 implicit places.
[2024-05-28 19:55:41] [INFO ] Redundant transitions in 33 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:55:41] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:55:41] [INFO ] Invariant cache hit.
[2024-05-28 19:55:41] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :196 after 5.19572e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:55:55] [INFO ] Deduced a trap composed of 245 places in 310 ms of which 4 ms to minimize.
[2024-05-28 19:55:55] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 4 ms to minimize.
[2024-05-28 19:55:55] [INFO ] Deduced a trap composed of 233 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:55:56] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 4 ms to minimize.
[2024-05-28 19:55:56] [INFO ] Deduced a trap composed of 230 places in 314 ms of which 4 ms to minimize.
[2024-05-28 19:55:56] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 4 ms to minimize.
[2024-05-28 19:55:57] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 4 ms to minimize.
[2024-05-28 19:55:57] [INFO ] Deduced a trap composed of 245 places in 302 ms of which 5 ms to minimize.
[2024-05-28 19:55:58] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 4 ms to minimize.
[2024-05-28 19:55:58] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 4 ms to minimize.
[2024-05-28 19:55:58] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 4 ms to minimize.
[2024-05-28 19:55:58] [INFO ] Deduced a trap composed of 196 places in 295 ms of which 4 ms to minimize.
[2024-05-28 19:55:59] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-05-28 19:55:59] [INFO ] Deduced a trap composed of 254 places in 319 ms of which 4 ms to minimize.
[2024-05-28 19:55:59] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 4 ms to minimize.
[2024-05-28 19:56:00] [INFO ] Deduced a trap composed of 196 places in 783 ms of which 4 ms to minimize.
[2024-05-28 19:56:01] [INFO ] Deduced a trap composed of 242 places in 407 ms of which 4 ms to minimize.
[2024-05-28 19:56:01] [INFO ] Deduced a trap composed of 196 places in 366 ms of which 4 ms to minimize.
[2024-05-28 19:56:01] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-05-28 19:56:02] [INFO ] Deduced a trap composed of 242 places in 336 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:56:03] [INFO ] Deduced a trap composed of 254 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:56:03] [INFO ] Deduced a trap composed of 245 places in 404 ms of which 4 ms to minimize.
[2024-05-28 19:56:03] [INFO ] Deduced a trap composed of 248 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:56:04] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 4 ms to minimize.
[2024-05-28 19:56:04] [INFO ] Deduced a trap composed of 251 places in 247 ms of which 4 ms to minimize.
[2024-05-28 19:56:04] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:56:05] [INFO ] Deduced a trap composed of 233 places in 289 ms of which 4 ms to minimize.
[2024-05-28 19:56:05] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 4 ms to minimize.
[2024-05-28 19:56:05] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:56:05] [INFO ] Deduced a trap composed of 230 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:56:06] [INFO ] Deduced a trap composed of 260 places in 246 ms of which 3 ms to minimize.
[2024-05-28 19:56:06] [INFO ] Deduced a trap composed of 236 places in 257 ms of which 4 ms to minimize.
[2024-05-28 19:56:06] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:56:07] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 4 ms to minimize.
[2024-05-28 19:56:07] [INFO ] Deduced a trap composed of 196 places in 566 ms of which 29 ms to minimize.
[2024-05-28 19:56:08] [INFO ] Deduced a trap composed of 196 places in 589 ms of which 5 ms to minimize.
[2024-05-28 19:56:09] [INFO ] Deduced a trap composed of 196 places in 792 ms of which 7 ms to minimize.
[2024-05-28 19:56:09] [INFO ] Deduced a trap composed of 196 places in 533 ms of which 5 ms to minimize.
[2024-05-28 19:56:10] [INFO ] Deduced a trap composed of 196 places in 489 ms of which 4 ms to minimize.
[2024-05-28 19:56:10] [INFO ] Deduced a trap composed of 196 places in 416 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Detected timeout of ITS tools.
[2024-05-28 19:56:21] [INFO ] Deduced a trap composed of 200 places in 279 ms of which 3 ms to minimize.
[2024-05-28 19:56:21] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:56:22] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 19:56:22] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:56:22] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 5 ms to minimize.
[2024-05-28 19:56:23] [INFO ] Deduced a trap composed of 200 places in 292 ms of which 4 ms to minimize.
[2024-05-28 19:56:23] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 3 ms to minimize.
[2024-05-28 19:56:23] [INFO ] Deduced a trap composed of 200 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:56:23] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:56:24] [INFO ] Deduced a trap composed of 200 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:56:24] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 5 ms to minimize.
[2024-05-28 19:56:24] [INFO ] Deduced a trap composed of 200 places in 267 ms of which 4 ms to minimize.
[2024-05-28 19:56:24] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 19:56:25] [INFO ] Deduced a trap composed of 200 places in 261 ms of which 5 ms to minimize.
[2024-05-28 19:56:25] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-05-28 19:56:25] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 9 ms to minimize.
[2024-05-28 19:56:26] [INFO ] Deduced a trap composed of 200 places in 379 ms of which 5 ms to minimize.
[2024-05-28 19:56:26] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 6 ms to minimize.
[2024-05-28 19:56:26] [INFO ] Deduced a trap composed of 200 places in 269 ms of which 5 ms to minimize.
[2024-05-28 19:56:27] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:56:29] [INFO ] Deduced a trap composed of 345 places in 327 ms of which 5 ms to minimize.
[2024-05-28 19:56:30] [INFO ] Deduced a trap composed of 335 places in 286 ms of which 5 ms to minimize.
[2024-05-28 19:56:30] [INFO ] Deduced a trap composed of 246 places in 305 ms of which 6 ms to minimize.
[2024-05-28 19:56:30] [INFO ] Deduced a trap composed of 239 places in 269 ms of which 4 ms to minimize.
[2024-05-28 19:56:31] [INFO ] Deduced a trap composed of 246 places in 289 ms of which 5 ms to minimize.
[2024-05-28 19:56:31] [INFO ] Deduced a trap composed of 245 places in 268 ms of which 5 ms to minimize.
[2024-05-28 19:56:31] [INFO ] Deduced a trap composed of 248 places in 308 ms of which 5 ms to minimize.
[2024-05-28 19:56:32] [INFO ] Deduced a trap composed of 258 places in 265 ms of which 5 ms to minimize.
[2024-05-28 19:56:32] [INFO ] Deduced a trap composed of 239 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:56:32] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 4 ms to minimize.
[2024-05-28 19:56:32] [INFO ] Deduced a trap composed of 248 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:56:33] [INFO ] Deduced a trap composed of 306 places in 281 ms of which 5 ms to minimize.
[2024-05-28 19:56:33] [INFO ] Deduced a trap composed of 236 places in 277 ms of which 4 ms to minimize.
[2024-05-28 19:56:33] [INFO ] Deduced a trap composed of 242 places in 325 ms of which 4 ms to minimize.
[2024-05-28 19:56:34] [INFO ] Deduced a trap composed of 251 places in 300 ms of which 4 ms to minimize.
[2024-05-28 19:56:34] [INFO ] Deduced a trap composed of 248 places in 278 ms of which 4 ms to minimize.
[2024-05-28 19:56:34] [INFO ] Deduced a trap composed of 236 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:56:35] [INFO ] Deduced a trap composed of 234 places in 309 ms of which 5 ms to minimize.
[2024-05-28 19:56:35] [INFO ] Deduced a trap composed of 242 places in 317 ms of which 4 ms to minimize.
[2024-05-28 19:56:36] [INFO ] Deduced a trap composed of 251 places in 327 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:56:40] [INFO ] Deduced a trap composed of 196 places in 336 ms of which 5 ms to minimize.
[2024-05-28 19:56:41] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 3 ms to minimize.
[2024-05-28 19:56:41] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 6 ms to minimize.
[2024-05-28 19:56:41] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 5 ms to minimize.
[2024-05-28 19:56:42] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 19:56:42] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 4 ms to minimize.
[2024-05-28 19:56:42] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 4 ms to minimize.
[2024-05-28 19:56:43] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 4 ms to minimize.
[2024-05-28 19:56:43] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:56:43] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-05-28 19:56:44] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 223 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 91/91 constraints]
After SMT, in 62520ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62547ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70230 ms. Remains : 770/770 places, 1103/1103 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[4]
Ending property specific reduction for PolyORBNT-COL-S05J60-UpperBounds-06 in 232086 ms.
[2024-05-28 19:56:44] [INFO ] Flatten gal took : 53 ms
[2024-05-28 19:56:44] [INFO ] Applying decomposition
[2024-05-28 19:56:44] [INFO ] Flatten gal took : 50 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/graph7676123348803484813.txt' '-o' '/tmp/graph7676123348803484813.bin' '-w' '/tmp/graph7676123348803484813.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7676123348803484813.bin' '-l' '-1' '-v' '-w' '/tmp/graph7676123348803484813.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:56:44] [INFO ] Decomposing Gal with order
[2024-05-28 19:56:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:56:44] [INFO ] Removed a total of 1084 redundant transitions.
[2024-05-28 19:56:44] [INFO ] Flatten gal took : 169 ms
[2024-05-28 19:56:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 477 labels/synchronizations in 32 ms.
[2024-05-28 19:56:44] [INFO ] Time to serialize gal into /tmp/UpperBounds8909574390658962647.gal : 21 ms
[2024-05-28 19:56:44] [INFO ] Time to serialize properties into /tmp/UpperBounds10586491252465100228.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/UpperBounds8909574390658962647.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10586491252465100228.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 ...284
Loading property file /tmp/UpperBounds10586491252465100228.prop.

BK_STOP 1716926766572

--------------------
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-S05J60"
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-S05J60, 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-171654447000389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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