Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 34K Apr 11 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 223K Apr 11 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 PolyORBLF-PT-S02J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716916561895

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 17:16:03] [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 17:16:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:16:04] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2024-05-28 17:16:04] [INFO ] Transformed 844 places.
[2024-05-28 17:16:04] [INFO ] Transformed 1812 transitions.
[2024-05-28 17:16:04] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 326 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 17:16:04] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-05-28 17:16:04] [INFO ] Computed 58 invariants in 170 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, 10, 1, 1, +inf, 87, 1, +inf, +inf, 87, +inf]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 161 ms. (61 steps per ms)
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120008 steps (34 resets) in 612 ms. (195 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 2, 1, 0, 1, 0, 1, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, 10, +inf, 87, +inf, +inf, 87, +inf]
[2024-05-28 17:16:05] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-28 17:16:05] [INFO ] Invariant cache hit.
[2024-05-28 17:16:05] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2024-05-28 17:16:05] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 69 ms returned unsat
[2024-05-28 17:16:06] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2024-05-28 17:16:06] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 59 ms returned unsat
[2024-05-28 17:16:06] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2024-05-28 17:16:06] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 30 ms returned unsat
[2024-05-28 17:16:06] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2024-05-28 17:16:06] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 42 ms returned sat
[2024-05-28 17:16:08] [INFO ] [Real]Absence check using state equation in 2322 ms returned sat
[2024-05-28 17:16:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:16:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 17:16:08] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 27 ms returned sat
[2024-05-28 17:16:11] [INFO ] [Nat]Absence check using state equation in 2859 ms returned sat
[2024-05-28 17:16:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:16:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 17:16:12] [INFO ] [Nat]Added 120 Read/Feed constraints in 1029 ms returned unknown
[2024-05-28 17:16:12] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-28 17:16:13] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 34 ms returned sat
[2024-05-28 17:16:15] [INFO ] [Real]Absence check using state equation in 2095 ms returned sat
[2024-05-28 17:16:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:16:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-28 17:16:15] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 32 ms returned sat
[2024-05-28 17:16:17] [INFO ] [Nat]Absence check using state equation in 1703 ms returned sat
[2024-05-28 17:16:17] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 17:16:18] [INFO ] [Nat]Added 120 Read/Feed constraints in 1022 ms returned unknown
[2024-05-28 17:16:18] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-28 17:16:18] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 7 ms returned unsat
[2024-05-28 17:16:18] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-28 17:16:18] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 66 ms returned sat
[2024-05-28 17:16:19] [INFO ] [Real]Absence check using state equation in 1163 ms returned sat
[2024-05-28 17:16:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:16:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-28 17:16:19] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 43 ms returned sat
[2024-05-28 17:16:22] [INFO ] [Nat]Absence check using state equation in 2186 ms returned unknown
[2024-05-28 17:16:22] [INFO ] [Real]Absence check using 13 positive place invariants in 26 ms returned sat
[2024-05-28 17:16:22] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 49 ms returned unsat
[2024-05-28 17:16:22] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2024-05-28 17:16:22] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 129 ms returned unsat
[2024-05-28 17:16:22] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2024-05-28 17:16:22] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 29 ms returned unsat
[2024-05-28 17:16:23] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-28 17:16:23] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 42 ms returned unsat
[2024-05-28 17:16:23] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-28 17:16:23] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 38 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 2, 1, 0, 1, 0, 1, 1, 1, 1, 1] Max Struct:[2, 1, 2, +inf, +inf, 1, +inf, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[+inf, +inf, +inf]
Support contains 31 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 542 place count 572 transition count 1382
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 562 place count 572 transition count 1362
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 582 place count 552 transition count 1362
Applied a total of 582 rules in 700 ms. Remains 552 /844 variables (removed 292) and now considering 1362/1652 (removed 290) transitions.
Running 1360 sub problems to find dead transitions.
[2024-05-28 17:16:24] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 552 cols
[2024-05-28 17:16:24] [INFO ] Computed 56 invariants in 81 ms
[2024-05-28 17:16:24] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-05-28 17:16:45] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 23 ms to minimize.
[2024-05-28 17:16:45] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
[2024-05-28 17:16:45] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2024-05-28 17:16:45] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:16:45] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-05-28 17:16:45] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 2 ms to minimize.
[2024-05-28 17:16:45] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:16:46] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-05-28 17:16:46] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2024-05-28 17:16:46] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:16:46] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 4 ms to minimize.
[2024-05-28 17:16:47] [INFO ] Deduced a trap composed of 47 places in 524 ms of which 12 ms to minimize.
[2024-05-28 17:16:47] [INFO ] Deduced a trap composed of 79 places in 374 ms of which 4 ms to minimize.
[2024-05-28 17:16:48] [INFO ] Deduced a trap composed of 186 places in 445 ms of which 12 ms to minimize.
SMT process timed out in 24386ms, After SMT, problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 24452ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25251 ms. Remains : 552/844 places, 1362/1652 transitions.
[2024-05-28 17:16:48] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 17:52:14] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 17:52:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[200, 30, 360]
RANDOM walk for 1000000 steps (352 resets) in 7209 ms. (138 steps per ms)
BEST_FIRST walk for 3000002 steps (1165 resets) in 8545 ms. (351 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0] Max Struct:[200, 30, 360]
[2024-05-28 17:52:30] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 17:52:30] [INFO ] Invariant cache hit.
[2024-05-28 17:52:30] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 17:52:30] [INFO ] [Real]Absence check using 17 positive and 39 generalized place invariants in 20 ms returned sat
[2024-05-28 17:52:31] [INFO ] [Real]Absence check using state equation in 720 ms returned sat
[2024-05-28 17:52:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:52:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 17:52:31] [INFO ] [Nat]Absence check using 17 positive and 39 generalized place invariants in 19 ms returned sat
[2024-05-28 17:52:33] [INFO ] [Nat]Absence check using state equation in 1984 ms returned sat
[2024-05-28 17:52:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:52:34] [INFO ] [Nat]Added 120 Read/Feed constraints in 1042 ms returned sat
[2024-05-28 17:52:35] [INFO ] Deduced a trap composed of 59 places in 284 ms of which 4 ms to minimize.
[2024-05-28 17:52:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 354 ms
[2024-05-28 17:52:35] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 17:52:35] [INFO ] [Real]Absence check using 17 positive and 39 generalized place invariants in 24 ms returned sat
[2024-05-28 17:52:36] [INFO ] [Real]Absence check using state equation in 1273 ms returned sat
[2024-05-28 17:52:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:52:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2024-05-28 17:52:36] [INFO ] [Nat]Absence check using 17 positive and 39 generalized place invariants in 24 ms returned sat
[2024-05-28 17:52:38] [INFO ] [Nat]Absence check using state equation in 1359 ms returned sat
[2024-05-28 17:52:38] [INFO ] [Nat]Added 120 Read/Feed constraints in 791 ms returned sat
[2024-05-28 17:52:39] [INFO ] Deduced a trap composed of 23 places in 384 ms of which 8 ms to minimize.
[2024-05-28 17:52:39] [INFO ] Deduced a trap composed of 207 places in 367 ms of which 4 ms to minimize.
[2024-05-28 17:52:40] [INFO ] Deduced a trap composed of 277 places in 358 ms of which 4 ms to minimize.
[2024-05-28 17:52:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1797 ms
[2024-05-28 17:52:40] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 161 ms.
[2024-05-28 17:52:41] [INFO ] Added : 25 causal constraints over 5 iterations in 949 ms. Result :sat
Minimization took 4931 ms.
[2024-05-28 17:52:46] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-28 17:52:46] [INFO ] [Real]Absence check using 17 positive and 39 generalized place invariants in 21 ms returned sat
[2024-05-28 17:52:47] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2024-05-28 17:52:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:52:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-28 17:52:47] [INFO ] [Nat]Absence check using 17 positive and 39 generalized place invariants in 27 ms returned sat
[2024-05-28 17:52:48] [INFO ] [Nat]Absence check using state equation in 821 ms returned sat
[2024-05-28 17:52:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 17:52:57] [INFO ] [Nat]Added 120 Read/Feed constraints in 9025 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0] Max Struct:[1, 30, 360]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[30, 360]
Support contains 11 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 50 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 552/552 places, 1362/1362 transitions.
[2024-05-28 17:52:57] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 17:52:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[30, 360]
RANDOM walk for 1000000 steps (357 resets) in 5612 ms. (178 steps per ms)
BEST_FIRST walk for 2000001 steps (253 resets) in 4619 ms. (432 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[30, 360]
[2024-05-28 17:53:07] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 17:53:07] [INFO ] Invariant cache hit.
[2024-05-28 17:53:07] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2024-05-28 17:53:07] [INFO ] [Real]Absence check using 17 positive and 39 generalized place invariants in 27 ms returned sat
[2024-05-28 17:53:09] [INFO ] [Real]Absence check using state equation in 1122 ms returned sat
[2024-05-28 17:53:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:53:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-28 17:53:09] [INFO ] [Nat]Absence check using 17 positive and 39 generalized place invariants in 17 ms returned sat
[2024-05-28 17:53:10] [INFO ] [Nat]Absence check using state equation in 1184 ms returned sat
[2024-05-28 17:53:10] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:53:10] [INFO ] [Nat]Added 120 Read/Feed constraints in 521 ms returned sat
[2024-05-28 17:53:11] [INFO ] Deduced a trap composed of 23 places in 393 ms of which 4 ms to minimize.
[2024-05-28 17:53:11] [INFO ] Deduced a trap composed of 207 places in 337 ms of which 3 ms to minimize.
[2024-05-28 17:53:12] [INFO ] Deduced a trap composed of 277 places in 354 ms of which 5 ms to minimize.
[2024-05-28 17:53:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1712 ms
[2024-05-28 17:53:12] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 125 ms.
[2024-05-28 17:53:13] [INFO ] Added : 25 causal constraints over 5 iterations in 698 ms. Result :sat
Minimization took 4896 ms.
[2024-05-28 17:53:18] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2024-05-28 17:53:18] [INFO ] [Real]Absence check using 17 positive and 39 generalized place invariants in 28 ms returned sat
[2024-05-28 17:53:19] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2024-05-28 17:53:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:53:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2024-05-28 17:53:19] [INFO ] [Nat]Absence check using 17 positive and 39 generalized place invariants in 23 ms returned sat
[2024-05-28 17:53:20] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2024-05-28 17:53:24] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 17:53:29] [INFO ] [Nat]Added 120 Read/Feed constraints in 9014 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[30, 360]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[30, 360]
Support contains 11 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 46 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 552/552 places, 1362/1362 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 33 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
[2024-05-28 17:53:29] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 17:53:29] [INFO ] Invariant cache hit.
[2024-05-28 17:53:29] [INFO ] Implicit Places using invariants in 756 ms returned [66, 133, 165, 292, 338, 367, 370, 408, 519, 550]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 760 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 542/552 places, 1362/1362 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 533 transition count 1353
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 533 transition count 1353
Applied a total of 18 rules in 57 ms. Remains 533 /542 variables (removed 9) and now considering 1353/1362 (removed 9) transitions.
[2024-05-28 17:53:29] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
// Phase 1: matrix 1333 rows 533 cols
[2024-05-28 17:53:29] [INFO ] Computed 46 invariants in 20 ms
[2024-05-28 17:53:30] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-28 17:53:30] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:53:30] [INFO ] Invariant cache hit.
[2024-05-28 17:53:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:53:42] [INFO ] Implicit Places using invariants and state equation in 12140 ms returned []
Implicit Place search using SMT with State Equation took 12749 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 533/552 places, 1353/1362 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13601 ms. Remains : 533/552 places, 1353/1362 transitions.
[2024-05-28 17:53:42] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:53:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[30, 360]
RANDOM walk for 1000000 steps (325 resets) in 5606 ms. (178 steps per ms)
BEST_FIRST walk for 2000002 steps (242 resets) in 4709 ms. (424 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[30, 360]
[2024-05-28 17:53:53] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:53:53] [INFO ] Invariant cache hit.
[2024-05-28 17:53:53] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-28 17:53:53] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 30 ms returned sat
[2024-05-28 17:53:54] [INFO ] [Real]Absence check using state equation in 920 ms returned sat
[2024-05-28 17:53:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:53:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-28 17:53:54] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 32 ms returned sat
[2024-05-28 17:53:56] [INFO ] [Nat]Absence check using state equation in 2333 ms returned sat
[2024-05-28 17:53:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:53:58] [INFO ] [Nat]Added 120 Read/Feed constraints in 2371 ms returned sat
[2024-05-28 17:53:59] [INFO ] Deduced a trap composed of 23 places in 386 ms of which 3 ms to minimize.
[2024-05-28 17:53:59] [INFO ] Deduced a trap composed of 226 places in 320 ms of which 3 ms to minimize.
[2024-05-28 17:53:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 844 ms
[2024-05-28 17:53:59] [INFO ] Computed and/alt/rep : 401/910/391 causal constraints (skipped 940 transitions) in 98 ms.
[2024-05-28 17:54:00] [INFO ] Added : 30 causal constraints over 6 iterations in 796 ms. Result :sat
Minimization took 5085 ms.
[2024-05-28 17:54:05] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-28 17:54:05] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 29 ms returned sat
[2024-05-28 17:54:06] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2024-05-28 17:54:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:54:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-28 17:54:06] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 41 ms returned sat
[2024-05-28 17:54:18] [INFO ] [Nat]Absence check using state equation in 12117 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[30, 360]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[30, 360]
Support contains 11 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 64 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 48 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-05-28 17:54:19] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:54:19] [INFO ] Invariant cache hit.
[2024-05-28 17:54:19] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-28 17:54:19] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:54:19] [INFO ] Invariant cache hit.
[2024-05-28 17:54:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:54:31] [INFO ] Implicit Places using invariants and state equation in 11471 ms returned []
Implicit Place search using SMT with State Equation took 12135 ms to find 0 implicit places.
[2024-05-28 17:54:31] [INFO ] Redundant transitions in 78 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-05-28 17:54:31] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:54:31] [INFO ] Invariant cache hit.
[2024-05-28 17:54:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 17:54:44] [INFO ] Deduced a trap composed of 44 places in 192 ms of which 2 ms to minimize.
[2024-05-28 17:54:44] [INFO ] Deduced a trap composed of 79 places in 170 ms of which 3 ms to minimize.
[2024-05-28 17:54:44] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 3 ms to minimize.
[2024-05-28 17:54:45] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 2 ms to minimize.
[2024-05-28 17:54:45] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:54:45] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:54:45] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:54:45] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:54:45] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:54:45] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-28 17:54:45] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:54:45] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 6 ms to minimize.
[2024-05-28 17:54:46] [INFO ] Deduced a trap composed of 82 places in 341 ms of which 5 ms to minimize.
[2024-05-28 17:54:48] [INFO ] Deduced a trap composed of 186 places in 339 ms of which 4 ms to minimize.
[2024-05-28 17:54:52] [INFO ] Deduced a trap composed of 332 places in 278 ms of which 4 ms to minimize.
[2024-05-28 17:54:56] [INFO ] Deduced a trap composed of 178 places in 272 ms of which 4 ms to minimize.
[2024-05-28 17:54:57] [INFO ] Deduced a trap composed of 188 places in 328 ms of which 4 ms to minimize.
[2024-05-28 17:54:57] [INFO ] Deduced a trap composed of 243 places in 378 ms of which 4 ms to minimize.
[2024-05-28 17:54:58] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 3 ms to minimize.
[2024-05-28 17:54:59] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 64 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 17:55:24] [INFO ] Deduced a trap composed of 199 places in 254 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 21/21 constraints]
After SMT, in 63063ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 63081ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75359 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 40000 steps (17 resets) in 1541 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 441 ms. (90 steps per ms) remains 4/4 properties
[2024-05-28 17:55:35] [INFO ] Flatten gal took : 342 ms
BEST_FIRST walk for 40004 steps (15 resets) in 581 ms. (68 steps per ms) remains 4/4 properties
[2024-05-28 17:55:35] [INFO ] Flatten gal took : 149 ms
BEST_FIRST walk for 40002 steps (11 resets) in 453 ms. (88 steps per ms) remains 4/4 properties
[2024-05-28 17:55:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16793121207641690936.gal : 74 ms
[2024-05-28 17:55:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18160628293728348599.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/ReachabilityCardinality16793121207641690936.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18160628293728348599.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40003 steps (11 resets) in 575 ms. (69 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality18160628293728348599.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :15 after 22
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :22 after 80
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :80 after 234
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :234 after 1916
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1916 after 1922
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1922 after 1928
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1928 after 2060
Interrupted probabilistic random walk after 60708 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 4
Probabilistic random walk after 60708 steps, saw 43016 distinct states, run finished after 3005 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-28 17:55:38] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:55:38] [INFO ] Invariant cache hit.
[2024-05-28 17:55:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
At refinement iteration 1 (OVERLAPS) 297/308 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2060 after 2124
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2124 after 3024
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3258 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 297/308 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 17:55:43] [INFO ] Deduced a trap composed of 44 places in 362 ms of which 4 ms to minimize.
[2024-05-28 17:55:43] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 3 ms to minimize.
[2024-05-28 17:55:43] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 3 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :3024 after 8022
[2024-05-28 17:55:43] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 3 ms to minimize.
[2024-05-28 17:55:44] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 2 ms to minimize.
[2024-05-28 17:55:44] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 1 ms to minimize.
[2024-05-28 17:55:44] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2024-05-28 17:55:44] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 8/52 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 17:55:45] [INFO ] Deduced a trap composed of 45 places in 1267 ms of which 26 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/531 variables, 1/54 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1864/1866 variables, and 585 constraints, problems are : Problem set: 2 solved, 2 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 531/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 8318ms problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 62 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Running 1351 sub problems to find dead transitions.
[2024-05-28 17:55:47] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:55:47] [INFO ] Invariant cache hit.
[2024-05-28 17:55:47] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :8022 after 10942
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 17:56:00] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 2 ms to minimize.
[2024-05-28 17:56:00] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 2 ms to minimize.
[2024-05-28 17:56:00] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 8 ms to minimize.
[2024-05-28 17:56:00] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:56:00] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2024-05-28 17:56:01] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:56:01] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:56:01] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:56:01] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:56:01] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:56:01] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 14 ms to minimize.
[2024-05-28 17:56:01] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :10942 after 23654
[2024-05-28 17:56:02] [INFO ] Deduced a trap composed of 82 places in 387 ms of which 5 ms to minimize.
[2024-05-28 17:56:04] [INFO ] Deduced a trap composed of 186 places in 225 ms of which 3 ms to minimize.
[2024-05-28 17:56:07] [INFO ] Deduced a trap composed of 332 places in 392 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 59 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 17:56:24] [INFO ] Deduced a trap composed of 55 places in 247 ms of which 8 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :23654 after 159030
Detected timeout of ITS tools.
[2024-05-28 17:56:25] [INFO ] Deduced a trap composed of 222 places in 557 ms of which 3 ms to minimize.
[2024-05-28 17:56:25] [INFO ] Flatten gal took : 137 ms
[2024-05-28 17:56:25] [INFO ] Applying decomposition
[2024-05-28 17:56:26] [INFO ] Flatten gal took : 147 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/graph2907041996921512375.txt' '-o' '/tmp/graph2907041996921512375.bin' '-w' '/tmp/graph2907041996921512375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2907041996921512375.bin' '-l' '-1' '-v' '-w' '/tmp/graph2907041996921512375.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:56:26] [INFO ] Decomposing Gal with order
[2024-05-28 17:56:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:56:27] [INFO ] Removed a total of 1450 redundant transitions.
[2024-05-28 17:56:27] [INFO ] Flatten gal took : 653 ms
[2024-05-28 17:56:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 473 labels/synchronizations in 103 ms.
[2024-05-28 17:56:27] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 2 ms to minimize.
[2024-05-28 17:56:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16742048574921307057.gal : 38 ms
[2024-05-28 17:56:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7576049052475914377.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/ReachabilityCardinality16742048574921307057.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7576049052475914377.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7576049052475914377.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :13 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15 after 22
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :22 after 28
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :28 after 36
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :36 after 184
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :184 after 6814
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 62 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 18/18 constraints]
After SMT, in 43606ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 43667ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43735 ms. Remains : 533/533 places, 1353/1353 transitions.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6814 after 13584
RANDOM walk for 40000 steps (18 resets) in 691 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (10 resets) in 396 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (11 resets) in 290 ms. (137 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :13584 after 13854
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13854 after 14128
Interrupted probabilistic random walk after 119858 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 2
Probabilistic random walk after 119858 steps, saw 83177 distinct states, run finished after 3013 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-28 17:56:34] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:56:34] [INFO ] Invariant cache hit.
[2024-05-28 17:56:34] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 297/308 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1154 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 297/308 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :14128 after 14645
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:56:36] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 2 ms to minimize.
[2024-05-28 17:56:36] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 3 ms to minimize.
[2024-05-28 17:56:38] [INFO ] Deduced a trap composed of 44 places in 2141 ms of which 3 ms to minimize.
[2024-05-28 17:56:38] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 2 ms to minimize.
[2024-05-28 17:56:38] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 1 ms to minimize.
[2024-05-28 17:56:38] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 3 ms to minimize.
[2024-05-28 17:56:38] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:56:38] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 17:56:39] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/531 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1333/1864 variables, 531/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 120/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MIN1 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 2/707 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 0/707 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1866 variables, 2/709 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1866 variables, 1/710 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 17:56:42] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1866 variables, 1/711 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1866 variables, 0/711 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1866 variables, 0/711 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1866/1866 variables, and 711 constraints, problems are : Problem set: 1 solved, 1 unsolved in 7412 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 8608ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 21 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 40000 steps (15 resets) in 552 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 199731 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 199731 steps, saw 135722 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-28 17:56:46] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:56:46] [INFO ] Invariant cache hit.
[2024-05-28 17:56:46] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:56:47] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 4 ms to minimize.
[2024-05-28 17:56:48] [INFO ] Deduced a trap composed of 44 places in 266 ms of which 3 ms to minimize.
[2024-05-28 17:56:48] [INFO ] Deduced a trap composed of 44 places in 256 ms of which 3 ms to minimize.
[2024-05-28 17:56:48] [INFO ] Deduced a trap composed of 44 places in 264 ms of which 3 ms to minimize.
[2024-05-28 17:56:48] [INFO ] Deduced a trap composed of 44 places in 257 ms of which 3 ms to minimize.
[2024-05-28 17:56:49] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 3 ms to minimize.
[2024-05-28 17:56:49] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 3 ms to minimize.
[2024-05-28 17:56:49] [INFO ] Deduced a trap composed of 248 places in 306 ms of which 3 ms to minimize.
[2024-05-28 17:56:49] [INFO ] Deduced a trap composed of 226 places in 295 ms of which 3 ms to minimize.
[2024-05-28 17:56:50] [INFO ] Deduced a trap composed of 201 places in 282 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/531 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1333/1864 variables, 531/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 120/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1866 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1866 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:56:52] [INFO ] Deduced a trap composed of 23 places in 361 ms of which 3 ms to minimize.
[2024-05-28 17:56:53] [INFO ] Deduced a trap composed of 177 places in 339 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1866 variables, 2/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1866 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1866 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1866/1866 variables, and 712 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6118 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 7067ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 117 ms.
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 42 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 42 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-05-28 17:56:53] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:56:53] [INFO ] Invariant cache hit.
[2024-05-28 17:56:54] [INFO ] Implicit Places using invariants in 867 ms returned []
[2024-05-28 17:56:54] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:56:54] [INFO ] Invariant cache hit.
[2024-05-28 17:56:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:57:11] [INFO ] Implicit Places using invariants and state equation in 17099 ms returned []
Implicit Place search using SMT with State Equation took 17982 ms to find 0 implicit places.
[2024-05-28 17:57:11] [INFO ] Redundant transitions in 20 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-05-28 17:57:11] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:57:11] [INFO ] Invariant cache hit.
[2024-05-28 17:57:11] [INFO ] State equation strengthened by 120 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 17:57:24] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 3 ms to minimize.
[2024-05-28 17:57:24] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 2 ms to minimize.
[2024-05-28 17:57:24] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 3 ms to minimize.
[2024-05-28 17:57:24] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:57:24] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:57:24] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 0 ms to minimize.
[2024-05-28 17:57:25] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:57:25] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:57:25] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:57:25] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:57:25] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-05-28 17:57:25] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:57:26] [INFO ] Deduced a trap composed of 82 places in 239 ms of which 3 ms to minimize.
[2024-05-28 17:57:28] [INFO ] Deduced a trap composed of 186 places in 215 ms of which 3 ms to minimize.
[2024-05-28 17:57:31] [INFO ] Deduced a trap composed of 332 places in 234 ms of which 2 ms to minimize.
[2024-05-28 17:57:35] [INFO ] Deduced a trap composed of 178 places in 252 ms of which 3 ms to minimize.
[2024-05-28 17:57:35] [INFO ] Deduced a trap composed of 188 places in 227 ms of which 3 ms to minimize.
[2024-05-28 17:57:36] [INFO ] Deduced a trap composed of 243 places in 260 ms of which 3 ms to minimize.
[2024-05-28 17:57:36] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 2 ms to minimize.
[2024-05-28 17:57:37] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 17:57:43] [INFO ] Deduced a trap composed of 200 places in 303 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 17:58:14] [INFO ] Deduced a trap composed of 62 places in 250 ms of which 4 ms to minimize.
[2024-05-28 17:58:14] [INFO ] Deduced a trap composed of 172 places in 257 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 67 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 23/23 constraints]
After SMT, in 63582ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 63613ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81700 ms. Remains : 533/533 places, 1353/1353 transitions.
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-08 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[30]
Starting property specific reduction for PolyORBLF-PT-S02J06T10-UpperBounds-04
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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
[2024-05-28 17:58:15] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:58:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (3 resets) in 56 ms. (175 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[30]
[2024-05-28 17:58:15] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:58:15] [INFO ] Invariant cache hit.
[2024-05-28 17:58:15] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-28 17:58:15] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 31 ms returned sat
[2024-05-28 17:58:16] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2024-05-28 17:58:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:58:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-28 17:58:16] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 29 ms returned sat
[2024-05-28 17:58:19] [INFO ] [Nat]Absence check using state equation in 2755 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[30]
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 23 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Running 1351 sub problems to find dead transitions.
[2024-05-28 17:58:19] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:58:19] [INFO ] Invariant cache hit.
[2024-05-28 17:58:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 17:58:31] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 2 ms to minimize.
[2024-05-28 17:58:31] [INFO ] Deduced a trap composed of 79 places in 203 ms of which 2 ms to minimize.
[2024-05-28 17:58:32] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 2 ms to minimize.
[2024-05-28 17:58:32] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:58:32] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:58:32] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:58:32] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:58:32] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:58:32] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:58:32] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-05-28 17:58:32] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-05-28 17:58:32] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 0 ms to minimize.
[2024-05-28 17:58:33] [INFO ] Deduced a trap composed of 82 places in 252 ms of which 3 ms to minimize.
[2024-05-28 17:58:34] [INFO ] Deduced a trap composed of 186 places in 220 ms of which 2 ms to minimize.
[2024-05-28 17:58:37] [INFO ] Deduced a trap composed of 332 places in 219 ms of which 2 ms to minimize.
[2024-05-28 17:58:41] [INFO ] Deduced a trap composed of 178 places in 300 ms of which 3 ms to minimize.
[2024-05-28 17:58:42] [INFO ] Deduced a trap composed of 188 places in 341 ms of which 4 ms to minimize.
[2024-05-28 17:58:43] [INFO ] Deduced a trap composed of 243 places in 355 ms of which 4 ms to minimize.
SMT process timed out in 23746ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 23761ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23790 ms. Remains : 533/533 places, 1353/1353 transitions.
[2024-05-28 17:58:43] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:58:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 1000000 steps (357 resets) in 5447 ms. (183 steps per ms)
BEST_FIRST walk for 1000000 steps (151 resets) in 2166 ms. (461 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[30]
[2024-05-28 17:58:50] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:58:50] [INFO ] Invariant cache hit.
[2024-05-28 17:58:50] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-28 17:58:50] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 21 ms returned sat
[2024-05-28 17:58:51] [INFO ] [Real]Absence check using state equation in 752 ms returned sat
[2024-05-28 17:58:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 17:58:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-28 17:58:51] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 28 ms returned sat
[2024-05-28 17:58:54] [INFO ] [Nat]Absence check using state equation in 2525 ms returned sat
[2024-05-28 17:58:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:58:56] [INFO ] [Nat]Added 120 Read/Feed constraints in 2482 ms returned sat
[2024-05-28 17:58:57] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 3 ms to minimize.
[2024-05-28 17:58:57] [INFO ] Deduced a trap composed of 226 places in 327 ms of which 4 ms to minimize.
[2024-05-28 17:58:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 707 ms
[2024-05-28 17:58:57] [INFO ] Computed and/alt/rep : 401/910/391 causal constraints (skipped 940 transitions) in 106 ms.
[2024-05-28 17:58:58] [INFO ] Added : 30 causal constraints over 6 iterations in 600 ms. Result :sat
Minimization took 5119 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[30]
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 41 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 30 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-05-28 17:59:03] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:59:03] [INFO ] Invariant cache hit.
[2024-05-28 17:59:03] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-28 17:59:03] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:59:03] [INFO ] Invariant cache hit.
[2024-05-28 17:59:04] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 17:59:20] [INFO ] Implicit Places using invariants and state equation in 16443 ms returned []
Implicit Place search using SMT with State Equation took 17016 ms to find 0 implicit places.
[2024-05-28 17:59:20] [INFO ] Redundant transitions in 97 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-05-28 17:59:20] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 17:59:20] [INFO ] Invariant cache hit.
[2024-05-28 17:59:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 17:59:32] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 2 ms to minimize.
[2024-05-28 17:59:32] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 2 ms to minimize.
[2024-05-28 17:59:32] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 2 ms to minimize.
[2024-05-28 17:59:32] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:59:32] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:59:32] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:59:33] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:59:33] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:59:33] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:59:33] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2024-05-28 17:59:33] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 0 ms to minimize.
[2024-05-28 17:59:33] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-05-28 17:59:34] [INFO ] Deduced a trap composed of 82 places in 331 ms of which 3 ms to minimize.
[2024-05-28 17:59:35] [INFO ] Deduced a trap composed of 186 places in 258 ms of which 2 ms to minimize.
[2024-05-28 17:59:39] [INFO ] Deduced a trap composed of 332 places in 334 ms of which 3 ms to minimize.
[2024-05-28 17:59:42] [INFO ] Deduced a trap composed of 178 places in 217 ms of which 3 ms to minimize.
[2024-05-28 17:59:43] [INFO ] Deduced a trap composed of 188 places in 216 ms of which 2 ms to minimize.
[2024-05-28 17:59:43] [INFO ] Deduced a trap composed of 243 places in 314 ms of which 4 ms to minimize.
[2024-05-28 17:59:43] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-28 17:59:44] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 17:59:51] [INFO ] Deduced a trap composed of 200 places in 262 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 21/21 constraints]
After SMT, in 63009ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 63034ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80200 ms. Remains : 533/533 places, 1353/1353 transitions.
[2024-05-28 18:00:23] [INFO ] Flatten gal took : 289 ms
RANDOM walk for 40000 steps (15 resets) in 924 ms. (43 steps per ms) remains 2/2 properties
[2024-05-28 18:00:23] [INFO ] Flatten gal took : 128 ms
[2024-05-28 18:00:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5497302286663473739.gal : 8 ms
[2024-05-28 18:00:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2736291436299948166.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/ReachabilityCardinality5497302286663473739.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2736291436299948166.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
BEST_FIRST walk for 40003 steps (12 resets) in 648 ms. (61 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality2736291436299948166.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 471 ms. (84 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :15 after 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 80
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :80 after 234
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :234 after 1916
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1916 after 1922
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1922 after 1928
Interrupted probabilistic random walk after 130700 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 130700 steps, saw 90325 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-28 18:00:27] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 18:00:27] [INFO ] Invariant cache hit.
[2024-05-28 18:00:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 18:00:27] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 3 ms to minimize.
[2024-05-28 18:00:27] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1928 after 2060
[2024-05-28 18:00:28] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2060 after 2124
[2024-05-28 18:00:28] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 4/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/531 variables, 1/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1333/1864 variables, 531/580 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 120/700 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 0/700 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1866 variables, 2/702 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 1/703 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1866 variables, 0/703 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1866 variables, 0/703 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 703 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2014 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 4/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 18:00:30] [INFO ] Deduced a trap composed of 44 places in 660 ms of which 3 ms to minimize.
[2024-05-28 18:00:30] [INFO ] Deduced a trap composed of 44 places in 329 ms of which 4 ms to minimize.
[2024-05-28 18:00:30] [INFO ] Deduced a trap composed of 44 places in 319 ms of which 4 ms to minimize.
[2024-05-28 18:00:31] [INFO ] Deduced a trap composed of 232 places in 366 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2124 after 3024
[2024-05-28 18:00:31] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 5/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/531 variables, 1/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1864/1866 variables, and 585 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3483 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 531/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 5525ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 32 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Running 1351 sub problems to find dead transitions.
[2024-05-28 18:00:32] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 18:00:32] [INFO ] Invariant cache hit.
[2024-05-28 18:00:32] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3024 after 8022
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8022 after 10942
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 18:00:44] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-05-28 18:00:45] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2024-05-28 18:00:45] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 2 ms to minimize.
[2024-05-28 18:00:45] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2024-05-28 18:00:47] [INFO ] Deduced a trap composed of 44 places in 2431 ms of which 27 ms to minimize.
[2024-05-28 18:00:50] [INFO ] Deduced a trap composed of 45 places in 2446 ms of which 27 ms to minimize.
[2024-05-28 18:00:50] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 1 ms to minimize.
[2024-05-28 18:00:50] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 1 ms to minimize.
[2024-05-28 18:00:50] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2024-05-28 18:00:50] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2024-05-28 18:00:50] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 0 ms to minimize.
[2024-05-28 18:00:50] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 0 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10942 after 23654
[2024-05-28 18:01:03] [INFO ] Deduced a trap composed of 82 places in 11922 ms of which 3 ms to minimize.
SMT process timed out in 30758ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 30793ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30827 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 40000 steps (13 resets) in 372 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (11 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 197622 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 197622 steps, saw 134361 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-28 18:01:06] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 18:01:06] [INFO ] Invariant cache hit.
[2024-05-28 18:01:06] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1063 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 18:01:08] [INFO ] Deduced a trap composed of 44 places in 493 ms of which 5 ms to minimize.
[2024-05-28 18:01:09] [INFO ] Deduced a trap composed of 44 places in 443 ms of which 5 ms to minimize.
[2024-05-28 18:01:09] [INFO ] Deduced a trap composed of 44 places in 525 ms of which 19 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :23654 after 159030
Detected timeout of ITS tools.
[2024-05-28 18:01:14] [INFO ] Flatten gal took : 99 ms
[2024-05-28 18:01:14] [INFO ] Applying decomposition
[2024-05-28 18:01:14] [INFO ] Flatten gal took : 98 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/graph10828626624451866300.txt' '-o' '/tmp/graph10828626624451866300.bin' '-w' '/tmp/graph10828626624451866300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10828626624451866300.bin' '-l' '-1' '-v' '-w' '/tmp/graph10828626624451866300.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:01:14] [INFO ] Decomposing Gal with order
[2024-05-28 18:01:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:01:14] [INFO ] Removed a total of 1196 redundant transitions.
[2024-05-28 18:01:15] [INFO ] Flatten gal took : 450 ms
[2024-05-28 18:01:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 478 labels/synchronizations in 62 ms.
[2024-05-28 18:01:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8279379575072419008.gal : 38 ms
[2024-05-28 18:01:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4985649908558006045.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/ReachabilityCardinality8279379575072419008.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4985649908558006045.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
[2024-05-28 18:01:15] [INFO ] Deduced a trap composed of 44 places in 6008 ms of which 3 ms to minimize.
Loading property file /tmp/ReachabilityCardinality4985649908558006045.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 13
[2024-05-28 18:01:16] [INFO ] Deduced a trap composed of 44 places in 407 ms of which 5 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :13 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 54
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :54 after 80
[2024-05-28 18:01:16] [INFO ] Deduced a trap composed of 44 places in 414 ms of which 6 ms to minimize.
[2024-05-28 18:01:16] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 2 ms to minimize.
[2024-05-28 18:01:16] [INFO ] Deduced a trap composed of 248 places in 227 ms of which 3 ms to minimize.
[2024-05-28 18:01:17] [INFO ] Deduced a trap composed of 226 places in 226 ms of which 3 ms to minimize.
[2024-05-28 18:01:17] [INFO ] Deduced a trap composed of 201 places in 230 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/531 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :80 after 1762
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1762 after 3962
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3962 after 4006
At refinement iteration 12 (OVERLAPS) 1333/1864 variables, 531/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4006 after 4296
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 120/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1866 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1866 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
[2024-05-28 18:01:20] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 2 ms to minimize.
SDD size :4296 after 4458
At refinement iteration 18 (INCLUDED_ONLY) 0/1866 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1866 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1866 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1866/1866 variables, and 711 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12704 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 13800ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 20 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 19 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-05-28 18:01:20] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 18:01:20] [INFO ] Invariant cache hit.
[2024-05-28 18:01:21] [INFO ] Implicit Places using invariants in 760 ms returned []
[2024-05-28 18:01:21] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 18:01:21] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4458 after 4712
[2024-05-28 18:01:22] [INFO ] State equation strengthened by 120 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4712 after 5696
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5696 after 7936
[2024-05-28 18:01:39] [INFO ] Implicit Places using invariants and state equation in 18479 ms returned []
Implicit Place search using SMT with State Equation took 19244 ms to find 0 implicit places.
[2024-05-28 18:01:39] [INFO ] Redundant transitions in 39 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-05-28 18:01:40] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 18:01:40] [INFO ] Invariant cache hit.
[2024-05-28 18:01:40] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 18:01:59] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 2 ms to minimize.
[2024-05-28 18:01:59] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 2 ms to minimize.
[2024-05-28 18:02:00] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 2 ms to minimize.
[2024-05-28 18:02:00] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-28 18:02:00] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-05-28 18:02:00] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 2 ms to minimize.
[2024-05-28 18:02:00] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-28 18:02:00] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:02:00] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-28 18:02:00] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-05-28 18:02:00] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-05-28 18:02:00] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-28 18:02:01] [INFO ] Deduced a trap composed of 82 places in 298 ms of which 4 ms to minimize.
[2024-05-28 18:02:03] [INFO ] Deduced a trap composed of 186 places in 250 ms of which 3 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 18:02:06] [INFO ] Deduced a trap composed of 332 places in 321 ms of which 4 ms to minimize.
[2024-05-28 18:02:10] [INFO ] Deduced a trap composed of 178 places in 263 ms of which 3 ms to minimize.
[2024-05-28 18:02:11] [INFO ] Deduced a trap composed of 188 places in 255 ms of which 2 ms to minimize.
[2024-05-28 18:02:11] [INFO ] Deduced a trap composed of 243 places in 292 ms of which 3 ms to minimize.
[2024-05-28 18:02:11] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 2 ms to minimize.
[2024-05-28 18:02:12] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 64 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 18:02:33] [INFO ] Deduced a trap composed of 199 places in 341 ms of which 5 ms to minimize.
[2024-05-28 18:02:43] [INFO ] Deduced a trap composed of 168 places in 355 ms of which 3 ms to minimize.
[2024-05-28 18:02:43] [INFO ] Deduced a trap composed of 221 places in 299 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 67 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 23/23 constraints]
After SMT, in 64087ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 64109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83428 ms. Remains : 533/533 places, 1353/1353 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[30]
Ending property specific reduction for PolyORBLF-PT-S02J06T10-UpperBounds-04 in 268758 ms.
[2024-05-28 18:02:44] [INFO ] Flatten gal took : 70 ms
[2024-05-28 18:02:44] [INFO ] Applying decomposition
[2024-05-28 18:02:44] [INFO ] Flatten gal took : 53 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/graph11437483246652169956.txt' '-o' '/tmp/graph11437483246652169956.bin' '-w' '/tmp/graph11437483246652169956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11437483246652169956.bin' '-l' '-1' '-v' '-w' '/tmp/graph11437483246652169956.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:02:44] [INFO ] Decomposing Gal with order
[2024-05-28 18:02:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:02:44] [INFO ] Removed a total of 1328 redundant transitions.
[2024-05-28 18:02:44] [INFO ] Flatten gal took : 137 ms
[2024-05-28 18:02:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 310 labels/synchronizations in 23 ms.
[2024-05-28 18:02:44] [INFO ] Time to serialize gal into /tmp/UpperBounds11851642074981641604.gal : 11 ms
[2024-05-28 18:02:44] [INFO ] Time to serialize properties into /tmp/UpperBounds6168001947429946784.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/UpperBounds11851642074981641604.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6168001947429946784.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 ...305
Loading property file /tmp/UpperBounds6168001947429946784.prop.
ITS-tools command line returned an error code 137
[2024-05-28 18:12:29] [INFO ] Flatten gal took : 57 ms
[2024-05-28 18:12:29] [INFO ] Time to serialize gal into /tmp/UpperBounds1142889113964066458.gal : 12 ms
[2024-05-28 18:12:29] [INFO ] Time to serialize properties into /tmp/UpperBounds8010371563902903996.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/UpperBounds1142889113964066458.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8010371563902903996.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 ...304
Loading property file /tmp/UpperBounds8010371563902903996.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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="PolyORBLF-PT-S02J06T10"
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 PolyORBLF-PT-S02J06T10, 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-171654446700261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T10.tgz
mv PolyORBLF-PT-S02J06T10 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 ;