fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124157000779
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S32C10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16246.000 3600000.00 3667959.00 30748.00 1 ? 1 ? ? 1 1 ? 1 1 1 1 1 1 ? ? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124157000779.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S32C10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124157000779
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 63M
-rw-r--r-- 1 mcc users 29K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K May 12 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 12 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 12 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 12 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 6.5K May 11 19:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 11 19:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 11 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 11 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 12 04:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 12 04:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 63M May 12 08:13 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 gen-UpperBounds-00
FORMULA_NAME gen-UpperBounds-01
FORMULA_NAME gen-UpperBounds-02
FORMULA_NAME gen-UpperBounds-03
FORMULA_NAME gen-UpperBounds-04
FORMULA_NAME gen-UpperBounds-05
FORMULA_NAME gen-UpperBounds-06
FORMULA_NAME gen-UpperBounds-07
FORMULA_NAME gen-UpperBounds-08
FORMULA_NAME gen-UpperBounds-09
FORMULA_NAME gen-UpperBounds-10
FORMULA_NAME gen-UpperBounds-11
FORMULA_NAME gen-UpperBounds-12
FORMULA_NAME gen-UpperBounds-13
FORMULA_NAME gen-UpperBounds-14
FORMULA_NAME gen-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621405879334

Running Version 0
[2021-05-19 06:31:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-19 06:31:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 06:31:22] [INFO ] Load time of PNML (sax parser for PT used): 1482 ms
[2021-05-19 06:31:22] [INFO ] Transformed 32088 places.
[2021-05-19 06:31:22] [INFO ] Transformed 48223 transitions.
[2021-05-19 06:31:22] [INFO ] Parsed PT model containing 32088 places and 48223 transitions in 1725 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Normalized transition count is 47167 out of 48223 initially.
// Phase 1: matrix 47167 rows 32088 cols
[2021-05-19 06:31:36] [INFO ] Computed 1893 place invariants in 13486 ms
Incomplete random walk after 10000 steps, including 98 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :1
[2021-05-19 06:31:38] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32088 cols
[2021-05-19 06:31:51] [INFO ] Computed 1893 place invariants in 12725 ms
[2021-05-19 06:31:56] [INFO ] [Real]Absence check using 90 positive place invariants in 85 ms returned unknown
[2021-05-19 06:32:01] [INFO ] [Real]Absence check using 90 positive place invariants in 357 ms returned unknown
[2021-05-19 06:32:06] [INFO ] [Real]Absence check using 90 positive place invariants in 435 ms returned unknown
[2021-05-19 06:32:11] [INFO ] [Real]Absence check using 90 positive place invariants in 475 ms returned unknown
[2021-05-19 06:32:16] [INFO ] [Real]Absence check using 90 positive place invariants in 391 ms returned unknown
[2021-05-19 06:32:21] [INFO ] [Real]Absence check using 90 positive place invariants in 474 ms returned unknown
[2021-05-19 06:32:26] [INFO ] [Real]Absence check using 90 positive place invariants in 503 ms returned unknown
[2021-05-19 06:32:31] [INFO ] [Real]Absence check using 90 positive place invariants in 361 ms returned unknown
[2021-05-19 06:32:36] [INFO ] [Real]Absence check using 90 positive place invariants in 374 ms returned unknown
[2021-05-19 06:32:41] [INFO ] [Real]Absence check using 90 positive place invariants in 401 ms returned unknown
[2021-05-19 06:32:46] [INFO ] [Real]Absence check using 90 positive place invariants in 442 ms returned unknown
[2021-05-19 06:32:51] [INFO ] [Real]Absence check using 90 positive place invariants in 369 ms returned unknown
[2021-05-19 06:32:56] [INFO ] [Real]Absence check using 90 positive place invariants in 326 ms returned unknown
[2021-05-19 06:33:01] [INFO ] [Real]Absence check using 90 positive place invariants in 406 ms returned unknown
[2021-05-19 06:33:06] [INFO ] [Real]Absence check using 90 positive place invariants in 346 ms returned unknown
[2021-05-19 06:33:11] [INFO ] [Real]Absence check using 90 positive place invariants in 360 ms returned unknown
Current structural bounds on expressions (after SMT) : [99, 1, 33, 1, 33, 33, 99, 33, 33, 33, 33, 99, 33, 99, 1, 33] Max seen :[0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0]
Support contains 16 out of 32088 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32088/32088 places, 48223/48223 transitions.
Graph (complete) has 105773 edges and 32088 vertex of which 32032 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.90 ms
Discarding 56 places :
Also discarding 0 output transitions
Drop transitions removed 10550 transitions
Trivial Post-agglo rules discarded 10550 transitions
Performed 10550 trivial Post agglomeration. Transition count delta: 10550
Iterating post reduction 0 with 10550 rules applied. Total rules applied 10551 place count 32032 transition count 37673
Reduce places removed 10550 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 10554 rules applied. Total rules applied 21105 place count 21482 transition count 37669
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21109 place count 21478 transition count 37669
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 660 Pre rules applied. Total rules applied 21109 place count 21478 transition count 37009
Deduced a syphon composed of 660 places in 72 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 3 with 1320 rules applied. Total rules applied 22429 place count 20818 transition count 37009
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 62 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 22495 place count 20785 transition count 36976
Free-agglomeration rule (complex) applied 1576 times.
Iterating global reduction 3 with 1576 rules applied. Total rules applied 24071 place count 20785 transition count 35400
Reduce places removed 1576 places and 0 transitions.
Iterating post reduction 3 with 1576 rules applied. Total rules applied 25647 place count 19209 transition count 35400
Partial Free-agglomeration rule applied 4214 times.
Drop transitions removed 4214 transitions
Iterating global reduction 4 with 4214 rules applied. Total rules applied 29861 place count 19209 transition count 35400
Applied a total of 29861 rules in 12756 ms. Remains 19209 /32088 variables (removed 12879) and now considering 35400/48223 (removed 12823) transitions.
Finished structural reductions, in 1 iterations. Remains : 19209/32088 places, 35400/48223 transitions.
Normalized transition count is 33834 out of 35400 initially.
// Phase 1: matrix 33834 rows 19209 cols
[2021-05-19 06:33:39] [INFO ] Computed 1837 place invariants in 15194 ms
FORMULA gen-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA gen-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA gen-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA gen-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA gen-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA gen-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 262126 steps, including 4265 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen :{0=1, 4=1, 6=1, 7=1}
Interrupted Best-First random walk after 389652 steps, including 626 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen :{4=1, 6=1, 7=1}
Interrupted Best-First random walk after 388327 steps, including 624 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen :{4=1}
Interrupted Best-First random walk after 385989 steps, including 621 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen :{4=1, 6=1}
Interrupted Best-First random walk after 386739 steps, including 622 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen :{0=1, 6=1}
Interrupted Best-First random walk after 386248 steps, including 621 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen :{0=1, 4=1, 7=1}
Interrupted Best-First random walk after 380581 steps, including 612 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen :{0=1, 4=1}
Interrupted Best-First random walk after 386190 steps, including 621 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen :{0=1, 4=1, 6=1}
Interrupted Best-First random walk after 378596 steps, including 609 resets, run timeout after 5001 ms. (steps per millisecond=75 ) properties seen :{4=1}
Interrupted Best-First random walk after 378629 steps, including 609 resets, run timeout after 5001 ms. (steps per millisecond=75 ) properties seen :{4=1, 6=1}
Interrupted Best-First random walk after 371575 steps, including 597 resets, run timeout after 5001 ms. (steps per millisecond=74 ) properties seen :{0=1, 6=1, 7=1}
[2021-05-19 06:34:59] [INFO ] Flow matrix only has 33834 transitions (discarded 1566 similar events)
// Phase 1: matrix 33834 rows 19209 cols
[2021-05-19 06:35:16] [INFO ] Computed 1837 place invariants in 16912 ms
[2021-05-19 06:35:19] [INFO ] [Real]Absence check using 65 positive place invariants in 650 ms returned sat
[2021-05-19 06:35:20] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 767 ms returned unsat
[2021-05-19 06:35:22] [INFO ] [Real]Absence check using 65 positive place invariants in 637 ms returned sat
[2021-05-19 06:35:23] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 909 ms returned sat
[2021-05-19 06:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:36:05] [INFO ] [Real]Absence check using state equation in 41334 ms returned unknown
[2021-05-19 06:36:08] [INFO ] [Real]Absence check using 65 positive place invariants in 646 ms returned sat
[2021-05-19 06:36:08] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 913 ms returned sat
[2021-05-19 06:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:36:50] [INFO ] [Real]Absence check using state equation in 41302 ms returned unknown
[2021-05-19 06:36:53] [INFO ] [Real]Absence check using 65 positive place invariants in 657 ms returned sat
[2021-05-19 06:36:54] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 948 ms returned sat
[2021-05-19 06:36:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:37:35] [INFO ] [Real]Absence check using state equation in 41218 ms returned unknown
[2021-05-19 06:37:38] [INFO ] [Real]Absence check using 65 positive place invariants in 638 ms returned sat
[2021-05-19 06:37:38] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 636 ms returned unsat
[2021-05-19 06:37:41] [INFO ] [Real]Absence check using 65 positive place invariants in 677 ms returned sat
[2021-05-19 06:37:42] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 962 ms returned sat
[2021-05-19 06:37:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:38:23] [INFO ] [Real]Absence check using state equation in 41162 ms returned unknown
[2021-05-19 06:38:26] [INFO ] [Real]Absence check using 65 positive place invariants in 649 ms returned sat
[2021-05-19 06:38:27] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 865 ms returned unsat
[2021-05-19 06:38:30] [INFO ] [Real]Absence check using 65 positive place invariants in 662 ms returned sat
[2021-05-19 06:38:31] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 798 ms returned unsat
[2021-05-19 06:38:33] [INFO ] [Real]Absence check using 65 positive place invariants in 660 ms returned sat
[2021-05-19 06:38:34] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1003 ms returned sat
[2021-05-19 06:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:39:16] [INFO ] [Real]Absence check using state equation in 41119 ms returned unknown
[2021-05-19 06:39:18] [INFO ] [Real]Absence check using 65 positive place invariants in 639 ms returned sat
[2021-05-19 06:39:19] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 954 ms returned sat
[2021-05-19 06:39:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:40:01] [INFO ] [Real]Absence check using state equation in 41228 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[1, 0, 0, 0, 1, 0, 1, 1, 0, 0]
FORMULA gen-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA gen-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 19209 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19209/19209 places, 35400/35400 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 19209 transition count 35397
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 19206 transition count 35397
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 19206 transition count 35389
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 22 place count 19198 transition count 35389
Applied a total of 22 rules in 3030 ms. Remains 19198 /19209 variables (removed 11) and now considering 35389/35400 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 19198/19209 places, 35389/35400 transitions.
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 06:40:19] [INFO ] Computed 1837 place invariants in 15356 ms
Interrupted random walk after 256742 steps, including 4180 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen :{}
Interrupted Best-First random walk after 384166 steps, including 618 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen :{}
Interrupted Best-First random walk after 382743 steps, including 615 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen :{}
Interrupted Best-First random walk after 383091 steps, including 616 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen :{}
Interrupted Best-First random walk after 384501 steps, including 618 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen :{}
Interrupted Best-First random walk after 383256 steps, including 616 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen :{}
Interrupted Best-First random walk after 383923 steps, including 617 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen :{}
[2021-05-19 06:41:19] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 06:41:36] [INFO ] Computed 1837 place invariants in 16748 ms
[2021-05-19 06:41:39] [INFO ] [Real]Absence check using 65 positive place invariants in 686 ms returned sat
[2021-05-19 06:41:40] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1171 ms returned sat
[2021-05-19 06:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:42:21] [INFO ] [Real]Absence check using state equation in 41048 ms returned unknown
[2021-05-19 06:42:24] [INFO ] [Real]Absence check using 65 positive place invariants in 664 ms returned sat
[2021-05-19 06:42:25] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1084 ms returned sat
[2021-05-19 06:42:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:43:06] [INFO ] [Real]Absence check using state equation in 40976 ms returned unknown
[2021-05-19 06:43:09] [INFO ] [Real]Absence check using 65 positive place invariants in 667 ms returned sat
[2021-05-19 06:43:10] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 975 ms returned sat
[2021-05-19 06:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:43:51] [INFO ] [Real]Absence check using state equation in 41194 ms returned unknown
[2021-05-19 06:43:54] [INFO ] [Real]Absence check using 65 positive place invariants in 654 ms returned sat
[2021-05-19 06:43:55] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 959 ms returned sat
[2021-05-19 06:43:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:44:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-19 06:44:39] [INFO ] [Real]Absence check using 65 positive place invariants in 673 ms returned sat
[2021-05-19 06:44:40] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 964 ms returned sat
[2021-05-19 06:44:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:45:21] [INFO ] [Real]Absence check using state equation in 41134 ms returned unknown
[2021-05-19 06:45:24] [INFO ] [Real]Absence check using 65 positive place invariants in 651 ms returned sat
[2021-05-19 06:45:25] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 980 ms returned sat
[2021-05-19 06:45:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:46:06] [INFO ] [Real]Absence check using state equation in 41230 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 19198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19198/19198 places, 35389/35389 transitions.
Applied a total of 0 rules in 1439 ms. Remains 19198 /19198 variables (removed 0) and now considering 35389/35389 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 19198/19198 places, 35389/35389 transitions.
Starting structural reductions, iteration 0 : 19198/19198 places, 35389/35389 transitions.
Applied a total of 0 rules in 1409 ms. Remains 19198 /19198 variables (removed 0) and now considering 35389/35389 (removed 0) transitions.
[2021-05-19 06:46:09] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 06:46:26] [INFO ] Computed 1837 place invariants in 17220 ms
[2021-05-19 06:46:28] [INFO ] Implicit Places using invariants in 19059 ms returned []
Implicit Place search using SMT only with invariants took 19059 ms to find 0 implicit places.
[2021-05-19 06:46:28] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 06:46:45] [INFO ] Computed 1837 place invariants in 17349 ms
[2021-05-19 06:46:47] [INFO ] Dead Transitions using invariants and state equation in 19288 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19198/19198 places, 35389/35389 transitions.
Starting property specific reduction for gen-UpperBounds-01
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 06:47:03] [INFO ] Computed 1837 place invariants in 15440 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1163 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
[2021-05-19 06:47:04] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 06:47:19] [INFO ] Computed 1837 place invariants in 14987 ms
[2021-05-19 06:47:22] [INFO ] [Real]Absence check using 65 positive place invariants in 663 ms returned sat
[2021-05-19 06:47:23] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 993 ms returned sat
[2021-05-19 06:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:47:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19198/19198 places, 35389/35389 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 19198 transition count 35386
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 19195 transition count 35386
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 19195 transition count 35384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 19193 transition count 35384
Applied a total of 10 rules in 3069 ms. Remains 19193 /19198 variables (removed 5) and now considering 35384/35389 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 19193/19198 places, 35384/35389 transitions.
Normalized transition count is 33818 out of 35384 initially.
// Phase 1: matrix 33818 rows 19193 cols
[2021-05-19 06:47:47] [INFO ] Computed 1837 place invariants in 19854 ms
Interrupted random walk after 235843 steps, including 3841 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen :{}
Interrupted Best-First random walk after 340226 steps, including 547 resets, run timeout after 5001 ms. (steps per millisecond=68 ) properties seen :{}
[2021-05-19 06:48:22] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2021-05-19 06:48:38] [INFO ] Computed 1837 place invariants in 15665 ms
[2021-05-19 06:48:42] [INFO ] [Real]Absence check using 65 positive place invariants in 816 ms returned sat
[2021-05-19 06:48:43] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1373 ms returned sat
[2021-05-19 06:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:49:23] [INFO ] [Real]Absence check using state equation in 39556 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1402 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 19193/19193 places, 35384/35384 transitions.
Starting structural reductions, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1414 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
[2021-05-19 06:49:25] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2021-05-19 06:49:42] [INFO ] Computed 1837 place invariants in 16084 ms
[2021-05-19 06:49:43] [INFO ] Implicit Places using invariants in 17788 ms returned []
Implicit Place search using SMT only with invariants took 17789 ms to find 0 implicit places.
[2021-05-19 06:49:43] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2021-05-19 06:49:59] [INFO ] Computed 1837 place invariants in 15950 ms
[2021-05-19 06:50:01] [INFO ] Dead Transitions using invariants and state equation in 17638 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19193/19193 places, 35384/35384 transitions.
Ending property specific reduction for gen-UpperBounds-01 in 193883 ms.
Starting property specific reduction for gen-UpperBounds-03
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 06:50:16] [INFO ] Computed 1837 place invariants in 15366 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1202 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
[2021-05-19 06:50:18] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 06:50:33] [INFO ] Computed 1837 place invariants in 15533 ms
[2021-05-19 06:50:36] [INFO ] [Real]Absence check using 65 positive place invariants in 679 ms returned sat
[2021-05-19 06:50:37] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1081 ms returned sat
[2021-05-19 06:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:50:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19198/19198 places, 35389/35389 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 19198 transition count 35386
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 19195 transition count 35386
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 19195 transition count 35384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 19193 transition count 35384
Applied a total of 10 rules in 2992 ms. Remains 19193 /19198 variables (removed 5) and now considering 35384/35389 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 19193/19198 places, 35384/35389 transitions.
Normalized transition count is 33818 out of 35384 initially.
// Phase 1: matrix 33818 rows 19193 cols
[2021-05-19 06:50:58] [INFO ] Computed 1837 place invariants in 16884 ms
Interrupted random walk after 249184 steps, including 4057 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen :{}
Interrupted Best-First random walk after 357624 steps, including 575 resets, run timeout after 5001 ms. (steps per millisecond=71 ) properties seen :{}
[2021-05-19 06:51:33] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2021-05-19 06:51:48] [INFO ] Computed 1837 place invariants in 14718 ms
[2021-05-19 06:51:51] [INFO ] [Real]Absence check using 65 positive place invariants in 641 ms returned sat
[2021-05-19 06:51:52] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 914 ms returned sat
[2021-05-19 06:51:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:52:33] [INFO ] [Real]Absence check using state equation in 41313 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1420 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 19193/19193 places, 35384/35384 transitions.
Starting structural reductions, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1386 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
[2021-05-19 06:52:36] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2021-05-19 06:52:51] [INFO ] Computed 1837 place invariants in 15469 ms
[2021-05-19 06:52:53] [INFO ] Implicit Places using invariants in 17153 ms returned []
Implicit Place search using SMT only with invariants took 17156 ms to find 0 implicit places.
[2021-05-19 06:52:53] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2021-05-19 06:53:09] [INFO ] Computed 1837 place invariants in 16109 ms
[2021-05-19 06:53:11] [INFO ] Dead Transitions using invariants and state equation in 17781 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19193/19193 places, 35384/35384 transitions.
Ending property specific reduction for gen-UpperBounds-03 in 189795 ms.
Starting property specific reduction for gen-UpperBounds-04
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 06:53:27] [INFO ] Computed 1837 place invariants in 15814 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1243 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
[2021-05-19 06:53:28] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 06:53:44] [INFO ] Computed 1837 place invariants in 16014 ms
[2021-05-19 06:53:47] [INFO ] [Real]Absence check using 65 positive place invariants in 696 ms returned sat
[2021-05-19 06:53:48] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1204 ms returned sat
[2021-05-19 06:53:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:53:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19198/19198 places, 35389/35389 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 19198 transition count 35387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19196 transition count 35387
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 19196 transition count 35386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 19195 transition count 35386
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 19195 transition count 35386
Applied a total of 7 rules in 4413 ms. Remains 19195 /19198 variables (removed 3) and now considering 35386/35389 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 19195/19198 places, 35386/35389 transitions.
Normalized transition count is 33820 out of 35386 initially.
// Phase 1: matrix 33820 rows 19195 cols
[2021-05-19 06:54:10] [INFO ] Computed 1837 place invariants in 16693 ms
Interrupted random walk after 254971 steps, including 4150 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen :{}
Interrupted Best-First random walk after 381594 steps, including 614 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen :{}
[2021-05-19 06:54:45] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2021-05-19 06:55:00] [INFO ] Computed 1837 place invariants in 15045 ms
[2021-05-19 06:55:03] [INFO ] [Real]Absence check using 65 positive place invariants in 652 ms returned sat
[2021-05-19 06:55:04] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 922 ms returned sat
[2021-05-19 06:55:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:55:45] [INFO ] [Real]Absence check using state equation in 41329 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1359 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 19195/19195 places, 35386/35386 transitions.
Starting structural reductions, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1333 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
[2021-05-19 06:55:48] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2021-05-19 06:56:03] [INFO ] Computed 1837 place invariants in 15026 ms
[2021-05-19 06:56:05] [INFO ] Implicit Places using invariants in 16791 ms returned []
Implicit Place search using SMT only with invariants took 16792 ms to find 0 implicit places.
[2021-05-19 06:56:05] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2021-05-19 06:56:21] [INFO ] Computed 1837 place invariants in 15812 ms
[2021-05-19 06:56:22] [INFO ] Dead Transitions using invariants and state equation in 17669 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19195/19195 places, 35386/35386 transitions.
Ending property specific reduction for gen-UpperBounds-04 in 191752 ms.
Starting property specific reduction for gen-UpperBounds-07
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 06:56:38] [INFO ] Computed 1837 place invariants in 15565 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1180 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
[2021-05-19 06:56:39] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 06:56:55] [INFO ] Computed 1837 place invariants in 15145 ms
[2021-05-19 06:56:57] [INFO ] [Real]Absence check using 65 positive place invariants in 664 ms returned sat
[2021-05-19 06:56:58] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 909 ms returned sat
[2021-05-19 06:56:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:57:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19198/19198 places, 35389/35389 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 19198 transition count 35387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19196 transition count 35387
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 19196 transition count 35386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 19195 transition count 35386
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 19195 transition count 35386
Applied a total of 7 rules in 4187 ms. Remains 19195 /19198 variables (removed 3) and now considering 35386/35389 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 19195/19198 places, 35386/35389 transitions.
Normalized transition count is 33820 out of 35386 initially.
// Phase 1: matrix 33820 rows 19195 cols
[2021-05-19 06:57:19] [INFO ] Computed 1837 place invariants in 14916 ms
Interrupted random walk after 258746 steps, including 4210 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen :{}
Interrupted Best-First random walk after 372718 steps, including 599 resets, run timeout after 5001 ms. (steps per millisecond=74 ) properties seen :{}
[2021-05-19 06:57:54] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2021-05-19 06:58:11] [INFO ] Computed 1837 place invariants in 16718 ms
[2021-05-19 06:58:13] [INFO ] [Real]Absence check using 65 positive place invariants in 661 ms returned sat
[2021-05-19 06:58:14] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1052 ms returned sat
[2021-05-19 06:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 06:58:56] [INFO ] [Real]Absence check using state equation in 41054 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1398 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 19195/19195 places, 35386/35386 transitions.
Starting structural reductions, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1375 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
[2021-05-19 06:58:58] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2021-05-19 06:59:13] [INFO ] Computed 1837 place invariants in 15168 ms
[2021-05-19 06:59:15] [INFO ] Implicit Places using invariants in 16882 ms returned []
Implicit Place search using SMT only with invariants took 16883 ms to find 0 implicit places.
[2021-05-19 06:59:15] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2021-05-19 06:59:30] [INFO ] Computed 1837 place invariants in 15186 ms
[2021-05-19 06:59:32] [INFO ] Dead Transitions using invariants and state equation in 16917 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19195/19195 places, 35386/35386 transitions.
Ending property specific reduction for gen-UpperBounds-07 in 189640 ms.
Starting property specific reduction for gen-UpperBounds-14
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 06:59:47] [INFO ] Computed 1837 place invariants in 15291 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1208 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
[2021-05-19 06:59:49] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 07:00:04] [INFO ] Computed 1837 place invariants in 15116 ms
[2021-05-19 07:00:07] [INFO ] [Real]Absence check using 65 positive place invariants in 668 ms returned sat
[2021-05-19 07:00:08] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 949 ms returned sat
[2021-05-19 07:00:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:00:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19198/19198 places, 35389/35389 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 19198 transition count 35386
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 19195 transition count 35386
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 19195 transition count 35384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 19193 transition count 35384
Applied a total of 10 rules in 2992 ms. Remains 19193 /19198 variables (removed 5) and now considering 35384/35389 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 19193/19198 places, 35384/35389 transitions.
Normalized transition count is 33818 out of 35384 initially.
// Phase 1: matrix 33818 rows 19193 cols
[2021-05-19 07:00:27] [INFO ] Computed 1837 place invariants in 15314 ms
Interrupted random walk after 256566 steps, including 4178 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen :{}
Interrupted Best-First random walk after 368705 steps, including 593 resets, run timeout after 5001 ms. (steps per millisecond=73 ) properties seen :{}
[2021-05-19 07:01:02] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2021-05-19 07:01:18] [INFO ] Computed 1837 place invariants in 15301 ms
[2021-05-19 07:01:21] [INFO ] [Real]Absence check using 65 positive place invariants in 662 ms returned sat
[2021-05-19 07:01:21] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 982 ms returned sat
[2021-05-19 07:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:02:03] [INFO ] [Real]Absence check using state equation in 41164 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1452 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 19193/19193 places, 35384/35384 transitions.
Starting structural reductions, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1409 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
[2021-05-19 07:02:06] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2021-05-19 07:02:21] [INFO ] Computed 1837 place invariants in 15344 ms
[2021-05-19 07:02:23] [INFO ] Implicit Places using invariants in 17062 ms returned []
Implicit Place search using SMT only with invariants took 17063 ms to find 0 implicit places.
[2021-05-19 07:02:23] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2021-05-19 07:02:38] [INFO ] Computed 1837 place invariants in 14965 ms
[2021-05-19 07:02:39] [INFO ] Dead Transitions using invariants and state equation in 16748 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19193/19193 places, 35384/35384 transitions.
Ending property specific reduction for gen-UpperBounds-14 in 187230 ms.
Starting property specific reduction for gen-UpperBounds-15
Normalized transition count is 33823 out of 35389 initially.
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 07:02:55] [INFO ] Computed 1837 place invariants in 15645 ms
Incomplete random walk after 10000 steps, including 163 resets, run finished after 1193 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
[2021-05-19 07:02:56] [INFO ] Flow matrix only has 33823 transitions (discarded 1566 similar events)
// Phase 1: matrix 33823 rows 19198 cols
[2021-05-19 07:03:12] [INFO ] Computed 1837 place invariants in 15561 ms
[2021-05-19 07:03:15] [INFO ] [Real]Absence check using 65 positive place invariants in 672 ms returned sat
[2021-05-19 07:03:16] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 947 ms returned sat
[2021-05-19 07:03:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:03:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19198 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19198/19198 places, 35389/35389 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 19198 transition count 35387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19196 transition count 35387
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 19196 transition count 35386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 19195 transition count 35386
Applied a total of 6 rules in 2941 ms. Remains 19195 /19198 variables (removed 3) and now considering 35386/35389 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 19195/19198 places, 35386/35389 transitions.
Normalized transition count is 33820 out of 35386 initially.
// Phase 1: matrix 33820 rows 19195 cols
[2021-05-19 07:03:36] [INFO ] Computed 1837 place invariants in 15878 ms
Interrupted random walk after 255614 steps, including 4161 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen :{}
Interrupted Best-First random walk after 379946 steps, including 611 resets, run timeout after 5001 ms. (steps per millisecond=75 ) properties seen :{}
[2021-05-19 07:04:11] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2021-05-19 07:04:27] [INFO ] Computed 1837 place invariants in 16582 ms
[2021-05-19 07:04:30] [INFO ] [Real]Absence check using 65 positive place invariants in 660 ms returned sat
[2021-05-19 07:04:31] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 992 ms returned sat
[2021-05-19 07:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:05:12] [INFO ] [Real]Absence check using state equation in 41143 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1366 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 19195/19195 places, 35386/35386 transitions.
Starting structural reductions, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1387 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
[2021-05-19 07:05:15] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2021-05-19 07:05:30] [INFO ] Computed 1837 place invariants in 15157 ms
[2021-05-19 07:05:32] [INFO ] Implicit Places using invariants in 16920 ms returned []
Implicit Place search using SMT only with invariants took 16921 ms to find 0 implicit places.
[2021-05-19 07:05:32] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2021-05-19 07:05:48] [INFO ] Computed 1837 place invariants in 15418 ms
[2021-05-19 07:05:49] [INFO ] Dead Transitions using invariants and state equation in 17188 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19195/19195 places, 35386/35386 transitions.
Ending property specific reduction for gen-UpperBounds-15 in 190006 ms.
[2021-05-19 07:05:52] [INFO ] Flatten gal took : 2304 ms
[2021-05-19 07:05:53] [INFO ] Applying decomposition
[2021-05-19 07:05:55] [INFO ] Flatten gal took : 1994 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11266028512300376013.txt, -o, /tmp/graph11266028512300376013.bin, -w, /tmp/graph11266028512300376013.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11266028512300376013.bin, -l, -1, -v, -w, /tmp/graph11266028512300376013.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 07:05:59] [INFO ] Decomposing Gal with order
[2021-05-19 07:06:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 07:06:58] [INFO ] Removed a total of 58040 redundant transitions.
[2021-05-19 07:07:04] [INFO ] Flatten gal took : 57029 ms
[2021-05-19 07:07:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 37051 labels/synchronizations in 12828 ms.
[2021-05-19 07:07:27] [INFO ] Time to serialize gal into /tmp/UpperBounds8461345164720834688.gal : 376 ms
[2021-05-19 07:07:27] [INFO ] Time to serialize properties into /tmp/UpperBounds6987532209588496456.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds8461345164720834688.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6987532209588496456.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8461345164720834688.gal -t CGAL -reachable-file /tmp/UpperBounds6987532209588496456.prop --nowitness
Loading property file /tmp/UpperBounds6987532209588496456.prop.
ITS-tools command line returned an error code 137
[2021-05-19 07:19:48] [INFO ] Flatten gal took : 3000 ms
[2021-05-19 07:19:49] [INFO ] Time to serialize gal into /tmp/UpperBounds10373614171466827084.gal : 252 ms
[2021-05-19 07:19:49] [INFO ] Time to serialize properties into /tmp/UpperBounds9402474221798790115.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds10373614171466827084.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9402474221798790115.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds10373614171466827084.gal -t CGAL -reachable-file /tmp/UpperBounds9402474221798790115.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds9402474221798790115.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="MultiCrashLeafsetExtension-PT-S32C10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S32C10, 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 r292-tall-162124157000779"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C10.tgz
mv MultiCrashLeafsetExtension-PT-S32C10 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;