About the Execution of Smart+red for PolyORBNT-PT-S05J80
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2454.896 | 3600000.00 | 3689315.00 | 7331.80 | 4 ? 1 3 2 1 10 ? 1 ? 3 1 1 3 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/mcc2023-input.r299-tall-167873953400749.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is PolyORBNT-PT-S05J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953400749
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 50K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 257K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 224K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 27K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 71K Feb 26 00:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 285K Feb 26 00:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Feb 25 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 578K Feb 25 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J80-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679543963913
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J80
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 03:59:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 03:59:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 03:59:25] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2023-03-23 03:59:25] [INFO ] Transformed 1189 places.
[2023-03-23 03:59:25] [INFO ] Transformed 2350 transitions.
[2023-03-23 03:59:25] [INFO ] Parsed PT model containing 1189 places and 2350 transitions and 14464 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 1691 out of 1695 initially.
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-23 03:59:25] [INFO ] Computed 182 place invariants in 140 ms
FORMULA PolyORBNT-PT-S05J80-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 692 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 14) seen :36
FORMULA PolyORBNT-PT-S05J80-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :24
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :29
FORMULA PolyORBNT-PT-S05J80-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :26
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :21
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :23
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :12
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :23
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :25
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :25
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :25
[2023-03-23 03:59:26] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-23 03:59:26] [INFO ] Computed 182 place invariants in 69 ms
[2023-03-23 03:59:26] [INFO ] [Real]Absence check using 157 positive place invariants in 49 ms returned sat
[2023-03-23 03:59:26] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 31 ms returned unsat
[2023-03-23 03:59:26] [INFO ] [Real]Absence check using 157 positive place invariants in 38 ms returned sat
[2023-03-23 03:59:27] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 48 ms returned sat
[2023-03-23 03:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 03:59:28] [INFO ] [Real]Absence check using state equation in 1131 ms returned sat
[2023-03-23 03:59:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 03:59:28] [INFO ] [Nat]Absence check using 157 positive place invariants in 34 ms returned sat
[2023-03-23 03:59:28] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-23 03:59:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 03:59:29] [INFO ] [Nat]Absence check using state equation in 897 ms returned sat
[2023-03-23 03:59:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 03:59:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 03:59:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 3895 ms returned unknown
[2023-03-23 03:59:33] [INFO ] [Real]Absence check using 157 positive place invariants in 38 ms returned sat
[2023-03-23 03:59:33] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 39 ms returned unsat
[2023-03-23 03:59:33] [INFO ] [Real]Absence check using 157 positive place invariants in 46 ms returned sat
[2023-03-23 03:59:33] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 28 ms returned unsat
[2023-03-23 03:59:33] [INFO ] [Real]Absence check using 157 positive place invariants in 34 ms returned sat
[2023-03-23 03:59:33] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-23 03:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 03:59:35] [INFO ] [Real]Absence check using state equation in 1291 ms returned sat
[2023-03-23 03:59:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 03:59:35] [INFO ] [Nat]Absence check using 157 positive place invariants in 40 ms returned sat
[2023-03-23 03:59:35] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-23 03:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 03:59:36] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2023-03-23 03:59:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 119 ms returned sat
[2023-03-23 03:59:36] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 148 ms.
[2023-03-23 03:59:37] [INFO ] Added : 17 causal constraints over 4 iterations in 976 ms. Result :sat
Minimization took 505 ms.
[2023-03-23 03:59:38] [INFO ] [Real]Absence check using 157 positive place invariants in 48 ms returned sat
[2023-03-23 03:59:38] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 40 ms returned unsat
[2023-03-23 03:59:38] [INFO ] [Real]Absence check using 157 positive place invariants in 36 ms returned sat
[2023-03-23 03:59:38] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-23 03:59:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 03:59:39] [INFO ] [Real]Absence check using state equation in 1239 ms returned sat
[2023-03-23 03:59:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 03:59:39] [INFO ] [Nat]Absence check using 157 positive place invariants in 37 ms returned sat
[2023-03-23 03:59:39] [INFO ] [Nat]Absence check using 157 positive and 25 generalized place invariants in 41 ms returned sat
[2023-03-23 03:59:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 03:59:40] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2023-03-23 03:59:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 117 ms returned sat
[2023-03-23 03:59:41] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 122 ms.
[2023-03-23 03:59:41] [INFO ] Added : 17 causal constraints over 4 iterations in 908 ms. Result :sat
Minimization took 490 ms.
[2023-03-23 03:59:42] [INFO ] [Real]Absence check using 157 positive place invariants in 36 ms returned sat
[2023-03-23 03:59:42] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 43 ms returned unsat
[2023-03-23 03:59:42] [INFO ] [Real]Absence check using 157 positive place invariants in 35 ms returned sat
[2023-03-23 03:59:42] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 3 ms returned unsat
[2023-03-23 03:59:42] [INFO ] [Real]Absence check using 157 positive place invariants in 37 ms returned sat
[2023-03-23 03:59:42] [INFO ] [Real]Absence check using 157 positive and 25 generalized place invariants in 44 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 4, 1, 10, 988, 1, 988, 1, 1, 1] Max seen :[4, 3, 1, 10, 3, 1, 3, 1, 1, 1]
FORMULA PolyORBNT-PT-S05J80-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J80-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1184 transition count 1609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 177 place count 1098 transition count 1525
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 345 place count 1014 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 346 place count 1013 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 347 place count 1013 transition count 1524
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 351 place count 1011 transition count 1522
Applied a total of 351 rules in 380 ms. Remains 1011 /1189 variables (removed 178) and now considering 1522/1695 (removed 173) transitions.
[2023-03-23 03:59:43] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
// Phase 1: matrix 1518 rows 1011 cols
[2023-03-23 03:59:43] [INFO ] Computed 177 place invariants in 36 ms
[2023-03-23 03:59:45] [INFO ] Dead Transitions using invariants and state equation in 2066 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1011/1189 places, 1427/1695 transitions.
Applied a total of 0 rules in 60 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2516 ms. Remains : 1011/1189 places, 1427/1695 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 03:59:45] [INFO ] Computed 177 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 47376 resets, run finished after 8116 ms. (steps per millisecond=123 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2675 resets, run finished after 1632 ms. (steps per millisecond=612 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2708 resets, run finished after 1650 ms. (steps per millisecond=606 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2747 resets, run finished after 1652 ms. (steps per millisecond=605 ) properties (out of 3) seen :9
[2023-03-23 03:59:58] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 03:59:58] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-23 03:59:58] [INFO ] [Real]Absence check using 156 positive place invariants in 32 ms returned sat
[2023-03-23 03:59:58] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 34 ms returned sat
[2023-03-23 03:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 03:59:59] [INFO ] [Real]Absence check using state equation in 1079 ms returned sat
[2023-03-23 03:59:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:00:00] [INFO ] [Nat]Absence check using 156 positive place invariants in 34 ms returned sat
[2023-03-23 04:00:00] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 37 ms returned sat
[2023-03-23 04:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:00:01] [INFO ] [Nat]Absence check using state equation in 1413 ms returned sat
[2023-03-23 04:00:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:00:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 2119 ms returned sat
[2023-03-23 04:00:04] [INFO ] Deduced a trap composed of 344 places in 478 ms of which 7 ms to minimize.
[2023-03-23 04:00:04] [INFO ] Deduced a trap composed of 332 places in 417 ms of which 1 ms to minimize.
[2023-03-23 04:00:05] [INFO ] Deduced a trap composed of 323 places in 524 ms of which 1 ms to minimize.
[2023-03-23 04:00:05] [INFO ] Deduced a trap composed of 327 places in 367 ms of which 3 ms to minimize.
[2023-03-23 04:00:06] [INFO ] Deduced a trap composed of 321 places in 399 ms of which 1 ms to minimize.
[2023-03-23 04:00:06] [INFO ] Deduced a trap composed of 336 places in 358 ms of which 1 ms to minimize.
[2023-03-23 04:00:07] [INFO ] Deduced a trap composed of 326 places in 370 ms of which 1 ms to minimize.
[2023-03-23 04:00:07] [INFO ] Deduced a trap composed of 324 places in 379 ms of which 5 ms to minimize.
[2023-03-23 04:00:07] [INFO ] Deduced a trap composed of 312 places in 393 ms of which 0 ms to minimize.
[2023-03-23 04:00:08] [INFO ] Deduced a trap composed of 321 places in 372 ms of which 1 ms to minimize.
[2023-03-23 04:00:08] [INFO ] Deduced a trap composed of 330 places in 376 ms of which 1 ms to minimize.
[2023-03-23 04:00:09] [INFO ] Deduced a trap composed of 308 places in 406 ms of which 1 ms to minimize.
[2023-03-23 04:00:10] [INFO ] Deduced a trap composed of 326 places in 373 ms of which 1 ms to minimize.
[2023-03-23 04:00:10] [INFO ] Deduced a trap composed of 323 places in 382 ms of which 1 ms to minimize.
[2023-03-23 04:00:10] [INFO ] Deduced a trap composed of 309 places in 362 ms of which 1 ms to minimize.
[2023-03-23 04:00:11] [INFO ] Deduced a trap composed of 320 places in 360 ms of which 0 ms to minimize.
[2023-03-23 04:00:11] [INFO ] Deduced a trap composed of 311 places in 371 ms of which 1 ms to minimize.
[2023-03-23 04:00:12] [INFO ] Deduced a trap composed of 320 places in 360 ms of which 1 ms to minimize.
[2023-03-23 04:00:13] [INFO ] Deduced a trap composed of 335 places in 378 ms of which 1 ms to minimize.
[2023-03-23 04:00:13] [INFO ] Deduced a trap composed of 330 places in 367 ms of which 0 ms to minimize.
[2023-03-23 04:00:13] [INFO ] Deduced a trap composed of 323 places in 380 ms of which 1 ms to minimize.
[2023-03-23 04:00:14] [INFO ] Deduced a trap composed of 314 places in 369 ms of which 1 ms to minimize.
[2023-03-23 04:00:14] [INFO ] Deduced a trap composed of 317 places in 385 ms of which 1 ms to minimize.
[2023-03-23 04:00:15] [INFO ] Deduced a trap composed of 335 places in 374 ms of which 1 ms to minimize.
[2023-03-23 04:00:15] [INFO ] Deduced a trap composed of 345 places in 383 ms of which 0 ms to minimize.
[2023-03-23 04:00:16] [INFO ] Deduced a trap composed of 329 places in 383 ms of which 0 ms to minimize.
[2023-03-23 04:00:16] [INFO ] Deduced a trap composed of 320 places in 370 ms of which 1 ms to minimize.
[2023-03-23 04:00:17] [INFO ] Deduced a trap composed of 320 places in 396 ms of which 1 ms to minimize.
[2023-03-23 04:00:18] [INFO ] Deduced a trap composed of 336 places in 377 ms of which 1 ms to minimize.
[2023-03-23 04:00:18] [INFO ] Deduced a trap composed of 305 places in 372 ms of which 1 ms to minimize.
[2023-03-23 04:00:19] [INFO ] Deduced a trap composed of 308 places in 387 ms of which 1 ms to minimize.
[2023-03-23 04:00:19] [INFO ] Deduced a trap composed of 315 places in 377 ms of which 1 ms to minimize.
[2023-03-23 04:00:20] [INFO ] Deduced a trap composed of 335 places in 405 ms of which 2 ms to minimize.
[2023-03-23 04:00:21] [INFO ] Deduced a trap composed of 356 places in 395 ms of which 1 ms to minimize.
[2023-03-23 04:00:22] [INFO ] Deduced a trap composed of 311 places in 370 ms of which 5 ms to minimize.
[2023-03-23 04:00:22] [INFO ] Deduced a trap composed of 323 places in 378 ms of which 1 ms to minimize.
[2023-03-23 04:00:22] [INFO ] Deduced a trap composed of 335 places in 378 ms of which 0 ms to minimize.
[2023-03-23 04:00:23] [INFO ] Deduced a trap composed of 335 places in 376 ms of which 1 ms to minimize.
[2023-03-23 04:00:24] [INFO ] Deduced a trap composed of 320 places in 396 ms of which 1 ms to minimize.
[2023-03-23 04:00:25] [INFO ] Deduced a trap composed of 312 places in 371 ms of which 0 ms to minimize.
[2023-03-23 04:00:26] [INFO ] Deduced a trap composed of 308 places in 375 ms of which 0 ms to minimize.
[2023-03-23 04:00:26] [INFO ] Deduced a trap composed of 317 places in 363 ms of which 1 ms to minimize.
[2023-03-23 04:00:27] [INFO ] Deduced a trap composed of 306 places in 389 ms of which 0 ms to minimize.
[2023-03-23 04:00:28] [INFO ] Deduced a trap composed of 315 places in 365 ms of which 1 ms to minimize.
[2023-03-23 04:00:30] [INFO ] Deduced a trap composed of 345 places in 395 ms of which 1 ms to minimize.
[2023-03-23 04:00:31] [INFO ] Deduced a trap composed of 303 places in 398 ms of which 1 ms to minimize.
[2023-03-23 04:00:34] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 30409 ms
[2023-03-23 04:00:34] [INFO ] [Real]Absence check using 156 positive place invariants in 39 ms returned sat
[2023-03-23 04:00:34] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-23 04:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:00:35] [INFO ] [Real]Absence check using state equation in 1051 ms returned sat
[2023-03-23 04:00:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:00:35] [INFO ] [Nat]Absence check using 156 positive place invariants in 34 ms returned sat
[2023-03-23 04:00:35] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 37 ms returned sat
[2023-03-23 04:00:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:00:36] [INFO ] [Nat]Absence check using state equation in 857 ms returned sat
[2023-03-23 04:00:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 705 ms returned sat
[2023-03-23 04:00:37] [INFO ] Deduced a trap composed of 201 places in 411 ms of which 1 ms to minimize.
[2023-03-23 04:00:38] [INFO ] Deduced a trap composed of 320 places in 394 ms of which 1 ms to minimize.
[2023-03-23 04:00:38] [INFO ] Deduced a trap composed of 332 places in 414 ms of which 1 ms to minimize.
[2023-03-23 04:00:38] [INFO ] Deduced a trap composed of 291 places in 410 ms of which 1 ms to minimize.
[2023-03-23 04:00:39] [INFO ] Deduced a trap composed of 332 places in 387 ms of which 2 ms to minimize.
[2023-03-23 04:00:39] [INFO ] Deduced a trap composed of 376 places in 414 ms of which 1 ms to minimize.
[2023-03-23 04:00:40] [INFO ] Deduced a trap composed of 315 places in 390 ms of which 0 ms to minimize.
[2023-03-23 04:00:40] [INFO ] Deduced a trap composed of 323 places in 389 ms of which 1 ms to minimize.
[2023-03-23 04:00:41] [INFO ] Deduced a trap composed of 303 places in 394 ms of which 1 ms to minimize.
[2023-03-23 04:00:42] [INFO ] Deduced a trap composed of 336 places in 377 ms of which 12 ms to minimize.
[2023-03-23 04:00:42] [INFO ] Deduced a trap composed of 350 places in 372 ms of which 1 ms to minimize.
[2023-03-23 04:00:43] [INFO ] Deduced a trap composed of 314 places in 402 ms of which 1 ms to minimize.
[2023-03-23 04:00:43] [INFO ] Deduced a trap composed of 330 places in 399 ms of which 1 ms to minimize.
[2023-03-23 04:00:45] [INFO ] Deduced a trap composed of 396 places in 355 ms of which 1 ms to minimize.
[2023-03-23 04:00:45] [INFO ] Deduced a trap composed of 324 places in 369 ms of which 1 ms to minimize.
[2023-03-23 04:00:46] [INFO ] Deduced a trap composed of 329 places in 356 ms of which 1 ms to minimize.
[2023-03-23 04:00:46] [INFO ] Deduced a trap composed of 308 places in 391 ms of which 1 ms to minimize.
[2023-03-23 04:00:46] [INFO ] Deduced a trap composed of 308 places in 371 ms of which 5 ms to minimize.
[2023-03-23 04:00:47] [INFO ] Deduced a trap composed of 336 places in 385 ms of which 4 ms to minimize.
[2023-03-23 04:00:47] [INFO ] Deduced a trap composed of 312 places in 382 ms of which 1 ms to minimize.
[2023-03-23 04:00:48] [INFO ] Deduced a trap composed of 293 places in 372 ms of which 2 ms to minimize.
[2023-03-23 04:00:49] [INFO ] Deduced a trap composed of 332 places in 364 ms of which 6 ms to minimize.
[2023-03-23 04:00:50] [INFO ] Deduced a trap composed of 338 places in 421 ms of which 1 ms to minimize.
[2023-03-23 04:00:50] [INFO ] Deduced a trap composed of 332 places in 416 ms of which 1 ms to minimize.
[2023-03-23 04:00:50] [INFO ] Deduced a trap composed of 308 places in 369 ms of which 1 ms to minimize.
[2023-03-23 04:00:51] [INFO ] Deduced a trap composed of 321 places in 364 ms of which 1 ms to minimize.
[2023-03-23 04:00:51] [INFO ] Deduced a trap composed of 326 places in 385 ms of which 0 ms to minimize.
[2023-03-23 04:00:52] [INFO ] Deduced a trap composed of 326 places in 363 ms of which 1 ms to minimize.
[2023-03-23 04:00:52] [INFO ] Deduced a trap composed of 308 places in 371 ms of which 1 ms to minimize.
[2023-03-23 04:00:53] [INFO ] Deduced a trap composed of 314 places in 361 ms of which 1 ms to minimize.
[2023-03-23 04:00:53] [INFO ] Deduced a trap composed of 327 places in 358 ms of which 1 ms to minimize.
[2023-03-23 04:00:54] [INFO ] Deduced a trap composed of 305 places in 374 ms of which 0 ms to minimize.
[2023-03-23 04:00:54] [INFO ] Deduced a trap composed of 294 places in 400 ms of which 1 ms to minimize.
[2023-03-23 04:00:55] [INFO ] Deduced a trap composed of 299 places in 361 ms of which 1 ms to minimize.
[2023-03-23 04:00:55] [INFO ] Deduced a trap composed of 324 places in 369 ms of which 1 ms to minimize.
[2023-03-23 04:00:56] [INFO ] Deduced a trap composed of 335 places in 391 ms of which 0 ms to minimize.
[2023-03-23 04:00:56] [INFO ] Deduced a trap composed of 308 places in 386 ms of which 1 ms to minimize.
[2023-03-23 04:00:58] [INFO ] Deduced a trap composed of 335 places in 372 ms of which 1 ms to minimize.
[2023-03-23 04:00:59] [INFO ] Deduced a trap composed of 332 places in 359 ms of which 1 ms to minimize.
[2023-03-23 04:01:00] [INFO ] Deduced a trap composed of 330 places in 395 ms of which 1 ms to minimize.
[2023-03-23 04:01:00] [INFO ] Deduced a trap composed of 335 places in 374 ms of which 1 ms to minimize.
[2023-03-23 04:01:01] [INFO ] Deduced a trap composed of 323 places in 374 ms of which 0 ms to minimize.
[2023-03-23 04:01:01] [INFO ] Deduced a trap composed of 314 places in 378 ms of which 0 ms to minimize.
[2023-03-23 04:01:02] [INFO ] Deduced a trap composed of 314 places in 360 ms of which 1 ms to minimize.
[2023-03-23 04:01:03] [INFO ] Deduced a trap composed of 321 places in 394 ms of which 1 ms to minimize.
[2023-03-23 04:01:05] [INFO ] Deduced a trap composed of 339 places in 366 ms of which 1 ms to minimize.
[2023-03-23 04:01:08] [INFO ] Deduced a trap composed of 321 places in 441 ms of which 1 ms to minimize.
[2023-03-23 04:01:11] [INFO ] Deduced a trap composed of 314 places in 368 ms of which 1 ms to minimize.
[2023-03-23 04:01:11] [INFO ] Deduced a trap composed of 323 places in 368 ms of which 1 ms to minimize.
[2023-03-23 04:01:12] [INFO ] Deduced a trap composed of 314 places in 376 ms of which 1 ms to minimize.
[2023-03-23 04:01:12] [INFO ] Deduced a trap composed of 332 places in 362 ms of which 1 ms to minimize.
[2023-03-23 04:01:13] [INFO ] Deduced a trap composed of 317 places in 359 ms of which 1 ms to minimize.
[2023-03-23 04:01:15] [INFO ] Deduced a trap composed of 317 places in 364 ms of which 1 ms to minimize.
[2023-03-23 04:01:16] [INFO ] Deduced a trap composed of 341 places in 358 ms of which 0 ms to minimize.
[2023-03-23 04:01:17] [INFO ] Deduced a trap composed of 338 places in 338 ms of which 1 ms to minimize.
[2023-03-23 04:01:17] [INFO ] Deduced a trap composed of 311 places in 360 ms of which 0 ms to minimize.
[2023-03-23 04:01:17] [INFO ] Deduced a trap composed of 320 places in 364 ms of which 1 ms to minimize.
[2023-03-23 04:01:18] [INFO ] Deduced a trap composed of 311 places in 359 ms of which 1 ms to minimize.
[2023-03-23 04:01:19] [INFO ] Deduced a trap composed of 323 places in 360 ms of which 0 ms to minimize.
[2023-03-23 04:01:19] [INFO ] Deduced a trap composed of 342 places in 366 ms of which 1 ms to minimize.
[2023-03-23 04:01:20] [INFO ] Trap strengthening (SAT) tested/added 60/60 trap constraints in 43273 ms
[2023-03-23 04:01:20] [INFO ] [Real]Absence check using 156 positive place invariants in 31 ms returned sat
[2023-03-23 04:01:20] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 32 ms returned sat
[2023-03-23 04:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:01:21] [INFO ] [Real]Absence check using state equation in 1018 ms returned sat
[2023-03-23 04:01:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:01:21] [INFO ] [Nat]Absence check using 156 positive place invariants in 38 ms returned sat
[2023-03-23 04:01:21] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 38 ms returned sat
[2023-03-23 04:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:01:22] [INFO ] [Nat]Absence check using state equation in 952 ms returned sat
[2023-03-23 04:01:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 711 ms returned sat
[2023-03-23 04:01:23] [INFO ] Deduced a trap composed of 201 places in 409 ms of which 1 ms to minimize.
[2023-03-23 04:01:24] [INFO ] Deduced a trap composed of 320 places in 391 ms of which 1 ms to minimize.
[2023-03-23 04:01:24] [INFO ] Deduced a trap composed of 332 places in 397 ms of which 1 ms to minimize.
[2023-03-23 04:01:25] [INFO ] Deduced a trap composed of 291 places in 391 ms of which 1 ms to minimize.
[2023-03-23 04:01:25] [INFO ] Deduced a trap composed of 332 places in 392 ms of which 1 ms to minimize.
[2023-03-23 04:01:26] [INFO ] Deduced a trap composed of 376 places in 411 ms of which 1 ms to minimize.
[2023-03-23 04:01:26] [INFO ] Deduced a trap composed of 315 places in 391 ms of which 0 ms to minimize.
[2023-03-23 04:01:27] [INFO ] Deduced a trap composed of 323 places in 383 ms of which 1 ms to minimize.
[2023-03-23 04:01:27] [INFO ] Deduced a trap composed of 303 places in 400 ms of which 1 ms to minimize.
[2023-03-23 04:01:28] [INFO ] Deduced a trap composed of 336 places in 407 ms of which 1 ms to minimize.
[2023-03-23 04:01:28] [INFO ] Deduced a trap composed of 350 places in 365 ms of which 1 ms to minimize.
[2023-03-23 04:01:29] [INFO ] Deduced a trap composed of 314 places in 382 ms of which 0 ms to minimize.
[2023-03-23 04:01:29] [INFO ] Deduced a trap composed of 330 places in 389 ms of which 1 ms to minimize.
[2023-03-23 04:01:31] [INFO ] Deduced a trap composed of 396 places in 372 ms of which 1 ms to minimize.
[2023-03-23 04:01:31] [INFO ] Deduced a trap composed of 324 places in 382 ms of which 1 ms to minimize.
[2023-03-23 04:01:32] [INFO ] Deduced a trap composed of 329 places in 380 ms of which 1 ms to minimize.
[2023-03-23 04:01:32] [INFO ] Deduced a trap composed of 308 places in 391 ms of which 1 ms to minimize.
[2023-03-23 04:01:33] [INFO ] Deduced a trap composed of 308 places in 384 ms of which 1 ms to minimize.
[2023-03-23 04:01:33] [INFO ] Deduced a trap composed of 336 places in 382 ms of which 1 ms to minimize.
[2023-03-23 04:01:34] [INFO ] Deduced a trap composed of 312 places in 373 ms of which 1 ms to minimize.
[2023-03-23 04:01:35] [INFO ] Deduced a trap composed of 293 places in 375 ms of which 1 ms to minimize.
[2023-03-23 04:01:35] [INFO ] Deduced a trap composed of 332 places in 361 ms of which 1 ms to minimize.
[2023-03-23 04:01:36] [INFO ] Deduced a trap composed of 338 places in 373 ms of which 1 ms to minimize.
[2023-03-23 04:01:36] [INFO ] Deduced a trap composed of 332 places in 389 ms of which 1 ms to minimize.
[2023-03-23 04:01:37] [INFO ] Deduced a trap composed of 308 places in 365 ms of which 1 ms to minimize.
[2023-03-23 04:01:37] [INFO ] Deduced a trap composed of 321 places in 363 ms of which 1 ms to minimize.
[2023-03-23 04:01:38] [INFO ] Deduced a trap composed of 326 places in 384 ms of which 1 ms to minimize.
[2023-03-23 04:01:38] [INFO ] Deduced a trap composed of 326 places in 447 ms of which 1 ms to minimize.
[2023-03-23 04:01:39] [INFO ] Deduced a trap composed of 308 places in 386 ms of which 1 ms to minimize.
[2023-03-23 04:01:39] [INFO ] Deduced a trap composed of 314 places in 354 ms of which 1 ms to minimize.
[2023-03-23 04:01:40] [INFO ] Deduced a trap composed of 327 places in 359 ms of which 1 ms to minimize.
[2023-03-23 04:01:40] [INFO ] Deduced a trap composed of 305 places in 371 ms of which 1 ms to minimize.
[2023-03-23 04:01:41] [INFO ] Deduced a trap composed of 294 places in 383 ms of which 0 ms to minimize.
[2023-03-23 04:01:41] [INFO ] Deduced a trap composed of 299 places in 382 ms of which 1 ms to minimize.
[2023-03-23 04:01:42] [INFO ] Deduced a trap composed of 324 places in 395 ms of which 1 ms to minimize.
[2023-03-23 04:01:42] [INFO ] Deduced a trap composed of 335 places in 390 ms of which 0 ms to minimize.
[2023-03-23 04:01:43] [INFO ] Deduced a trap composed of 308 places in 360 ms of which 2 ms to minimize.
[2023-03-23 04:01:44] [INFO ] Deduced a trap composed of 335 places in 382 ms of which 1 ms to minimize.
[2023-03-23 04:01:45] [INFO ] Deduced a trap composed of 332 places in 379 ms of which 1 ms to minimize.
[2023-03-23 04:01:46] [INFO ] Deduced a trap composed of 330 places in 398 ms of which 1 ms to minimize.
[2023-03-23 04:01:47] [INFO ] Deduced a trap composed of 335 places in 374 ms of which 1 ms to minimize.
[2023-03-23 04:01:47] [INFO ] Deduced a trap composed of 323 places in 375 ms of which 1 ms to minimize.
[2023-03-23 04:01:48] [INFO ] Deduced a trap composed of 314 places in 391 ms of which 1 ms to minimize.
[2023-03-23 04:01:48] [INFO ] Deduced a trap composed of 314 places in 402 ms of which 0 ms to minimize.
[2023-03-23 04:01:50] [INFO ] Deduced a trap composed of 321 places in 399 ms of which 1 ms to minimize.
[2023-03-23 04:01:52] [INFO ] Deduced a trap composed of 339 places in 371 ms of which 0 ms to minimize.
[2023-03-23 04:01:54] [INFO ] Deduced a trap composed of 321 places in 368 ms of which 1 ms to minimize.
[2023-03-23 04:01:57] [INFO ] Deduced a trap composed of 314 places in 404 ms of which 1 ms to minimize.
[2023-03-23 04:01:58] [INFO ] Deduced a trap composed of 323 places in 368 ms of which 1 ms to minimize.
[2023-03-23 04:01:58] [INFO ] Deduced a trap composed of 314 places in 359 ms of which 1 ms to minimize.
[2023-03-23 04:01:59] [INFO ] Deduced a trap composed of 332 places in 387 ms of which 0 ms to minimize.
[2023-03-23 04:01:59] [INFO ] Deduced a trap composed of 317 places in 365 ms of which 1 ms to minimize.
[2023-03-23 04:02:02] [INFO ] Deduced a trap composed of 317 places in 372 ms of which 1 ms to minimize.
[2023-03-23 04:02:03] [INFO ] Deduced a trap composed of 341 places in 369 ms of which 1 ms to minimize.
[2023-03-23 04:02:03] [INFO ] Deduced a trap composed of 338 places in 365 ms of which 1 ms to minimize.
[2023-03-23 04:02:04] [INFO ] Deduced a trap composed of 311 places in 362 ms of which 1 ms to minimize.
[2023-03-23 04:02:04] [INFO ] Deduced a trap composed of 320 places in 362 ms of which 1 ms to minimize.
[2023-03-23 04:02:05] [INFO ] Deduced a trap composed of 311 places in 359 ms of which 1 ms to minimize.
[2023-03-23 04:02:05] [INFO ] Deduced a trap composed of 323 places in 373 ms of which 1 ms to minimize.
[2023-03-23 04:02:06] [INFO ] Deduced a trap composed of 342 places in 394 ms of which 1 ms to minimize.
[2023-03-23 04:02:06] [INFO ] Trap strengthening (SAT) tested/added 60/60 trap constraints in 43155 ms
Current structural bounds on expressions (after SMT) : [4, 988, 988] Max seen :[3, 3, 3]
Support contains 2 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 64 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 79 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-23 04:02:06] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 04:02:06] [INFO ] Invariant cache hit.
[2023-03-23 04:02:09] [INFO ] Implicit Places using invariants in 2771 ms returned []
[2023-03-23 04:02:09] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 04:02:09] [INFO ] Invariant cache hit.
[2023-03-23 04:02:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:02:37] [INFO ] Implicit Places using invariants and state equation in 28277 ms returned []
Implicit Place search using SMT with State Equation took 31066 ms to find 0 implicit places.
[2023-03-23 04:02:38] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-23 04:02:38] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 04:02:38] [INFO ] Invariant cache hit.
[2023-03-23 04:02:39] [INFO ] Dead Transitions using invariants and state equation in 1952 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33205 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-01
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 04:02:40] [INFO ] Computed 177 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 477 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2023-03-23 04:02:40] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 04:02:40] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-23 04:02:40] [INFO ] [Real]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-23 04:02:40] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-23 04:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:02:41] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2023-03-23 04:02:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:02:41] [INFO ] [Nat]Absence check using 156 positive place invariants in 36 ms returned sat
[2023-03-23 04:02:41] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 38 ms returned sat
[2023-03-23 04:02:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:02:43] [INFO ] [Nat]Absence check using state equation in 1446 ms returned sat
[2023-03-23 04:02:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:02:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 2093 ms returned sat
[2023-03-23 04:02:45] [INFO ] Deduced a trap composed of 344 places in 370 ms of which 1 ms to minimize.
[2023-03-23 04:02:46] [INFO ] Deduced a trap composed of 332 places in 380 ms of which 1 ms to minimize.
[2023-03-23 04:02:46] [INFO ] Deduced a trap composed of 323 places in 374 ms of which 1 ms to minimize.
[2023-03-23 04:02:46] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 1279 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1011 transition count 1426
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1010 transition count 1426
Applied a total of 2 rules in 90 ms. Remains 1010 /1011 variables (removed 1) and now considering 1426/1427 (removed 1) transitions.
[2023-03-23 04:02:46] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-23 04:02:46] [INFO ] Computed 177 place invariants in 49 ms
[2023-03-23 04:02:48] [INFO ] Dead Transitions using invariants and state equation in 2069 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2172 ms. Remains : 1010/1011 places, 1426/1427 transitions.
Normalized transition count is 1422 out of 1426 initially.
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-23 04:02:48] [INFO ] Computed 177 place invariants in 47 ms
Incomplete random walk after 1000000 steps, including 52045 resets, run finished after 8440 ms. (steps per millisecond=118 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2715 resets, run finished after 1588 ms. (steps per millisecond=629 ) properties (out of 1) seen :3
[2023-03-23 04:02:58] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-23 04:02:58] [INFO ] Computed 177 place invariants in 50 ms
[2023-03-23 04:02:58] [INFO ] [Real]Absence check using 155 positive place invariants in 30 ms returned sat
[2023-03-23 04:02:59] [INFO ] [Real]Absence check using 155 positive and 22 generalized place invariants in 31 ms returned sat
[2023-03-23 04:02:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:03:00] [INFO ] [Real]Absence check using state equation in 1014 ms returned sat
[2023-03-23 04:03:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:03:00] [INFO ] [Nat]Absence check using 155 positive place invariants in 34 ms returned sat
[2023-03-23 04:03:00] [INFO ] [Nat]Absence check using 155 positive and 22 generalized place invariants in 31 ms returned sat
[2023-03-23 04:03:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:03:01] [INFO ] [Nat]Absence check using state equation in 1098 ms returned sat
[2023-03-23 04:03:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:03:04] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 04:03:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 4969 ms returned sat
[2023-03-23 04:03:06] [INFO ] Deduced a trap composed of 317 places in 370 ms of which 1 ms to minimize.
[2023-03-23 04:03:07] [INFO ] Deduced a trap composed of 299 places in 390 ms of which 1 ms to minimize.
[2023-03-23 04:03:07] [INFO ] Deduced a trap composed of 320 places in 397 ms of which 1 ms to minimize.
[2023-03-23 04:03:08] [INFO ] Deduced a trap composed of 308 places in 386 ms of which 1 ms to minimize.
[2023-03-23 04:03:08] [INFO ] Deduced a trap composed of 305 places in 375 ms of which 1 ms to minimize.
[2023-03-23 04:03:08] [INFO ] Deduced a trap composed of 315 places in 391 ms of which 0 ms to minimize.
[2023-03-23 04:03:09] [INFO ] Deduced a trap composed of 312 places in 354 ms of which 1 ms to minimize.
[2023-03-23 04:03:09] [INFO ] Deduced a trap composed of 324 places in 378 ms of which 1 ms to minimize.
[2023-03-23 04:03:10] [INFO ] Deduced a trap composed of 323 places in 365 ms of which 1 ms to minimize.
[2023-03-23 04:03:10] [INFO ] Deduced a trap composed of 329 places in 383 ms of which 1 ms to minimize.
[2023-03-23 04:03:11] [INFO ] Deduced a trap composed of 318 places in 363 ms of which 1 ms to minimize.
[2023-03-23 04:03:11] [INFO ] Deduced a trap composed of 325 places in 363 ms of which 0 ms to minimize.
[2023-03-23 04:03:12] [INFO ] Deduced a trap composed of 311 places in 366 ms of which 1 ms to minimize.
[2023-03-23 04:03:13] [INFO ] Deduced a trap composed of 332 places in 391 ms of which 1 ms to minimize.
[2023-03-23 04:03:13] [INFO ] Deduced a trap composed of 302 places in 354 ms of which 1 ms to minimize.
[2023-03-23 04:03:14] [INFO ] Deduced a trap composed of 311 places in 369 ms of which 1 ms to minimize.
[2023-03-23 04:03:14] [INFO ] Deduced a trap composed of 329 places in 352 ms of which 0 ms to minimize.
[2023-03-23 04:03:15] [INFO ] Deduced a trap composed of 329 places in 364 ms of which 1 ms to minimize.
[2023-03-23 04:03:17] [INFO ] Deduced a trap composed of 323 places in 381 ms of which 1 ms to minimize.
[2023-03-23 04:03:17] [INFO ] Deduced a trap composed of 326 places in 394 ms of which 1 ms to minimize.
[2023-03-23 04:03:18] [INFO ] Deduced a trap composed of 302 places in 387 ms of which 1 ms to minimize.
[2023-03-23 04:03:18] [INFO ] Deduced a trap composed of 342 places in 380 ms of which 1 ms to minimize.
[2023-03-23 04:03:19] [INFO ] Deduced a trap composed of 335 places in 363 ms of which 1 ms to minimize.
[2023-03-23 04:03:20] [INFO ] Deduced a trap composed of 317 places in 378 ms of which 1 ms to minimize.
[2023-03-23 04:03:23] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 17320 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 44 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 43 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-23 04:03:23] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 04:03:23] [INFO ] Invariant cache hit.
[2023-03-23 04:03:26] [INFO ] Implicit Places using invariants in 2491 ms returned []
[2023-03-23 04:03:26] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 04:03:26] [INFO ] Invariant cache hit.
[2023-03-23 04:03:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:03:56] [INFO ] Performed 795/1010 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-23 04:04:01] [INFO ] Implicit Places using invariants and state equation in 35643 ms returned []
Implicit Place search using SMT with State Equation took 38135 ms to find 0 implicit places.
[2023-03-23 04:04:01] [INFO ] Redundant transitions in 78 ms returned []
[2023-03-23 04:04:02] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 04:04:02] [INFO ] Invariant cache hit.
[2023-03-23 04:04:03] [INFO ] Dead Transitions using invariants and state equation in 1996 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40266 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-01 in 83992 ms.
Starting property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-07
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 04:04:04] [INFO ] Computed 177 place invariants in 31 ms
Incomplete random walk after 10001 steps, including 475 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :3
[2023-03-23 04:04:04] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 04:04:04] [INFO ] Computed 177 place invariants in 31 ms
[2023-03-23 04:04:04] [INFO ] [Real]Absence check using 156 positive place invariants in 33 ms returned sat
[2023-03-23 04:04:04] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 34 ms returned sat
[2023-03-23 04:04:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:04:05] [INFO ] [Real]Absence check using state equation in 1050 ms returned sat
[2023-03-23 04:04:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:04:05] [INFO ] [Nat]Absence check using 156 positive place invariants in 35 ms returned sat
[2023-03-23 04:04:05] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 39 ms returned sat
[2023-03-23 04:04:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:04:06] [INFO ] [Nat]Absence check using state equation in 877 ms returned sat
[2023-03-23 04:04:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:04:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 717 ms returned sat
[2023-03-23 04:04:07] [INFO ] Deduced a trap composed of 201 places in 429 ms of which 1 ms to minimize.
[2023-03-23 04:04:08] [INFO ] Deduced a trap composed of 320 places in 383 ms of which 1 ms to minimize.
[2023-03-23 04:04:08] [INFO ] Deduced a trap composed of 332 places in 394 ms of which 1 ms to minimize.
[2023-03-23 04:04:09] [INFO ] Deduced a trap composed of 291 places in 380 ms of which 1 ms to minimize.
[2023-03-23 04:04:09] [INFO ] Deduced a trap composed of 332 places in 392 ms of which 1 ms to minimize.
[2023-03-23 04:04:09] [INFO ] Deduced a trap composed of 376 places in 405 ms of which 1 ms to minimize.
[2023-03-23 04:04:10] [INFO ] Deduced a trap composed of 315 places in 390 ms of which 0 ms to minimize.
[2023-03-23 04:04:10] [INFO ] Deduced a trap composed of 323 places in 405 ms of which 1 ms to minimize.
[2023-03-23 04:04:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 60 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-23 04:04:10] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 04:04:10] [INFO ] Invariant cache hit.
[2023-03-23 04:04:12] [INFO ] Dead Transitions using invariants and state equation in 1995 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2058 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 04:04:12] [INFO ] Computed 177 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 47427 resets, run finished after 8080 ms. (steps per millisecond=123 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2656 resets, run finished after 1655 ms. (steps per millisecond=604 ) properties (out of 1) seen :3
[2023-03-23 04:04:22] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 04:04:22] [INFO ] Computed 177 place invariants in 33 ms
[2023-03-23 04:04:22] [INFO ] [Real]Absence check using 156 positive place invariants in 34 ms returned sat
[2023-03-23 04:04:22] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 34 ms returned sat
[2023-03-23 04:04:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:04:23] [INFO ] [Real]Absence check using state equation in 1034 ms returned sat
[2023-03-23 04:04:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:04:24] [INFO ] [Nat]Absence check using 156 positive place invariants in 35 ms returned sat
[2023-03-23 04:04:24] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 38 ms returned sat
[2023-03-23 04:04:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:04:25] [INFO ] [Nat]Absence check using state equation in 879 ms returned sat
[2023-03-23 04:04:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:04:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 726 ms returned sat
[2023-03-23 04:04:26] [INFO ] Deduced a trap composed of 201 places in 434 ms of which 1 ms to minimize.
[2023-03-23 04:04:26] [INFO ] Deduced a trap composed of 320 places in 384 ms of which 1 ms to minimize.
[2023-03-23 04:04:27] [INFO ] Deduced a trap composed of 332 places in 404 ms of which 1 ms to minimize.
[2023-03-23 04:04:27] [INFO ] Deduced a trap composed of 291 places in 396 ms of which 1 ms to minimize.
[2023-03-23 04:04:28] [INFO ] Deduced a trap composed of 332 places in 403 ms of which 1 ms to minimize.
[2023-03-23 04:04:28] [INFO ] Deduced a trap composed of 376 places in 416 ms of which 1 ms to minimize.
[2023-03-23 04:04:28] [INFO ] Deduced a trap composed of 315 places in 398 ms of which 1 ms to minimize.
[2023-03-23 04:04:29] [INFO ] Deduced a trap composed of 323 places in 398 ms of which 1 ms to minimize.
[2023-03-23 04:04:29] [INFO ] Deduced a trap composed of 303 places in 413 ms of which 1 ms to minimize.
[2023-03-23 04:04:30] [INFO ] Deduced a trap composed of 336 places in 394 ms of which 1 ms to minimize.
[2023-03-23 04:04:31] [INFO ] Deduced a trap composed of 350 places in 392 ms of which 1 ms to minimize.
[2023-03-23 04:04:31] [INFO ] Deduced a trap composed of 314 places in 398 ms of which 1 ms to minimize.
[2023-03-23 04:04:32] [INFO ] Deduced a trap composed of 330 places in 389 ms of which 1 ms to minimize.
[2023-03-23 04:04:34] [INFO ] Deduced a trap composed of 396 places in 394 ms of which 1 ms to minimize.
[2023-03-23 04:04:34] [INFO ] Deduced a trap composed of 324 places in 387 ms of which 1 ms to minimize.
[2023-03-23 04:04:34] [INFO ] Deduced a trap composed of 329 places in 391 ms of which 1 ms to minimize.
[2023-03-23 04:04:35] [INFO ] Deduced a trap composed of 308 places in 397 ms of which 1 ms to minimize.
[2023-03-23 04:04:35] [INFO ] Deduced a trap composed of 308 places in 389 ms of which 1 ms to minimize.
[2023-03-23 04:04:36] [INFO ] Deduced a trap composed of 336 places in 374 ms of which 1 ms to minimize.
[2023-03-23 04:04:36] [INFO ] Deduced a trap composed of 312 places in 371 ms of which 1 ms to minimize.
[2023-03-23 04:04:37] [INFO ] Deduced a trap composed of 293 places in 375 ms of which 1 ms to minimize.
[2023-03-23 04:04:38] [INFO ] Deduced a trap composed of 332 places in 358 ms of which 1 ms to minimize.
[2023-03-23 04:04:38] [INFO ] Deduced a trap composed of 338 places in 357 ms of which 1 ms to minimize.
[2023-03-23 04:04:39] [INFO ] Deduced a trap composed of 332 places in 361 ms of which 0 ms to minimize.
[2023-03-23 04:04:39] [INFO ] Deduced a trap composed of 308 places in 369 ms of which 1 ms to minimize.
[2023-03-23 04:04:40] [INFO ] Deduced a trap composed of 321 places in 369 ms of which 1 ms to minimize.
[2023-03-23 04:04:40] [INFO ] Deduced a trap composed of 326 places in 364 ms of which 1 ms to minimize.
[2023-03-23 04:04:41] [INFO ] Deduced a trap composed of 326 places in 362 ms of which 1 ms to minimize.
[2023-03-23 04:04:41] [INFO ] Deduced a trap composed of 308 places in 354 ms of which 0 ms to minimize.
[2023-03-23 04:04:42] [INFO ] Deduced a trap composed of 314 places in 352 ms of which 0 ms to minimize.
[2023-03-23 04:04:42] [INFO ] Deduced a trap composed of 327 places in 364 ms of which 2 ms to minimize.
[2023-03-23 04:04:43] [INFO ] Deduced a trap composed of 305 places in 346 ms of which 1 ms to minimize.
[2023-03-23 04:04:43] [INFO ] Deduced a trap composed of 294 places in 378 ms of which 1 ms to minimize.
[2023-03-23 04:04:44] [INFO ] Deduced a trap composed of 299 places in 369 ms of which 1 ms to minimize.
[2023-03-23 04:04:44] [INFO ] Deduced a trap composed of 324 places in 365 ms of which 1 ms to minimize.
[2023-03-23 04:04:45] [INFO ] Deduced a trap composed of 335 places in 370 ms of which 1 ms to minimize.
[2023-03-23 04:04:45] [INFO ] Deduced a trap composed of 308 places in 363 ms of which 1 ms to minimize.
[2023-03-23 04:04:47] [INFO ] Deduced a trap composed of 335 places in 364 ms of which 1 ms to minimize.
[2023-03-23 04:04:48] [INFO ] Deduced a trap composed of 332 places in 369 ms of which 1 ms to minimize.
[2023-03-23 04:04:48] [INFO ] Deduced a trap composed of 330 places in 367 ms of which 1 ms to minimize.
[2023-03-23 04:04:49] [INFO ] Deduced a trap composed of 335 places in 366 ms of which 1 ms to minimize.
[2023-03-23 04:04:50] [INFO ] Deduced a trap composed of 323 places in 361 ms of which 1 ms to minimize.
[2023-03-23 04:04:50] [INFO ] Deduced a trap composed of 314 places in 353 ms of which 1 ms to minimize.
[2023-03-23 04:04:51] [INFO ] Deduced a trap composed of 314 places in 367 ms of which 1 ms to minimize.
[2023-03-23 04:04:52] [INFO ] Deduced a trap composed of 321 places in 359 ms of which 0 ms to minimize.
[2023-03-23 04:04:54] [INFO ] Deduced a trap composed of 339 places in 359 ms of which 0 ms to minimize.
[2023-03-23 04:04:57] [INFO ] Deduced a trap composed of 321 places in 364 ms of which 0 ms to minimize.
[2023-03-23 04:05:00] [INFO ] Deduced a trap composed of 314 places in 362 ms of which 2 ms to minimize.
[2023-03-23 04:05:00] [INFO ] Deduced a trap composed of 323 places in 365 ms of which 1 ms to minimize.
[2023-03-23 04:05:01] [INFO ] Deduced a trap composed of 314 places in 354 ms of which 0 ms to minimize.
[2023-03-23 04:05:01] [INFO ] Deduced a trap composed of 332 places in 355 ms of which 1 ms to minimize.
[2023-03-23 04:05:02] [INFO ] Deduced a trap composed of 317 places in 357 ms of which 1 ms to minimize.
[2023-03-23 04:05:04] [INFO ] Deduced a trap composed of 317 places in 351 ms of which 1 ms to minimize.
[2023-03-23 04:05:05] [INFO ] Deduced a trap composed of 341 places in 356 ms of which 2 ms to minimize.
[2023-03-23 04:05:05] [INFO ] Deduced a trap composed of 338 places in 366 ms of which 1 ms to minimize.
[2023-03-23 04:05:06] [INFO ] Deduced a trap composed of 311 places in 357 ms of which 0 ms to minimize.
[2023-03-23 04:05:06] [INFO ] Deduced a trap composed of 320 places in 357 ms of which 1 ms to minimize.
[2023-03-23 04:05:07] [INFO ] Deduced a trap composed of 311 places in 363 ms of which 1 ms to minimize.
[2023-03-23 04:05:08] [INFO ] Deduced a trap composed of 323 places in 354 ms of which 1 ms to minimize.
[2023-03-23 04:05:08] [INFO ] Deduced a trap composed of 342 places in 359 ms of which 1 ms to minimize.
[2023-03-23 04:05:09] [INFO ] Trap strengthening (SAT) tested/added 60/60 trap constraints in 43219 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 42 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 41 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-23 04:05:09] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 04:05:09] [INFO ] Invariant cache hit.
[2023-03-23 04:05:11] [INFO ] Implicit Places using invariants in 2388 ms returned []
[2023-03-23 04:05:11] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 04:05:11] [INFO ] Invariant cache hit.
[2023-03-23 04:05:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:05:42] [INFO ] Performed 931/1011 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-23 04:05:44] [INFO ] Implicit Places using invariants and state equation in 32497 ms returned []
Implicit Place search using SMT with State Equation took 34888 ms to find 0 implicit places.
[2023-03-23 04:05:44] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-23 04:05:44] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 04:05:44] [INFO ] Invariant cache hit.
[2023-03-23 04:05:46] [INFO ] Dead Transitions using invariants and state equation in 1971 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36962 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-07 in 102048 ms.
Starting property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-09
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 04:05:46] [INFO ] Computed 177 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 464 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2023-03-23 04:05:46] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 04:05:46] [INFO ] Computed 177 place invariants in 30 ms
[2023-03-23 04:05:46] [INFO ] [Real]Absence check using 156 positive place invariants in 32 ms returned sat
[2023-03-23 04:05:46] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 49 ms returned sat
[2023-03-23 04:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:05:47] [INFO ] [Real]Absence check using state equation in 1076 ms returned sat
[2023-03-23 04:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:05:47] [INFO ] [Nat]Absence check using 156 positive place invariants in 36 ms returned sat
[2023-03-23 04:05:47] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 39 ms returned sat
[2023-03-23 04:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:05:48] [INFO ] [Nat]Absence check using state equation in 879 ms returned sat
[2023-03-23 04:05:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:05:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 720 ms returned sat
[2023-03-23 04:05:49] [INFO ] Deduced a trap composed of 201 places in 412 ms of which 1 ms to minimize.
[2023-03-23 04:05:50] [INFO ] Deduced a trap composed of 320 places in 382 ms of which 0 ms to minimize.
[2023-03-23 04:05:50] [INFO ] Deduced a trap composed of 332 places in 386 ms of which 1 ms to minimize.
[2023-03-23 04:05:51] [INFO ] Deduced a trap composed of 291 places in 381 ms of which 1 ms to minimize.
[2023-03-23 04:05:51] [INFO ] Deduced a trap composed of 332 places in 387 ms of which 0 ms to minimize.
[2023-03-23 04:05:51] [INFO ] Deduced a trap composed of 376 places in 431 ms of which 1 ms to minimize.
[2023-03-23 04:05:52] [INFO ] Deduced a trap composed of 315 places in 381 ms of which 1 ms to minimize.
[2023-03-23 04:05:52] [INFO ] Deduced a trap composed of 323 places in 399 ms of which 1 ms to minimize.
[2023-03-23 04:05:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 45 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-23 04:05:52] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 04:05:52] [INFO ] Invariant cache hit.
[2023-03-23 04:05:54] [INFO ] Dead Transitions using invariants and state equation in 2016 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2065 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 04:05:54] [INFO ] Computed 177 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 47328 resets, run finished after 8359 ms. (steps per millisecond=119 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2672 resets, run finished after 1697 ms. (steps per millisecond=589 ) properties (out of 1) seen :3
[2023-03-23 04:06:05] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 04:06:05] [INFO ] Computed 177 place invariants in 29 ms
[2023-03-23 04:06:05] [INFO ] [Real]Absence check using 156 positive place invariants in 34 ms returned sat
[2023-03-23 04:06:05] [INFO ] [Real]Absence check using 156 positive and 21 generalized place invariants in 35 ms returned sat
[2023-03-23 04:06:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 04:06:06] [INFO ] [Real]Absence check using state equation in 1077 ms returned sat
[2023-03-23 04:06:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 04:06:06] [INFO ] [Nat]Absence check using 156 positive place invariants in 34 ms returned sat
[2023-03-23 04:06:06] [INFO ] [Nat]Absence check using 156 positive and 21 generalized place invariants in 38 ms returned sat
[2023-03-23 04:06:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 04:06:07] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2023-03-23 04:06:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:06:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 751 ms returned sat
[2023-03-23 04:06:08] [INFO ] Deduced a trap composed of 201 places in 438 ms of which 1 ms to minimize.
[2023-03-23 04:06:09] [INFO ] Deduced a trap composed of 320 places in 383 ms of which 1 ms to minimize.
[2023-03-23 04:06:09] [INFO ] Deduced a trap composed of 332 places in 403 ms of which 1 ms to minimize.
[2023-03-23 04:06:09] [INFO ] Deduced a trap composed of 291 places in 375 ms of which 1 ms to minimize.
[2023-03-23 04:06:10] [INFO ] Deduced a trap composed of 332 places in 386 ms of which 1 ms to minimize.
[2023-03-23 04:06:10] [INFO ] Deduced a trap composed of 376 places in 396 ms of which 1 ms to minimize.
[2023-03-23 04:06:11] [INFO ] Deduced a trap composed of 315 places in 383 ms of which 1 ms to minimize.
[2023-03-23 04:06:11] [INFO ] Deduced a trap composed of 323 places in 389 ms of which 1 ms to minimize.
[2023-03-23 04:06:12] [INFO ] Deduced a trap composed of 303 places in 394 ms of which 1 ms to minimize.
[2023-03-23 04:06:13] [INFO ] Deduced a trap composed of 336 places in 389 ms of which 1 ms to minimize.
[2023-03-23 04:06:13] [INFO ] Deduced a trap composed of 350 places in 371 ms of which 1 ms to minimize.
[2023-03-23 04:06:14] [INFO ] Deduced a trap composed of 314 places in 379 ms of which 1 ms to minimize.
[2023-03-23 04:06:14] [INFO ] Deduced a trap composed of 330 places in 375 ms of which 1 ms to minimize.
[2023-03-23 04:06:16] [INFO ] Deduced a trap composed of 396 places in 392 ms of which 1 ms to minimize.
[2023-03-23 04:06:16] [INFO ] Deduced a trap composed of 324 places in 390 ms of which 1 ms to minimize.
[2023-03-23 04:06:17] [INFO ] Deduced a trap composed of 329 places in 388 ms of which 1 ms to minimize.
[2023-03-23 04:06:17] [INFO ] Deduced a trap composed of 308 places in 376 ms of which 1 ms to minimize.
[2023-03-23 04:06:18] [INFO ] Deduced a trap composed of 308 places in 383 ms of which 1 ms to minimize.
[2023-03-23 04:06:18] [INFO ] Deduced a trap composed of 336 places in 385 ms of which 1 ms to minimize.
[2023-03-23 04:06:19] [INFO ] Deduced a trap composed of 312 places in 385 ms of which 1 ms to minimize.
[2023-03-23 04:06:20] [INFO ] Deduced a trap composed of 293 places in 396 ms of which 0 ms to minimize.
[2023-03-23 04:06:20] [INFO ] Deduced a trap composed of 332 places in 377 ms of which 0 ms to minimize.
[2023-03-23 04:06:21] [INFO ] Deduced a trap composed of 338 places in 359 ms of which 1 ms to minimize.
[2023-03-23 04:06:21] [INFO ] Deduced a trap composed of 332 places in 362 ms of which 1 ms to minimize.
[2023-03-23 04:06:22] [INFO ] Deduced a trap composed of 308 places in 359 ms of which 1 ms to minimize.
[2023-03-23 04:06:22] [INFO ] Deduced a trap composed of 321 places in 365 ms of which 1 ms to minimize.
[2023-03-23 04:06:23] [INFO ] Deduced a trap composed of 326 places in 368 ms of which 1 ms to minimize.
[2023-03-23 04:06:23] [INFO ] Deduced a trap composed of 326 places in 361 ms of which 0 ms to minimize.
[2023-03-23 04:06:23] [INFO ] Deduced a trap composed of 308 places in 359 ms of which 1 ms to minimize.
[2023-03-23 04:06:24] [INFO ] Deduced a trap composed of 314 places in 355 ms of which 1 ms to minimize.
[2023-03-23 04:06:25] [INFO ] Deduced a trap composed of 327 places in 377 ms of which 1 ms to minimize.
[2023-03-23 04:06:25] [INFO ] Deduced a trap composed of 305 places in 348 ms of which 0 ms to minimize.
[2023-03-23 04:06:26] [INFO ] Deduced a trap composed of 294 places in 372 ms of which 1 ms to minimize.
[2023-03-23 04:06:26] [INFO ] Deduced a trap composed of 299 places in 369 ms of which 1 ms to minimize.
[2023-03-23 04:06:27] [INFO ] Deduced a trap composed of 324 places in 363 ms of which 1 ms to minimize.
[2023-03-23 04:06:27] [INFO ] Deduced a trap composed of 335 places in 371 ms of which 1 ms to minimize.
[2023-03-23 04:06:27] [INFO ] Deduced a trap composed of 308 places in 363 ms of which 0 ms to minimize.
[2023-03-23 04:06:29] [INFO ] Deduced a trap composed of 335 places in 362 ms of which 1 ms to minimize.
[2023-03-23 04:06:30] [INFO ] Deduced a trap composed of 332 places in 361 ms of which 1 ms to minimize.
[2023-03-23 04:06:31] [INFO ] Deduced a trap composed of 330 places in 370 ms of which 1 ms to minimize.
[2023-03-23 04:06:31] [INFO ] Deduced a trap composed of 335 places in 372 ms of which 1 ms to minimize.
[2023-03-23 04:06:32] [INFO ] Deduced a trap composed of 323 places in 372 ms of which 1 ms to minimize.
[2023-03-23 04:06:32] [INFO ] Deduced a trap composed of 314 places in 355 ms of which 1 ms to minimize.
[2023-03-23 04:06:33] [INFO ] Deduced a trap composed of 314 places in 365 ms of which 1 ms to minimize.
[2023-03-23 04:06:34] [INFO ] Deduced a trap composed of 321 places in 349 ms of which 0 ms to minimize.
[2023-03-23 04:06:36] [INFO ] Deduced a trap composed of 339 places in 344 ms of which 1 ms to minimize.
[2023-03-23 04:06:39] [INFO ] Deduced a trap composed of 321 places in 366 ms of which 1 ms to minimize.
[2023-03-23 04:06:42] [INFO ] Deduced a trap composed of 314 places in 391 ms of which 1 ms to minimize.
[2023-03-23 04:06:42] [INFO ] Deduced a trap composed of 323 places in 365 ms of which 1 ms to minimize.
[2023-03-23 04:06:43] [INFO ] Deduced a trap composed of 314 places in 372 ms of which 1 ms to minimize.
[2023-03-23 04:06:43] [INFO ] Deduced a trap composed of 332 places in 352 ms of which 0 ms to minimize.
[2023-03-23 04:06:44] [INFO ] Deduced a trap composed of 317 places in 365 ms of which 1 ms to minimize.
[2023-03-23 04:06:46] [INFO ] Deduced a trap composed of 317 places in 352 ms of which 1 ms to minimize.
[2023-03-23 04:06:47] [INFO ] Deduced a trap composed of 341 places in 341 ms of which 1 ms to minimize.
[2023-03-23 04:06:48] [INFO ] Deduced a trap composed of 338 places in 375 ms of which 1 ms to minimize.
[2023-03-23 04:06:48] [INFO ] Deduced a trap composed of 311 places in 369 ms of which 1 ms to minimize.
[2023-03-23 04:06:49] [INFO ] Deduced a trap composed of 320 places in 366 ms of which 0 ms to minimize.
[2023-03-23 04:06:49] [INFO ] Deduced a trap composed of 311 places in 364 ms of which 1 ms to minimize.
[2023-03-23 04:06:50] [INFO ] Deduced a trap composed of 323 places in 376 ms of which 1 ms to minimize.
[2023-03-23 04:06:50] [INFO ] Deduced a trap composed of 342 places in 358 ms of which 1 ms to minimize.
[2023-03-23 04:06:51] [INFO ] Trap strengthening (SAT) tested/added 60/60 trap constraints in 43196 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 54 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 43 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-23 04:06:51] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 04:06:51] [INFO ] Invariant cache hit.
[2023-03-23 04:06:53] [INFO ] Implicit Places using invariants in 2433 ms returned []
[2023-03-23 04:06:53] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 04:06:53] [INFO ] Invariant cache hit.
[2023-03-23 04:06:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 04:07:22] [INFO ] Implicit Places using invariants and state equation in 28286 ms returned []
Implicit Place search using SMT with State Equation took 30720 ms to find 0 implicit places.
[2023-03-23 04:07:22] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-23 04:07:22] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 04:07:22] [INFO ] Invariant cache hit.
[2023-03-23 04:07:24] [INFO ] Dead Transitions using invariants and state equation in 2029 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32839 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J80-UpperBounds-09 in 98275 ms.
[2023-03-23 04:07:24] [INFO ] Flatten gal took : 182 ms
[2023-03-23 04:07:24] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-23 04:07:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1011 places, 1427 transitions and 7211 arcs took 9 ms.
Total runtime 479360 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (PT), instance S05J80
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart
PNML FILE: model.pnml
Petri model created: 1011 places, 1427 transitions, 7211 arcs.
Final Score: 287007.048
Took : 27 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13691380 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100472 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J80"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is PolyORBNT-PT-S05J80, 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 r299-tall-167873953400749"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J80.tgz
mv PolyORBNT-PT-S05J80 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 ;