About the Execution of ITS-Tools for EisenbergMcGuire-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1656.747 | 135786.00 | 240382.00 | 600.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.r158-smll-171636266300165.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 EisenbergMcGuire-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300165
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 460K 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 EisenbergMcGuire-PT-05-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716516879907
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 02:14:42] [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-24 02:14:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:14:42] [INFO ] Load time of PNML (sax parser for PT used): 274 ms
[2024-05-24 02:14:42] [INFO ] Transformed 295 places.
[2024-05-24 02:14:42] [INFO ] Transformed 800 transitions.
[2024-05-24 02:14:42] [INFO ] Found NUPN structural information;
[2024-05-24 02:14:43] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 532 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
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, 1, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-24 02:14:43] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
[2024-05-24 02:14:43] [INFO ] Computed 16 invariants in 27 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 92 ms. (107 steps per ms)
FORMULA EisenbergMcGuire-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-24 02:14:43] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
[2024-05-24 02:14:43] [INFO ] Invariant cache hit.
[2024-05-24 02:14:44] [INFO ] [Real]Absence check using 11 positive place invariants in 24 ms returned sat
[2024-05-24 02:14:44] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 6 ms returned sat
[2024-05-24 02:14:44] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2024-05-24 02:14:44] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-05-24 02:14:44] [INFO ] [Real]Added 196 Read/Feed constraints in 75 ms returned sat
[2024-05-24 02:14:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:14:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-05-24 02:14:44] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 7 ms returned sat
[2024-05-24 02:14:45] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-05-24 02:14:45] [INFO ] [Nat]Added 196 Read/Feed constraints in 36 ms returned sat
[2024-05-24 02:14:45] [INFO ] Deduced a trap composed of 3 places in 302 ms of which 45 ms to minimize.
[2024-05-24 02:14:45] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 5 ms to minimize.
[2024-05-24 02:14:46] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 4 ms to minimize.
[2024-05-24 02:14:46] [INFO ] Deduced a trap composed of 32 places in 279 ms of which 4 ms to minimize.
[2024-05-24 02:14:46] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 5 ms to minimize.
[2024-05-24 02:14:46] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 5 ms to minimize.
[2024-05-24 02:14:47] [INFO ] Deduced a trap composed of 40 places in 289 ms of which 5 ms to minimize.
[2024-05-24 02:14:47] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 5 ms to minimize.
[2024-05-24 02:14:48] [INFO ] Deduced a trap composed of 3 places in 340 ms of which 5 ms to minimize.
[2024-05-24 02:14:48] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 4 ms to minimize.
[2024-05-24 02:14:48] [INFO ] Deduced a trap composed of 14 places in 250 ms of which 4 ms to minimize.
[2024-05-24 02:14:48] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 3 ms to minimize.
[2024-05-24 02:14:48] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-05-24 02:14:48] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3722 ms
[2024-05-24 02:14:48] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 59 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-24 02:14:49] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2024-05-24 02:14:49] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 02:14:50] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2024-05-24 02:14:50] [INFO ] [Real]Added 196 Read/Feed constraints in 50 ms returned sat
[2024-05-24 02:14:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:14:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2024-05-24 02:14:50] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 6 ms returned sat
[2024-05-24 02:14:50] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2024-05-24 02:14:50] [INFO ] [Nat]Added 196 Read/Feed constraints in 56 ms returned sat
[2024-05-24 02:14:50] [INFO ] Deduced a trap composed of 3 places in 211 ms of which 4 ms to minimize.
[2024-05-24 02:14:51] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-24 02:14:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2024-05-24 02:14:51] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 77 ms.
[2024-05-24 02:14:53] [INFO ] Deduced a trap composed of 20 places in 322 ms of which 5 ms to minimize.
[2024-05-24 02:14:53] [INFO ] Deduced a trap composed of 48 places in 283 ms of which 3 ms to minimize.
[2024-05-24 02:14:54] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 3 ms to minimize.
[2024-05-24 02:14:54] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
[2024-05-24 02:14:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1110 ms
[2024-05-24 02:14:54] [INFO ] Added : 213 causal constraints over 43 iterations in 3217 ms. Result :sat
Minimization took 227 ms.
[2024-05-24 02:14:54] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-05-24 02:14:54] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 02:14:54] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-05-24 02:14:54] [INFO ] [Real]Added 196 Read/Feed constraints in 29 ms returned sat
[2024-05-24 02:14:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:14:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-05-24 02:14:55] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 02:14:55] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-24 02:14:55] [INFO ] [Nat]Added 196 Read/Feed constraints in 30 ms returned sat
[2024-05-24 02:14:55] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 3 ms to minimize.
[2024-05-24 02:14:55] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 3 ms to minimize.
[2024-05-24 02:14:55] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 3 ms to minimize.
[2024-05-24 02:14:55] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 3 ms to minimize.
[2024-05-24 02:14:56] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:14:56] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 3 ms to minimize.
[2024-05-24 02:14:56] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 4 ms to minimize.
[2024-05-24 02:14:56] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-24 02:14:56] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 4 ms to minimize.
[2024-05-24 02:14:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1632 ms
[2024-05-24 02:14:56] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 78 ms.
[2024-05-24 02:14:59] [INFO ] Added : 235 causal constraints over 47 iterations in 3080 ms. Result :unknown
[2024-05-24 02:15:00] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-05-24 02:15:00] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-24 02:15:00] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-05-24 02:15:00] [INFO ] [Real]Added 196 Read/Feed constraints in 49 ms returned sat
[2024-05-24 02:15:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:15:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-05-24 02:15:00] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-24 02:15:00] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2024-05-24 02:15:00] [INFO ] [Nat]Added 196 Read/Feed constraints in 53 ms returned sat
[2024-05-24 02:15:01] [INFO ] Deduced a trap composed of 3 places in 272 ms of which 4 ms to minimize.
[2024-05-24 02:15:01] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 5 ms to minimize.
[2024-05-24 02:15:01] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 4 ms to minimize.
[2024-05-24 02:15:02] [INFO ] Deduced a trap composed of 3 places in 272 ms of which 5 ms to minimize.
[2024-05-24 02:15:02] [INFO ] Deduced a trap composed of 26 places in 306 ms of which 5 ms to minimize.
[2024-05-24 02:15:02] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 4 ms to minimize.
[2024-05-24 02:15:02] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 4 ms to minimize.
[2024-05-24 02:15:03] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:15:03] [INFO ] Deduced a trap composed of 45 places in 234 ms of which 4 ms to minimize.
[2024-05-24 02:15:03] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 3 ms to minimize.
[2024-05-24 02:15:03] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:15:03] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 3 ms to minimize.
[2024-05-24 02:15:04] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:15:04] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3237 ms
[2024-05-24 02:15:04] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 76 ms.
[2024-05-24 02:15:05] [INFO ] Added : 120 causal constraints over 24 iterations in 1330 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[1, 1]
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 295 transition count 795
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 290 transition count 795
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 290 transition count 716
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 211 transition count 716
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 188 place count 191 transition count 616
Iterating global reduction 2 with 20 rules applied. Total rules applied 208 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 248 place count 171 transition count 596
Applied a total of 248 rules in 252 ms. Remains 171 /295 variables (removed 124) and now considering 596/800 (removed 204) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 171/295 places, 596/800 transitions.
[2024-05-24 02:15:06] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-05-24 02:15:06] [INFO ] Computed 16 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA EisenbergMcGuire-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1509 ms. (662 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 450 ms. (2217 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 02:15:08] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-05-24 02:15:08] [INFO ] Invariant cache hit.
[2024-05-24 02:15:08] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-24 02:15:08] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 02:15:08] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-05-24 02:15:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-24 02:15:08] [INFO ] [Real]Added 116 Read/Feed constraints in 35 ms returned sat
[2024-05-24 02:15:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:15:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-24 02:15:08] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-24 02:15:08] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2024-05-24 02:15:08] [INFO ] [Nat]Added 116 Read/Feed constraints in 26 ms returned sat
[2024-05-24 02:15:08] [INFO ] Computed and/alt/rep : 262/886/202 causal constraints (skipped 54 transitions) in 38 ms.
[2024-05-24 02:15:09] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:15:09] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-24 02:15:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2024-05-24 02:15:09] [INFO ] Added : 61 causal constraints over 15 iterations in 740 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 171 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p33_0_0) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 595/595 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 170 transition count 594
Applied a total of 1 rules in 46 ms. Remains 170 /171 variables (removed 1) and now considering 594/595 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 170/171 places, 594/595 transitions.
[2024-05-24 02:15:09] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
// Phase 1: matrix 259 rows 170 cols
[2024-05-24 02:15:09] [INFO ] Computed 16 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1455 ms. (686 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 393 ms. (2538 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 02:15:11] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-05-24 02:15:11] [INFO ] Invariant cache hit.
[2024-05-24 02:15:11] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-24 02:15:11] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-24 02:15:11] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-24 02:15:11] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-24 02:15:11] [INFO ] [Real]Added 115 Read/Feed constraints in 21 ms returned sat
[2024-05-24 02:15:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 02:15:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-05-24 02:15:11] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-24 02:15:12] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-24 02:15:12] [INFO ] [Nat]Added 115 Read/Feed constraints in 31 ms returned sat
[2024-05-24 02:15:12] [INFO ] Computed and/alt/rep : 260/882/200 causal constraints (skipped 54 transitions) in 39 ms.
[2024-05-24 02:15:12] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:15:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-24 02:15:12] [INFO ] Added : 50 causal constraints over 11 iterations in 486 ms. Result :sat
Minimization took 109 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 34 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 170/170 places, 594/594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 33 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2024-05-24 02:15:12] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-05-24 02:15:12] [INFO ] Invariant cache hit.
[2024-05-24 02:15:13] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-24 02:15:13] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-05-24 02:15:13] [INFO ] Invariant cache hit.
[2024-05-24 02:15:13] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-24 02:15:14] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
[2024-05-24 02:15:14] [INFO ] Redundant transitions in 59 ms returned []
Running 589 sub problems to find dead transitions.
[2024-05-24 02:15:14] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-05-24 02:15:14] [INFO ] Invariant cache hit.
[2024-05-24 02:15:14] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-24 02:15:18] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:15:19] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:15:20] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-24 02:15:20] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-24 02:15:21] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2024-05-24 02:15:21] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-24 02:15:21] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
[2024-05-24 02:15:21] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-24 02:15:22] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-24 02:15:22] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-24 02:15:22] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (OVERLAPS) 1/170 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-24 02:15:33] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:15:34] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 6 ms to minimize.
[2024-05-24 02:15:34] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 2 ms to minimize.
[2024-05-24 02:15:34] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 2 ms to minimize.
[2024-05-24 02:15:34] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 3 ms to minimize.
[2024-05-24 02:15:35] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:15:35] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 2 ms to minimize.
[2024-05-24 02:15:35] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 3 ms to minimize.
[2024-05-24 02:15:36] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 2 ms to minimize.
[2024-05-24 02:15:36] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 3 ms to minimize.
[2024-05-24 02:15:36] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 2 ms to minimize.
[2024-05-24 02:15:36] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 2 ms to minimize.
[2024-05-24 02:15:36] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
[2024-05-24 02:15:36] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 3 ms to minimize.
[2024-05-24 02:15:37] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 3 ms to minimize.
[2024-05-24 02:15:37] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 3 ms to minimize.
[2024-05-24 02:15:37] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 3 ms to minimize.
[2024-05-24 02:15:37] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 3 ms to minimize.
[2024-05-24 02:15:38] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-05-24 02:15:38] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-24 02:15:44] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 3 ms to minimize.
SMT process timed out in 30760ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 30801ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32134 ms. Remains : 170/170 places, 594/594 transitions.
RANDOM walk for 40000 steps (8 resets) in 1227 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
[2024-05-24 02:15:45] [INFO ] Flatten gal took : 263 ms
[2024-05-24 02:15:46] [INFO ] Flatten gal took : 130 ms
[2024-05-24 02:15:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6948323948744881410.gal : 42 ms
[2024-05-24 02:15:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7746941233776142181.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/ReachabilityCardinality6948323948744881410.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7746941233776142181.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/ReachabilityCardinality7746941233776142181.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 41
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :41 after 44
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :44 after 61
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :61 after 203
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :203 after 398
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :398 after 804
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :804 after 2686
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2686 after 4557
Interrupted probabilistic random walk after 396966 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 2
Probabilistic random walk after 396966 steps, saw 83400 distinct states, run finished after 3006 ms. (steps per millisecond=132 ) properties seen :0
[2024-05-24 02:15:48] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-05-24 02:15:48] [INFO ] Invariant cache hit.
[2024-05-24 02:15:48] [INFO ] State equation strengthened by 115 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) 30/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 02:15:48] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :4557 after 19418
At refinement iteration 6 (OVERLAPS) 51/84 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/121 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 64/185 variables, 28/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/281 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/281 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 8/289 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/289 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 140/429 variables, 104/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/429 variables, 93/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/429 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/429 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/84 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 37/121 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 64/185 variables, 28/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/185 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 96/281 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/281 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 8/289 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 02:15:49] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 2 ms to minimize.
[2024-05-24 02:15:49] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/289 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/289 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 140/429 variables, 104/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/429 variables, 93/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 02:15:49] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-24 02:15:49] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:15:49] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/429 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/429 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/429 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 1330ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 156 ms.
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 18 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 170/170 places, 594/594 transitions.
RANDOM walk for 40000 steps (8 resets) in 437 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :19418 after 34759
Interrupted probabilistic random walk after 504624 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 2
Probabilistic random walk after 504624 steps, saw 102042 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-24 02:15:53] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-05-24 02:15:53] [INFO ] Invariant cache hit.
[2024-05-24 02:15:53] [INFO ] State equation strengthened by 115 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) 30/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 02:15:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/84 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/121 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 64/185 variables, 28/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/281 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/281 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 8/289 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/289 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 140/429 variables, 104/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/429 variables, 93/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/429 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/429 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/84 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 37/121 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 64/185 variables, 28/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/185 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 96/281 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/281 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 8/289 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 02:15:53] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 2 ms to minimize.
[2024-05-24 02:15:53] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/289 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/289 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 140/429 variables, 104/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/429 variables, 93/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 02:15:54] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-24 02:15:54] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:15:54] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/429 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/429 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/429 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 1197ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 65 ms.
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 17 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 170/170 places, 594/594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 17 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2024-05-24 02:15:54] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-05-24 02:15:54] [INFO ] Invariant cache hit.
[2024-05-24 02:15:54] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-24 02:15:54] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-05-24 02:15:54] [INFO ] Invariant cache hit.
[2024-05-24 02:15:54] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-24 02:15:55] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2024-05-24 02:15:55] [INFO ] Redundant transitions in 33 ms returned []
Running 589 sub problems to find dead transitions.
[2024-05-24 02:15:55] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-05-24 02:15:55] [INFO ] Invariant cache hit.
[2024-05-24 02:15:55] [INFO ] State equation strengthened by 115 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :34759 after 122684
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-24 02:15:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-24 02:15:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-24 02:15:59] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:15:59] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-24 02:15:59] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-24 02:15:59] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:16:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-24 02:16:00] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:16:00] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-05-24 02:16:00] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:16:00] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 589 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :122684 after 341142
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (OVERLAPS) 1/170 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-24 02:16:07] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-24 02:16:07] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-24 02:16:08] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-24 02:16:08] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-24 02:16:08] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-24 02:16:08] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2024-05-24 02:16:08] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 8 ms to minimize.
[2024-05-24 02:16:08] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-24 02:16:09] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
[2024-05-24 02:16:09] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
[2024-05-24 02:16:09] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 2 ms to minimize.
[2024-05-24 02:16:09] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 2 ms to minimize.
[2024-05-24 02:16:09] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-24 02:16:09] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-24 02:16:09] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-24 02:16:09] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-05-24 02:16:10] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-24 02:16:10] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2024-05-24 02:16:10] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-24 02:16:10] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-24 02:16:14] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-24 02:16:14] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-24 02:16:14] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-05-24 02:16:15] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 3 ms to minimize.
[2024-05-24 02:16:15] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-24 02:16:17] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-24 02:16:17] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-24 02:16:17] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-24 02:16:18] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-24 02:16:19] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:16:19] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 1 ms to minimize.
[2024-05-24 02:16:19] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-05-24 02:16:20] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-24 02:16:23] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-24 02:16:23] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2024-05-24 02:16:23] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2024-05-24 02:16:24] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/429 variables, and 64 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/115 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 48/61 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-24 02:16:28] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:16:28] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-05-24 02:16:28] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-24 02:16:28] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:16:29] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-05-24 02:16:29] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
[2024-05-24 02:16:29] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (OVERLAPS) 1/170 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Detected timeout of ITS tools.
[2024-05-24 02:16:36] [INFO ] Flatten gal took : 60 ms
[2024-05-24 02:16:36] [INFO ] Applying decomposition
[2024-05-24 02:16:36] [INFO ] Flatten gal took : 53 ms
[2024-05-24 02:16:36] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 2 ms to minimize.
[2024-05-24 02:16:36] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 2 ms to minimize.
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/graph9767153361570824013.txt' '-o' '/tmp/graph9767153361570824013.bin' '-w' '/tmp/graph9767153361570824013.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9767153361570824013.bin' '-l' '-1' '-v' '-w' '/tmp/graph9767153361570824013.weights' '-q' '0' '-e' '0.001'
[2024-05-24 02:16:36] [INFO ] Decomposing Gal with order
[2024-05-24 02:16:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 02:16:36] [INFO ] Removed a total of 1012 redundant transitions.
[2024-05-24 02:16:36] [INFO ] Flatten gal took : 202 ms
[2024-05-24 02:16:36] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 2 ms to minimize.
[2024-05-24 02:16:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 210 labels/synchronizations in 49 ms.
[2024-05-24 02:16:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5543122685548123492.gal : 19 ms
[2024-05-24 02:16:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18000012816822822520.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/ReachabilityCardinality5543122685548123492.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18000012816822822520.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/ReachabilityCardinality18000012816822822520.prop.
[2024-05-24 02:16:37] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 2 ms to minimize.
[2024-05-24 02:16:37] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
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,4205,0.483599,15212,1344,434,17864,1392,1398,21444,233,4978,0
Total reachable state count : 4205
Verifying 2 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,1,0.485549,15212,66,48,17864,1392,1402,21444,236,4978,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,1,0.486168,15472,66,48,17864,1392,1410,21444,238,4978,0
[2024-05-24 02:16:37] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 3 ms to minimize.
[2024-05-24 02:16:38] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 3 ms to minimize.
[2024-05-24 02:16:39] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 3 ms to minimize.
[2024-05-24 02:16:39] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 3 ms to minimize.
[2024-05-24 02:16:39] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 3 ms to minimize.
[2024-05-24 02:16:39] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 3 ms to minimize.
[2024-05-24 02:16:40] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 3 ms to minimize.
[2024-05-24 02:16:40] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 2 ms to minimize.
[2024-05-24 02:16:40] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 3 ms to minimize.
[2024-05-24 02:16:40] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-24 02:16:43] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 1 ms to minimize.
[2024-05-24 02:16:43] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-24 02:16:46] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-05-24 02:16:46] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-05-24 02:16:47] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-05-24 02:16:47] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
[2024-05-24 02:16:47] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-24 02:16:47] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-24 02:16:47] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2024-05-24 02:16:48] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-24 02:16:48] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-24 02:16:48] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2024-05-24 02:16:49] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 3 ms to minimize.
[2024-05-24 02:16:49] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 3 ms to minimize.
[2024-05-24 02:16:49] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 3 ms to minimize.
[2024-05-24 02:16:50] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 3 ms to minimize.
[2024-05-24 02:16:50] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 3 ms to minimize.
[2024-05-24 02:16:50] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 3 ms to minimize.
[2024-05-24 02:16:50] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 3 ms to minimize.
[2024-05-24 02:16:50] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 3 ms to minimize.
[2024-05-24 02:16:51] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 3 ms to minimize.
[2024-05-24 02:16:51] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-05-24 02:16:55] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 2 ms to minimize.
[2024-05-24 02:16:55] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 2 ms to minimize.
[2024-05-24 02:16:55] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/429 variables, and 111 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/115 constraints, PredecessorRefiner: 0/589 constraints, Known Traps: 95/95 constraints]
After SMT, in 60351ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 60363ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61182 ms. Remains : 170/170 places, 594/594 transitions.
FORMULA EisenbergMcGuire-PT-05-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 133202 ms.
BK_STOP 1716517015693
--------------------
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="EisenbergMcGuire-PT-05"
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 EisenbergMcGuire-PT-05, 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 r158-smll-171636266300165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-05.tgz
mv EisenbergMcGuire-PT-05 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 '
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 ;