Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 23K Apr 12 11:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 11:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 958K Apr 12 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Apr 12 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 12 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716932926991

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-28 21:48:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 21:48:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:48:49] [INFO ] Load time of PNML (sax parser for PT used): 769 ms
[2024-05-28 21:48:49] [INFO ] Transformed 474 places.
[2024-05-28 21:48:49] [INFO ] Transformed 11760 transitions.
[2024-05-28 21:48:49] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 1022 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 10, 1, 0, 0, 0, 0, 0] 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, 1, 0, 0, 0, 0, 10, 1, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 21:48:49] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-05-28 21:48:49] [INFO ] Computed 72 invariants in 135 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 10, 1, 0, 0, 0, 0, 0] Max Struct:[190, 68, 23, 61, 158, 39, 158, 39, 10, 1, 4, 118, 98, 752, 1]
FORMULA PolyORBNT-PT-S10J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (560 resets) in 300 ms. (33 steps per ms)
BEST_FIRST walk for 130012 steps (1375 resets) in 664 ms. (195 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[190, 68, 23, 61, 158, 39, 158, 39, 4, 118, 98, 752, 1]
[2024-05-28 21:48:50] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-05-28 21:48:50] [INFO ] Invariant cache hit.
[2024-05-28 21:48:51] [INFO ] [Real]Absence check using 45 positive place invariants in 28 ms returned sat
[2024-05-28 21:48:51] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 21 ms returned unsat
[2024-05-28 21:48:51] [INFO ] [Real]Absence check using 45 positive place invariants in 23 ms returned sat
[2024-05-28 21:48:51] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 25 ms returned sat
[2024-05-28 21:48:52] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2024-05-28 21:48:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:48:52] [INFO ] [Nat]Absence check using 45 positive place invariants in 16 ms returned sat
[2024-05-28 21:48:52] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 17 ms returned sat
[2024-05-28 21:48:53] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2024-05-28 21:48:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:48:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 57 ms returned sat
[2024-05-28 21:48:53] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 520 ms.
[2024-05-28 21:48:54] [INFO ] Added : 6 causal constraints over 2 iterations in 983 ms. Result :sat
Minimization took 816 ms.
[2024-05-28 21:48:55] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-28 21:48:55] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 22 ms returned sat
[2024-05-28 21:48:55] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2024-05-28 21:48:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:48:56] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 21:48:56] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-28 21:48:56] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2024-05-28 21:48:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 87 ms returned sat
[2024-05-28 21:48:56] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 243 ms.
[2024-05-28 21:48:57] [INFO ] Added : 10 causal constraints over 2 iterations in 1051 ms. Result :sat
Minimization took 692 ms.
[2024-05-28 21:48:58] [INFO ] [Real]Absence check using 45 positive place invariants in 20 ms returned sat
[2024-05-28 21:48:58] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 29 ms returned unsat
[2024-05-28 21:48:58] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 21:48:58] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2024-05-28 21:48:59] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2024-05-28 21:48:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:48:59] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 21:48:59] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-28 21:49:00] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2024-05-28 21:49:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 82 ms returned sat
[2024-05-28 21:49:01] [INFO ] Deduced a trap composed of 141 places in 762 ms of which 59 ms to minimize.
[2024-05-28 21:49:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1180 ms
[2024-05-28 21:49:01] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 256 ms.
[2024-05-28 21:49:03] [INFO ] Added : 11 causal constraints over 3 iterations in 1633 ms. Result :unknown
[2024-05-28 21:49:03] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2024-05-28 21:49:03] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 30 ms returned sat
[2024-05-28 21:49:03] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2024-05-28 21:49:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:03] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 21:49:04] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2024-05-28 21:49:04] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2024-05-28 21:49:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 96 ms returned sat
[2024-05-28 21:49:04] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 160 ms.
[2024-05-28 21:49:06] [INFO ] Deduced a trap composed of 19 places in 733 ms of which 3 ms to minimize.
[2024-05-28 21:49:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 970 ms
[2024-05-28 21:49:07] [INFO ] Deduced a trap composed of 121 places in 435 ms of which 3 ms to minimize.
[2024-05-28 21:49:07] [INFO ] Deduced a trap composed of 105 places in 460 ms of which 9 ms to minimize.
[2024-05-28 21:49:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1118 ms
[2024-05-28 21:49:08] [INFO ] Added : 32 causal constraints over 7 iterations in 3349 ms. Result :sat
Minimization took 737 ms.
[2024-05-28 21:49:08] [INFO ] [Real]Absence check using 45 positive place invariants in 25 ms returned sat
[2024-05-28 21:49:08] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 21 ms returned sat
[2024-05-28 21:49:09] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2024-05-28 21:49:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:09] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-28 21:49:09] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 12 ms returned sat
[2024-05-28 21:49:10] [INFO ] [Nat]Absence check using state equation in 912 ms returned sat
[2024-05-28 21:49:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 37 ms returned sat
[2024-05-28 21:49:11] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 165 ms.
[2024-05-28 21:49:11] [INFO ] Added : 11 causal constraints over 3 iterations in 505 ms. Result :sat
Minimization took 692 ms.
[2024-05-28 21:49:12] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2024-05-28 21:49:12] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 25 ms returned sat
[2024-05-28 21:49:13] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2024-05-28 21:49:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:13] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 21:49:13] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2024-05-28 21:49:13] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2024-05-28 21:49:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 137 ms returned sat
[2024-05-28 21:49:14] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 152 ms.
[2024-05-28 21:49:15] [INFO ] Deduced a trap composed of 19 places in 411 ms of which 2 ms to minimize.
[2024-05-28 21:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 810 ms
[2024-05-28 21:49:15] [INFO ] Added : 32 causal constraints over 7 iterations in 1794 ms. Result :sat
Minimization took 1075 ms.
[2024-05-28 21:49:17] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2024-05-28 21:49:17] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 20 ms returned sat
[2024-05-28 21:49:17] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2024-05-28 21:49:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:17] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-28 21:49:17] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned sat
[2024-05-28 21:49:18] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2024-05-28 21:49:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 68 ms returned sat
[2024-05-28 21:49:18] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 183 ms.
[2024-05-28 21:49:19] [INFO ] Deduced a trap composed of 19 places in 424 ms of which 1 ms to minimize.
[2024-05-28 21:49:20] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 978 ms
Maximisation of solution failed !
Minimization took 3 ms.
[2024-05-28 21:49:22] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2024-05-28 21:49:22] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 23 ms returned sat
[2024-05-28 21:49:23] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2024-05-28 21:49:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:23] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2024-05-28 21:49:23] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 21:49:24] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2024-05-28 21:49:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 125 ms returned sat
[2024-05-28 21:49:24] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 196 ms.
[2024-05-28 21:49:25] [INFO ] Deduced a trap composed of 232 places in 566 ms of which 4 ms to minimize.
[2024-05-28 21:49:26] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1132 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-28 21:49:28] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2024-05-28 21:49:28] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 20 ms returned sat
[2024-05-28 21:49:29] [INFO ] [Real]Absence check using state equation in 702 ms returned sat
[2024-05-28 21:49:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:29] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2024-05-28 21:49:29] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 20 ms returned sat
[2024-05-28 21:49:30] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2024-05-28 21:49:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-28 21:49:30] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 179 ms.
[2024-05-28 21:49:31] [INFO ] Deduced a trap composed of 19 places in 379 ms of which 2 ms to minimize.
[2024-05-28 21:49:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 602 ms
[2024-05-28 21:49:32] [INFO ] Added : 27 causal constraints over 7 iterations in 1946 ms. Result :sat
Minimization took 1123 ms.
[2024-05-28 21:49:33] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 21:49:33] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-28 21:49:34] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2024-05-28 21:49:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:34] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2024-05-28 21:49:34] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 21:49:34] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2024-05-28 21:49:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 239 ms returned sat
[2024-05-28 21:49:35] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 195 ms.
[2024-05-28 21:49:35] [INFO ] Added : 12 causal constraints over 3 iterations in 649 ms. Result :sat
Minimization took 1079 ms.
[2024-05-28 21:49:37] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2024-05-28 21:49:37] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 21:49:37] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2024-05-28 21:49:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:49:37] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2024-05-28 21:49:37] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 18 ms returned sat
[2024-05-28 21:49:38] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2024-05-28 21:49:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 262 ms returned sat
[2024-05-28 21:49:39] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 162 ms.
[2024-05-28 21:49:40] [INFO ] Deduced a trap composed of 19 places in 429 ms of which 1 ms to minimize.
[2024-05-28 21:49:40] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1009 ms
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 68, 23, 1, 158, 39, 158, 39, 4, 118, 98, 752, 1]
FORMULA PolyORBNT-PT-S10J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0] Max Struct:[68, 23, 158, 39, 158, 39, 4, 118, 98, 752, 1]
Support contains 51 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 464 transition count 1626
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 60 place count 440 transition count 1624
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 438 transition count 1624
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 62 place count 438 transition count 1600
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 110 place count 414 transition count 1600
Applied a total of 110 rules in 324 ms. Remains 414 /474 variables (removed 60) and now considering 1600/1650 (removed 50) transitions.
Running 1589 sub problems to find dead transitions.
[2024-05-28 21:49:43] [INFO ] Flow matrix only has 1591 transitions (discarded 9 similar events)
// Phase 1: matrix 1591 rows 414 cols
[2024-05-28 21:49:43] [INFO ] Computed 62 invariants in 35 ms
[2024-05-28 21:49:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1589 unsolved
Problem TDEAD513 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1485 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/405 variables, 1/53 constraints. Problems are: Problem set: 66 solved, 1523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/2005 variables, and 53 constraints, problems are : Problem set: 66 solved, 1523 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 8/17 constraints, State Equation: 0/414 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1589/589 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 1523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 44/44 constraints. Problems are: Problem set: 66 solved, 1523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 8/52 constraints. Problems are: Problem set: 66 solved, 1523 unsolved
[2024-05-28 21:50:21] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 1 ms to minimize.
[2024-05-28 21:50:24] [INFO ] Deduced a trap composed of 10 places in 460 ms of which 4 ms to minimize.
[2024-05-28 21:50:26] [INFO ] Deduced a trap composed of 85 places in 439 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 3/55 constraints. Problems are: Problem set: 66 solved, 1523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/2005 variables, and 55 constraints, problems are : Problem set: 66 solved, 1523 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 8/17 constraints, State Equation: 0/414 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 934/589 constraints, Known Traps: 3/3 constraints]
After SMT, in 56409ms problems are : Problem set: 66 solved, 1523 unsolved
Search for dead transitions found 66 dead transitions in 56488ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 414/474 places, 1534/1650 transitions.
Applied a total of 0 rules in 38 ms. Remains 414 /414 variables (removed 0) and now considering 1534/1534 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56882 ms. Remains : 414/474 places, 1534/1650 transitions.
[2024-05-28 21:50:39] [INFO ] Flow matrix only has 1525 transitions (discarded 9 similar events)
// Phase 1: matrix 1525 rows 414 cols
[2024-05-28 21:50:39] [INFO ] Computed 62 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0] Max Struct:[67, 23, 77, 38, 77, 38, 4, 57, 70, 410, 1]
RANDOM walk for 1000000 steps (68485 resets) in 13135 ms. (76 steps per ms)
FORMULA PolyORBNT-PT-S10J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10000007 steps (94371 resets) in 23729 ms. (421 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1, 2, 1, 3, 1, 1, 3, 1, 4] Max Struct:[67, 23, 77, 38, 77, 38, 4, 57, 70, 410]
[2024-05-28 21:51:16] [INFO ] Flow matrix only has 1525 transitions (discarded 9 similar events)
[2024-05-28 21:51:16] [INFO ] Invariant cache hit.
[2024-05-28 21:51:16] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2024-05-28 21:51:16] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 14 ms returned unsat
[2024-05-28 21:51:16] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 21:51:16] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 5 ms returned unsat
[2024-05-28 21:51:16] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 21:51:16] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 5 ms returned unsat
[2024-05-28 21:51:16] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 21:51:16] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 10 ms returned unsat
[2024-05-28 21:51:17] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 21:51:17] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 11 ms returned sat
[2024-05-28 21:51:17] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2024-05-28 21:51:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:51:17] [INFO ] [Nat]Absence check using 45 positive place invariants in 20 ms returned sat
[2024-05-28 21:51:17] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 12 ms returned sat
[2024-05-28 21:51:18] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2024-05-28 21:51:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:51:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 116 ms returned sat
[2024-05-28 21:51:18] [INFO ] Computed and/alt/rep : 1191/4540/1191 causal constraints (skipped 323 transitions) in 174 ms.
[2024-05-28 21:51:19] [INFO ] Added : 11 causal constraints over 3 iterations in 840 ms. Result :sat
Minimization took 4953 ms.
[2024-05-28 21:51:24] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-28 21:51:24] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 9 ms returned unsat
[2024-05-28 21:51:24] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-28 21:51:24] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 11 ms returned unsat
[2024-05-28 21:51:24] [INFO ] [Real]Absence check using 45 positive place invariants in 19 ms returned sat
[2024-05-28 21:51:24] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 8 ms returned unsat
[2024-05-28 21:51:24] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-28 21:51:24] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 11 ms returned unsat
[2024-05-28 21:51:24] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-28 21:51:24] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1, 2, 1, 3, 1, 1, 3, 1, 4] Max Struct:[4, 1, 2, 1, 77, 1, 1, 3, 1, 4]
FORMULA PolyORBNT-PT-S10J20-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[77]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1534/1534 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 413 transition count 1533
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 413 transition count 1533
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 411 transition count 1531
Applied a total of 6 rules in 107 ms. Remains 411 /414 variables (removed 3) and now considering 1531/1534 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 411/414 places, 1531/1534 transitions.
[2024-05-28 21:51:24] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
// Phase 1: matrix 1522 rows 411 cols
[2024-05-28 21:51:24] [INFO ] Computed 62 invariants in 40 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[77]
RANDOM walk for 1000000 steps (70417 resets) in 12258 ms. (81 steps per ms)
BEST_FIRST walk for 1000001 steps (9451 resets) in 2010 ms. (497 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[77]
[2024-05-28 21:51:38] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2024-05-28 21:51:38] [INFO ] Invariant cache hit.
[2024-05-28 21:51:39] [INFO ] [Real]Absence check using 44 positive place invariants in 14 ms returned sat
[2024-05-28 21:51:39] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 16 ms returned sat
[2024-05-28 21:51:39] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2024-05-28 21:51:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:51:39] [INFO ] [Nat]Absence check using 44 positive place invariants in 12 ms returned sat
[2024-05-28 21:51:39] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 12 ms returned sat
[2024-05-28 21:51:40] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2024-05-28 21:51:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:51:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 137 ms returned sat
[2024-05-28 21:51:40] [INFO ] Deduced a trap composed of 140 places in 525 ms of which 4 ms to minimize.
[2024-05-28 21:51:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 655 ms
[2024-05-28 21:51:40] [INFO ] Computed and/alt/rep : 1189/4535/1189 causal constraints (skipped 322 transitions) in 124 ms.
[2024-05-28 21:51:41] [INFO ] Added : 9 causal constraints over 3 iterations in 630 ms. Result :sat
Minimization took 5878 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[77]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[77]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 35 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 411/411 places, 1531/1531 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 1531/1531 transitions.
Applied a total of 0 rules in 33 ms. Remains 411 /411 variables (removed 0) and now considering 1531/1531 (removed 0) transitions.
[2024-05-28 21:51:47] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2024-05-28 21:51:47] [INFO ] Invariant cache hit.
[2024-05-28 21:51:48] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-05-28 21:51:48] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2024-05-28 21:51:48] [INFO ] Invariant cache hit.
[2024-05-28 21:51:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:51:54] [INFO ] Implicit Places using invariants and state equation in 6018 ms returned []
Implicit Place search using SMT with State Equation took 6631 ms to find 0 implicit places.
[2024-05-28 21:51:54] [INFO ] Redundant transitions in 117 ms returned []
Running 1520 sub problems to find dead transitions.
[2024-05-28 21:51:54] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
[2024-05-28 21:51:54] [INFO ] Invariant cache hit.
[2024-05-28 21:51:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 3 (OVERLAPS) 1/402 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1305 is UNSAT
At refinement iteration 5 (OVERLAPS) 9/411 variables, 9/62 constraints. Problems are: Problem set: 549 solved, 971 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/1933 variables, and 62 constraints, problems are : Problem set: 549 solved, 971 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1520/1520 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 549 solved, 971 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 549 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 549 solved, 971 unsolved
[2024-05-28 21:52:47] [INFO ] Deduced a trap composed of 18 places in 310 ms of which 1 ms to minimize.
[2024-05-28 21:52:53] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 2/54 constraints. Problems are: Problem set: 549 solved, 971 unsolved
[2024-05-28 21:52:57] [INFO ] Deduced a trap composed of 60 places in 377 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/55 constraints. Problems are: Problem set: 549 solved, 971 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/55 constraints. Problems are: Problem set: 549 solved, 971 unsolved
SMT process timed out in 82266ms, After SMT, problems are : Problem set: 549 solved, 971 unsolved
Search for dead transitions found 549 dead transitions in 82292ms
Found 549 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 549 transitions
Dead transitions reduction (with SMT) removed 549 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 411/411 places, 982/1531 transitions.
Applied a total of 0 rules in 20 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2024-05-28 21:53:16] [INFO ] Redundant transitions in 11 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 89131 ms. Remains : 411/411 places, 982/1531 transitions.
[2024-05-28 21:53:16] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2024-05-28 21:53:16] [INFO ] Computed 62 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[77]
RANDOM walk for 1000000 steps (70742 resets) in 7554 ms. (132 steps per ms)
BEST_FIRST walk for 1000001 steps (9473 resets) in 1573 ms. (635 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[77]
[2024-05-28 21:53:25] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:53:25] [INFO ] Invariant cache hit.
[2024-05-28 21:53:25] [INFO ] [Real]Absence check using 44 positive place invariants in 12 ms returned sat
[2024-05-28 21:53:25] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 10 ms returned sat
[2024-05-28 21:53:26] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2024-05-28 21:53:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:53:26] [INFO ] [Nat]Absence check using 44 positive place invariants in 11 ms returned sat
[2024-05-28 21:53:26] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 12 ms returned sat
[2024-05-28 21:53:26] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2024-05-28 21:53:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:53:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 57 ms returned sat
[2024-05-28 21:53:26] [INFO ] Deduced a trap composed of 164 places in 338 ms of which 3 ms to minimize.
[2024-05-28 21:53:27] [INFO ] Deduced a trap composed of 164 places in 267 ms of which 2 ms to minimize.
[2024-05-28 21:53:27] [INFO ] Deduced a trap composed of 164 places in 304 ms of which 3 ms to minimize.
[2024-05-28 21:53:27] [INFO ] Deduced a trap composed of 158 places in 270 ms of which 3 ms to minimize.
[2024-05-28 21:53:28] [INFO ] Deduced a trap composed of 160 places in 278 ms of which 2 ms to minimize.
[2024-05-28 21:53:28] [INFO ] Deduced a trap composed of 164 places in 269 ms of which 3 ms to minimize.
[2024-05-28 21:53:28] [INFO ] Deduced a trap composed of 169 places in 275 ms of which 3 ms to minimize.
[2024-05-28 21:53:29] [INFO ] Deduced a trap composed of 162 places in 307 ms of which 3 ms to minimize.
[2024-05-28 21:53:29] [INFO ] Deduced a trap composed of 160 places in 271 ms of which 2 ms to minimize.
[2024-05-28 21:53:29] [INFO ] Deduced a trap composed of 156 places in 249 ms of which 2 ms to minimize.
[2024-05-28 21:53:30] [INFO ] Deduced a trap composed of 168 places in 241 ms of which 2 ms to minimize.
[2024-05-28 21:53:30] [INFO ] Deduced a trap composed of 164 places in 283 ms of which 2 ms to minimize.
[2024-05-28 21:53:30] [INFO ] Deduced a trap composed of 166 places in 294 ms of which 3 ms to minimize.
[2024-05-28 21:53:31] [INFO ] Deduced a trap composed of 156 places in 260 ms of which 2 ms to minimize.
[2024-05-28 21:53:31] [INFO ] Deduced a trap composed of 168 places in 263 ms of which 3 ms to minimize.
[2024-05-28 21:53:31] [INFO ] Deduced a trap composed of 168 places in 299 ms of which 5 ms to minimize.
[2024-05-28 21:53:32] [INFO ] Deduced a trap composed of 158 places in 276 ms of which 2 ms to minimize.
[2024-05-28 21:53:32] [INFO ] Deduced a trap composed of 169 places in 266 ms of which 3 ms to minimize.
[2024-05-28 21:53:32] [INFO ] Deduced a trap composed of 156 places in 247 ms of which 2 ms to minimize.
[2024-05-28 21:53:33] [INFO ] Deduced a trap composed of 162 places in 317 ms of which 3 ms to minimize.
[2024-05-28 21:53:34] [INFO ] Deduced a trap composed of 158 places in 304 ms of which 3 ms to minimize.
[2024-05-28 21:53:34] [INFO ] Deduced a trap composed of 166 places in 284 ms of which 3 ms to minimize.
[2024-05-28 21:53:34] [INFO ] Deduced a trap composed of 165 places in 240 ms of which 3 ms to minimize.
[2024-05-28 21:53:35] [INFO ] Deduced a trap composed of 171 places in 237 ms of which 3 ms to minimize.
[2024-05-28 21:53:35] [INFO ] Deduced a trap composed of 175 places in 241 ms of which 2 ms to minimize.
[2024-05-28 21:53:35] [INFO ] Deduced a trap composed of 158 places in 291 ms of which 3 ms to minimize.
[2024-05-28 21:53:35] [INFO ] Deduced a trap composed of 164 places in 295 ms of which 3 ms to minimize.
[2024-05-28 21:53:36] [INFO ] Deduced a trap composed of 160 places in 259 ms of which 2 ms to minimize.
[2024-05-28 21:53:36] [INFO ] Deduced a trap composed of 162 places in 260 ms of which 3 ms to minimize.
[2024-05-28 21:53:37] [INFO ] Deduced a trap composed of 164 places in 313 ms of which 3 ms to minimize.
[2024-05-28 21:53:37] [INFO ] Deduced a trap composed of 162 places in 306 ms of which 6 ms to minimize.
[2024-05-28 21:53:37] [INFO ] Deduced a trap composed of 172 places in 361 ms of which 4 ms to minimize.
[2024-05-28 21:53:38] [INFO ] Deduced a trap composed of 167 places in 311 ms of which 3 ms to minimize.
[2024-05-28 21:53:38] [INFO ] Deduced a trap composed of 168 places in 306 ms of which 3 ms to minimize.
[2024-05-28 21:53:39] [INFO ] Deduced a trap composed of 167 places in 336 ms of which 3 ms to minimize.
[2024-05-28 21:53:40] [INFO ] Deduced a trap composed of 167 places in 325 ms of which 3 ms to minimize.
[2024-05-28 21:53:40] [INFO ] Deduced a trap composed of 175 places in 323 ms of which 3 ms to minimize.
[2024-05-28 21:53:41] [INFO ] Deduced a trap composed of 164 places in 310 ms of which 6 ms to minimize.
[2024-05-28 21:53:41] [INFO ] Deduced a trap composed of 158 places in 276 ms of which 3 ms to minimize.
[2024-05-28 21:53:42] [INFO ] Deduced a trap composed of 169 places in 282 ms of which 2 ms to minimize.
[2024-05-28 21:53:42] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 2 ms to minimize.
[2024-05-28 21:53:43] [INFO ] Deduced a trap composed of 162 places in 337 ms of which 3 ms to minimize.
[2024-05-28 21:53:43] [INFO ] Deduced a trap composed of 160 places in 275 ms of which 2 ms to minimize.
[2024-05-28 21:53:43] [INFO ] Deduced a trap composed of 164 places in 261 ms of which 3 ms to minimize.
[2024-05-28 21:53:44] [INFO ] Deduced a trap composed of 164 places in 237 ms of which 2 ms to minimize.
[2024-05-28 21:53:44] [INFO ] Deduced a trap composed of 169 places in 295 ms of which 3 ms to minimize.
[2024-05-28 21:53:45] [INFO ] Deduced a trap composed of 162 places in 351 ms of which 3 ms to minimize.
[2024-05-28 21:53:45] [INFO ] Deduced a trap composed of 169 places in 381 ms of which 3 ms to minimize.
[2024-05-28 21:53:45] [INFO ] Deduced a trap composed of 168 places in 382 ms of which 3 ms to minimize.
[2024-05-28 21:53:46] [INFO ] Deduced a trap composed of 173 places in 395 ms of which 3 ms to minimize.
[2024-05-28 21:53:46] [INFO ] Deduced a trap composed of 156 places in 385 ms of which 3 ms to minimize.
[2024-05-28 21:53:47] [INFO ] Deduced a trap composed of 160 places in 412 ms of which 3 ms to minimize.
[2024-05-28 21:53:51] [INFO ] Trap strengthening (SAT) tested/added 52/52 trap constraints in 25327 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[77]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[77]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 37 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 37 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2024-05-28 21:53:52] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:53:52] [INFO ] Invariant cache hit.
[2024-05-28 21:53:52] [INFO ] Implicit Places using invariants in 704 ms returned []
[2024-05-28 21:53:52] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:53:52] [INFO ] Invariant cache hit.
[2024-05-28 21:53:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:53:57] [INFO ] Implicit Places using invariants and state equation in 5037 ms returned []
Implicit Place search using SMT with State Equation took 5753 ms to find 0 implicit places.
[2024-05-28 21:53:57] [INFO ] Redundant transitions in 64 ms returned []
Running 971 sub problems to find dead transitions.
[2024-05-28 21:53:57] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:53:57] [INFO ] Invariant cache hit.
[2024-05-28 21:53:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:54:08] [INFO ] Deduced a trap composed of 113 places in 117 ms of which 2 ms to minimize.
[2024-05-28 21:54:09] [INFO ] Deduced a trap composed of 113 places in 303 ms of which 3 ms to minimize.
[2024-05-28 21:54:09] [INFO ] Deduced a trap composed of 117 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:54:09] [INFO ] Deduced a trap composed of 127 places in 168 ms of which 3 ms to minimize.
[2024-05-28 21:54:09] [INFO ] Deduced a trap composed of 107 places in 166 ms of which 3 ms to minimize.
[2024-05-28 21:54:09] [INFO ] Deduced a trap composed of 107 places in 168 ms of which 3 ms to minimize.
[2024-05-28 21:54:10] [INFO ] Deduced a trap composed of 132 places in 165 ms of which 3 ms to minimize.
[2024-05-28 21:54:10] [INFO ] Deduced a trap composed of 123 places in 169 ms of which 2 ms to minimize.
[2024-05-28 21:54:10] [INFO ] Deduced a trap composed of 114 places in 165 ms of which 3 ms to minimize.
[2024-05-28 21:54:10] [INFO ] Deduced a trap composed of 118 places in 211 ms of which 3 ms to minimize.
[2024-05-28 21:54:11] [INFO ] Deduced a trap composed of 118 places in 223 ms of which 3 ms to minimize.
[2024-05-28 21:54:11] [INFO ] Deduced a trap composed of 166 places in 244 ms of which 6 ms to minimize.
[2024-05-28 21:54:12] [INFO ] Deduced a trap composed of 170 places in 227 ms of which 4 ms to minimize.
[2024-05-28 21:54:12] [INFO ] Deduced a trap composed of 168 places in 191 ms of which 3 ms to minimize.
[2024-05-28 21:54:12] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 3 ms to minimize.
[2024-05-28 21:54:12] [INFO ] Deduced a trap composed of 170 places in 177 ms of which 4 ms to minimize.
[2024-05-28 21:54:12] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 3 ms to minimize.
[2024-05-28 21:54:13] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 3 ms to minimize.
[2024-05-28 21:54:13] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 2 ms to minimize.
[2024-05-28 21:54:13] [INFO ] Deduced a trap composed of 117 places in 199 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:54:19] [INFO ] Deduced a trap composed of 177 places in 189 ms of which 3 ms to minimize.
[2024-05-28 21:54:21] [INFO ] Deduced a trap composed of 107 places in 203 ms of which 3 ms to minimize.
[2024-05-28 21:54:21] [INFO ] Deduced a trap composed of 117 places in 178 ms of which 3 ms to minimize.
[2024-05-28 21:54:21] [INFO ] Deduced a trap composed of 119 places in 169 ms of which 3 ms to minimize.
[2024-05-28 21:54:21] [INFO ] Deduced a trap composed of 112 places in 215 ms of which 2 ms to minimize.
[2024-05-28 21:54:22] [INFO ] Deduced a trap composed of 117 places in 213 ms of which 3 ms to minimize.
[2024-05-28 21:54:22] [INFO ] Deduced a trap composed of 122 places in 255 ms of which 2 ms to minimize.
[2024-05-28 21:54:22] [INFO ] Deduced a trap composed of 117 places in 215 ms of which 3 ms to minimize.
[2024-05-28 21:54:22] [INFO ] Deduced a trap composed of 112 places in 214 ms of which 3 ms to minimize.
[2024-05-28 21:54:23] [INFO ] Deduced a trap composed of 107 places in 208 ms of which 2 ms to minimize.
[2024-05-28 21:54:23] [INFO ] Deduced a trap composed of 127 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:54:23] [INFO ] Deduced a trap composed of 118 places in 210 ms of which 3 ms to minimize.
[2024-05-28 21:54:23] [INFO ] Deduced a trap composed of 117 places in 181 ms of which 2 ms to minimize.
[2024-05-28 21:54:23] [INFO ] Deduced a trap composed of 112 places in 234 ms of which 4 ms to minimize.
[2024-05-28 21:54:24] [INFO ] Deduced a trap composed of 112 places in 184 ms of which 2 ms to minimize.
[2024-05-28 21:54:24] [INFO ] Deduced a trap composed of 98 places in 204 ms of which 3 ms to minimize.
[2024-05-28 21:54:24] [INFO ] Deduced a trap composed of 59 places in 231 ms of which 3 ms to minimize.
[2024-05-28 21:54:25] [INFO ] Deduced a trap composed of 117 places in 202 ms of which 3 ms to minimize.
[2024-05-28 21:54:25] [INFO ] Deduced a trap composed of 98 places in 181 ms of which 3 ms to minimize.
[2024-05-28 21:54:25] [INFO ] Deduced a trap composed of 102 places in 206 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:54:31] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 2 ms to minimize.
[2024-05-28 21:54:32] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 3 ms to minimize.
[2024-05-28 21:54:32] [INFO ] Deduced a trap composed of 92 places in 218 ms of which 2 ms to minimize.
[2024-05-28 21:54:32] [INFO ] Deduced a trap composed of 168 places in 120 ms of which 2 ms to minimize.
[2024-05-28 21:54:32] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:54:33] [INFO ] Deduced a trap composed of 129 places in 181 ms of which 3 ms to minimize.
[2024-05-28 21:54:33] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 2 ms to minimize.
SMT process timed out in 35324ms, After SMT, problems are : Problem set: 0 solved, 971 unsolved
Search for dead transitions found 0 dead transitions in 35342ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41211 ms. Remains : 411/411 places, 982/982 transitions.
RANDOM walk for 40000 steps (2829 resets) in 883 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (384 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (376 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
[2024-05-28 21:54:34] [INFO ] Flatten gal took : 310 ms
[2024-05-28 21:54:34] [INFO ] Flatten gal took : 171 ms
[2024-05-28 21:54:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7741740189545865618.gal : 57 ms
[2024-05-28 21:54:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2635188445470066054.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/ReachabilityCardinality7741740189545865618.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2635188445470066054.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2635188445470066054.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 128
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :128 after 129
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :129 after 131
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :131 after 138
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :138 after 178
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :178 after 266
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :266 after 470
Interrupted probabilistic random walk after 352047 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 2
Probabilistic random walk after 352047 steps, saw 57900 distinct states, run finished after 3004 ms. (steps per millisecond=117 ) properties seen :0
[2024-05-28 21:54:36] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:54:36] [INFO ] Invariant cache hit.
[2024-05-28 21:54:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 21:54:37] [INFO ] Deduced a trap composed of 83 places in 228 ms of which 4 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/410 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :470 after 4353
At refinement iteration 10 (OVERLAPS) 973/1383 variables, 410/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1383 variables, 1/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1383 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1384 variables, 1/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1384 variables, 0/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1384 variables, 0/475 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1384/1384 variables, and 475 constraints, problems are : Problem set: 1 solved, 1 unsolved in 932 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 1/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 21:54:38] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 3 ms to minimize.
[2024-05-28 21:54:38] [INFO ] Deduced a trap composed of 166 places in 213 ms of which 3 ms to minimize.
[2024-05-28 21:54:38] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 3 ms to minimize.
[2024-05-28 21:54:38] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4353 after 4806
[2024-05-28 21:54:38] [INFO ] Deduced a trap composed of 150 places in 181 ms of which 2 ms to minimize.
[2024-05-28 21:54:39] [INFO ] Deduced a trap composed of 168 places in 222 ms of which 3 ms to minimize.
[2024-05-28 21:54:39] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 2 ms to minimize.
[2024-05-28 21:54:39] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 2 ms to minimize.
[2024-05-28 21:54:39] [INFO ] Deduced a trap composed of 168 places in 178 ms of which 2 ms to minimize.
[2024-05-28 21:54:39] [INFO ] Deduced a trap composed of 154 places in 182 ms of which 2 ms to minimize.
[2024-05-28 21:54:40] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 3 ms to minimize.
[2024-05-28 21:54:40] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 2 ms to minimize.
[2024-05-28 21:54:40] [INFO ] Deduced a trap composed of 164 places in 393 ms of which 2 ms to minimize.
[2024-05-28 21:54:41] [INFO ] Deduced a trap composed of 168 places in 237 ms of which 2 ms to minimize.
[2024-05-28 21:54:41] [INFO ] Deduced a trap composed of 146 places in 234 ms of which 2 ms to minimize.
[2024-05-28 21:54:41] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 2 ms to minimize.
[2024-05-28 21:54:41] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 2 ms to minimize.
[2024-05-28 21:54:41] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 2 ms to minimize.
[2024-05-28 21:54:42] [INFO ] Deduced a trap composed of 162 places in 182 ms of which 2 ms to minimize.
[2024-05-28 21:54:42] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 20/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 21:54:42] [INFO ] Deduced a trap composed of 166 places in 174 ms of which 2 ms to minimize.
[2024-05-28 21:54:42] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 2 ms to minimize.
[2024-05-28 21:54:42] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 2 ms to minimize.
SMT process timed out in 6082ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 20 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Running 971 sub problems to find dead transitions.
[2024-05-28 21:54:42] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:54:42] [INFO ] Invariant cache hit.
[2024-05-28 21:54:42] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4806 after 48276
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:54:56] [INFO ] Deduced a trap composed of 113 places in 220 ms of which 6 ms to minimize.
[2024-05-28 21:54:56] [INFO ] Deduced a trap composed of 113 places in 217 ms of which 4 ms to minimize.
[2024-05-28 21:54:56] [INFO ] Deduced a trap composed of 117 places in 210 ms of which 5 ms to minimize.
[2024-05-28 21:54:56] [INFO ] Deduced a trap composed of 127 places in 195 ms of which 3 ms to minimize.
[2024-05-28 21:54:57] [INFO ] Deduced a trap composed of 107 places in 192 ms of which 3 ms to minimize.
[2024-05-28 21:54:57] [INFO ] Deduced a trap composed of 107 places in 202 ms of which 3 ms to minimize.
[2024-05-28 21:54:57] [INFO ] Deduced a trap composed of 132 places in 178 ms of which 3 ms to minimize.
[2024-05-28 21:54:57] [INFO ] Deduced a trap composed of 123 places in 264 ms of which 4 ms to minimize.
[2024-05-28 21:54:58] [INFO ] Deduced a trap composed of 114 places in 237 ms of which 3 ms to minimize.
[2024-05-28 21:54:58] [INFO ] Deduced a trap composed of 118 places in 182 ms of which 2 ms to minimize.
[2024-05-28 21:54:58] [INFO ] Deduced a trap composed of 118 places in 228 ms of which 4 ms to minimize.
[2024-05-28 21:54:59] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 6 ms to minimize.
[2024-05-28 21:54:59] [INFO ] Deduced a trap composed of 170 places in 213 ms of which 5 ms to minimize.
[2024-05-28 21:54:59] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 4 ms to minimize.
[2024-05-28 21:54:59] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 5 ms to minimize.
[2024-05-28 21:55:00] [INFO ] Deduced a trap composed of 170 places in 218 ms of which 6 ms to minimize.
[2024-05-28 21:55:00] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 4 ms to minimize.
[2024-05-28 21:55:00] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 4 ms to minimize.
[2024-05-28 21:55:00] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :48276 after 61452
[2024-05-28 21:55:01] [INFO ] Deduced a trap composed of 117 places in 228 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:55:02] [INFO ] Deduced a trap composed of 177 places in 228 ms of which 4 ms to minimize.
[2024-05-28 21:55:02] [INFO ] Deduced a trap composed of 107 places in 232 ms of which 3 ms to minimize.
[2024-05-28 21:55:03] [INFO ] Deduced a trap composed of 117 places in 217 ms of which 4 ms to minimize.
[2024-05-28 21:55:03] [INFO ] Deduced a trap composed of 119 places in 217 ms of which 4 ms to minimize.
[2024-05-28 21:55:03] [INFO ] Deduced a trap composed of 112 places in 218 ms of which 6 ms to minimize.
[2024-05-28 21:55:03] [INFO ] Deduced a trap composed of 117 places in 217 ms of which 4 ms to minimize.
[2024-05-28 21:55:04] [INFO ] Deduced a trap composed of 122 places in 225 ms of which 7 ms to minimize.
[2024-05-28 21:55:04] [INFO ] Deduced a trap composed of 117 places in 219 ms of which 4 ms to minimize.
[2024-05-28 21:55:04] [INFO ] Deduced a trap composed of 112 places in 215 ms of which 4 ms to minimize.
[2024-05-28 21:55:04] [INFO ] Deduced a trap composed of 107 places in 213 ms of which 4 ms to minimize.
[2024-05-28 21:55:04] [INFO ] Deduced a trap composed of 127 places in 213 ms of which 4 ms to minimize.
[2024-05-28 21:55:05] [INFO ] Deduced a trap composed of 118 places in 214 ms of which 4 ms to minimize.
[2024-05-28 21:55:05] [INFO ] Deduced a trap composed of 117 places in 311 ms of which 4 ms to minimize.
[2024-05-28 21:55:05] [INFO ] Deduced a trap composed of 112 places in 211 ms of which 4 ms to minimize.
[2024-05-28 21:55:05] [INFO ] Deduced a trap composed of 112 places in 216 ms of which 4 ms to minimize.
[2024-05-28 21:55:06] [INFO ] Deduced a trap composed of 98 places in 241 ms of which 5 ms to minimize.
[2024-05-28 21:55:06] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 5 ms to minimize.
[2024-05-28 21:55:06] [INFO ] Deduced a trap composed of 117 places in 239 ms of which 6 ms to minimize.
[2024-05-28 21:55:07] [INFO ] Deduced a trap composed of 98 places in 225 ms of which 6 ms to minimize.
[2024-05-28 21:55:07] [INFO ] Deduced a trap composed of 102 places in 219 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1384 variables, and 92 constraints, problems are : Problem set: 0 solved, 971 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 9/18 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 971/971 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 971 unsolved
Detected timeout of ITS tools.
[2024-05-28 21:55:24] [INFO ] Flatten gal took : 156 ms
[2024-05-28 21:55:24] [INFO ] Applying decomposition
[2024-05-28 21:55:24] [INFO ] Flatten gal took : 111 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 971 unsolved
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/graph10243678127252953708.txt' '-o' '/tmp/graph10243678127252953708.bin' '-w' '/tmp/graph10243678127252953708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10243678127252953708.bin' '-l' '-1' '-v' '-w' '/tmp/graph10243678127252953708.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:55:25] [INFO ] Decomposing Gal with order
[2024-05-28 21:55:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:55:25] [INFO ] Removed a total of 2736 redundant transitions.
[2024-05-28 21:55:25] [INFO ] Flatten gal took : 262 ms
[2024-05-28 21:55:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 265 labels/synchronizations in 94 ms.
[2024-05-28 21:55:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1040599984422408931.gal : 20 ms
[2024-05-28 21:55:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2142453266918246248.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/ReachabilityCardinality1040599984422408931.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2142453266918246248.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2142453266918246248.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 40/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:55:26] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 1 ms to minimize.
[2024-05-28 21:55:26] [INFO ] Deduced a trap composed of 98 places in 219 ms of which 11 ms to minimize.
[2024-05-28 21:55:27] [INFO ] Deduced a trap composed of 127 places in 201 ms of which 2 ms to minimize.
[2024-05-28 21:55:27] [INFO ] Deduced a trap composed of 113 places in 197 ms of which 2 ms to minimize.
[2024-05-28 21:55:27] [INFO ] Deduced a trap composed of 127 places in 193 ms of which 2 ms to minimize.
[2024-05-28 21:55:27] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 2 ms to minimize.
[2024-05-28 21:55:27] [INFO ] Deduced a trap composed of 122 places in 194 ms of which 3 ms to minimize.
SMT process timed out in 45076ms, After SMT, problems are : Problem set: 0 solved, 971 unsolved
Search for dead transitions found 0 dead transitions in 45090ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45115 ms. Remains : 411/411 places, 982/982 transitions.
RANDOM walk for 40000 steps (2770 resets) in 1067 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (363 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 452016 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 452016 steps, saw 74064 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
[2024-05-28 21:55:31] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:55:31] [INFO ] Invariant cache hit.
[2024-05-28 21:55:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 973/1383 variables, 410/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1383 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1383 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1384 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1384 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1384/1384 variables, and 474 constraints, problems are : Problem set: 0 solved, 1 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 411/411 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/124 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 259/383 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/409 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:55:32] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 2 ms to minimize.
[2024-05-28 21:55:32] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 3 ms to minimize.
[2024-05-28 21:55:32] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 2 ms to minimize.
[2024-05-28 21:55:32] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 2 ms to minimize.
[2024-05-28 21:55:33] [INFO ] Deduced a trap composed of 164 places in 244 ms of which 3 ms to minimize.
[2024-05-28 21:55:33] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 3 ms to minimize.
[2024-05-28 21:55:33] [INFO ] Deduced a trap composed of 164 places in 255 ms of which 3 ms to minimize.
[2024-05-28 21:55:33] [INFO ] Deduced a trap composed of 150 places in 243 ms of which 3 ms to minimize.
[2024-05-28 21:55:34] [INFO ] Deduced a trap composed of 168 places in 253 ms of which 3 ms to minimize.
[2024-05-28 21:55:34] [INFO ] Deduced a trap composed of 154 places in 214 ms of which 2 ms to minimize.
[2024-05-28 21:55:34] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 2 ms to minimize.
[2024-05-28 21:55:34] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 2 ms to minimize.
[2024-05-28 21:55:35] [INFO ] Deduced a trap composed of 150 places in 210 ms of which 2 ms to minimize.
[2024-05-28 21:55:35] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 2 ms to minimize.
[2024-05-28 21:55:35] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 3 ms to minimize.
[2024-05-28 21:55:35] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 3 ms to minimize.
[2024-05-28 21:55:35] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 2 ms to minimize.
[2024-05-28 21:55:36] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 2 ms to minimize.
[2024-05-28 21:55:36] [INFO ] Deduced a trap composed of 160 places in 225 ms of which 2 ms to minimize.
[2024-05-28 21:55:36] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:55:36] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 2 ms to minimize.
[2024-05-28 21:55:37] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 2 ms to minimize.
[2024-05-28 21:55:37] [INFO ] Deduced a trap composed of 146 places in 207 ms of which 2 ms to minimize.
[2024-05-28 21:55:37] [INFO ] Deduced a trap composed of 154 places in 199 ms of which 2 ms to minimize.
[2024-05-28 21:55:37] [INFO ] Deduced a trap composed of 172 places in 296 ms of which 3 ms to minimize.
[2024-05-28 21:55:38] [INFO ] Deduced a trap composed of 172 places in 309 ms of which 2 ms to minimize.
[2024-05-28 21:55:38] [INFO ] Deduced a trap composed of 150 places in 293 ms of which 2 ms to minimize.
[2024-05-28 21:55:38] [INFO ] Deduced a trap composed of 162 places in 285 ms of which 3 ms to minimize.
[2024-05-28 21:55:39] [INFO ] Deduced a trap composed of 154 places in 277 ms of which 2 ms to minimize.
[2024-05-28 21:55:39] [INFO ] Deduced a trap composed of 162 places in 311 ms of which 3 ms to minimize.
[2024-05-28 21:55:39] [INFO ] Deduced a trap composed of 158 places in 235 ms of which 2 ms to minimize.
[2024-05-28 21:55:39] [INFO ] Deduced a trap composed of 168 places in 321 ms of which 3 ms to minimize.
[2024-05-28 21:55:40] [INFO ] Deduced a trap composed of 162 places in 248 ms of which 3 ms to minimize.
[2024-05-28 21:55:40] [INFO ] Deduced a trap composed of 154 places in 245 ms of which 2 ms to minimize.
[2024-05-28 21:55:40] [INFO ] Deduced a trap composed of 154 places in 194 ms of which 3 ms to minimize.
[2024-05-28 21:55:41] [INFO ] Deduced a trap composed of 166 places in 371 ms of which 3 ms to minimize.
[2024-05-28 21:55:41] [INFO ] Deduced a trap composed of 154 places in 248 ms of which 2 ms to minimize.
[2024-05-28 21:55:41] [INFO ] Deduced a trap composed of 160 places in 280 ms of which 2 ms to minimize.
[2024-05-28 21:55:41] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 3 ms to minimize.
[2024-05-28 21:55:42] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:55:42] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 3 ms to minimize.
[2024-05-28 21:55:42] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 2 ms to minimize.
[2024-05-28 21:55:42] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 3 ms to minimize.
[2024-05-28 21:55:43] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 2 ms to minimize.
[2024-05-28 21:55:43] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 2 ms to minimize.
[2024-05-28 21:55:43] [INFO ] Deduced a trap composed of 154 places in 224 ms of which 9 ms to minimize.
[2024-05-28 21:55:43] [INFO ] Deduced a trap composed of 172 places in 211 ms of which 2 ms to minimize.
[2024-05-28 21:55:44] [INFO ] Deduced a trap composed of 160 places in 237 ms of which 3 ms to minimize.
[2024-05-28 21:55:44] [INFO ] Deduced a trap composed of 150 places in 199 ms of which 2 ms to minimize.
[2024-05-28 21:55:44] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 2 ms to minimize.
[2024-05-28 21:55:44] [INFO ] Deduced a trap composed of 168 places in 222 ms of which 3 ms to minimize.
[2024-05-28 21:55:44] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 3 ms to minimize.
[2024-05-28 21:55:45] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 2 ms to minimize.
[2024-05-28 21:55:45] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 2 ms to minimize.
[2024-05-28 21:55:45] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 2 ms to minimize.
[2024-05-28 21:55:47] [INFO ] Deduced a trap composed of 158 places in 1519 ms of which 3 ms to minimize.
[2024-05-28 21:55:47] [INFO ] Deduced a trap composed of 154 places in 253 ms of which 3 ms to minimize.
[2024-05-28 21:55:47] [INFO ] Deduced a trap composed of 172 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:55:47] [INFO ] Deduced a trap composed of 158 places in 247 ms of which 3 ms to minimize.
[2024-05-28 21:55:48] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:55:48] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 3 ms to minimize.
[2024-05-28 21:55:48] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 2 ms to minimize.
[2024-05-28 21:55:48] [INFO ] Deduced a trap composed of 160 places in 286 ms of which 4 ms to minimize.
[2024-05-28 21:55:49] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 2 ms to minimize.
[2024-05-28 21:55:49] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 3 ms to minimize.
[2024-05-28 21:55:49] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 2 ms to minimize.
[2024-05-28 21:55:56] [INFO ] Deduced a trap composed of 164 places in 6383 ms of which 3 ms to minimize.
[2024-05-28 21:55:57] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 2 ms to minimize.
[2024-05-28 21:55:57] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 2 ms to minimize.
[2024-05-28 21:55:57] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 6 ms to minimize.
[2024-05-28 21:55:58] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 2 ms to minimize.
[2024-05-28 21:55:58] [INFO ] Deduced a trap composed of 170 places in 219 ms of which 2 ms to minimize.
[2024-05-28 21:55:59] [INFO ] Deduced a trap composed of 166 places in 309 ms of which 2 ms to minimize.
[2024-05-28 21:55:59] [INFO ] Deduced a trap composed of 164 places in 298 ms of which 2 ms to minimize.
[2024-05-28 21:55:59] [INFO ] Deduced a trap composed of 162 places in 271 ms of which 2 ms to minimize.
[2024-05-28 21:56:08] [INFO ] Deduced a trap composed of 158 places in 8947 ms of which 28 ms to minimize.
[2024-05-28 21:56:09] [INFO ] Deduced a trap composed of 168 places in 279 ms of which 3 ms to minimize.
[2024-05-28 21:56:09] [INFO ] Deduced a trap composed of 158 places in 269 ms of which 3 ms to minimize.
[2024-05-28 21:56:09] [INFO ] Deduced a trap composed of 160 places in 253 ms of which 3 ms to minimize.
[2024-05-28 21:56:09] [INFO ] Deduced a trap composed of 168 places in 271 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:56:10] [INFO ] Deduced a trap composed of 156 places in 284 ms of which 3 ms to minimize.
[2024-05-28 21:56:10] [INFO ] Deduced a trap composed of 164 places in 652 ms of which 3 ms to minimize.
[2024-05-28 21:56:11] [INFO ] Deduced a trap composed of 160 places in 248 ms of which 3 ms to minimize.
[2024-05-28 21:56:11] [INFO ] Deduced a trap composed of 162 places in 233 ms of which 3 ms to minimize.
[2024-05-28 21:56:11] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 2 ms to minimize.
[2024-05-28 21:56:12] [INFO ] Deduced a trap composed of 158 places in 368 ms of which 5 ms to minimize.
[2024-05-28 21:56:12] [INFO ] Deduced a trap composed of 162 places in 322 ms of which 3 ms to minimize.
[2024-05-28 21:56:12] [INFO ] Deduced a trap composed of 154 places in 276 ms of which 3 ms to minimize.
[2024-05-28 21:56:13] [INFO ] Deduced a trap composed of 175 places in 278 ms of which 5 ms to minimize.
[2024-05-28 21:56:13] [INFO ] Deduced a trap composed of 166 places in 276 ms of which 5 ms to minimize.
[2024-05-28 21:56:13] [INFO ] Deduced a trap composed of 160 places in 272 ms of which 3 ms to minimize.
[2024-05-28 21:56:14] [INFO ] Deduced a trap composed of 164 places in 308 ms of which 2 ms to minimize.
[2024-05-28 21:56:14] [INFO ] Deduced a trap composed of 158 places in 304 ms of which 2 ms to minimize.
[2024-05-28 21:56:14] [INFO ] Deduced a trap composed of 168 places in 280 ms of which 2 ms to minimize.
[2024-05-28 21:56:15] [INFO ] Deduced a trap composed of 170 places in 280 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2024-05-28 21:56:16] [INFO ] Deduced a trap composed of 156 places in 257 ms of which 2 ms to minimize.
[2024-05-28 21:56:16] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 2 ms to minimize.
[2024-05-28 21:56:16] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 2 ms to minimize.
[2024-05-28 21:56:16] [INFO ] Deduced a trap composed of 166 places in 181 ms of which 2 ms to minimize.
[2024-05-28 21:56:16] [INFO ] Deduced a trap composed of 138 places in 185 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:56:17] [INFO ] Deduced a trap composed of 162 places in 180 ms of which 4 ms to minimize.
SMT process timed out in 45597ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 19 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 16 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2024-05-28 21:56:17] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:56:17] [INFO ] Invariant cache hit.
[2024-05-28 21:56:17] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-28 21:56:17] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:56:17] [INFO ] Invariant cache hit.
[2024-05-28 21:56:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:56:21] [INFO ] Implicit Places using invariants and state equation in 3602 ms returned []
Implicit Place search using SMT with State Equation took 4263 ms to find 0 implicit places.
[2024-05-28 21:56:21] [INFO ] Redundant transitions in 45 ms returned []
Running 971 sub problems to find dead transitions.
[2024-05-28 21:56:21] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:56:21] [INFO ] Invariant cache hit.
[2024-05-28 21:56:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:56:31] [INFO ] Deduced a trap composed of 113 places in 131 ms of which 2 ms to minimize.
[2024-05-28 21:56:31] [INFO ] Deduced a trap composed of 113 places in 150 ms of which 2 ms to minimize.
[2024-05-28 21:56:31] [INFO ] Deduced a trap composed of 117 places in 146 ms of which 2 ms to minimize.
[2024-05-28 21:56:31] [INFO ] Deduced a trap composed of 127 places in 149 ms of which 1 ms to minimize.
[2024-05-28 21:56:32] [INFO ] Deduced a trap composed of 107 places in 286 ms of which 2 ms to minimize.
[2024-05-28 21:56:32] [INFO ] Deduced a trap composed of 107 places in 161 ms of which 2 ms to minimize.
[2024-05-28 21:56:32] [INFO ] Deduced a trap composed of 132 places in 152 ms of which 1 ms to minimize.
[2024-05-28 21:56:32] [INFO ] Deduced a trap composed of 123 places in 141 ms of which 2 ms to minimize.
[2024-05-28 21:56:32] [INFO ] Deduced a trap composed of 114 places in 143 ms of which 2 ms to minimize.
[2024-05-28 21:56:33] [INFO ] Deduced a trap composed of 118 places in 133 ms of which 2 ms to minimize.
[2024-05-28 21:56:33] [INFO ] Deduced a trap composed of 118 places in 135 ms of which 2 ms to minimize.
[2024-05-28 21:56:33] [INFO ] Deduced a trap composed of 166 places in 116 ms of which 2 ms to minimize.
[2024-05-28 21:56:33] [INFO ] Deduced a trap composed of 170 places in 133 ms of which 2 ms to minimize.
[2024-05-28 21:56:34] [INFO ] Deduced a trap composed of 168 places in 139 ms of which 1 ms to minimize.
[2024-05-28 21:56:34] [INFO ] Deduced a trap composed of 156 places in 147 ms of which 2 ms to minimize.
[2024-05-28 21:56:34] [INFO ] Deduced a trap composed of 170 places in 141 ms of which 2 ms to minimize.
[2024-05-28 21:56:34] [INFO ] Deduced a trap composed of 158 places in 136 ms of which 2 ms to minimize.
[2024-05-28 21:56:34] [INFO ] Deduced a trap composed of 158 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:56:34] [INFO ] Deduced a trap composed of 162 places in 134 ms of which 2 ms to minimize.
[2024-05-28 21:56:35] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:56:35] [INFO ] Deduced a trap composed of 177 places in 121 ms of which 2 ms to minimize.
[2024-05-28 21:56:35] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 2 ms to minimize.
[2024-05-28 21:56:36] [INFO ] Deduced a trap composed of 117 places in 142 ms of which 2 ms to minimize.
[2024-05-28 21:56:36] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:56:36] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 2 ms to minimize.
[2024-05-28 21:56:36] [INFO ] Deduced a trap composed of 117 places in 149 ms of which 2 ms to minimize.
[2024-05-28 21:56:36] [INFO ] Deduced a trap composed of 122 places in 150 ms of which 2 ms to minimize.
[2024-05-28 21:56:36] [INFO ] Deduced a trap composed of 117 places in 136 ms of which 2 ms to minimize.
[2024-05-28 21:56:37] [INFO ] Deduced a trap composed of 112 places in 142 ms of which 2 ms to minimize.
[2024-05-28 21:56:37] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 2 ms to minimize.
[2024-05-28 21:56:37] [INFO ] Deduced a trap composed of 127 places in 150 ms of which 2 ms to minimize.
[2024-05-28 21:56:37] [INFO ] Deduced a trap composed of 118 places in 145 ms of which 2 ms to minimize.
[2024-05-28 21:56:37] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 2 ms to minimize.
[2024-05-28 21:56:37] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 2 ms to minimize.
[2024-05-28 21:56:38] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 2 ms to minimize.
[2024-05-28 21:56:38] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 2 ms to minimize.
[2024-05-28 21:56:38] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 2 ms to minimize.
[2024-05-28 21:56:38] [INFO ] Deduced a trap composed of 117 places in 134 ms of which 3 ms to minimize.
[2024-05-28 21:56:38] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 2 ms to minimize.
[2024-05-28 21:56:38] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:56:45] [INFO ] Deduced a trap composed of 77 places in 210 ms of which 3 ms to minimize.
[2024-05-28 21:56:45] [INFO ] Deduced a trap composed of 60 places in 176 ms of which 2 ms to minimize.
[2024-05-28 21:56:45] [INFO ] Deduced a trap composed of 92 places in 192 ms of which 3 ms to minimize.
[2024-05-28 21:56:45] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 2 ms to minimize.
[2024-05-28 21:56:46] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 2 ms to minimize.
[2024-05-28 21:56:46] [INFO ] Deduced a trap composed of 129 places in 136 ms of which 2 ms to minimize.
[2024-05-28 21:56:46] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 2 ms to minimize.
[2024-05-28 21:56:46] [INFO ] Deduced a trap composed of 133 places in 131 ms of which 2 ms to minimize.
[2024-05-28 21:56:46] [INFO ] Deduced a trap composed of 164 places in 142 ms of which 2 ms to minimize.
[2024-05-28 21:56:46] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 2 ms to minimize.
[2024-05-28 21:56:46] [INFO ] Deduced a trap composed of 129 places in 135 ms of which 2 ms to minimize.
[2024-05-28 21:56:47] [INFO ] Deduced a trap composed of 123 places in 135 ms of which 2 ms to minimize.
[2024-05-28 21:56:47] [INFO ] Deduced a trap composed of 123 places in 141 ms of which 2 ms to minimize.
[2024-05-28 21:56:47] [INFO ] Deduced a trap composed of 118 places in 147 ms of which 2 ms to minimize.
[2024-05-28 21:56:47] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 2 ms to minimize.
[2024-05-28 21:56:47] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 2 ms to minimize.
[2024-05-28 21:56:47] [INFO ] Deduced a trap composed of 161 places in 146 ms of which 2 ms to minimize.
[2024-05-28 21:56:47] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 1 ms to minimize.
[2024-05-28 21:56:48] [INFO ] Deduced a trap composed of 171 places in 146 ms of which 2 ms to minimize.
[2024-05-28 21:56:48] [INFO ] Deduced a trap composed of 102 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:56:49] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 3 ms to minimize.
[2024-05-28 21:56:49] [INFO ] Deduced a trap composed of 117 places in 169 ms of which 2 ms to minimize.
[2024-05-28 21:56:49] [INFO ] Deduced a trap composed of 113 places in 157 ms of which 2 ms to minimize.
[2024-05-28 21:56:49] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 2 ms to minimize.
[2024-05-28 21:56:50] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 2 ms to minimize.
[2024-05-28 21:56:50] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 2 ms to minimize.
[2024-05-28 21:56:50] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 2 ms to minimize.
[2024-05-28 21:56:50] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 2 ms to minimize.
[2024-05-28 21:56:50] [INFO ] Deduced a trap composed of 103 places in 158 ms of which 3 ms to minimize.
[2024-05-28 21:56:50] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 3 ms to minimize.
[2024-05-28 21:56:51] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 2 ms to minimize.
[2024-05-28 21:56:51] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 2 ms to minimize.
[2024-05-28 21:56:51] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 2 ms to minimize.
[2024-05-28 21:56:51] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 1 ms to minimize.
[2024-05-28 21:56:51] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 2 ms to minimize.
[2024-05-28 21:56:52] [INFO ] Deduced a trap composed of 129 places in 142 ms of which 2 ms to minimize.
[2024-05-28 21:56:52] [INFO ] Deduced a trap composed of 130 places in 151 ms of which 2 ms to minimize.
[2024-05-28 21:56:52] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 2 ms to minimize.
[2024-05-28 21:56:52] [INFO ] Deduced a trap composed of 134 places in 134 ms of which 2 ms to minimize.
[2024-05-28 21:56:52] [INFO ] Deduced a trap composed of 174 places in 151 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:56:53] [INFO ] Deduced a trap composed of 127 places in 146 ms of which 2 ms to minimize.
[2024-05-28 21:56:53] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 2 ms to minimize.
[2024-05-28 21:56:54] [INFO ] Deduced a trap composed of 109 places in 149 ms of which 2 ms to minimize.
[2024-05-28 21:56:54] [INFO ] Deduced a trap composed of 103 places in 178 ms of which 2 ms to minimize.
[2024-05-28 21:56:54] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 2 ms to minimize.
[2024-05-28 21:56:54] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 2 ms to minimize.
[2024-05-28 21:56:55] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 2 ms to minimize.
[2024-05-28 21:56:55] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 2 ms to minimize.
[2024-05-28 21:56:55] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 2 ms to minimize.
[2024-05-28 21:56:55] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 2 ms to minimize.
[2024-05-28 21:56:55] [INFO ] Deduced a trap composed of 118 places in 135 ms of which 2 ms to minimize.
[2024-05-28 21:56:56] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 2 ms to minimize.
[2024-05-28 21:56:56] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:56:56] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 2 ms to minimize.
SMT process timed out in 35071ms, After SMT, problems are : Problem set: 0 solved, 971 unsolved
Search for dead transitions found 0 dead transitions in 35086ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39436 ms. Remains : 411/411 places, 982/982 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[77]
Starting property specific reduction for PolyORBNT-PT-S10J20-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[77]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[77]
[2024-05-28 21:56:56] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:56:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[77]
RANDOM walk for 10000 steps (722 resets) in 71 ms. (138 steps per ms)
BEST_FIRST walk for 10001 steps (86 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[77]
[2024-05-28 21:56:56] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:56:56] [INFO ] Invariant cache hit.
[2024-05-28 21:56:56] [INFO ] [Real]Absence check using 44 positive place invariants in 9 ms returned sat
[2024-05-28 21:56:56] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 26 ms returned sat
[2024-05-28 21:56:56] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2024-05-28 21:56:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:56:57] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2024-05-28 21:56:57] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 8 ms returned sat
[2024-05-28 21:56:57] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2024-05-28 21:56:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:56:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 104 ms returned sat
[2024-05-28 21:56:57] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 2 ms to minimize.
[2024-05-28 21:56:58] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 3 ms to minimize.
[2024-05-28 21:56:58] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 2 ms to minimize.
[2024-05-28 21:56:58] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 2 ms to minimize.
[2024-05-28 21:56:58] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 2 ms to minimize.
[2024-05-28 21:56:59] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 2 ms to minimize.
[2024-05-28 21:56:59] [INFO ] Deduced a trap composed of 169 places in 206 ms of which 2 ms to minimize.
[2024-05-28 21:56:59] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 2 ms to minimize.
[2024-05-28 21:56:59] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 2 ms to minimize.
[2024-05-28 21:57:00] [INFO ] Deduced a trap composed of 156 places in 264 ms of which 2 ms to minimize.
[2024-05-28 21:57:00] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 2 ms to minimize.
[2024-05-28 21:57:00] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 2 ms to minimize.
[2024-05-28 21:57:00] [INFO ] Deduced a trap composed of 166 places in 245 ms of which 2 ms to minimize.
[2024-05-28 21:57:01] [INFO ] Deduced a trap composed of 156 places in 181 ms of which 2 ms to minimize.
[2024-05-28 21:57:01] [INFO ] Deduced a trap composed of 168 places in 290 ms of which 3 ms to minimize.
[2024-05-28 21:57:01] [INFO ] Deduced a trap composed of 168 places in 319 ms of which 3 ms to minimize.
[2024-05-28 21:57:02] [INFO ] Trap strengthening (SAT) tested/added 16/16 trap constraints in 4494 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[77]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[77]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 25 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Running 971 sub problems to find dead transitions.
[2024-05-28 21:57:02] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:57:02] [INFO ] Invariant cache hit.
[2024-05-28 21:57:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:57:11] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 2 ms to minimize.
[2024-05-28 21:57:11] [INFO ] Deduced a trap composed of 113 places in 141 ms of which 2 ms to minimize.
[2024-05-28 21:57:11] [INFO ] Deduced a trap composed of 117 places in 197 ms of which 2 ms to minimize.
[2024-05-28 21:57:11] [INFO ] Deduced a trap composed of 127 places in 180 ms of which 3 ms to minimize.
[2024-05-28 21:57:12] [INFO ] Deduced a trap composed of 107 places in 201 ms of which 3 ms to minimize.
[2024-05-28 21:57:12] [INFO ] Deduced a trap composed of 107 places in 314 ms of which 3 ms to minimize.
[2024-05-28 21:57:12] [INFO ] Deduced a trap composed of 132 places in 160 ms of which 3 ms to minimize.
[2024-05-28 21:57:12] [INFO ] Deduced a trap composed of 123 places in 167 ms of which 2 ms to minimize.
[2024-05-28 21:57:12] [INFO ] Deduced a trap composed of 114 places in 165 ms of which 2 ms to minimize.
[2024-05-28 21:57:13] [INFO ] Deduced a trap composed of 118 places in 150 ms of which 2 ms to minimize.
[2024-05-28 21:57:13] [INFO ] Deduced a trap composed of 118 places in 128 ms of which 2 ms to minimize.
[2024-05-28 21:57:14] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 2 ms to minimize.
[2024-05-28 21:57:14] [INFO ] Deduced a trap composed of 170 places in 145 ms of which 3 ms to minimize.
[2024-05-28 21:57:14] [INFO ] Deduced a trap composed of 168 places in 147 ms of which 3 ms to minimize.
[2024-05-28 21:57:14] [INFO ] Deduced a trap composed of 156 places in 164 ms of which 3 ms to minimize.
[2024-05-28 21:57:14] [INFO ] Deduced a trap composed of 170 places in 162 ms of which 3 ms to minimize.
[2024-05-28 21:57:14] [INFO ] Deduced a trap composed of 158 places in 151 ms of which 2 ms to minimize.
[2024-05-28 21:57:15] [INFO ] Deduced a trap composed of 158 places in 132 ms of which 2 ms to minimize.
[2024-05-28 21:57:15] [INFO ] Deduced a trap composed of 162 places in 149 ms of which 2 ms to minimize.
[2024-05-28 21:57:15] [INFO ] Deduced a trap composed of 117 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:57:16] [INFO ] Deduced a trap composed of 177 places in 187 ms of which 2 ms to minimize.
[2024-05-28 21:57:16] [INFO ] Deduced a trap composed of 107 places in 162 ms of which 3 ms to minimize.
[2024-05-28 21:57:17] [INFO ] Deduced a trap composed of 117 places in 172 ms of which 2 ms to minimize.
[2024-05-28 21:57:17] [INFO ] Deduced a trap composed of 119 places in 153 ms of which 2 ms to minimize.
[2024-05-28 21:57:17] [INFO ] Deduced a trap composed of 112 places in 170 ms of which 2 ms to minimize.
[2024-05-28 21:57:17] [INFO ] Deduced a trap composed of 117 places in 158 ms of which 2 ms to minimize.
[2024-05-28 21:57:17] [INFO ] Deduced a trap composed of 122 places in 201 ms of which 3 ms to minimize.
[2024-05-28 21:57:18] [INFO ] Deduced a trap composed of 117 places in 171 ms of which 3 ms to minimize.
[2024-05-28 21:57:18] [INFO ] Deduced a trap composed of 112 places in 181 ms of which 4 ms to minimize.
[2024-05-28 21:57:18] [INFO ] Deduced a trap composed of 107 places in 198 ms of which 3 ms to minimize.
[2024-05-28 21:57:18] [INFO ] Deduced a trap composed of 127 places in 179 ms of which 2 ms to minimize.
[2024-05-28 21:57:18] [INFO ] Deduced a trap composed of 118 places in 135 ms of which 2 ms to minimize.
[2024-05-28 21:57:18] [INFO ] Deduced a trap composed of 117 places in 132 ms of which 2 ms to minimize.
[2024-05-28 21:57:19] [INFO ] Deduced a trap composed of 112 places in 189 ms of which 3 ms to minimize.
[2024-05-28 21:57:19] [INFO ] Deduced a trap composed of 112 places in 159 ms of which 2 ms to minimize.
[2024-05-28 21:57:19] [INFO ] Deduced a trap composed of 98 places in 205 ms of which 2 ms to minimize.
[2024-05-28 21:57:19] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 3 ms to minimize.
[2024-05-28 21:57:19] [INFO ] Deduced a trap composed of 117 places in 157 ms of which 3 ms to minimize.
[2024-05-28 21:57:20] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 2 ms to minimize.
[2024-05-28 21:57:20] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:57:25] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 2 ms to minimize.
[2024-05-28 21:57:25] [INFO ] Deduced a trap composed of 60 places in 144 ms of which 1 ms to minimize.
[2024-05-28 21:57:26] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 2 ms to minimize.
[2024-05-28 21:57:26] [INFO ] Deduced a trap composed of 168 places in 138 ms of which 2 ms to minimize.
SMT process timed out in 24306ms, After SMT, problems are : Problem set: 0 solved, 971 unsolved
Search for dead transitions found 0 dead transitions in 24318ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24347 ms. Remains : 411/411 places, 982/982 transitions.
[2024-05-28 21:57:26] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:57:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[77]
RANDOM walk for 1000000 steps (70504 resets) in 6792 ms. (147 steps per ms)
BEST_FIRST walk for 1000000 steps (9458 resets) in 1308 ms. (763 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[77]
[2024-05-28 21:57:34] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:57:34] [INFO ] Invariant cache hit.
[2024-05-28 21:57:34] [INFO ] [Real]Absence check using 44 positive place invariants in 13 ms returned sat
[2024-05-28 21:57:34] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 15 ms returned sat
[2024-05-28 21:57:34] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2024-05-28 21:57:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:57:34] [INFO ] [Nat]Absence check using 44 positive place invariants in 8 ms returned sat
[2024-05-28 21:57:34] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 9 ms returned sat
[2024-05-28 21:57:35] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2024-05-28 21:57:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:57:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 57 ms returned sat
[2024-05-28 21:57:35] [INFO ] Deduced a trap composed of 164 places in 279 ms of which 3 ms to minimize.
[2024-05-28 21:57:35] [INFO ] Deduced a trap composed of 164 places in 252 ms of which 2 ms to minimize.
[2024-05-28 21:57:36] [INFO ] Deduced a trap composed of 164 places in 267 ms of which 3 ms to minimize.
[2024-05-28 21:57:36] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 2 ms to minimize.
[2024-05-28 21:57:36] [INFO ] Deduced a trap composed of 160 places in 232 ms of which 2 ms to minimize.
[2024-05-28 21:57:37] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 2 ms to minimize.
[2024-05-28 21:57:37] [INFO ] Deduced a trap composed of 169 places in 203 ms of which 2 ms to minimize.
[2024-05-28 21:57:37] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 2 ms to minimize.
[2024-05-28 21:57:37] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 2 ms to minimize.
[2024-05-28 21:57:37] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 3 ms to minimize.
[2024-05-28 21:57:38] [INFO ] Deduced a trap composed of 168 places in 266 ms of which 2 ms to minimize.
[2024-05-28 21:57:38] [INFO ] Deduced a trap composed of 164 places in 256 ms of which 2 ms to minimize.
[2024-05-28 21:57:39] [INFO ] Deduced a trap composed of 166 places in 238 ms of which 2 ms to minimize.
[2024-05-28 21:57:39] [INFO ] Deduced a trap composed of 156 places in 215 ms of which 2 ms to minimize.
[2024-05-28 21:57:39] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 2 ms to minimize.
[2024-05-28 21:57:39] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 2 ms to minimize.
[2024-05-28 21:57:40] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 2 ms to minimize.
[2024-05-28 21:57:40] [INFO ] Deduced a trap composed of 169 places in 252 ms of which 2 ms to minimize.
[2024-05-28 21:57:40] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 2 ms to minimize.
[2024-05-28 21:57:40] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 2 ms to minimize.
[2024-05-28 21:57:41] [INFO ] Deduced a trap composed of 158 places in 260 ms of which 3 ms to minimize.
[2024-05-28 21:57:41] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 3 ms to minimize.
[2024-05-28 21:57:42] [INFO ] Deduced a trap composed of 165 places in 232 ms of which 2 ms to minimize.
[2024-05-28 21:57:42] [INFO ] Deduced a trap composed of 171 places in 201 ms of which 2 ms to minimize.
[2024-05-28 21:57:42] [INFO ] Deduced a trap composed of 175 places in 202 ms of which 2 ms to minimize.
[2024-05-28 21:57:42] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 2 ms to minimize.
[2024-05-28 21:57:43] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 2 ms to minimize.
[2024-05-28 21:57:43] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 2 ms to minimize.
[2024-05-28 21:57:43] [INFO ] Deduced a trap composed of 162 places in 264 ms of which 2 ms to minimize.
[2024-05-28 21:57:44] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 2 ms to minimize.
[2024-05-28 21:57:44] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 2 ms to minimize.
[2024-05-28 21:57:44] [INFO ] Deduced a trap composed of 172 places in 247 ms of which 2 ms to minimize.
[2024-05-28 21:57:44] [INFO ] Deduced a trap composed of 167 places in 219 ms of which 2 ms to minimize.
[2024-05-28 21:57:45] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 2 ms to minimize.
[2024-05-28 21:57:45] [INFO ] Deduced a trap composed of 167 places in 259 ms of which 3 ms to minimize.
[2024-05-28 21:57:46] [INFO ] Deduced a trap composed of 167 places in 290 ms of which 2 ms to minimize.
[2024-05-28 21:57:46] [INFO ] Deduced a trap composed of 175 places in 261 ms of which 2 ms to minimize.
[2024-05-28 21:57:47] [INFO ] Deduced a trap composed of 164 places in 289 ms of which 2 ms to minimize.
[2024-05-28 21:57:47] [INFO ] Deduced a trap composed of 158 places in 266 ms of which 2 ms to minimize.
[2024-05-28 21:57:48] [INFO ] Deduced a trap composed of 169 places in 266 ms of which 3 ms to minimize.
[2024-05-28 21:57:48] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 2 ms to minimize.
[2024-05-28 21:57:48] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 2 ms to minimize.
[2024-05-28 21:57:48] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 2 ms to minimize.
[2024-05-28 21:57:49] [INFO ] Deduced a trap composed of 164 places in 251 ms of which 2 ms to minimize.
[2024-05-28 21:57:49] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 2 ms to minimize.
[2024-05-28 21:57:49] [INFO ] Deduced a trap composed of 169 places in 209 ms of which 2 ms to minimize.
[2024-05-28 21:57:50] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 2 ms to minimize.
[2024-05-28 21:57:50] [INFO ] Deduced a trap composed of 169 places in 205 ms of which 2 ms to minimize.
[2024-05-28 21:57:50] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 2 ms to minimize.
[2024-05-28 21:57:50] [INFO ] Deduced a trap composed of 173 places in 232 ms of which 2 ms to minimize.
[2024-05-28 21:57:51] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 2 ms to minimize.
[2024-05-28 21:57:51] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 2 ms to minimize.
[2024-05-28 21:57:55] [INFO ] Trap strengthening (SAT) tested/added 52/52 trap constraints in 20492 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[77]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[77]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 40 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 32 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2024-05-28 21:57:55] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:57:55] [INFO ] Invariant cache hit.
[2024-05-28 21:57:56] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-05-28 21:57:56] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:57:56] [INFO ] Invariant cache hit.
[2024-05-28 21:57:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:58:00] [INFO ] Implicit Places using invariants and state equation in 3851 ms returned []
Implicit Place search using SMT with State Equation took 4413 ms to find 0 implicit places.
[2024-05-28 21:58:00] [INFO ] Redundant transitions in 15 ms returned []
Running 971 sub problems to find dead transitions.
[2024-05-28 21:58:00] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-28 21:58:00] [INFO ] Invariant cache hit.
[2024-05-28 21:58:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 971 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:58:09] [INFO ] Deduced a trap composed of 113 places in 132 ms of which 2 ms to minimize.
[2024-05-28 21:58:09] [INFO ] Deduced a trap composed of 113 places in 132 ms of which 1 ms to minimize.
[2024-05-28 21:58:10] [INFO ] Deduced a trap composed of 117 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:58:10] [INFO ] Deduced a trap composed of 127 places in 146 ms of which 2 ms to minimize.
[2024-05-28 21:58:10] [INFO ] Deduced a trap composed of 107 places in 141 ms of which 2 ms to minimize.
[2024-05-28 21:58:10] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 2 ms to minimize.
[2024-05-28 21:58:10] [INFO ] Deduced a trap composed of 132 places in 138 ms of which 1 ms to minimize.
[2024-05-28 21:58:10] [INFO ] Deduced a trap composed of 123 places in 142 ms of which 2 ms to minimize.
[2024-05-28 21:58:10] [INFO ] Deduced a trap composed of 114 places in 142 ms of which 2 ms to minimize.
[2024-05-28 21:58:11] [INFO ] Deduced a trap composed of 118 places in 132 ms of which 2 ms to minimize.
[2024-05-28 21:58:11] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 2 ms to minimize.
[2024-05-28 21:58:11] [INFO ] Deduced a trap composed of 166 places in 135 ms of which 2 ms to minimize.
[2024-05-28 21:58:12] [INFO ] Deduced a trap composed of 170 places in 178 ms of which 2 ms to minimize.
[2024-05-28 21:58:12] [INFO ] Deduced a trap composed of 168 places in 138 ms of which 2 ms to minimize.
[2024-05-28 21:58:12] [INFO ] Deduced a trap composed of 156 places in 143 ms of which 2 ms to minimize.
[2024-05-28 21:58:12] [INFO ] Deduced a trap composed of 170 places in 146 ms of which 10 ms to minimize.
[2024-05-28 21:58:12] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 2 ms to minimize.
[2024-05-28 21:58:12] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 2 ms to minimize.
[2024-05-28 21:58:13] [INFO ] Deduced a trap composed of 162 places in 152 ms of which 2 ms to minimize.
[2024-05-28 21:58:13] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 971 unsolved
[2024-05-28 21:58:14] [INFO ] Deduced a trap composed of 177 places in 280 ms of which 7 ms to minimize.

BK_STOP 1716933497838

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S10J20, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654447200485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;