About the Execution of LTSMin+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 |
| 1217.680 | 3600000.00 | 13950038.00 | 760.50 | 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.r169-tall-167838856300741.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 ltsminxred
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 r169-tall-167838856300741
=====================================================================
--------------------
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 1678632871506
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:54:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 14:54:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:54:33] [INFO ] Load time of PNML (sax parser for PT used): 376 ms
[2023-03-12 14:54:33] [INFO ] Transformed 2826 places.
[2023-03-12 14:54:33] [INFO ] Transformed 8960 transitions.
[2023-03-12 14:54:33] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 505 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1198 places in 40 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 14:54:34] [INFO ] Computed 4 place invariants in 106 ms
Incomplete random walk after 10013 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) 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 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) 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 :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :3
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 14:54:34] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 14:54:34] [INFO ] Computed 4 place invariants in 58 ms
[2023-03-12 14:54:34] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2023-03-12 14:54:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:54:35] [INFO ] [Real]Absence check using state equation in 890 ms returned sat
[2023-03-12 14:54:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:54:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-12 14:54:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:54:36] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2023-03-12 14:54:37] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 14:54:37] [INFO ] [Nat]Added 479 Read/Feed constraints in 111 ms returned sat
[2023-03-12 14:54:38] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 743 ms.
[2023-03-12 14:54:39] [INFO ] Deduced a trap composed of 133 places in 1223 ms of which 9 ms to minimize.
[2023-03-12 14:54:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1465 ms
[2023-03-12 14:54:39] [INFO ] Added : 2 causal constraints over 1 iterations in 2679 ms. Result :sat
[2023-03-12 14:54:40] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-12 14:54:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:54:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:54:41] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2023-03-12 14:54:41] [INFO ] [Real]Added 479 Read/Feed constraints in 86 ms returned sat
[2023-03-12 14:54:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:54:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-12 14:54:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:54:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:54:42] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2023-03-12 14:54:42] [INFO ] [Nat]Added 479 Read/Feed constraints in 95 ms returned sat
[2023-03-12 14:54:43] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 554 ms.
[2023-03-12 14:54:43] [INFO ] Added : 0 causal constraints over 0 iterations in 766 ms. Result :sat
[2023-03-12 14:54:43] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-12 14:54:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:54:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:54:44] [INFO ] [Real]Absence check using state equation in 848 ms returned sat
[2023-03-12 14:54:44] [INFO ] [Real]Added 479 Read/Feed constraints in 95 ms returned sat
[2023-03-12 14:54:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:54:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-12 14:54:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:54:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:54:45] [INFO ] [Nat]Absence check using state equation in 853 ms returned sat
[2023-03-12 14:54:45] [INFO ] [Nat]Added 479 Read/Feed constraints in 84 ms returned sat
[2023-03-12 14:54:46] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 499 ms.
[2023-03-12 14:54:46] [INFO ] Added : 0 causal constraints over 0 iterations in 718 ms. Result :sat
[2023-03-12 14:54:46] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-12 14:54:46] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-12 14:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:54:47] [INFO ] [Real]Absence check using state equation in 828 ms returned sat
[2023-03-12 14:54:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:54:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-12 14:54:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:54:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:54:48] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2023-03-12 14:54:49] [INFO ] [Nat]Added 479 Read/Feed constraints in 331 ms returned sat
[2023-03-12 14:54:49] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 456 ms.
[2023-03-12 14:54:50] [INFO ] Added : 2 causal constraints over 1 iterations in 822 ms. Result :sat
[2023-03-12 14:54:50] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-12 14:54:50] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:54:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:54:51] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2023-03-12 14:54:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:54:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-12 14:54:51] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 14:54:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:54:52] [INFO ] [Nat]Absence check using state equation in 868 ms returned sat
[2023-03-12 14:54:52] [INFO ] [Nat]Added 479 Read/Feed constraints in 105 ms returned sat
[2023-03-12 14:54:53] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 477 ms.
[2023-03-12 14:54:53] [INFO ] Added : 1 causal constraints over 1 iterations in 803 ms. Result :sat
[2023-03-12 14:54:53] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-12 14:54:53] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:54:54] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2023-03-12 14:54:54] [INFO ] [Real]Added 479 Read/Feed constraints in 85 ms returned sat
[2023-03-12 14:54:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:54:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2023-03-12 14:54:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 14:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:54:55] [INFO ] [Nat]Absence check using state equation in 868 ms returned sat
[2023-03-12 14:54:56] [INFO ] [Nat]Added 479 Read/Feed constraints in 86 ms returned sat
[2023-03-12 14:54:56] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 452 ms.
[2023-03-12 14:54:56] [INFO ] Added : 0 causal constraints over 0 iterations in 655 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, 16, 16, -1, -1, 16] Max seen :[0, 2, 2, 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 1233 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 1236 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 14:54:58] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2129 ms. (steps per millisecond=469 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 839 ms. (steps per millisecond=1191 ) properties (out of 6) seen :267
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties (out of 6) seen :31
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 720 ms. (steps per millisecond=1388 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 6) seen :131
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 715 ms. (steps per millisecond=1398 ) properties (out of 6) seen :1726
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 694 ms. (steps per millisecond=1440 ) properties (out of 6) seen :21
[2023-03-12 14:55:04] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 14:55:04] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-12 14:55:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:04] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-12 14:55:05] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 14:55:05] [INFO ] [Real]Added 80 Read/Feed constraints in 86 ms returned sat
[2023-03-12 14:55:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-12 14:55:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:05] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2023-03-12 14:55:05] [INFO ] [Nat]Added 80 Read/Feed constraints in 63 ms returned sat
[2023-03-12 14:55:05] [INFO ] Deduced a trap composed of 125 places in 261 ms of which 1 ms to minimize.
[2023-03-12 14:55:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-03-12 14:55:06] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 104 ms.
[2023-03-12 14:55:06] [INFO ] Added : 17 causal constraints over 4 iterations in 372 ms. Result :sat
Minimization took 62 ms.
[2023-03-12 14:55:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:06] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-03-12 14:55:06] [INFO ] [Real]Added 80 Read/Feed constraints in 21 ms returned sat
[2023-03-12 14:55:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:55:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:06] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-12 14:55:06] [INFO ] [Nat]Added 80 Read/Feed constraints in 18 ms returned sat
[2023-03-12 14:55:06] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 68 ms.
[2023-03-12 14:55:07] [INFO ] Added : 0 causal constraints over 0 iterations in 125 ms. Result :sat
Minimization took 53 ms.
[2023-03-12 14:55:07] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:07] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-12 14:55:07] [INFO ] [Real]Added 80 Read/Feed constraints in 22 ms returned sat
[2023-03-12 14:55:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:07] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-12 14:55:07] [INFO ] [Nat]Added 80 Read/Feed constraints in 17 ms returned sat
[2023-03-12 14:55:07] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 64 ms.
[2023-03-12 14:55:07] [INFO ] Added : 0 causal constraints over 0 iterations in 121 ms. Result :sat
Minimization took 48 ms.
[2023-03-12 14:55:07] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:08] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2023-03-12 14:55:08] [INFO ] [Real]Added 80 Read/Feed constraints in 21 ms returned sat
[2023-03-12 14:55:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:08] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-12 14:55:08] [INFO ] [Nat]Added 80 Read/Feed constraints in 30 ms returned sat
[2023-03-12 14:55:08] [INFO ] Deduced a trap composed of 125 places in 205 ms of which 1 ms to minimize.
[2023-03-12 14:55:08] [INFO ] Deduced a trap composed of 99 places in 198 ms of which 1 ms to minimize.
[2023-03-12 14:55:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 473 ms
[2023-03-12 14:55:08] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 69 ms.
[2023-03-12 14:55:09] [INFO ] Added : 32 causal constraints over 7 iterations in 410 ms. Result :sat
Minimization took 53 ms.
[2023-03-12 14:55:09] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:09] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-12 14:55:09] [INFO ] [Real]Added 80 Read/Feed constraints in 76 ms returned sat
[2023-03-12 14:55:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:55:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:09] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2023-03-12 14:55:09] [INFO ] [Nat]Added 80 Read/Feed constraints in 62 ms returned sat
[2023-03-12 14:55:10] [INFO ] Deduced a trap composed of 84 places in 195 ms of which 0 ms to minimize.
[2023-03-12 14:55:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-12 14:55:10] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 73 ms.
[2023-03-12 14:55:10] [INFO ] Added : 12 causal constraints over 5 iterations in 299 ms. Result :sat
Minimization took 47 ms.
[2023-03-12 14:55:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:10] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-12 14:55:10] [INFO ] [Real]Added 80 Read/Feed constraints in 19 ms returned sat
[2023-03-12 14:55:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:55:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:11] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-12 14:55:11] [INFO ] [Nat]Added 80 Read/Feed constraints in 18 ms returned sat
[2023-03-12 14:55:11] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 66 ms.
[2023-03-12 14:55:11] [INFO ] Added : 0 causal constraints over 0 iterations in 127 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1, 16, 16, -1, -1, 16] Max seen :[261, 3, 3, 127, 1720, 2]
FORMULA FunctionPointer-PT-c016-UpperBounds-15 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c016-UpperBounds-08 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c016-UpperBounds-03 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 1252/1252 transitions.
Applied a total of 0 rules in 51 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 51 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 14:55:16] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2001 ms. (steps per millisecond=499 ) properties (out of 3) seen :0
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 :209
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 :128
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties (out of 3) seen :820
[2023-03-12 14:55:20] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 14:55:20] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-12 14:55:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:20] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-12 14:55:20] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 14:55:20] [INFO ] [Real]Added 80 Read/Feed constraints in 89 ms returned sat
[2023-03-12 14:55:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:21] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2023-03-12 14:55:21] [INFO ] [Nat]Added 80 Read/Feed constraints in 62 ms returned sat
[2023-03-12 14:55:21] [INFO ] Deduced a trap composed of 125 places in 198 ms of which 0 ms to minimize.
[2023-03-12 14:55:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-12 14:55:21] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 80 ms.
[2023-03-12 14:55:21] [INFO ] Added : 17 causal constraints over 4 iterations in 325 ms. Result :sat
Minimization took 48 ms.
[2023-03-12 14:55:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:22] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-03-12 14:55:22] [INFO ] [Real]Added 80 Read/Feed constraints in 21 ms returned sat
[2023-03-12 14:55:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:55:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:22] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-12 14:55:22] [INFO ] [Nat]Added 80 Read/Feed constraints in 33 ms returned sat
[2023-03-12 14:55:22] [INFO ] Deduced a trap composed of 125 places in 205 ms of which 0 ms to minimize.
[2023-03-12 14:55:22] [INFO ] Deduced a trap composed of 99 places in 195 ms of which 0 ms to minimize.
[2023-03-12 14:55:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
[2023-03-12 14:55:22] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 67 ms.
[2023-03-12 14:55:23] [INFO ] Added : 32 causal constraints over 7 iterations in 418 ms. Result :sat
Minimization took 62 ms.
[2023-03-12 14:55:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:23] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-12 14:55:23] [INFO ] [Real]Added 80 Read/Feed constraints in 67 ms returned sat
[2023-03-12 14:55:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:55:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:23] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-12 14:55:23] [INFO ] [Nat]Added 80 Read/Feed constraints in 59 ms returned sat
[2023-03-12 14:55:24] [INFO ] Deduced a trap composed of 84 places in 198 ms of which 1 ms to minimize.
[2023-03-12 14:55:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-12 14:55:24] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 65 ms.
[2023-03-12 14:55:24] [INFO ] Added : 12 causal constraints over 5 iterations in 295 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[261, 128, 1720]
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 44 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 14:55:29] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 14:55:29] [INFO ] Invariant cache hit.
[2023-03-12 14:55:29] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-12 14:55:29] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 14:55:29] [INFO ] Invariant cache hit.
[2023-03-12 14:55:29] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 14:55:30] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
[2023-03-12 14:55:30] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-12 14:55:30] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 14:55:30] [INFO ] Invariant cache hit.
[2023-03-12 14:55:31] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1904 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 14:55:31] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2075 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 793 ms. (steps per millisecond=1261 ) properties (out of 3) seen :252
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 741 ms. (steps per millisecond=1349 ) properties (out of 3) seen :149
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 :1677
[2023-03-12 14:55:35] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 14:55:35] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-12 14:55:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:35] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-12 14:55:35] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 14:55:35] [INFO ] [Real]Added 80 Read/Feed constraints in 67 ms returned sat
[2023-03-12 14:55:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:36] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2023-03-12 14:55:36] [INFO ] [Nat]Added 80 Read/Feed constraints in 64 ms returned sat
[2023-03-12 14:55:36] [INFO ] Deduced a trap composed of 125 places in 201 ms of which 0 ms to minimize.
[2023-03-12 14:55:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-12 14:55:36] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 69 ms.
[2023-03-12 14:55:36] [INFO ] Added : 17 causal constraints over 4 iterations in 315 ms. Result :sat
Minimization took 47 ms.
[2023-03-12 14:55:36] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:37] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-12 14:55:37] [INFO ] [Real]Added 80 Read/Feed constraints in 21 ms returned sat
[2023-03-12 14:55:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:55:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:37] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2023-03-12 14:55:37] [INFO ] [Nat]Added 80 Read/Feed constraints in 31 ms returned sat
[2023-03-12 14:55:37] [INFO ] Deduced a trap composed of 125 places in 203 ms of which 0 ms to minimize.
[2023-03-12 14:55:37] [INFO ] Deduced a trap composed of 99 places in 201 ms of which 1 ms to minimize.
[2023-03-12 14:55:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 470 ms
[2023-03-12 14:55:37] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 65 ms.
[2023-03-12 14:55:38] [INFO ] Added : 32 causal constraints over 7 iterations in 432 ms. Result :sat
Minimization took 62 ms.
[2023-03-12 14:55:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:38] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2023-03-12 14:55:38] [INFO ] [Real]Added 80 Read/Feed constraints in 69 ms returned sat
[2023-03-12 14:55:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:55:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:38] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-03-12 14:55:38] [INFO ] [Nat]Added 80 Read/Feed constraints in 69 ms returned sat
[2023-03-12 14:55:39] [INFO ] Deduced a trap composed of 84 places in 187 ms of which 1 ms to minimize.
[2023-03-12 14:55:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-12 14:55:39] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 75 ms.
[2023-03-12 14:55:39] [INFO ] Added : 12 causal constraints over 5 iterations in 314 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[261, 144, 1720]
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 51 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 53 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 63 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-12 14:55:44] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 14:55:44] [INFO ] Invariant cache hit.
[2023-03-12 14:55:44] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-12 14:55:44] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 14:55:44] [INFO ] Invariant cache hit.
[2023-03-12 14:55:45] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 14:55:45] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1536 ms to find 0 implicit places.
[2023-03-12 14:55:46] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-12 14:55:46] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 14:55:46] [INFO ] Invariant cache hit.
[2023-03-12 14:55:46] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2128 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 14:55:46] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2083 ms. (steps per millisecond=480 ) properties (out of 3) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 738 ms. (steps per millisecond=1355 ) properties (out of 3) seen :19
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 :141
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 755 ms. (steps per millisecond=1324 ) properties (out of 3) seen :576
[2023-03-12 14:55:50] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 14:55:50] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-12 14:55:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:51] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2023-03-12 14:55:51] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 14:55:51] [INFO ] [Real]Added 80 Read/Feed constraints in 68 ms returned sat
[2023-03-12 14:55:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:51] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-12 14:55:51] [INFO ] [Nat]Added 80 Read/Feed constraints in 60 ms returned sat
[2023-03-12 14:55:51] [INFO ] Deduced a trap composed of 125 places in 203 ms of which 1 ms to minimize.
[2023-03-12 14:55:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-12 14:55:51] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 66 ms.
[2023-03-12 14:55:51] [INFO ] Added : 17 causal constraints over 4 iterations in 300 ms. Result :sat
Minimization took 48 ms.
[2023-03-12 14:55:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:52] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-12 14:55:52] [INFO ] [Real]Added 80 Read/Feed constraints in 19 ms returned sat
[2023-03-12 14:55:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:52] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-12 14:55:52] [INFO ] [Nat]Added 80 Read/Feed constraints in 31 ms returned sat
[2023-03-12 14:55:52] [INFO ] Deduced a trap composed of 125 places in 199 ms of which 0 ms to minimize.
[2023-03-12 14:55:52] [INFO ] Deduced a trap composed of 99 places in 184 ms of which 1 ms to minimize.
[2023-03-12 14:55:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 453 ms
[2023-03-12 14:55:53] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 66 ms.
[2023-03-12 14:55:53] [INFO ] Added : 32 causal constraints over 7 iterations in 417 ms. Result :sat
Minimization took 60 ms.
[2023-03-12 14:55:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:53] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-03-12 14:55:53] [INFO ] [Real]Added 80 Read/Feed constraints in 71 ms returned sat
[2023-03-12 14:55:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:55:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:55:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:55:54] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-12 14:55:54] [INFO ] [Nat]Added 80 Read/Feed constraints in 61 ms returned sat
[2023-03-12 14:55:54] [INFO ] Deduced a trap composed of 84 places in 215 ms of which 1 ms to minimize.
[2023-03-12 14:55:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-12 14:55:54] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 73 ms.
[2023-03-12 14:55:54] [INFO ] Added : 12 causal constraints over 5 iterations in 311 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[261, 144, 1720]
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 48 ms. Remains 434 /434 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-12 14:56:00] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 14:56:00] [INFO ] Invariant cache hit.
[2023-03-12 14:56:00] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-12 14:56:00] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 14:56:00] [INFO ] Invariant cache hit.
[2023-03-12 14:56:00] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 14:56:01] [INFO ] Implicit Places using invariants and state equation in 879 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
[2023-03-12 14:56:01] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-12 14:56:01] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2023-03-12 14:56:01] [INFO ] Invariant cache hit.
[2023-03-12 14:56:02] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1747 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 14:56:02] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) 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 14:56:02] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 14:56:02] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-12 14:56:02] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:02] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-12 14:56:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:56:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:56:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:02] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-12 14:56:02] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 14:56:02] [INFO ] [Nat]Added 80 Read/Feed constraints in 22 ms returned sat
[2023-03-12 14:56:02] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 73 ms.
[2023-03-12 14:56:02] [INFO ] Added : 15 causal constraints over 4 iterations in 291 ms. Result :sat
Minimization took 52 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 134 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 134 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 14:56:03] [INFO ] Computed 3 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2093 ms. (steps per millisecond=477 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 756 ms. (steps per millisecond=1322 ) properties (out of 1) seen :497
[2023-03-12 14:56:05] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-12 14:56:05] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-12 14:56:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:56:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:06] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2023-03-12 14:56:06] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:56:06] [INFO ] [Real]Added 75 Read/Feed constraints in 61 ms returned sat
[2023-03-12 14:56:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:56:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:56:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:06] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-12 14:56:06] [INFO ] [Nat]Added 75 Read/Feed constraints in 62 ms returned sat
[2023-03-12 14:56:06] [INFO ] Deduced a trap composed of 113 places in 197 ms of which 0 ms to minimize.
[2023-03-12 14:56:07] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 0 ms to minimize.
[2023-03-12 14:56:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 474 ms
[2023-03-12 14:56:07] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 67 ms.
[2023-03-12 14:56:07] [INFO ] Added : 13 causal constraints over 4 iterations in 261 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[497]
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 47 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 47 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 46 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-12 14:56:09] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:56:09] [INFO ] Invariant cache hit.
[2023-03-12 14:56:10] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-12 14:56:10] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:56:10] [INFO ] Invariant cache hit.
[2023-03-12 14:56:10] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:56:10] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
[2023-03-12 14:56:10] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-12 14:56:10] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:56:10] [INFO ] Invariant cache hit.
[2023-03-12 14:56:11] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1732 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 14:56:11] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000001 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 669 ms. (steps per millisecond=1494 ) properties (out of 1) seen :0
[2023-03-12 14:56:14] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-12 14:56:14] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-12 14:56:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:14] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-12 14:56:14] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:56:14] [INFO ] [Real]Added 75 Read/Feed constraints in 64 ms returned sat
[2023-03-12 14:56:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:56:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:14] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-12 14:56:14] [INFO ] [Nat]Added 75 Read/Feed constraints in 59 ms returned sat
[2023-03-12 14:56:14] [INFO ] Deduced a trap composed of 113 places in 193 ms of which 0 ms to minimize.
[2023-03-12 14:56:15] [INFO ] Deduced a trap composed of 71 places in 173 ms of which 1 ms to minimize.
[2023-03-12 14:56:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 432 ms
[2023-03-12 14:56:15] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 66 ms.
[2023-03-12 14:56:15] [INFO ] Added : 13 causal constraints over 4 iterations in 274 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[497]
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 41 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 41 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 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-12 14:56:17] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:56:17] [INFO ] Invariant cache hit.
[2023-03-12 14:56:17] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-12 14:56:17] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:56:17] [INFO ] Invariant cache hit.
[2023-03-12 14:56:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:56:18] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1263 ms to find 0 implicit places.
[2023-03-12 14:56:18] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-12 14:56:18] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-12 14:56:18] [INFO ] Invariant cache hit.
[2023-03-12 14:56:19] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1740 ms. Remains : 421/421 places, 1218/1218 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-02 in 17084 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 14:56:19] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-12 14:56:19] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 14:56:19] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-12 14:56:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:19] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-03-12 14:56:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:56:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:56:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:19] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-12 14:56:19] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 14:56:19] [INFO ] [Nat]Added 80 Read/Feed constraints in 68 ms returned sat
[2023-03-12 14:56:19] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 70 ms.
[2023-03-12 14:56:20] [INFO ] Added : 27 causal constraints over 6 iterations in 355 ms. Result :sat
Minimization took 58 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
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 117 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 118 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 14:56:20] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2020 ms. (steps per millisecond=495 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 690 ms. (steps per millisecond=1449 ) properties (out of 1) seen :117
[2023-03-12 14:56:22] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2023-03-12 14:56:22] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-12 14:56:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:56:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:23] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-12 14:56:23] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:56:23] [INFO ] [Real]Added 75 Read/Feed constraints in 23 ms returned sat
[2023-03-12 14:56:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:56:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:56:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:23] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-12 14:56:23] [INFO ] [Nat]Added 75 Read/Feed constraints in 19 ms returned sat
[2023-03-12 14:56:23] [INFO ] Deduced a trap composed of 113 places in 194 ms of which 1 ms to minimize.
[2023-03-12 14:56:23] [INFO ] Deduced a trap composed of 99 places in 178 ms of which 0 ms to minimize.
[2023-03-12 14:56:24] [INFO ] Deduced a trap composed of 78 places in 177 ms of which 1 ms to minimize.
[2023-03-12 14:56:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 646 ms
[2023-03-12 14:56:24] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 66 ms.
[2023-03-12 14:56:24] [INFO ] Added : 41 causal constraints over 10 iterations in 531 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[117]
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 44 ms. Remains : 425/425 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1232/1232 transitions.
Applied a total of 0 rules in 43 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2023-03-12 14:56:25] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 14:56:25] [INFO ] Invariant cache hit.
[2023-03-12 14:56:25] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-12 14:56:25] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 14:56:25] [INFO ] Invariant cache hit.
[2023-03-12 14:56:26] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:56:26] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
[2023-03-12 14:56:26] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-12 14:56:26] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 14:56:26] [INFO ] Invariant cache hit.
[2023-03-12 14:56:27] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1703 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 14:56:27] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 2026 ms. (steps per millisecond=493 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=1402 ) properties (out of 1) seen :133
[2023-03-12 14:56:29] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2023-03-12 14:56:29] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-12 14:56:29] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:56:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:30] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-12 14:56:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:56:30] [INFO ] [Real]Added 75 Read/Feed constraints in 23 ms returned sat
[2023-03-12 14:56:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:56:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:56:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:30] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-12 14:56:30] [INFO ] [Nat]Added 75 Read/Feed constraints in 20 ms returned sat
[2023-03-12 14:56:30] [INFO ] Deduced a trap composed of 113 places in 196 ms of which 1 ms to minimize.
[2023-03-12 14:56:30] [INFO ] Deduced a trap composed of 99 places in 177 ms of which 1 ms to minimize.
[2023-03-12 14:56:31] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 1 ms to minimize.
[2023-03-12 14:56:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 654 ms
[2023-03-12 14:56:31] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 65 ms.
[2023-03-12 14:56:31] [INFO ] Added : 41 causal constraints over 10 iterations in 527 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[133]
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 42 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2023-03-12 14:56:32] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 14:56:32] [INFO ] Invariant cache hit.
[2023-03-12 14:56:32] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-12 14:56:32] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 14:56:32] [INFO ] Invariant cache hit.
[2023-03-12 14:56:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:56:33] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
[2023-03-12 14:56:33] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-12 14:56:33] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 14:56:33] [INFO ] Invariant cache hit.
[2023-03-12 14:56:34] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1733 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 14:56:34] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2025 ms. (steps per millisecond=493 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 717 ms. (steps per millisecond=1394 ) properties (out of 1) seen :157
[2023-03-12 14:56:36] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2023-03-12 14:56:36] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-12 14:56:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:56:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:37] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2023-03-12 14:56:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:56:37] [INFO ] [Real]Added 75 Read/Feed constraints in 23 ms returned sat
[2023-03-12 14:56:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:56:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:56:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:37] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-12 14:56:37] [INFO ] [Nat]Added 75 Read/Feed constraints in 21 ms returned sat
[2023-03-12 14:56:37] [INFO ] Deduced a trap composed of 113 places in 198 ms of which 1 ms to minimize.
[2023-03-12 14:56:37] [INFO ] Deduced a trap composed of 99 places in 190 ms of which 1 ms to minimize.
[2023-03-12 14:56:38] [INFO ] Deduced a trap composed of 78 places in 191 ms of which 0 ms to minimize.
[2023-03-12 14:56:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 675 ms
[2023-03-12 14:56:38] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 66 ms.
[2023-03-12 14:56:38] [INFO ] Added : 41 causal constraints over 10 iterations in 551 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[157]
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 65 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 65 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 47 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2023-03-12 14:56:39] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 14:56:39] [INFO ] Invariant cache hit.
[2023-03-12 14:56:40] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-12 14:56:40] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 14:56:40] [INFO ] Invariant cache hit.
[2023-03-12 14:56:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:56:41] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
[2023-03-12 14:56:41] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-12 14:56:41] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 14:56:41] [INFO ] Invariant cache hit.
[2023-03-12 14:56:41] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1716 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 14:56:41] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2038 ms. (steps per millisecond=490 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 1) seen :115
[2023-03-12 14:56:44] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
// Phase 1: matrix 695 rows 425 cols
[2023-03-12 14:56:44] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-12 14:56:44] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:56:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:44] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-12 14:56:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:56:44] [INFO ] [Real]Added 75 Read/Feed constraints in 33 ms returned sat
[2023-03-12 14:56:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:56:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:56:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:44] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-12 14:56:44] [INFO ] [Nat]Added 75 Read/Feed constraints in 19 ms returned sat
[2023-03-12 14:56:44] [INFO ] Deduced a trap composed of 113 places in 198 ms of which 0 ms to minimize.
[2023-03-12 14:56:45] [INFO ] Deduced a trap composed of 99 places in 189 ms of which 0 ms to minimize.
[2023-03-12 14:56:45] [INFO ] Deduced a trap composed of 78 places in 188 ms of which 1 ms to minimize.
[2023-03-12 14:56:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 651 ms
[2023-03-12 14:56:45] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 361 transitions) in 62 ms.
[2023-03-12 14:56:45] [INFO ] Added : 41 causal constraints over 10 iterations in 527 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[157]
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 41 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 41 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 41 ms. Remains 425 /425 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2023-03-12 14:56:46] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 14:56:46] [INFO ] Invariant cache hit.
[2023-03-12 14:56:47] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-12 14:56:47] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 14:56:47] [INFO ] Invariant cache hit.
[2023-03-12 14:56:47] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-12 14:56:48] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2023-03-12 14:56:48] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-12 14:56:48] [INFO ] Flow matrix only has 695 transitions (discarded 537 similar events)
[2023-03-12 14:56:48] [INFO ] Invariant cache hit.
[2023-03-12 14:56:48] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1710 ms. Remains : 425/425 places, 1232/1232 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-09 in 29491 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 14:56:48] [INFO ] Computed 3 place invariants in 7 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 14:56:48] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 434 cols
[2023-03-12 14:56:48] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-12 14:56:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:48] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-12 14:56:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:56:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 14:56:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:49] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-12 14:56:49] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-12 14:56:49] [INFO ] [Nat]Added 80 Read/Feed constraints in 39 ms returned sat
[2023-03-12 14:56:49] [INFO ] Computed and/alt/rep : 344/1786/337 causal constraints (skipped 372 transitions) in 72 ms.
[2023-03-12 14:56:49] [INFO ] Added : 31 causal constraints over 9 iterations in 470 ms. Result :sat
Minimization took 63 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 121 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 122 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 14:56:49] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2099 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 757 ms. (steps per millisecond=1321 ) properties (out of 1) seen :0
[2023-03-12 14:56:52] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2023-03-12 14:56:52] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-12 14:56:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:56:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:52] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-12 14:56:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:56:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:56:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:53] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-12 14:56:53] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-12 14:56:53] [INFO ] [Nat]Added 74 Read/Feed constraints in 50 ms returned sat
[2023-03-12 14:56:53] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 67 ms.
[2023-03-12 14:56:53] [INFO ] Added : 5 causal constraints over 3 iterations in 219 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
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 45 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 44 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-12 14:56:53] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-12 14:56:53] [INFO ] Invariant cache hit.
[2023-03-12 14:56:53] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-12 14:56:53] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-12 14:56:53] [INFO ] Invariant cache hit.
[2023-03-12 14:56:54] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-12 14:56:55] [INFO ] Implicit Places using invariants and state equation in 1100 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
[2023-03-12 14:56:55] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-12 14:56:55] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-12 14:56:55] [INFO ] Invariant cache hit.
[2023-03-12 14:56:55] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1884 ms. Remains : 414/414 places, 1202/1202 transitions.
Normalized transition count is 678 out of 1202 initially.
// Phase 1: matrix 678 rows 414 cols
[2023-03-12 14:56:55] [INFO ] Computed 3 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2080 ms. (steps per millisecond=480 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 732 ms. (steps per millisecond=1366 ) properties (out of 1) seen :0
[2023-03-12 14:56:58] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2023-03-12 14:56:58] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-12 14:56:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:56:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:58] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-12 14:56:58] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-12 14:56:58] [INFO ] [Real]Added 74 Read/Feed constraints in 39 ms returned sat
[2023-03-12 14:56:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:56:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-12 14:56:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:56:58] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2023-03-12 14:56:58] [INFO ] [Nat]Added 74 Read/Feed constraints in 18 ms returned sat
[2023-03-12 14:56:59] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 0 ms to minimize.
[2023-03-12 14:56:59] [INFO ] Deduced a trap composed of 73 places in 185 ms of which 1 ms to minimize.
[2023-03-12 14:56:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 438 ms
[2023-03-12 14:56:59] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 70 ms.
[2023-03-12 14:56:59] [INFO ] Added : 10 causal constraints over 7 iterations in 424 ms. Result :sat
Minimization took 49 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 45 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 45 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2023-03-12 14:56:59] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-12 14:56:59] [INFO ] Invariant cache hit.
[2023-03-12 14:57:00] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-12 14:57:00] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-12 14:57:00] [INFO ] Invariant cache hit.
[2023-03-12 14:57:00] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-12 14:57:01] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
[2023-03-12 14:57:01] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-12 14:57:01] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2023-03-12 14:57:01] [INFO ] Invariant cache hit.
[2023-03-12 14:57:01] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1639 ms. Remains : 414/414 places, 1202/1202 transitions.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-12 in 12881 ms.
[2023-03-12 14:57:01] [INFO ] Flatten gal took : 115 ms
[2023-03-12 14:57:01] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 14:57:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 434 places, 1252 transitions and 5134 arcs took 7 ms.
Total runtime 148479 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/945/ub_0_ --maxsum=/tmp/945/ub_1_ --maxsum=/tmp/945/ub_2_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14926076 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095000 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
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="ltsminxred"
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 ltsminxred"
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 r169-tall-167838856300741"
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 ;