About the Execution of Marcie+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 |
| 9098.432 | 3600000.00 | 3650790.00 | 8853.00 | 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.r170-tall-167838857700741.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 marciexred
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 r170-tall-167838857700741
=====================================================================
--------------------
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 1678627670053
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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 13:27:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 13:27:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:27:51] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2023-03-12 13:27:51] [INFO ] Transformed 2826 places.
[2023-03-12 13:27:51] [INFO ] Transformed 8960 transitions.
[2023-03-12 13:27:51] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 471 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1198 places in 37 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-12 13:27:52] [INFO ] Computed 4 place invariants in 83 ms
Incomplete random walk after 10016 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 7) seen :1
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 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 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 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :2
[2023-03-12 13:27:52] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 13:27:52] [INFO ] Computed 4 place invariants in 48 ms
[2023-03-12 13:27:52] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2023-03-12 13:27:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 13:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:53] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2023-03-12 13:27:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:27:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-12 13:27:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:27:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:54] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2023-03-12 13:27:54] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 13:27:54] [INFO ] [Nat]Added 479 Read/Feed constraints in 95 ms returned sat
[2023-03-12 13:27:55] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 690 ms.
[2023-03-12 13:27:57] [INFO ] Deduced a trap composed of 133 places in 1107 ms of which 7 ms to minimize.
[2023-03-12 13:27:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1333 ms
[2023-03-12 13:27:57] [INFO ] Added : 2 causal constraints over 1 iterations in 2439 ms. Result :sat
[2023-03-12 13:27:57] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-12 13:27:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:58] [INFO ] [Real]Absence check using state equation in 815 ms returned sat
[2023-03-12 13:27:58] [INFO ] [Real]Added 479 Read/Feed constraints in 79 ms returned sat
[2023-03-12 13:27:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:27:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-12 13:27:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 13:27:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:27:59] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2023-03-12 13:27:59] [INFO ] [Nat]Added 479 Read/Feed constraints in 75 ms returned sat
[2023-03-12 13:28:00] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 459 ms.
[2023-03-12 13:28:00] [INFO ] Added : 0 causal constraints over 0 iterations in 657 ms. Result :sat
[2023-03-12 13:28:00] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-12 13:28:00] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:01] [INFO ] [Real]Absence check using state equation in 764 ms returned sat
[2023-03-12 13:28:01] [INFO ] [Real]Added 479 Read/Feed constraints in 88 ms returned sat
[2023-03-12 13:28:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-12 13:28:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:28:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:02] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2023-03-12 13:28:03] [INFO ] [Nat]Added 479 Read/Feed constraints in 80 ms returned sat
[2023-03-12 13:28:03] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 410 ms.
[2023-03-12 13:28:03] [INFO ] Added : 0 causal constraints over 0 iterations in 608 ms. Result :sat
[2023-03-12 13:28:03] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-12 13:28:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:28:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:04] [INFO ] [Real]Absence check using state equation in 761 ms returned sat
[2023-03-12 13:28:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-12 13:28:04] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:28:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:05] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2023-03-12 13:28:06] [INFO ] [Nat]Added 479 Read/Feed constraints in 316 ms returned sat
[2023-03-12 13:28:06] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 410 ms.
[2023-03-12 13:28:06] [INFO ] Added : 2 causal constraints over 1 iterations in 745 ms. Result :sat
[2023-03-12 13:28:07] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-12 13:28:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:28:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:07] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2023-03-12 13:28:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-12 13:28:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:28:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:08] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2023-03-12 13:28:09] [INFO ] [Nat]Added 479 Read/Feed constraints in 88 ms returned sat
[2023-03-12 13:28:09] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 457 ms.
[2023-03-12 13:28:09] [INFO ] Added : 1 causal constraints over 1 iterations in 754 ms. Result :sat
[2023-03-12 13:28:10] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-12 13:28:10] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:10] [INFO ] [Real]Absence check using state equation in 777 ms returned sat
[2023-03-12 13:28:11] [INFO ] [Real]Added 479 Read/Feed constraints in 88 ms returned sat
[2023-03-12 13:28:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-12 13:28:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:12] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2023-03-12 13:28:12] [INFO ] [Nat]Added 479 Read/Feed constraints in 71 ms returned sat
[2023-03-12 13:28:12] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 400 ms.
[2023-03-12 13:28:12] [INFO ] Added : 0 causal constraints over 0 iterations in 596 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, 16, 16, -1, -1, 16] Max seen :[0, 2, 1, 0, 0, 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.13 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 1106 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 1106 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-12 13:28:14] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2093 ms. (steps per millisecond=477 ) properties (out of 6) seen :30
FORMULA FunctionPointer-PT-c016-UpperBounds-15 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 717 ms. (steps per millisecond=1394 ) properties (out of 5) seen :24
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 5) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 695 ms. (steps per millisecond=1438 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 744 ms. (steps per millisecond=1344 ) properties (out of 5) seen :122
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 724 ms. (steps per millisecond=1381 ) properties (out of 5) seen :525
[2023-03-12 13:28:19] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 13:28:19] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-12 13:28:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:19] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2023-03-12 13:28:19] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 13:28:20] [INFO ] [Real]Added 80 Read/Feed constraints in 34 ms returned sat
[2023-03-12 13:28:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:20] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-12 13:28:20] [INFO ] [Nat]Added 80 Read/Feed constraints in 65 ms returned sat
[2023-03-12 13:28:20] [INFO ] Deduced a trap composed of 125 places in 170 ms of which 0 ms to minimize.
[2023-03-12 13:28:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-12 13:28:20] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 60 ms.
[2023-03-12 13:28:20] [INFO ] Added : 16 causal constraints over 4 iterations in 292 ms. Result :sat
Minimization took 49 ms.
[2023-03-12 13:28:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:21] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2023-03-12 13:28:21] [INFO ] [Real]Added 80 Read/Feed constraints in 18 ms returned sat
[2023-03-12 13:28:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:21] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-12 13:28:21] [INFO ] [Nat]Added 80 Read/Feed constraints in 18 ms returned sat
[2023-03-12 13:28:21] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 62 ms.
[2023-03-12 13:28:21] [INFO ] Added : 0 causal constraints over 0 iterations in 116 ms. Result :sat
Minimization took 46 ms.
[2023-03-12 13:28:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:21] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-12 13:28:21] [INFO ] [Real]Added 80 Read/Feed constraints in 18 ms returned sat
[2023-03-12 13:28:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 13:28:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:21] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-12 13:28:21] [INFO ] [Nat]Added 80 Read/Feed constraints in 15 ms returned sat
[2023-03-12 13:28:22] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 65 ms.
[2023-03-12 13:28:22] [INFO ] Added : 0 causal constraints over 0 iterations in 118 ms. Result :sat
Minimization took 43 ms.
[2023-03-12 13:28:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:22] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-12 13:28:22] [INFO ] [Real]Added 80 Read/Feed constraints in 19 ms returned sat
[2023-03-12 13:28:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:22] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2023-03-12 13:28:22] [INFO ] [Nat]Added 80 Read/Feed constraints in 30 ms returned sat
[2023-03-12 13:28:22] [INFO ] Deduced a trap composed of 125 places in 192 ms of which 1 ms to minimize.
[2023-03-12 13:28:23] [INFO ] Deduced a trap composed of 99 places in 174 ms of which 1 ms to minimize.
[2023-03-12 13:28:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 436 ms
[2023-03-12 13:28:23] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 65 ms.
[2023-03-12 13:28:23] [INFO ] Added : 32 causal constraints over 7 iterations in 392 ms. Result :sat
Minimization took 56 ms.
[2023-03-12 13:28:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:23] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-12 13:28:23] [INFO ] [Real]Added 80 Read/Feed constraints in 63 ms returned sat
[2023-03-12 13:28:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:24] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-12 13:28:24] [INFO ] [Nat]Added 80 Read/Feed constraints in 54 ms returned sat
[2023-03-12 13:28:24] [INFO ] Deduced a trap composed of 84 places in 184 ms of which 1 ms to minimize.
[2023-03-12 13:28:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-12 13:28:24] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 62 ms.
[2023-03-12 13:28:24] [INFO ] Added : 12 causal constraints over 5 iterations in 283 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1, 16, 16, -1, -1] Max seen :[5, 3, 2, 91, 517]
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 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 47 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-12 13:28:26] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2013 ms. (steps per millisecond=496 ) properties (out of 3) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 687 ms. (steps per millisecond=1455 ) properties (out of 3) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 729 ms. (steps per millisecond=1371 ) properties (out of 3) seen :142
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties (out of 3) seen :1658
[2023-03-12 13:28:30] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 13:28:30] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-12 13:28:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:30] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-12 13:28:30] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 13:28:30] [INFO ] [Real]Added 80 Read/Feed constraints in 28 ms returned sat
[2023-03-12 13:28:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:30] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-12 13:28:30] [INFO ] [Nat]Added 80 Read/Feed constraints in 68 ms returned sat
[2023-03-12 13:28:31] [INFO ] Deduced a trap composed of 125 places in 184 ms of which 1 ms to minimize.
[2023-03-12 13:28:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-12 13:28:31] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 61 ms.
[2023-03-12 13:28:31] [INFO ] Added : 16 causal constraints over 4 iterations in 284 ms. Result :sat
Minimization took 47 ms.
[2023-03-12 13:28:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:31] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-12 13:28:31] [INFO ] [Real]Added 80 Read/Feed constraints in 19 ms returned sat
[2023-03-12 13:28:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:31] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-12 13:28:31] [INFO ] [Nat]Added 80 Read/Feed constraints in 30 ms returned sat
[2023-03-12 13:28:32] [INFO ] Deduced a trap composed of 125 places in 183 ms of which 0 ms to minimize.
[2023-03-12 13:28:32] [INFO ] Deduced a trap composed of 99 places in 176 ms of which 2 ms to minimize.
[2023-03-12 13:28:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 428 ms
[2023-03-12 13:28:32] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 62 ms.
[2023-03-12 13:28:32] [INFO ] Added : 32 causal constraints over 7 iterations in 384 ms. Result :sat
Minimization took 53 ms.
[2023-03-12 13:28:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:33] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-12 13:28:33] [INFO ] [Real]Added 80 Read/Feed constraints in 61 ms returned sat
[2023-03-12 13:28:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:33] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-12 13:28:33] [INFO ] [Nat]Added 80 Read/Feed constraints in 58 ms returned sat
[2023-03-12 13:28:33] [INFO ] Deduced a trap composed of 84 places in 182 ms of which 1 ms to minimize.
[2023-03-12 13:28:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-12 13:28:33] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 63 ms.
[2023-03-12 13:28:33] [INFO ] Added : 12 causal constraints over 5 iterations in 279 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[10, 120, 1652]
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 48 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 53 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-12 13:28:37] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 13:28:37] [INFO ] Invariant cache hit.
[2023-03-12 13:28:37] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-12 13:28:37] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 13:28:37] [INFO ] Invariant cache hit.
[2023-03-12 13:28:37] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 13:28:38] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2023-03-12 13:28:38] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-12 13:28:38] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 13:28:38] [INFO ] Invariant cache hit.
[2023-03-12 13:28:38] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1654 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-12 13:28:38] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2079 ms. (steps per millisecond=481 ) properties (out of 3) 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 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 731 ms. (steps per millisecond=1367 ) properties (out of 3) seen :110
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 :925
[2023-03-12 13:28:43] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 13:28:43] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-12 13:28:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:43] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-12 13:28:43] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 13:28:43] [INFO ] [Real]Added 80 Read/Feed constraints in 23 ms returned sat
[2023-03-12 13:28:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:43] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-12 13:28:43] [INFO ] [Nat]Added 80 Read/Feed constraints in 63 ms returned sat
[2023-03-12 13:28:43] [INFO ] Deduced a trap composed of 125 places in 179 ms of which 1 ms to minimize.
[2023-03-12 13:28:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-12 13:28:43] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 59 ms.
[2023-03-12 13:28:44] [INFO ] Added : 16 causal constraints over 4 iterations in 293 ms. Result :sat
Minimization took 45 ms.
[2023-03-12 13:28:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:44] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-12 13:28:44] [INFO ] [Real]Added 80 Read/Feed constraints in 18 ms returned sat
[2023-03-12 13:28:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:44] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-12 13:28:44] [INFO ] [Nat]Added 80 Read/Feed constraints in 30 ms returned sat
[2023-03-12 13:28:44] [INFO ] Deduced a trap composed of 125 places in 190 ms of which 1 ms to minimize.
[2023-03-12 13:28:45] [INFO ] Deduced a trap composed of 99 places in 179 ms of which 1 ms to minimize.
[2023-03-12 13:28:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 432 ms
[2023-03-12 13:28:45] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 68 ms.
[2023-03-12 13:28:45] [INFO ] Added : 32 causal constraints over 7 iterations in 423 ms. Result :sat
Minimization took 59 ms.
[2023-03-12 13:28:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:45] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2023-03-12 13:28:46] [INFO ] [Real]Added 80 Read/Feed constraints in 76 ms returned sat
[2023-03-12 13:28:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:46] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-12 13:28:46] [INFO ] [Nat]Added 80 Read/Feed constraints in 55 ms returned sat
[2023-03-12 13:28:46] [INFO ] Deduced a trap composed of 84 places in 178 ms of which 1 ms to minimize.
[2023-03-12 13:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-12 13:28:46] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 63 ms.
[2023-03-12 13:28:46] [INFO ] Added : 12 causal constraints over 5 iterations in 275 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[10, 120, 1652]
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 46 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 47 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 45 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-12 13:28:50] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 13:28:50] [INFO ] Invariant cache hit.
[2023-03-12 13:28:50] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-12 13:28:50] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 13:28:50] [INFO ] Invariant cache hit.
[2023-03-12 13:28:50] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 13:28:51] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2023-03-12 13:28:51] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-12 13:28:51] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 13:28:51] [INFO ] Invariant cache hit.
[2023-03-12 13:28:51] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1673 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-12 13:28:51] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2082 ms. (steps per millisecond=480 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 725 ms. (steps per millisecond=1379 ) properties (out of 3) seen :212
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 716 ms. (steps per millisecond=1396 ) properties (out of 3) seen :159
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 699 ms. (steps per millisecond=1430 ) properties (out of 3) seen :900
[2023-03-12 13:28:56] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 13:28:56] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-12 13:28:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:56] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-12 13:28:56] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 13:28:56] [INFO ] [Real]Added 80 Read/Feed constraints in 64 ms returned sat
[2023-03-12 13:28:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 13:28:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:56] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-12 13:28:56] [INFO ] [Nat]Added 80 Read/Feed constraints in 58 ms returned sat
[2023-03-12 13:28:56] [INFO ] Deduced a trap composed of 125 places in 182 ms of which 0 ms to minimize.
[2023-03-12 13:28:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-12 13:28:56] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 61 ms.
[2023-03-12 13:28:57] [INFO ] Added : 17 causal constraints over 4 iterations in 279 ms. Result :sat
Minimization took 49 ms.
[2023-03-12 13:28:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:57] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-12 13:28:57] [INFO ] [Real]Added 80 Read/Feed constraints in 19 ms returned sat
[2023-03-12 13:28:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:57] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-12 13:28:57] [INFO ] [Nat]Added 80 Read/Feed constraints in 29 ms returned sat
[2023-03-12 13:28:57] [INFO ] Deduced a trap composed of 125 places in 191 ms of which 0 ms to minimize.
[2023-03-12 13:28:58] [INFO ] Deduced a trap composed of 99 places in 176 ms of which 0 ms to minimize.
[2023-03-12 13:28:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 435 ms
[2023-03-12 13:28:58] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 60 ms.
[2023-03-12 13:28:58] [INFO ] Added : 32 causal constraints over 7 iterations in 389 ms. Result :sat
Minimization took 58 ms.
[2023-03-12 13:28:58] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 13:28:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:58] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-12 13:28:58] [INFO ] [Real]Added 80 Read/Feed constraints in 65 ms returned sat
[2023-03-12 13:28:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:28:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:28:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:28:59] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-12 13:28:59] [INFO ] [Nat]Added 80 Read/Feed constraints in 53 ms returned sat
[2023-03-12 13:28:59] [INFO ] Deduced a trap composed of 84 places in 181 ms of which 1 ms to minimize.
[2023-03-12 13:28:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-12 13:28:59] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 60 ms.
[2023-03-12 13:28:59] [INFO ] Added : 12 causal constraints over 5 iterations in 268 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[208, 143, 1652]
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 46 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.
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.
[2023-03-12 13:29:03] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 13:29:03] [INFO ] Invariant cache hit.
[2023-03-12 13:29:04] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-12 13:29:04] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 13:29:04] [INFO ] Invariant cache hit.
[2023-03-12 13:29:04] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 13:29:05] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
[2023-03-12 13:29:05] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-12 13:29:05] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 13:29:05] [INFO ] Invariant cache hit.
[2023-03-12 13:29:05] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1617 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-12 13:29:05] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2161 ms. (steps per millisecond=462 ) properties (out of 3) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 691 ms. (steps per millisecond=1447 ) properties (out of 3) seen :17
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 662 ms. (steps per millisecond=1510 ) properties (out of 3) seen :125
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 710 ms. (steps per millisecond=1408 ) properties (out of 3) seen :1062
[2023-03-12 13:29:09] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 13:29:09] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-12 13:29:09] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:09] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-12 13:29:09] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 13:29:10] [INFO ] [Real]Added 80 Read/Feed constraints in 69 ms returned sat
[2023-03-12 13:29:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:29:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:10] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-12 13:29:10] [INFO ] [Nat]Added 80 Read/Feed constraints in 58 ms returned sat
[2023-03-12 13:29:10] [INFO ] Deduced a trap composed of 125 places in 180 ms of which 0 ms to minimize.
[2023-03-12 13:29:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-12 13:29:10] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 63 ms.
[2023-03-12 13:29:10] [INFO ] Added : 17 causal constraints over 4 iterations in 284 ms. Result :sat
Minimization took 46 ms.
[2023-03-12 13:29:10] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 13:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:11] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-12 13:29:11] [INFO ] [Real]Added 80 Read/Feed constraints in 19 ms returned sat
[2023-03-12 13:29:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:29:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:11] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-12 13:29:11] [INFO ] [Nat]Added 80 Read/Feed constraints in 29 ms returned sat
[2023-03-12 13:29:11] [INFO ] Deduced a trap composed of 125 places in 197 ms of which 0 ms to minimize.
[2023-03-12 13:29:11] [INFO ] Deduced a trap composed of 99 places in 182 ms of which 1 ms to minimize.
[2023-03-12 13:29:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 444 ms
[2023-03-12 13:29:11] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 61 ms.
[2023-03-12 13:29:12] [INFO ] Added : 32 causal constraints over 7 iterations in 377 ms. Result :sat
Minimization took 58 ms.
[2023-03-12 13:29:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:12] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-12 13:29:12] [INFO ] [Real]Added 80 Read/Feed constraints in 62 ms returned sat
[2023-03-12 13:29:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:29:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:12] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-12 13:29:12] [INFO ] [Nat]Added 80 Read/Feed constraints in 55 ms returned sat
[2023-03-12 13:29:13] [INFO ] Deduced a trap composed of 84 places in 196 ms of which 1 ms to minimize.
[2023-03-12 13:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-12 13:29:13] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 60 ms.
[2023-03-12 13:29:13] [INFO ] Added : 12 causal constraints over 5 iterations in 268 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[208, 143, 1652]
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 45 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 48 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-12 13:29:18] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 13:29:18] [INFO ] Invariant cache hit.
[2023-03-12 13:29:18] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-12 13:29:18] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 13:29:18] [INFO ] Invariant cache hit.
[2023-03-12 13:29:18] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 13:29:19] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
[2023-03-12 13:29:19] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 13:29:19] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 13:29:19] [INFO ] Invariant cache hit.
[2023-03-12 13:29:19] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1659 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-12 13:29:19] [INFO ] Computed 3 place invariants in 5 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-12 13:29:19] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 13:29:19] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-12 13:29:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:19] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-12 13:29:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:29:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:20] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2023-03-12 13:29:20] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 13:29:20] [INFO ] [Nat]Added 80 Read/Feed constraints in 18 ms returned sat
[2023-03-12 13:29:20] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 71 ms.
[2023-03-12 13:29:20] [INFO ] Added : 15 causal constraints over 4 iterations in 274 ms. Result :sat
Minimization took 46 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 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 188 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 188 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-12 13:29:20] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2053 ms. (steps per millisecond=487 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 1) seen :515
[2023-03-12 13:29:23] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-12 13:29:23] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-12 13:29:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:23] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-12 13:29:23] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:29:23] [INFO ] [Real]Added 75 Read/Feed constraints in 59 ms returned sat
[2023-03-12 13:29:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:29:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 13:29:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:24] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-12 13:29:24] [INFO ] [Nat]Added 75 Read/Feed constraints in 59 ms returned sat
[2023-03-12 13:29:24] [INFO ] Deduced a trap composed of 113 places in 174 ms of which 1 ms to minimize.
[2023-03-12 13:29:24] [INFO ] Deduced a trap composed of 71 places in 163 ms of which 0 ms to minimize.
[2023-03-12 13:29:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
[2023-03-12 13:29:24] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 62 ms.
[2023-03-12 13:29:24] [INFO ] Added : 13 causal constraints over 4 iterations in 246 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[515]
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 46 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 46 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-12 13:29:26] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 13:29:26] [INFO ] Invariant cache hit.
[2023-03-12 13:29:26] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-12 13:29:26] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 13:29:27] [INFO ] Invariant cache hit.
[2023-03-12 13:29:27] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:29:27] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
[2023-03-12 13:29:28] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-12 13:29:28] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 13:29:28] [INFO ] Invariant cache hit.
[2023-03-12 13:29:28] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1707 ms. Remains : 421/421 places, 1218/1218 transitions.
Normalized transition count is 688 out of 1218 initially.
// Phase 1: matrix 688 rows 421 cols
[2023-03-12 13:29:28] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1993 ms. (steps per millisecond=501 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 694 ms. (steps per millisecond=1440 ) properties (out of 1) seen :521
[2023-03-12 13:29:31] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-12 13:29:31] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-12 13:29:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:31] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2023-03-12 13:29:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:29:31] [INFO ] [Real]Added 75 Read/Feed constraints in 61 ms returned sat
[2023-03-12 13:29:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:29:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:31] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-12 13:29:31] [INFO ] [Nat]Added 75 Read/Feed constraints in 54 ms returned sat
[2023-03-12 13:29:31] [INFO ] Deduced a trap composed of 113 places in 180 ms of which 1 ms to minimize.
[2023-03-12 13:29:32] [INFO ] Deduced a trap composed of 71 places in 169 ms of which 0 ms to minimize.
[2023-03-12 13:29:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 404 ms
[2023-03-12 13:29:32] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 59 ms.
[2023-03-12 13:29:32] [INFO ] Added : 13 causal constraints over 4 iterations in 249 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[521]
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 43 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 43 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-12 13:29:34] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 13:29:34] [INFO ] Invariant cache hit.
[2023-03-12 13:29:34] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-12 13:29:34] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 13:29:34] [INFO ] Invariant cache hit.
[2023-03-12 13:29:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:29:35] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
[2023-03-12 13:29:35] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-12 13:29:35] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 13:29:35] [INFO ] Invariant cache hit.
[2023-03-12 13:29:36] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1622 ms. Remains : 421/421 places, 1218/1218 transitions.
Normalized transition count is 688 out of 1218 initially.
// Phase 1: matrix 688 rows 421 cols
[2023-03-12 13:29:36] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1983 ms. (steps per millisecond=504 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties (out of 1) seen :0
[2023-03-12 13:29:38] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-12 13:29:38] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-12 13:29:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:38] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2023-03-12 13:29:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:29:39] [INFO ] [Real]Added 75 Read/Feed constraints in 52 ms returned sat
[2023-03-12 13:29:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:29:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:39] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-12 13:29:39] [INFO ] [Nat]Added 75 Read/Feed constraints in 54 ms returned sat
[2023-03-12 13:29:39] [INFO ] Deduced a trap composed of 113 places in 171 ms of which 0 ms to minimize.
[2023-03-12 13:29:39] [INFO ] Deduced a trap composed of 71 places in 172 ms of which 0 ms to minimize.
[2023-03-12 13:29:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
[2023-03-12 13:29:39] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 60 ms.
[2023-03-12 13:29:40] [INFO ] Added : 13 causal constraints over 4 iterations in 245 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[521]
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 42 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 42 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-12 13:29:42] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 13:29:42] [INFO ] Invariant cache hit.
[2023-03-12 13:29:42] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-12 13:29:42] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 13:29:42] [INFO ] Invariant cache hit.
[2023-03-12 13:29:42] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:29:43] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
[2023-03-12 13:29:43] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-12 13:29:43] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 13:29:43] [INFO ] Invariant cache hit.
[2023-03-12 13:29:43] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1854 ms. Remains : 421/421 places, 1218/1218 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-02 in 24174 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-12 13:29:43] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :6
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 :0
[2023-03-12 13:29:43] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 13:29:43] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-12 13:29:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:44] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-12 13:29:44] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 13:29:44] [INFO ] [Real]Added 80 Read/Feed constraints in 19 ms returned sat
[2023-03-12 13:29:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:29:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:44] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2023-03-12 13:29:44] [INFO ] [Nat]Added 80 Read/Feed constraints in 30 ms returned sat
[2023-03-12 13:29:44] [INFO ] Deduced a trap composed of 125 places in 174 ms of which 1 ms to minimize.
[2023-03-12 13:29:44] [INFO ] Deduced a trap composed of 109 places in 160 ms of which 0 ms to minimize.
[2023-03-12 13:29:44] [INFO ] Deduced a trap composed of 99 places in 178 ms of which 1 ms to minimize.
[2023-03-12 13:29:45] [INFO ] Deduced a trap composed of 96 places in 169 ms of which 1 ms to minimize.
[2023-03-12 13:29:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 787 ms
[2023-03-12 13:29:45] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 63 ms.
[2023-03-12 13:29:45] [INFO ] Added : 24 causal constraints over 5 iterations in 324 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[6]
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 105 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 106 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-12 13:29:45] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2032 ms. (steps per millisecond=492 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 690 ms. (steps per millisecond=1449 ) properties (out of 1) seen :131
[2023-03-12 13:29:48] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2023-03-12 13:29:48] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-12 13:29:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 13:29:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:48] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-03-12 13:29:48] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:29:48] [INFO ] [Real]Added 75 Read/Feed constraints in 25 ms returned sat
[2023-03-12 13:29:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:29:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:48] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-12 13:29:48] [INFO ] [Nat]Added 75 Read/Feed constraints in 18 ms returned sat
[2023-03-12 13:29:49] [INFO ] Deduced a trap composed of 113 places in 194 ms of which 0 ms to minimize.
[2023-03-12 13:29:49] [INFO ] Deduced a trap composed of 99 places in 168 ms of which 1 ms to minimize.
[2023-03-12 13:29:49] [INFO ] Deduced a trap composed of 78 places in 168 ms of which 1 ms to minimize.
[2023-03-12 13:29:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 603 ms
[2023-03-12 13:29:49] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 56 ms.
[2023-03-12 13:29:50] [INFO ] Added : 41 causal constraints over 10 iterations in 494 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[131]
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-12 13:29:50] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 13:29:50] [INFO ] Invariant cache hit.
[2023-03-12 13:29:51] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-12 13:29:51] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 13:29:51] [INFO ] Invariant cache hit.
[2023-03-12 13:29:51] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:29:52] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2023-03-12 13:29:52] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-12 13:29:52] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 13:29:52] [INFO ] Invariant cache hit.
[2023-03-12 13:29:52] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1614 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-12 13:29:52] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2127 ms. (steps per millisecond=470 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties (out of 1) seen :113
[2023-03-12 13:29:55] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2023-03-12 13:29:55] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-12 13:29:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 13:29:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:55] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-12 13:29:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:29:55] [INFO ] [Real]Added 75 Read/Feed constraints in 20 ms returned sat
[2023-03-12 13:29:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:29:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:55] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-12 13:29:55] [INFO ] [Nat]Added 75 Read/Feed constraints in 23 ms returned sat
[2023-03-12 13:29:55] [INFO ] Deduced a trap composed of 113 places in 168 ms of which 4 ms to minimize.
[2023-03-12 13:29:56] [INFO ] Deduced a trap composed of 99 places in 174 ms of which 0 ms to minimize.
[2023-03-12 13:29:56] [INFO ] Deduced a trap composed of 78 places in 174 ms of which 1 ms to minimize.
[2023-03-12 13:29:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 596 ms
[2023-03-12 13:29:56] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 59 ms.
[2023-03-12 13:29:56] [INFO ] Added : 41 causal constraints over 10 iterations in 504 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[131]
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 44 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2023-03-12 13:29:57] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 13:29:57] [INFO ] Invariant cache hit.
[2023-03-12 13:29:57] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-12 13:29:57] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 13:29:57] [INFO ] Invariant cache hit.
[2023-03-12 13:29:58] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 13:29:58] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
[2023-03-12 13:29:58] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 13:29:58] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 13:29:58] [INFO ] Invariant cache hit.
[2023-03-12 13:29:59] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1622 ms. Remains : 425/425 places, 1232/1232 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-09 in 15376 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-12 13:29:59] [INFO ] Computed 3 place invariants in 2 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-12 13:29:59] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 13:29:59] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-12 13:29:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:59] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-12 13:29:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:29:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 13:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:29:59] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-12 13:29:59] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 13:29:59] [INFO ] [Nat]Added 80 Read/Feed constraints in 35 ms returned sat
[2023-03-12 13:29:59] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 63 ms.
[2023-03-12 13:30:00] [INFO ] Added : 31 causal constraints over 9 iterations in 431 ms. Result :sat
Minimization took 59 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 117 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 117 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-12 13:30:00] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 1942 ms. (steps per millisecond=514 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 663 ms. (steps per millisecond=1508 ) properties (out of 1) seen :0
[2023-03-12 13:30:03] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2023-03-12 13:30:03] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-12 13:30:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 13:30:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:30:03] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-12 13:30:03] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-12 13:30:03] [INFO ] [Real]Added 74 Read/Feed constraints in 37 ms returned sat
[2023-03-12 13:30:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:30:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-12 13:30:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:30:03] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-12 13:30:03] [INFO ] [Nat]Added 74 Read/Feed constraints in 16 ms returned sat
[2023-03-12 13:30:03] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 0 ms to minimize.
[2023-03-12 13:30:03] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 0 ms to minimize.
[2023-03-12 13:30:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 398 ms
[2023-03-12 13:30:03] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 60 ms.
[2023-03-12 13:30:04] [INFO ] Added : 10 causal constraints over 7 iterations in 395 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
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 41 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 42 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 49 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-12 13:30:04] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-12 13:30:04] [INFO ] Invariant cache hit.
[2023-03-12 13:30:04] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-12 13:30:04] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-12 13:30:04] [INFO ] Invariant cache hit.
[2023-03-12 13:30:04] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-12 13:30:05] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2023-03-12 13:30:05] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-12 13:30:05] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-12 13:30:05] [INFO ] Invariant cache hit.
[2023-03-12 13:30:06] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1596 ms. Remains : 414/414 places, 1202/1202 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-12 in 6766 ms.
[2023-03-12 13:30:06] [INFO ] Flatten gal took : 124 ms
[2023-03-12 13:30:06] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-12 13:30:06] [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 134808 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: FuncPointer_3
(NrP: 434 NrTr: 1252 NrArc: 5134)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.035sec
net check time: 0m 0.000sec
init dd package: 0m 2.721sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7044900 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16096672 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.001sec
2900 10376 13148 14077 15420 16306 20211 19359 16999 16786 19238 19036 17012 18611 17749 17458 17702 17930 17512 18190 18601 21457 20993 18247 18897 20263 22593 18933 20669 18548 19009 23494 19145 21930 19861 18876 19396 24070 20260 19353 21692 20822 19282 20788 19963 19799 22615 21687 20888 19665 37400 95450 125795
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="marciexred"
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 marciexred"
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 r170-tall-167838857700741"
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 ;