fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r092-tall-171624189900733
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DES-PT-50a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1856.796 219520.00 364304.00 388.50 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r092-tall-171624189900733.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DES-PT-50a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189900733
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 08:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 97K May 18 16:42 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 DES-PT-50a-UpperBounds-00
FORMULA_NAME DES-PT-50a-UpperBounds-01
FORMULA_NAME DES-PT-50a-UpperBounds-02
FORMULA_NAME DES-PT-50a-UpperBounds-03
FORMULA_NAME DES-PT-50a-UpperBounds-04
FORMULA_NAME DES-PT-50a-UpperBounds-05
FORMULA_NAME DES-PT-50a-UpperBounds-06
FORMULA_NAME DES-PT-50a-UpperBounds-07
FORMULA_NAME DES-PT-50a-UpperBounds-08
FORMULA_NAME DES-PT-50a-UpperBounds-09
FORMULA_NAME DES-PT-50a-UpperBounds-10
FORMULA_NAME DES-PT-50a-UpperBounds-11
FORMULA_NAME DES-PT-50a-UpperBounds-12
FORMULA_NAME DES-PT-50a-UpperBounds-13
FORMULA_NAME DES-PT-50a-UpperBounds-14
FORMULA_NAME DES-PT-50a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716358516166

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-22 06:15:17] [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-22 06:15:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 06:15:17] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-22 06:15:17] [INFO ] Transformed 314 places.
[2024-05-22 06:15:17] [INFO ] Transformed 271 transitions.
[2024-05-22 06:15:17] [INFO ] Found NUPN structural information;
[2024-05-22 06:15:17] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 257 rows 314 cols
[2024-05-22 06:15:17] [INFO ] Computed 59 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (217 resets) in 97 ms. (102 steps per ms)
FORMULA DES-PT-50a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (364 resets) in 198 ms. (402 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-22 06:15:17] [INFO ] Invariant cache hit.
[2024-05-22 06:15:18] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-22 06:15:18] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2024-05-22 06:15:18] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-22 06:15:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:18] [INFO ] [Nat]Absence check using 34 positive place invariants in 13 ms returned sat
[2024-05-22 06:15:18] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 06:15:18] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-22 06:15:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 06:15:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 54 ms returned sat
[2024-05-22 06:15:18] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 22 ms.
[2024-05-22 06:15:19] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 19 ms to minimize.
[2024-05-22 06:15:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2024-05-22 06:15:19] [INFO ] Added : 130 causal constraints over 27 iterations in 1133 ms. Result :sat
Minimization took 274 ms.
[2024-05-22 06:15:20] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 06:15:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 06:15:20] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-22 06:15:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 06:15:20] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 06:15:20] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-22 06:15:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2024-05-22 06:15:20] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 18 ms.
[2024-05-22 06:15:21] [INFO ] Added : 67 causal constraints over 14 iterations in 472 ms. Result :sat
Minimization took 188 ms.
[2024-05-22 06:15:21] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-22 06:15:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 06:15:21] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-22 06:15:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 06:15:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 06:15:21] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-22 06:15:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 29 ms returned sat
[2024-05-22 06:15:21] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 21 ms.
[2024-05-22 06:15:22] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-22 06:15:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-22 06:15:22] [INFO ] Added : 112 causal constraints over 23 iterations in 873 ms. Result :sat
Minimization took 262 ms.
[2024-05-22 06:15:22] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 06:15:23] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 06:15:23] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-05-22 06:15:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2024-05-22 06:15:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-22 06:15:23] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-22 06:15:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 82 ms returned sat
[2024-05-22 06:15:23] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-22 06:15:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-22 06:15:23] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 17 ms.
[2024-05-22 06:15:24] [INFO ] Added : 146 causal constraints over 30 iterations in 755 ms. Result :sat
Minimization took 243 ms.
[2024-05-22 06:15:24] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 06:15:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 06:15:24] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-22 06:15:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 06:15:24] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 06:15:25] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2024-05-22 06:15:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 74 ms returned sat
[2024-05-22 06:15:25] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 15 ms.
[2024-05-22 06:15:25] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-22 06:15:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-22 06:15:25] [INFO ] Added : 104 causal constraints over 21 iterations in 615 ms. Result :sat
Minimization took 292 ms.
[2024-05-22 06:15:26] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 06:15:26] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-22 06:15:26] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-22 06:15:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-22 06:15:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-22 06:15:26] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-22 06:15:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 142 ms returned sat
[2024-05-22 06:15:26] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 23 ms.
[2024-05-22 06:15:27] [INFO ] Added : 86 causal constraints over 18 iterations in 557 ms. Result :sat
Minimization took 313 ms.
[2024-05-22 06:15:27] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 06:15:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 06:15:27] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-22 06:15:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 06:15:27] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 06:15:28] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-22 06:15:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 71 ms returned sat
[2024-05-22 06:15:28] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 19 ms.
[2024-05-22 06:15:28] [INFO ] Added : 73 causal constraints over 15 iterations in 537 ms. Result :sat
Minimization took 270 ms.
[2024-05-22 06:15:29] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 06:15:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 06:15:29] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-05-22 06:15:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 06:15:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 06:15:29] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-22 06:15:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2024-05-22 06:15:29] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-22 06:15:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-22 06:15:29] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 15 ms.
[2024-05-22 06:15:30] [INFO ] Added : 153 causal constraints over 31 iterations in 839 ms. Result :sat
Minimization took 285 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA DES-PT-50a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 314 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 313 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 313 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 313 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 312 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 311 transition count 253
Applied a total of 12 rules in 113 ms. Remains 311 /314 variables (removed 3) and now considering 253/257 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 311/314 places, 253/257 transitions.
// Phase 1: matrix 253 rows 311 cols
[2024-05-22 06:15:32] [INFO ] Computed 60 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13695 resets) in 1978 ms. (505 steps per ms)
BEST_FIRST walk for 7000007 steps (16034 resets) in 6377 ms. (1097 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-22 06:15:41] [INFO ] Invariant cache hit.
[2024-05-22 06:15:41] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 06:15:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 06:15:41] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-22 06:15:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 06:15:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 06:15:41] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-22 06:15:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:15:41] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-22 06:15:41] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-22 06:15:42] [INFO ] Added : 119 causal constraints over 24 iterations in 488 ms. Result :sat
Minimization took 120 ms.
[2024-05-22 06:15:42] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 06:15:42] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 06:15:42] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-22 06:15:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 06:15:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 06:15:42] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-22 06:15:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-22 06:15:42] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 5 ms to minimize.
[2024-05-22 06:15:42] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-22 06:15:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2024-05-22 06:15:42] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-22 06:15:43] [INFO ] Added : 125 causal constraints over 26 iterations in 481 ms. Result :sat
Minimization took 116 ms.
[2024-05-22 06:15:43] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 06:15:43] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 06:15:43] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-22 06:15:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 06:15:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 06:15:43] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-22 06:15:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 19 ms returned sat
[2024-05-22 06:15:43] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-22 06:15:44] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-22 06:15:44] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-22 06:15:44] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:15:44] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 06:15:44] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 06:15:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 476 ms
[2024-05-22 06:15:45] [INFO ] Added : 195 causal constraints over 39 iterations in 1229 ms. Result :sat
Minimization took 131 ms.
[2024-05-22 06:15:45] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 06:15:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 06:15:45] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-22 06:15:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 06:15:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 06:15:45] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-22 06:15:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2024-05-22 06:15:45] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-22 06:15:46] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-22 06:15:46] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-05-22 06:15:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2024-05-22 06:15:46] [INFO ] Added : 151 causal constraints over 31 iterations in 774 ms. Result :sat
Minimization took 120 ms.
[2024-05-22 06:15:46] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 06:15:46] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 06:15:46] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-22 06:15:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 06:15:46] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 06:15:46] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-22 06:15:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-22 06:15:46] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-22 06:15:47] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-22 06:15:47] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-22 06:15:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2024-05-22 06:15:47] [INFO ] Added : 95 causal constraints over 20 iterations in 656 ms. Result :sat
Minimization took 99 ms.
[2024-05-22 06:15:47] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 06:15:47] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 06:15:47] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-22 06:15:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 06:15:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 06:15:47] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-22 06:15:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2024-05-22 06:15:47] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-22 06:15:48] [INFO ] Added : 77 causal constraints over 16 iterations in 354 ms. Result :sat
Minimization took 95 ms.
[2024-05-22 06:15:48] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 06:15:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 06:15:48] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-22 06:15:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 06:15:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 06:15:48] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 06:15:48] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-22 06:15:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 06:15:48] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 17 ms.
[2024-05-22 06:15:49] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:15:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-22 06:15:49] [INFO ] Added : 172 causal constraints over 36 iterations in 807 ms. Result :sat
Minimization took 118 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 23 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-22 06:15:51] [INFO ] Invariant cache hit.
[2024-05-22 06:15:52] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-22 06:15:52] [INFO ] Invariant cache hit.
[2024-05-22 06:15:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:15:52] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2024-05-22 06:15:52] [INFO ] Redundant transitions in 9 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-22 06:15:52] [INFO ] Invariant cache hit.
[2024-05-22 06:15:52] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-22 06:15:59] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-22 06:16:03] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-22 06:16:03] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-22 06:16:03] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-22 06:16:03] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-22 06:16:03] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-22 06:16:03] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-22 06:16:03] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-22 06:16:04] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 8/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 1/564 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-22 06:16:09] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-22 06:16:12] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-22 06:16:16] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 250/633 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-22 06:16:48] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-22 06:16:52] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 635 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 13/14 constraints]
After SMT, in 60569ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60587ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61487 ms. Remains : 311/311 places, 253/253 transitions.
RANDOM walk for 40000 steps (553 resets) in 1627 ms. (24 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (95 resets) in 228 ms. (174 steps per ms) remains 14/14 properties
[2024-05-22 06:16:54] [INFO ] Flatten gal took : 200 ms
BEST_FIRST walk for 40004 steps (95 resets) in 221 ms. (180 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (89 resets) in 260 ms. (153 steps per ms) remains 14/14 properties
[2024-05-22 06:16:54] [INFO ] Flatten gal took : 168 ms
BEST_FIRST walk for 40004 steps (98 resets) in 276 ms. (144 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (92 resets) in 123 ms. (322 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (91 resets) in 179 ms. (222 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (81 resets) in 142 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (85 resets) in 229 ms. (173 steps per ms) remains 14/14 properties
[2024-05-22 06:16:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8773097764571145714.gal : 76 ms
[2024-05-22 06:16:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16749032058630581793.prop : 3 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/ReachabilityCardinality8773097764571145714.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16749032058630581793.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (80 resets) in 176 ms. (226 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (87 resets) in 167 ms. (238 steps per ms) remains 14/14 properties

BEST_FIRST walk for 40004 steps (97 resets) in 169 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (87 resets) in 154 ms. (258 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (91 resets) in 130 ms. (305 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (98 resets) in 106 ms. (373 steps per ms) remains 14/14 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16749032058630581793.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :10 after 18
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :18 after 22
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :22 after 576
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :576 after 630
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :630 after 1440
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :1440 after 11292
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :11292 after 69964
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :69964 after 93680
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :364744 after 412888
Interrupted probabilistic random walk after 598103 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 14
Probabilistic random walk after 598103 steps, saw 86078 distinct states, run finished after 3004 ms. (steps per millisecond=199 ) properties seen :0
[2024-05-22 06:16:58] [INFO ] Invariant cache hit.
[2024-05-22 06:16:58] [INFO ] State equation strengthened by 2 read => feed constraints.
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :412888 after 6.77365e+08
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 180/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/220 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 25/245 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 7/252 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 204/456 variables, 252/307 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,14 properties remain. new max is 32768
[2024-05-22 06:17:02] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
SDD size :7.06975e+08 after 7.0795e+08
[2024-05-22 06:17:02] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 63/519 variables, 14/325 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 1/520 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:17:02] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 14 ms to minimize.
[2024-05-22 06:17:02] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/564 variables, and 333 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 267/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 180/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 33/220 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 25/245 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 7/252 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 204/456 variables, 252/310 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 10/322 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 63/519 variables, 14/336 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/519 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 1/520 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/520 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/520 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 44/564 variables, 44/391 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:17:07] [INFO ] Deduced a trap composed of 8 places in 996 ms of which 5 ms to minimize.
SDD proceeding with computation,14 properties remain. new max is 65536
SDD size :7.29588e+08 after 7.96643e+09
[2024-05-22 06:17:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/564 variables, and 393 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 6/6 constraints]
After SMT, in 10054ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 25 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 311/311 places, 253/253 transitions.
RANDOM walk for 40000 steps (558 resets) in 937 ms. (42 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (85 resets) in 222 ms. (179 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (85 resets) in 87 ms. (454 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (92 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (92 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (90 resets) in 74 ms. (533 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (92 resets) in 121 ms. (327 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (89 resets) in 110 ms. (360 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (86 resets) in 143 ms. (277 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (90 resets) in 108 ms. (367 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (94 resets) in 135 ms. (294 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (83 resets) in 63 ms. (625 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (87 resets) in 89 ms. (444 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (95 resets) in 63 ms. (625 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (93 resets) in 88 ms. (449 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 600887 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 14
Probabilistic random walk after 600887 steps, saw 86447 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2024-05-22 06:17:12] [INFO ] Invariant cache hit.
[2024-05-22 06:17:12] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 180/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/220 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 25/245 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 7/252 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 204/456 variables, 252/307 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:17:16] [INFO ] Deduced a trap composed of 8 places in 1452 ms of which 1 ms to minimize.
[2024-05-22 06:17:16] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 63/519 variables, 14/325 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 1/520 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (OVERLAPS) 44/564 variables, 44/375 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:17:18] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 6 ms to minimize.
[2024-05-22 06:17:19] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
SDD proceeding with computation,14 properties remain. new max is 131072
SDD size :8.45539e+09 after 3.36009e+10
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 377 constraints, problems are : Problem set: 0 solved, 14 unsolved in 8717 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 180/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 33/220 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 25/245 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 7/252 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 204/456 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 10/321 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:17:22] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 63/519 variables, 14/336 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/519 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/519 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:17:23] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/519 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/519 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 1/520 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/520 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-22 06:17:24] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-22 06:17:24] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/520 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/520 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (OVERLAPS) 44/564 variables, 44/395 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/564 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (OVERLAPS) 0/564 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 395 constraints, problems are : Problem set: 0 solved, 14 unsolved in 6546 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 8/8 constraints]
After SMT, in 15299ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 6 different solutions.
Parikh walk visited 4 properties in 6385 ms.
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 311/311 places, 253/253 transitions.
RANDOM walk for 40000 steps (535 resets) in 195 ms. (204 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (100 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (96 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (92 resets) in 186 ms. (213 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (86 resets) in 48 ms. (816 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (85 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (90 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (88 resets) in 49 ms. (800 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (94 resets) in 49 ms. (800 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (90 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (88 resets) in 48 ms. (816 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 898362 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :0 out of 10
Probabilistic random walk after 898362 steps, saw 128014 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
[2024-05-22 06:17:37] [INFO ] Invariant cache hit.
[2024-05-22 06:17:37] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 181/186 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/219 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/244 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/251 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 202/453 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 06:17:38] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 63/516 variables, 12/321 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1/517 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 47/564 variables, 47/374 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 374 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1250 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 181/186 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 33/219 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/244 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 7/251 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 202/453 variables, 251/307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 06:17:39] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2024-05-22 06:17:39] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 63/516 variables, 12/331 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/516 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 06:17:40] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
SDD proceeding with computation,14 properties remain. new max is 262144
SDD size :3.53481e+10 after 8.81531e+10
[2024-05-22 06:17:41] [INFO ] Deduced a trap composed of 16 places in 779 ms of which 3 ms to minimize.
[2024-05-22 06:17:41] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/516 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/516 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 1/517 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/517 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 06:17:41] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/517 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/517 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 47/564 variables, 47/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/564 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (OVERLAPS) 0/564 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 390 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4536 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints]
After SMT, in 5818ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Detected timeout of ITS tools.
[2024-05-22 06:17:45] [INFO ] Flatten gal took : 35 ms
[2024-05-22 06:17:45] [INFO ] Applying decomposition
[2024-05-22 06:17:45] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4058710694262187250.txt' '-o' '/tmp/graph4058710694262187250.bin' '-w' '/tmp/graph4058710694262187250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4058710694262187250.bin' '-l' '-1' '-v' '-w' '/tmp/graph4058710694262187250.weights' '-q' '0' '-e' '0.001'
[2024-05-22 06:17:45] [INFO ] Decomposing Gal with order
[2024-05-22 06:17:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 06:17:45] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-22 06:17:45] [INFO ] Flatten gal took : 109 ms
[2024-05-22 06:17:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 7 ms.
[2024-05-22 06:17:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17213770988093781480.gal : 5 ms
[2024-05-22 06:17:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8743164561433294008.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/ReachabilityCardinality17213770988093781480.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8743164561433294008.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8743164561433294008.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :4 after 20
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :20 after 366
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :366 after 2640
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :8206 after 1.38051e+09
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :1.38051e+09 after 2.86315e+09
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :2.86315e+09 after 4.5929e+09
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :4.5929e+09 after 7.06397e+09
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1.03797e+12 after 1.07384e+12
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.3555e+13 after 1.36805e+13
Parikh walk visited 0 properties in 10149 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-22 06:17:53] [INFO ] Invariant cache hit.
[2024-05-22 06:17:54] [INFO ] Implicit Places using invariants in 867 ms returned []
[2024-05-22 06:17:54] [INFO ] Invariant cache hit.
[2024-05-22 06:17:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 06:17:55] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
[2024-05-22 06:17:55] [INFO ] Redundant transitions in 12 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-22 06:17:55] [INFO ] Invariant cache hit.
[2024-05-22 06:17:55] [INFO ] State equation strengthened by 2 read => feed constraints.
Invariant property MIN6 does not hold.
Reachability property MAX6 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.19111e+13,11.366,226280,24099,5376,495704,17553,294,672069,470,99190,0
Total reachable state count : 21911139485388

Verifying 10 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,8.18813e+06,11.4047,226280,118,235,495704,17553,296,672069,473,99190,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,8.18813e+06,11.411,226280,118,235,495704,17553,300,672069,475,99190,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,1.14547e+06,11.4129,226280,301,472,495704,17553,303,672069,477,99190,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1.14547e+06,11.4137,226280,301,472,495704,17553,309,672069,479,99190,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,312,11.4154,226280,82,257,495704,17553,311,672069,481,99190,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,312,11.4169,226280,82,257,495704,17553,315,672069,483,99190,0
Reachability property MAX4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,2.6454e+07,11.4176,226280,131,273,495704,17553,317,672069,485,99190,0
Invariant property MIN4 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,2.6454e+07,11.4179,226280,131,273,495704,17553,321,672069,487,99190,0
Reachability property MAX6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX6,944784,11.4196,226280,70,240,495704,17553,323,672069,489,99190,0
Invariant property MIN6 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN6,944784,11.4209,226280,70,240,495704,17553,327,672069,491,99190,0
ITS tools runner thread asked to quit. Dying gracefully.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-22 06:18:00] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-22 06:18:05] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-22 06:18:05] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 9 ms to minimize.
[2024-05-22 06:18:05] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-22 06:18:05] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-22 06:18:05] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-22 06:18:05] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-22 06:18:05] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-22 06:18:06] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 8/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 1/564 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-22 06:18:11] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-22 06:18:14] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-22 06:18:17] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 250/633 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-22 06:18:50] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-22 06:18:54] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 635 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 13/14 constraints]
After SMT, in 60337ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61912 ms. Remains : 311/311 places, 253/253 transitions.
FORMULA DES-PT-50a-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 7 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 218280 ms.

BK_STOP 1716358735686

--------------------
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="DES-PT-50a"
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 DES-PT-50a, 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 r092-tall-171624189900733"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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