About the Execution of Smart+red for FunctionPointer-PT-c016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16151.000 | 1732565.00 | 1776836.00 | 11804.30 | 0 0 ? 16 0 0 0 0 16 ? 0 1 ? 0 0 16 | 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.r171-tall-167838859000741.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 FunctionPointer-PT-c016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838859000741
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.2M Mar 5 18:22 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 FunctionPointer-PT-c016-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679505733787
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=FunctionPointer-PT-c016
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 17:22:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 17:22:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:22:15] [INFO ] Load time of PNML (sax parser for PT used): 334 ms
[2023-03-22 17:22:15] [INFO ] Transformed 2826 places.
[2023-03-22 17:22:15] [INFO ] Transformed 8960 transitions.
[2023-03-22 17:22:15] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 484 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1198 places in 36 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3540 out of 5962 initially.
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-22 17:22:15] [INFO ] Computed 4 place invariants in 87 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 7) seen :10
FORMULA FunctionPointer-PT-c016-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :1
[2023-03-22 17:22:16] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-22 17:22:16] [INFO ] Computed 4 place invariants in 55 ms
[2023-03-22 17:22:16] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2023-03-22 17:22:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 17:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:17] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2023-03-22 17:22:17] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-22 17:22:18] [INFO ] [Real]Added 479 Read/Feed constraints in 112 ms returned sat
[2023-03-22 17:22:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:22:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-22 17:22:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 17:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:19] [INFO ] [Nat]Absence check using state equation in 808 ms returned sat
[2023-03-22 17:22:19] [INFO ] [Nat]Added 479 Read/Feed constraints in 140 ms returned sat
[2023-03-22 17:22:20] [INFO ] Deduced a trap composed of 133 places in 1090 ms of which 7 ms to minimize.
[2023-03-22 17:22:21] [INFO ] Deduced a trap composed of 133 places in 1115 ms of which 2 ms to minimize.
[2023-03-22 17:22:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2484 ms
[2023-03-22 17:22:22] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 735 ms.
[2023-03-22 17:22:22] [INFO ] Added : 2 causal constraints over 1 iterations in 1060 ms. Result :sat
[2023-03-22 17:22:23] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-22 17:22:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 17:22:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:23] [INFO ] [Real]Absence check using state equation in 804 ms returned sat
[2023-03-22 17:22:24] [INFO ] [Real]Added 479 Read/Feed constraints in 80 ms returned sat
[2023-03-22 17:22:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:22:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-22 17:22:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 17:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:25] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2023-03-22 17:22:25] [INFO ] [Nat]Added 479 Read/Feed constraints in 81 ms returned sat
[2023-03-22 17:22:25] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 671 ms.
[2023-03-22 17:22:26] [INFO ] Added : 0 causal constraints over 0 iterations in 872 ms. Result :sat
[2023-03-22 17:22:26] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-22 17:22:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-22 17:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:27] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2023-03-22 17:22:27] [INFO ] [Real]Added 479 Read/Feed constraints in 79 ms returned sat
[2023-03-22 17:22:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:22:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-22 17:22:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 17:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:28] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2023-03-22 17:22:28] [INFO ] [Nat]Added 479 Read/Feed constraints in 73 ms returned sat
[2023-03-22 17:22:28] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 485 ms.
[2023-03-22 17:22:29] [INFO ] Added : 0 causal constraints over 0 iterations in 691 ms. Result :sat
[2023-03-22 17:22:29] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-22 17:22:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:22:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:30] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2023-03-22 17:22:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:22:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-22 17:22:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:22:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:31] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2023-03-22 17:22:31] [INFO ] [Nat]Added 479 Read/Feed constraints in 310 ms returned sat
[2023-03-22 17:22:32] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 426 ms.
[2023-03-22 17:22:32] [INFO ] Added : 2 causal constraints over 1 iterations in 757 ms. Result :sat
[2023-03-22 17:22:32] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-22 17:22:32] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 17:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:33] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2023-03-22 17:22:33] [INFO ] [Real]Added 479 Read/Feed constraints in 111 ms returned sat
[2023-03-22 17:22:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:22:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-22 17:22:33] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:22:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:34] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2023-03-22 17:22:34] [INFO ] [Nat]Added 479 Read/Feed constraints in 149 ms returned sat
[2023-03-22 17:22:36] [INFO ] Deduced a trap composed of 133 places in 1107 ms of which 2 ms to minimize.
[2023-03-22 17:22:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1286 ms
[2023-03-22 17:22:36] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 493 ms.
[2023-03-22 17:22:36] [INFO ] Added : 1 causal constraints over 1 iterations in 818 ms. Result :sat
[2023-03-22 17:22:37] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-22 17:22:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 17:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:37] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2023-03-22 17:22:38] [INFO ] [Real]Added 479 Read/Feed constraints in 85 ms returned sat
[2023-03-22 17:22:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:22:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-22 17:22:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 17:22:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:39] [INFO ] [Nat]Absence check using state equation in 763 ms returned sat
[2023-03-22 17:22:39] [INFO ] [Nat]Added 479 Read/Feed constraints in 79 ms returned sat
[2023-03-22 17:22:39] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 481 ms.
[2023-03-22 17:22:40] [INFO ] Added : 0 causal constraints over 0 iterations in 677 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, 16, 16, -1, -1, 16] Max seen :[6, 1, 2, 0, 3, 1]
Support contains 6 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1419 are kept as prefixes of interest. Removing 209 places using SCC suffix rule.15 ms
Discarding 209 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 1419 transition count 5578
Discarding 301 places :
Symmetric choice reduction at 1 with 301 rule applications. Total rules 686 place count 1118 transition count 3282
Iterating global reduction 1 with 301 rules applied. Total rules applied 987 place count 1118 transition count 3282
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 1339 place count 1118 transition count 2930
Discarding 155 places :
Symmetric choice reduction at 2 with 155 rule applications. Total rules 1494 place count 963 transition count 2620
Iterating global reduction 2 with 155 rules applied. Total rules applied 1649 place count 963 transition count 2620
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 1709 place count 963 transition count 2560
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1723 place count 949 transition count 2532
Iterating global reduction 3 with 14 rules applied. Total rules applied 1737 place count 949 transition count 2532
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1751 place count 935 transition count 2504
Iterating global reduction 3 with 14 rules applied. Total rules applied 1765 place count 935 transition count 2504
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1779 place count 921 transition count 2476
Iterating global reduction 3 with 14 rules applied. Total rules applied 1793 place count 921 transition count 2476
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1807 place count 907 transition count 2448
Iterating global reduction 3 with 14 rules applied. Total rules applied 1821 place count 907 transition count 2448
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1835 place count 893 transition count 2420
Iterating global reduction 3 with 14 rules applied. Total rules applied 1849 place count 893 transition count 2420
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1862 place count 880 transition count 2394
Iterating global reduction 3 with 13 rules applied. Total rules applied 1875 place count 880 transition count 2394
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1888 place count 867 transition count 2368
Iterating global reduction 3 with 13 rules applied. Total rules applied 1901 place count 867 transition count 2368
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1955 place count 813 transition count 2166
Iterating global reduction 3 with 54 rules applied. Total rules applied 2009 place count 813 transition count 2166
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 2070 place count 752 transition count 1922
Iterating global reduction 3 with 61 rules applied. Total rules applied 2131 place count 752 transition count 1922
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 2192 place count 691 transition count 1772
Iterating global reduction 3 with 61 rules applied. Total rules applied 2253 place count 691 transition count 1772
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 2314 place count 630 transition count 1650
Iterating global reduction 3 with 61 rules applied. Total rules applied 2375 place count 630 transition count 1650
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 2436 place count 569 transition count 1528
Iterating global reduction 3 with 61 rules applied. Total rules applied 2497 place count 569 transition count 1528
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 2558 place count 508 transition count 1406
Iterating global reduction 3 with 61 rules applied. Total rules applied 2619 place count 508 transition count 1406
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2679 place count 448 transition count 1286
Iterating global reduction 3 with 60 rules applied. Total rules applied 2739 place count 448 transition count 1286
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 2753 place count 434 transition count 1258
Iterating global reduction 3 with 14 rules applied. Total rules applied 2767 place count 434 transition count 1258
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 2773 place count 434 transition count 1252
Applied a total of 2773 rules in 1170 ms. Remains 434 /1628 variables (removed 1194) and now considering 1252/5962 (removed 4710) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1171 ms. Remains : 434/1628 places, 1252/5962 transitions.
Normalized transition count is 711 out of 1252 initially.
// Phase 1: matrix 711 rows 434 cols
[2023-03-22 17:22:41] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2281 ms. (steps per millisecond=438 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 806 ms. (steps per millisecond=1240 ) properties (out of 6) seen :516
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 762 ms. (steps per millisecond=1312 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 710 ms. (steps per millisecond=1408 ) properties (out of 6) seen :142
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 710 ms. (steps per millisecond=1408 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 749 ms. (steps per millisecond=1335 ) properties (out of 6) seen :23
[2023-03-22 17:22:48] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-22 17:22:48] [INFO ] Computed 3 place invariants in 10 ms
[2023-03-22 17:22:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:48] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-22 17:22:48] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 17:22:48] [INFO ] [Real]Added 80 Read/Feed constraints in 65 ms returned sat
[2023-03-22 17:22:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:22:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-22 17:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:48] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-22 17:22:48] [INFO ] [Nat]Added 80 Read/Feed constraints in 57 ms returned sat
[2023-03-22 17:22:48] [INFO ] Deduced a trap composed of 125 places in 200 ms of which 0 ms to minimize.
[2023-03-22 17:22:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-22 17:22:49] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 62 ms.
[2023-03-22 17:22:49] [INFO ] Added : 17 causal constraints over 4 iterations in 273 ms. Result :sat
Minimization took 48 ms.
[2023-03-22 17:22:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:22:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:49] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2023-03-22 17:22:49] [INFO ] [Real]Added 80 Read/Feed constraints in 19 ms returned sat
[2023-03-22 17:22:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:22:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:22:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:49] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-22 17:22:49] [INFO ] [Nat]Added 80 Read/Feed constraints in 17 ms returned sat
[2023-03-22 17:22:49] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 67 ms.
[2023-03-22 17:22:49] [INFO ] Added : 0 causal constraints over 0 iterations in 123 ms. Result :sat
Minimization took 49 ms.
[2023-03-22 17:22:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:50] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-22 17:22:50] [INFO ] [Real]Added 80 Read/Feed constraints in 19 ms returned sat
[2023-03-22 17:22:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:22:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:50] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-22 17:22:50] [INFO ] [Nat]Added 80 Read/Feed constraints in 16 ms returned sat
[2023-03-22 17:22:50] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 65 ms.
[2023-03-22 17:22:50] [INFO ] Added : 0 causal constraints over 0 iterations in 128 ms. Result :sat
Minimization took 47 ms.
[2023-03-22 17:22:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:50] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-22 17:22:50] [INFO ] [Real]Added 80 Read/Feed constraints in 21 ms returned sat
[2023-03-22 17:22:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:22:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:22:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:51] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-22 17:22:51] [INFO ] [Nat]Added 80 Read/Feed constraints in 31 ms returned sat
[2023-03-22 17:22:51] [INFO ] Deduced a trap composed of 125 places in 192 ms of which 1 ms to minimize.
[2023-03-22 17:22:51] [INFO ] Deduced a trap composed of 99 places in 204 ms of which 0 ms to minimize.
[2023-03-22 17:22:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 469 ms
[2023-03-22 17:22:51] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 79 ms.
[2023-03-22 17:22:52] [INFO ] Added : 32 causal constraints over 7 iterations in 422 ms. Result :sat
Minimization took 57 ms.
[2023-03-22 17:22:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:52] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-22 17:22:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:22:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:22:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:52] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-22 17:22:52] [INFO ] [Nat]Added 80 Read/Feed constraints in 57 ms returned sat
[2023-03-22 17:22:52] [INFO ] Deduced a trap composed of 84 places in 196 ms of which 0 ms to minimize.
[2023-03-22 17:22:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-22 17:22:53] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 61 ms.
[2023-03-22 17:22:53] [INFO ] Added : 13 causal constraints over 6 iterations in 310 ms. Result :sat
Minimization took 44 ms.
[2023-03-22 17:22:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:22:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:53] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-22 17:22:53] [INFO ] [Real]Added 80 Read/Feed constraints in 20 ms returned sat
[2023-03-22 17:22:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:22:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:22:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:22:53] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-22 17:22:53] [INFO ] [Nat]Added 80 Read/Feed constraints in 17 ms returned sat
[2023-03-22 17:22:53] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 68 ms.
[2023-03-22 17:22:53] [INFO ] Added : 0 causal constraints over 0 iterations in 127 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [-1, 16, 16, -1, -1, 16] Max seen :[510, 2, 3, 125, 15, 2]
FORMULA FunctionPointer-PT-c016-UpperBounds-15 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c016-UpperBounds-08 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c016-UpperBounds-03 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Applied a total of 0 rules in 45 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 434/434 places, 1252/1252 transitions.
Normalized transition count is 711 out of 1252 initially.
// Phase 1: matrix 711 rows 434 cols
[2023-03-22 17:22:57] [INFO ] Computed 3 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2054 ms. (steps per millisecond=486 ) properties (out of 3) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 698 ms. (steps per millisecond=1432 ) properties (out of 3) seen :25
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 726 ms. (steps per millisecond=1377 ) properties (out of 3) seen :150
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 701 ms. (steps per millisecond=1426 ) properties (out of 3) seen :3
[2023-03-22 17:23:01] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-22 17:23:01] [INFO ] Computed 3 place invariants in 13 ms
[2023-03-22 17:23:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:01] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-22 17:23:01] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 17:23:01] [INFO ] [Real]Added 80 Read/Feed constraints in 65 ms returned sat
[2023-03-22 17:23:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:23:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:01] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-22 17:23:01] [INFO ] [Nat]Added 80 Read/Feed constraints in 63 ms returned sat
[2023-03-22 17:23:02] [INFO ] Deduced a trap composed of 125 places in 174 ms of which 1 ms to minimize.
[2023-03-22 17:23:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-22 17:23:02] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 64 ms.
[2023-03-22 17:23:02] [INFO ] Added : 17 causal constraints over 4 iterations in 277 ms. Result :sat
Minimization took 40 ms.
[2023-03-22 17:23:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:02] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-22 17:23:02] [INFO ] [Real]Added 80 Read/Feed constraints in 21 ms returned sat
[2023-03-22 17:23:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:23:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:02] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-22 17:23:03] [INFO ] [Nat]Added 80 Read/Feed constraints in 31 ms returned sat
[2023-03-22 17:23:03] [INFO ] Deduced a trap composed of 125 places in 194 ms of which 1 ms to minimize.
[2023-03-22 17:23:03] [INFO ] Deduced a trap composed of 99 places in 188 ms of which 1 ms to minimize.
[2023-03-22 17:23:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 448 ms
[2023-03-22 17:23:03] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 72 ms.
[2023-03-22 17:23:03] [INFO ] Added : 32 causal constraints over 7 iterations in 403 ms. Result :sat
Minimization took 55 ms.
[2023-03-22 17:23:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:04] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-22 17:23:04] [INFO ] [Real]Added 80 Read/Feed constraints in 39 ms returned sat
[2023-03-22 17:23:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:23:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:04] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-22 17:23:04] [INFO ] [Nat]Added 80 Read/Feed constraints in 56 ms returned sat
[2023-03-22 17:23:04] [INFO ] Deduced a trap composed of 84 places in 184 ms of which 0 ms to minimize.
[2023-03-22 17:23:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-22 17:23:04] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 63 ms.
[2023-03-22 17:23:05] [INFO ] Added : 12 causal constraints over 5 iterations in 279 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[510, 139, 20]
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Applied a total of 0 rules in 47 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 434/434 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Applied a total of 0 rules in 46 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-22 17:23:08] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-22 17:23:08] [INFO ] Invariant cache hit.
[2023-03-22 17:23:08] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-22 17:23:08] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-22 17:23:08] [INFO ] Invariant cache hit.
[2023-03-22 17:23:08] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 17:23:09] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
[2023-03-22 17:23:09] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-22 17:23:09] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-22 17:23:09] [INFO ] Invariant cache hit.
[2023-03-22 17:23:09] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1672 ms. Remains : 434/434 places, 1252/1252 transitions.
Normalized transition count is 711 out of 1252 initially.
// Phase 1: matrix 711 rows 434 cols
[2023-03-22 17:23:09] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2218 ms. (steps per millisecond=450 ) properties (out of 3) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 765 ms. (steps per millisecond=1307 ) properties (out of 3) seen :230
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 3) seen :133
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 759 ms. (steps per millisecond=1317 ) properties (out of 3) seen :989
[2023-03-22 17:23:14] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-22 17:23:14] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-22 17:23:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:14] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-22 17:23:14] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 17:23:14] [INFO ] [Real]Added 80 Read/Feed constraints in 67 ms returned sat
[2023-03-22 17:23:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:23:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:15] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-22 17:23:15] [INFO ] [Nat]Added 80 Read/Feed constraints in 58 ms returned sat
[2023-03-22 17:23:15] [INFO ] Deduced a trap composed of 125 places in 184 ms of which 0 ms to minimize.
[2023-03-22 17:23:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-22 17:23:15] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 75 ms.
[2023-03-22 17:23:15] [INFO ] Added : 17 causal constraints over 4 iterations in 306 ms. Result :sat
Minimization took 45 ms.
[2023-03-22 17:23:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:15] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-22 17:23:15] [INFO ] [Real]Added 80 Read/Feed constraints in 20 ms returned sat
[2023-03-22 17:23:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:23:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:16] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-22 17:23:16] [INFO ] [Nat]Added 80 Read/Feed constraints in 30 ms returned sat
[2023-03-22 17:23:16] [INFO ] Deduced a trap composed of 125 places in 189 ms of which 0 ms to minimize.
[2023-03-22 17:23:16] [INFO ] Deduced a trap composed of 99 places in 184 ms of which 1 ms to minimize.
[2023-03-22 17:23:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 442 ms
[2023-03-22 17:23:16] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 74 ms.
[2023-03-22 17:23:17] [INFO ] Added : 32 causal constraints over 7 iterations in 407 ms. Result :sat
Minimization took 57 ms.
[2023-03-22 17:23:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:17] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-22 17:23:17] [INFO ] [Real]Added 80 Read/Feed constraints in 64 ms returned sat
[2023-03-22 17:23:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:23:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-22 17:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:17] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-22 17:23:17] [INFO ] [Nat]Added 80 Read/Feed constraints in 56 ms returned sat
[2023-03-22 17:23:17] [INFO ] Deduced a trap composed of 84 places in 183 ms of which 0 ms to minimize.
[2023-03-22 17:23:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-22 17:23:17] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 69 ms.
[2023-03-22 17:23:18] [INFO ] Added : 12 causal constraints over 5 iterations in 280 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[510, 139, 981]
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Applied a total of 0 rules in 50 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 434/434 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Applied a total of 0 rules in 49 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-22 17:23:23] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-22 17:23:23] [INFO ] Invariant cache hit.
[2023-03-22 17:23:23] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-22 17:23:23] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-22 17:23:23] [INFO ] Invariant cache hit.
[2023-03-22 17:23:23] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 17:23:24] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
[2023-03-22 17:23:24] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-22 17:23:24] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-22 17:23:24] [INFO ] Invariant cache hit.
[2023-03-22 17:23:24] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1577 ms. Remains : 434/434 places, 1252/1252 transitions.
Normalized transition count is 711 out of 1252 initially.
// Phase 1: matrix 711 rows 434 cols
[2023-03-22 17:23:24] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2145 ms. (steps per millisecond=466 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 735 ms. (steps per millisecond=1360 ) properties (out of 3) seen :182
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 727 ms. (steps per millisecond=1375 ) properties (out of 3) seen :128
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties (out of 3) seen :4
[2023-03-22 17:23:29] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-22 17:23:29] [INFO ] Computed 3 place invariants in 14 ms
[2023-03-22 17:23:29] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:29] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-03-22 17:23:29] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 17:23:29] [INFO ] [Real]Added 80 Read/Feed constraints in 71 ms returned sat
[2023-03-22 17:23:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:23:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:29] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-03-22 17:23:29] [INFO ] [Nat]Added 80 Read/Feed constraints in 58 ms returned sat
[2023-03-22 17:23:29] [INFO ] Deduced a trap composed of 125 places in 183 ms of which 1 ms to minimize.
[2023-03-22 17:23:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-22 17:23:29] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 63 ms.
[2023-03-22 17:23:30] [INFO ] Added : 17 causal constraints over 4 iterations in 274 ms. Result :sat
Minimization took 46 ms.
[2023-03-22 17:23:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:30] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2023-03-22 17:23:30] [INFO ] [Real]Added 80 Read/Feed constraints in 19 ms returned sat
[2023-03-22 17:23:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:23:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:30] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-22 17:23:30] [INFO ] [Nat]Added 80 Read/Feed constraints in 29 ms returned sat
[2023-03-22 17:23:30] [INFO ] Deduced a trap composed of 125 places in 189 ms of which 0 ms to minimize.
[2023-03-22 17:23:31] [INFO ] Deduced a trap composed of 99 places in 174 ms of which 0 ms to minimize.
[2023-03-22 17:23:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 419 ms
[2023-03-22 17:23:31] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 67 ms.
[2023-03-22 17:23:31] [INFO ] Added : 32 causal constraints over 7 iterations in 405 ms. Result :sat
Minimization took 63 ms.
[2023-03-22 17:23:31] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 17:23:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:31] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-22 17:23:31] [INFO ] [Real]Added 80 Read/Feed constraints in 62 ms returned sat
[2023-03-22 17:23:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:23:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:32] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-22 17:23:32] [INFO ] [Nat]Added 80 Read/Feed constraints in 55 ms returned sat
[2023-03-22 17:23:32] [INFO ] Deduced a trap composed of 84 places in 192 ms of which 0 ms to minimize.
[2023-03-22 17:23:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-22 17:23:32] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 71 ms.
[2023-03-22 17:23:32] [INFO ] Added : 12 causal constraints over 5 iterations in 290 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[510, 139, 981]
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Applied a total of 0 rules in 60 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 434/434 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Applied a total of 0 rules in 47 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-22 17:23:37] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-22 17:23:37] [INFO ] Invariant cache hit.
[2023-03-22 17:23:38] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-22 17:23:38] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-22 17:23:38] [INFO ] Invariant cache hit.
[2023-03-22 17:23:38] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 17:23:38] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
[2023-03-22 17:23:38] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-22 17:23:38] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-22 17:23:38] [INFO ] Invariant cache hit.
[2023-03-22 17:23:39] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1660 ms. Remains : 434/434 places, 1252/1252 transitions.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-02
Normalized transition count is 711 out of 1252 initially.
// Phase 1: matrix 711 rows 434 cols
[2023-03-22 17:23:39] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
[2023-03-22 17:23:39] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-22 17:23:39] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-22 17:23:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:39] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-22 17:23:39] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 17:23:39] [INFO ] [Real]Added 80 Read/Feed constraints in 22 ms returned sat
[2023-03-22 17:23:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:23:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:39] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-22 17:23:39] [INFO ] [Nat]Added 80 Read/Feed constraints in 64 ms returned sat
[2023-03-22 17:23:40] [INFO ] Deduced a trap composed of 125 places in 189 ms of which 0 ms to minimize.
[2023-03-22 17:23:40] [INFO ] Deduced a trap composed of 109 places in 183 ms of which 1 ms to minimize.
[2023-03-22 17:23:40] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 1 ms to minimize.
[2023-03-22 17:23:40] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 1 ms to minimize.
[2023-03-22 17:23:40] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 1 ms to minimize.
[2023-03-22 17:23:41] [INFO ] Deduced a trap composed of 84 places in 166 ms of which 0 ms to minimize.
[2023-03-22 17:23:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1245 ms
[2023-03-22 17:23:41] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 66 ms.
[2023-03-22 17:23:41] [INFO ] Added : 10 causal constraints over 4 iterations in 257 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 432 transition count 1248
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 432 transition count 1248
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 432 transition count 1246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 430 transition count 1242
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 430 transition count 1242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 14 place count 430 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 429 transition count 1236
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 429 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 428 transition count 1234
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 428 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 427 transition count 1230
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 426 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 425 transition count 1226
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 424 transition count 1224
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 423 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 421 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 421 transition count 1218
Applied a total of 32 rules in 131 ms. Remains 421 /434 variables (removed 13) and now considering 1218/1252 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 421/434 places, 1218/1252 transitions.
Normalized transition count is 688 out of 1218 initially.
// Phase 1: matrix 688 rows 421 cols
[2023-03-22 17:23:41] [INFO ] Computed 3 place invariants in 8 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 2058 ms. (steps per millisecond=485 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 704 ms. (steps per millisecond=1420 ) properties (out of 1) seen :0
[2023-03-22 17:23:44] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-22 17:23:44] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-22 17:23:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:44] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-22 17:23:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-22 17:23:44] [INFO ] [Real]Added 75 Read/Feed constraints in 26 ms returned sat
[2023-03-22 17:23:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:23:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:44] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-22 17:23:44] [INFO ] [Nat]Added 75 Read/Feed constraints in 55 ms returned sat
[2023-03-22 17:23:45] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 0 ms to minimize.
[2023-03-22 17:23:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-22 17:23:45] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 66 ms.
[2023-03-22 17:23:45] [INFO ] Added : 17 causal constraints over 5 iterations in 295 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 44 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 42 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-22 17:23:45] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-22 17:23:45] [INFO ] Invariant cache hit.
[2023-03-22 17:23:45] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-22 17:23:45] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-22 17:23:45] [INFO ] Invariant cache hit.
[2023-03-22 17:23:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-22 17:23:46] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2023-03-22 17:23:46] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 17:23:46] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-22 17:23:46] [INFO ] Invariant cache hit.
[2023-03-22 17:23:47] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1621 ms. Remains : 421/421 places, 1218/1218 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-02 in 7927 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-09
Normalized transition count is 711 out of 1252 initially.
// Phase 1: matrix 711 rows 434 cols
[2023-03-22 17:23:47] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2023-03-22 17:23:47] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-22 17:23:47] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-22 17:23:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:47] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-22 17:23:47] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 17:23:47] [INFO ] [Real]Added 80 Read/Feed constraints in 19 ms returned sat
[2023-03-22 17:23:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:23:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:47] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2023-03-22 17:23:47] [INFO ] [Nat]Added 80 Read/Feed constraints in 20 ms returned sat
[2023-03-22 17:23:48] [INFO ] Deduced a trap composed of 125 places in 191 ms of which 0 ms to minimize.
[2023-03-22 17:23:48] [INFO ] Deduced a trap composed of 99 places in 181 ms of which 0 ms to minimize.
[2023-03-22 17:23:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 457 ms
[2023-03-22 17:23:48] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 71 ms.
[2023-03-22 17:23:48] [INFO ] Added : 32 causal constraints over 7 iterations in 404 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 432 transition count 1248
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 432 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 431 transition count 1244
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 431 transition count 1244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 430 transition count 1242
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 430 transition count 1242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 429 transition count 1240
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 429 transition count 1240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 428 transition count 1238
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 428 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 427 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 427 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 426 transition count 1234
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 426 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 425 transition count 1232
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 425 transition count 1232
Applied a total of 18 rules in 127 ms. Remains 425 /434 variables (removed 9) and now considering 1232/1252 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 425/434 places, 1232/1252 transitions.
Normalized transition count is 695 out of 1232 initially.
// Phase 1: matrix 695 rows 425 cols
[2023-03-22 17:23:48] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2149 ms. (steps per millisecond=465 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=1392 ) properties (out of 1) seen :134
[2023-03-22 17:23:51] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2023-03-22 17:23:51] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-22 17:23:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:51] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-22 17:23:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-22 17:23:52] [INFO ] [Real]Added 75 Read/Feed constraints in 22 ms returned sat
[2023-03-22 17:23:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:23:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:52] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-22 17:23:52] [INFO ] [Nat]Added 75 Read/Feed constraints in 18 ms returned sat
[2023-03-22 17:23:52] [INFO ] Deduced a trap composed of 113 places in 179 ms of which 0 ms to minimize.
[2023-03-22 17:23:52] [INFO ] Deduced a trap composed of 99 places in 166 ms of which 1 ms to minimize.
[2023-03-22 17:23:52] [INFO ] Deduced a trap composed of 78 places in 208 ms of which 0 ms to minimize.
[2023-03-22 17:23:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 652 ms
[2023-03-22 17:23:52] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 70 ms.
[2023-03-22 17:23:53] [INFO ] Added : 41 causal constraints over 10 iterations in 502 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[134]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 43 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 42 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2023-03-22 17:23:54] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-22 17:23:54] [INFO ] Invariant cache hit.
[2023-03-22 17:23:54] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-22 17:23:54] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-22 17:23:54] [INFO ] Invariant cache hit.
[2023-03-22 17:23:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-22 17:23:55] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
[2023-03-22 17:23:55] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-22 17:23:55] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-22 17:23:55] [INFO ] Invariant cache hit.
[2023-03-22 17:23:56] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1680 ms. Remains : 425/425 places, 1232/1232 transitions.
Normalized transition count is 695 out of 1232 initially.
// Phase 1: matrix 695 rows 425 cols
[2023-03-22 17:23:56] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2110 ms. (steps per millisecond=473 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=1402 ) properties (out of 1) seen :149
[2023-03-22 17:23:58] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2023-03-22 17:23:58] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-22 17:23:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:59] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-03-22 17:23:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-22 17:23:59] [INFO ] [Real]Added 75 Read/Feed constraints in 26 ms returned sat
[2023-03-22 17:23:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:23:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:23:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:23:59] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-22 17:23:59] [INFO ] [Nat]Added 75 Read/Feed constraints in 17 ms returned sat
[2023-03-22 17:23:59] [INFO ] Deduced a trap composed of 113 places in 177 ms of which 0 ms to minimize.
[2023-03-22 17:23:59] [INFO ] Deduced a trap composed of 99 places in 177 ms of which 0 ms to minimize.
[2023-03-22 17:23:59] [INFO ] Deduced a trap composed of 78 places in 173 ms of which 2 ms to minimize.
[2023-03-22 17:23:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 615 ms
[2023-03-22 17:24:00] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 73 ms.
[2023-03-22 17:24:00] [INFO ] Added : 41 causal constraints over 10 iterations in 511 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[149]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 42 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 43 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2023-03-22 17:24:01] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-22 17:24:01] [INFO ] Invariant cache hit.
[2023-03-22 17:24:01] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-22 17:24:01] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-22 17:24:01] [INFO ] Invariant cache hit.
[2023-03-22 17:24:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-22 17:24:02] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2023-03-22 17:24:02] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-22 17:24:02] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-22 17:24:02] [INFO ] Invariant cache hit.
[2023-03-22 17:24:03] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1604 ms. Remains : 425/425 places, 1232/1232 transitions.
Normalized transition count is 695 out of 1232 initially.
// Phase 1: matrix 695 rows 425 cols
[2023-03-22 17:24:03] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2037 ms. (steps per millisecond=490 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 710 ms. (steps per millisecond=1408 ) properties (out of 1) seen :128
[2023-03-22 17:24:05] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2023-03-22 17:24:05] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-22 17:24:05] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 17:24:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:24:05] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-22 17:24:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-22 17:24:06] [INFO ] [Real]Added 75 Read/Feed constraints in 22 ms returned sat
[2023-03-22 17:24:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:24:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:24:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:24:06] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-22 17:24:06] [INFO ] [Nat]Added 75 Read/Feed constraints in 18 ms returned sat
[2023-03-22 17:24:06] [INFO ] Deduced a trap composed of 113 places in 188 ms of which 3 ms to minimize.
[2023-03-22 17:24:06] [INFO ] Deduced a trap composed of 99 places in 176 ms of which 1 ms to minimize.
[2023-03-22 17:24:06] [INFO ] Deduced a trap composed of 78 places in 184 ms of which 0 ms to minimize.
[2023-03-22 17:24:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 649 ms
[2023-03-22 17:24:06] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 60 ms.
[2023-03-22 17:24:07] [INFO ] Added : 41 causal constraints over 10 iterations in 490 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[149]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 43 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 42 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2023-03-22 17:24:08] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-22 17:24:08] [INFO ] Invariant cache hit.
[2023-03-22 17:24:08] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-22 17:24:08] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-22 17:24:08] [INFO ] Invariant cache hit.
[2023-03-22 17:24:08] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-22 17:24:09] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
[2023-03-22 17:24:09] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-22 17:24:09] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-22 17:24:09] [INFO ] Invariant cache hit.
[2023-03-22 17:24:09] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1599 ms. Remains : 425/425 places, 1232/1232 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-09 in 22634 ms.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-12
Normalized transition count is 711 out of 1252 initially.
// Phase 1: matrix 711 rows 434 cols
[2023-03-22 17:24:09] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-22 17:24:09] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-22 17:24:09] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-22 17:24:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:24:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:24:10] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-22 17:24:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:24:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:24:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:24:10] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-22 17:24:10] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 17:24:10] [INFO ] [Nat]Added 80 Read/Feed constraints in 35 ms returned sat
[2023-03-22 17:24:10] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 69 ms.
[2023-03-22 17:24:10] [INFO ] Added : 31 causal constraints over 9 iterations in 431 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 432 transition count 1248
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 432 transition count 1248
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 432 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 429 transition count 1238
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 429 transition count 1238
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 429 transition count 1234
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 427 transition count 1230
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 427 transition count 1230
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 425 transition count 1226
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 425 transition count 1226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 423 transition count 1220
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 423 transition count 1220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 421 transition count 1216
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 421 transition count 1216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 419 transition count 1212
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 419 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 417 transition count 1208
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 416 transition count 1206
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 416 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 415 transition count 1204
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 414 transition count 1202
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 414 transition count 1202
Applied a total of 46 rules in 132 ms. Remains 414 /434 variables (removed 20) and now considering 1202/1252 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 414/434 places, 1202/1252 transitions.
Normalized transition count is 678 out of 1202 initially.
// Phase 1: matrix 678 rows 414 cols
[2023-03-22 17:24:11] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 2073 ms. (steps per millisecond=482 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 698 ms. (steps per millisecond=1432 ) properties (out of 1) seen :1774
[2023-03-22 17:24:13] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2023-03-22 17:24:13] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-22 17:24:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:24:14] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-22 17:24:14] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-22 17:24:14] [INFO ] [Real]Added 74 Read/Feed constraints in 38 ms returned sat
[2023-03-22 17:24:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:24:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-22 17:24:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:24:14] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-22 17:24:14] [INFO ] [Nat]Added 74 Read/Feed constraints in 57 ms returned sat
[2023-03-22 17:24:14] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 0 ms to minimize.
[2023-03-22 17:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-22 17:24:14] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 64 ms.
[2023-03-22 17:24:14] [INFO ] Added : 5 causal constraints over 3 iterations in 217 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1774]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 46 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 42 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-22 17:24:17] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-22 17:24:17] [INFO ] Invariant cache hit.
[2023-03-22 17:24:17] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-22 17:24:17] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-22 17:24:17] [INFO ] Invariant cache hit.
[2023-03-22 17:24:17] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-22 17:24:18] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
[2023-03-22 17:24:18] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-22 17:24:18] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-22 17:24:18] [INFO ] Invariant cache hit.
[2023-03-22 17:24:18] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1620 ms. Remains : 414/414 places, 1202/1202 transitions.
Normalized transition count is 678 out of 1202 initially.
// Phase 1: matrix 678 rows 414 cols
[2023-03-22 17:24:18] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2020 ms. (steps per millisecond=495 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties (out of 1) seen :0
[2023-03-22 17:24:21] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2023-03-22 17:24:21] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-22 17:24:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:24:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:24:21] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-22 17:24:21] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-22 17:24:21] [INFO ] [Real]Added 74 Read/Feed constraints in 40 ms returned sat
[2023-03-22 17:24:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:24:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:24:22] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-22 17:24:22] [INFO ] [Nat]Added 74 Read/Feed constraints in 57 ms returned sat
[2023-03-22 17:24:22] [INFO ] Deduced a trap composed of 74 places in 173 ms of which 1 ms to minimize.
[2023-03-22 17:24:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-22 17:24:22] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 70 ms.
[2023-03-22 17:24:22] [INFO ] Added : 5 causal constraints over 3 iterations in 224 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1774]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 44 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 42 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-22 17:24:25] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-22 17:24:25] [INFO ] Invariant cache hit.
[2023-03-22 17:24:25] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-22 17:24:25] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-22 17:24:25] [INFO ] Invariant cache hit.
[2023-03-22 17:24:25] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-22 17:24:26] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
[2023-03-22 17:24:26] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-22 17:24:26] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-22 17:24:26] [INFO ] Invariant cache hit.
[2023-03-22 17:24:26] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1772 ms. Remains : 414/414 places, 1202/1202 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-12 in 16956 ms.
[2023-03-22 17:24:27] [INFO ] Flatten gal took : 114 ms
[2023-03-22 17:24:27] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 17:24:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 434 places, 1252 transitions and 5134 arcs took 6 ms.
Total runtime 131892 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FunctionPointer (PT), instance c016
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: 434 places, 1252 transitions, 5134 arcs.
Final Score: 42626.572
Took : 67 seconds
Bounds file is: UpperBounds.xml
BK_STOP 1679507466352
--------------------
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
ERROR:
Generation failed in Meddly with error code:
Insufficient memory
within model automodel instantiated in file model.sm near line 6838
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 935 Segmentation fault ${SMART}/smart ${INPUT_SM}
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="FunctionPointer-PT-c016"
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 FunctionPointer-PT-c016, 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 r171-tall-167838859000741"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c016.tgz
mv FunctionPointer-PT-c016 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 ;