fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r229-tall-167856414000949
Last Updated
May 14, 2023

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16213.539 3600000.00 3667488.00 32805.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/mcc2023-input.r229-tall-167856414000949.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S32C09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856414000949
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 31M
-rw-r--r-- 1 mcc users 14K Feb 26 03:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 03:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 03:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 03:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 30M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679634569166

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C09
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-24 05:09:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-24 05:09:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 05:09:31] [INFO ] Load time of PNML (sax parser for PT used): 866 ms
[2023-03-24 05:09:31] [INFO ] Transformed 29770 places.
[2023-03-24 05:09:31] [INFO ] Transformed 44921 transitions.
[2023-03-24 05:09:31] [INFO ] Parsed PT model containing 29770 places and 44921 transitions and 170374 arcs in 1082 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Normalized transition count is 43865 out of 44921 initially.
// Phase 1: matrix 43865 rows 29770 cols
[2023-03-24 05:09:38] [INFO ] Computed 1823 place invariants in 6107 ms
Incomplete random walk after 10000 steps, including 108 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 16) seen :1
[2023-03-24 05:09:39] [INFO ] Flow matrix only has 43865 transitions (discarded 1056 similar events)
// Phase 1: matrix 43865 rows 29770 cols
[2023-03-24 05:09:45] [INFO ] Computed 1823 place invariants in 5564 ms
[2023-03-24 05:09:50] [INFO ] [Real]Absence check using 88 positive place invariants in 798 ms returned unknown
[2023-03-24 05:09:55] [INFO ] [Real]Absence check using 88 positive place invariants in 1319 ms returned unknown
[2023-03-24 05:10:00] [INFO ] [Real]Absence check using 88 positive place invariants in 1376 ms returned unknown
[2023-03-24 05:10:05] [INFO ] [Real]Absence check using 88 positive place invariants in 1377 ms returned unknown
[2023-03-24 05:10:10] [INFO ] [Real]Absence check using 88 positive place invariants in 1307 ms returned unknown
[2023-03-24 05:10:15] [INFO ] [Real]Absence check using 88 positive place invariants in 1296 ms returned unknown
[2023-03-24 05:10:20] [INFO ] [Real]Absence check using 88 positive place invariants in 1406 ms returned unknown
[2023-03-24 05:10:25] [INFO ] [Real]Absence check using 88 positive place invariants in 1356 ms returned unknown
[2023-03-24 05:10:30] [INFO ] [Real]Absence check using 88 positive place invariants in 1288 ms returned unknown
[2023-03-24 05:10:35] [INFO ] [Real]Absence check using 88 positive place invariants in 1305 ms returned unknown
[2023-03-24 05:10:40] [INFO ] [Real]Absence check using 88 positive place invariants in 1286 ms returned unknown
[2023-03-24 05:10:45] [INFO ] [Real]Absence check using 88 positive place invariants in 1296 ms returned unknown
[2023-03-24 05:10:50] [INFO ] [Real]Absence check using 88 positive place invariants in 1274 ms returned unknown
[2023-03-24 05:10:55] [INFO ] [Real]Absence check using 88 positive place invariants in 1242 ms returned unknown
[2023-03-24 05:11:00] [INFO ] [Real]Absence check using 88 positive place invariants in 1244 ms returned unknown
[2023-03-24 05:11:05] [INFO ] [Real]Absence check using 88 positive place invariants in 1208 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 33, 33, 99, 1, 99, 99, 1, 33, 33, 33, 33, 99, 1, 33] Max seen :[0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1]
Support contains 16 out of 29770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 29770/29770 places, 44921/44921 transitions.
Graph (complete) has 99155 edges and 29770 vertex of which 29716 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.66 ms
Discarding 54 places :
Also discarding 0 output transitions
Drop transitions removed 9495 transitions
Trivial Post-agglo rules discarded 9495 transitions
Performed 9495 trivial Post agglomeration. Transition count delta: 9495
Iterating post reduction 0 with 9495 rules applied. Total rules applied 9496 place count 29716 transition count 35426
Reduce places removed 9495 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 9499 rules applied. Total rules applied 18995 place count 20221 transition count 35422
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 18999 place count 20217 transition count 35422
Performed 594 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 594 Pre rules applied. Total rules applied 18999 place count 20217 transition count 34828
Deduced a syphon composed of 594 places in 54 ms
Reduce places removed 594 places and 0 transitions.
Iterating global reduction 3 with 1188 rules applied. Total rules applied 20187 place count 19623 transition count 34828
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 100 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 20253 place count 19590 transition count 34795
Free-agglomeration rule (complex) applied 1574 times.
Iterating global reduction 3 with 1574 rules applied. Total rules applied 21827 place count 19590 transition count 33221
Reduce places removed 1574 places and 0 transitions.
Iterating post reduction 3 with 1574 rules applied. Total rules applied 23401 place count 18016 transition count 33221
Partial Free-agglomeration rule applied 3687 times.
Drop transitions removed 3687 transitions
Iterating global reduction 4 with 3687 rules applied. Total rules applied 27088 place count 18016 transition count 33221
Applied a total of 27088 rules in 12065 ms. Remains 18016 /29770 variables (removed 11754) and now considering 33221/44921 (removed 11700) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12072 ms. Remains : 18016/29770 places, 33221/44921 transitions.
Normalized transition count is 31656 out of 33221 initially.
// Phase 1: matrix 31656 rows 18016 cols
[2023-03-24 05:11:28] [INFO ] Computed 1769 place invariants in 10325 ms
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 299061 steps, including 5397 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 5
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 457435 steps, including 804 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen 2
Interrupted Best-First random walk after 460217 steps, including 809 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen 1
Interrupted Best-First random walk after 466544 steps, including 820 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen 2
Interrupted Best-First random walk after 463190 steps, including 814 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen 2
Interrupted Best-First random walk after 452487 steps, including 796 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 2
Interrupted Best-First random walk after 449682 steps, including 791 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 2
Interrupted Best-First random walk after 445731 steps, including 784 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 1
Interrupted Best-First random walk after 448467 steps, including 788 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 2
Interrupted Best-First random walk after 455529 steps, including 801 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen 1
Interrupted Best-First random walk after 457268 steps, including 804 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen 2
[2023-03-24 05:12:48] [INFO ] Flow matrix only has 31656 transitions (discarded 1565 similar events)
// Phase 1: matrix 31656 rows 18016 cols
[2023-03-24 05:12:58] [INFO ] Computed 1769 place invariants in 10461 ms
[2023-03-24 05:13:01] [INFO ] [Real]Absence check using 65 positive place invariants in 599 ms returned sat
[2023-03-24 05:13:02] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1374 ms returned sat
[2023-03-24 05:13:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:13:43] [INFO ] [Real]Absence check using state equation in 41236 ms returned unknown
[2023-03-24 05:13:46] [INFO ] [Real]Absence check using 65 positive place invariants in 587 ms returned sat
[2023-03-24 05:13:47] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1241 ms returned sat
[2023-03-24 05:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:14:28] [INFO ] [Real]Absence check using state equation in 41319 ms returned unknown
[2023-03-24 05:14:31] [INFO ] [Real]Absence check using 65 positive place invariants in 579 ms returned sat
[2023-03-24 05:14:31] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 684 ms returned unsat
[2023-03-24 05:14:34] [INFO ] [Real]Absence check using 65 positive place invariants in 577 ms returned sat
[2023-03-24 05:14:35] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1393 ms returned sat
[2023-03-24 05:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:15:16] [INFO ] [Real]Absence check using state equation in 41269 ms returned unknown
[2023-03-24 05:15:19] [INFO ] [Real]Absence check using 65 positive place invariants in 588 ms returned sat
[2023-03-24 05:15:19] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 543 ms returned unsat
[2023-03-24 05:15:22] [INFO ] [Real]Absence check using 65 positive place invariants in 580 ms returned sat
[2023-03-24 05:15:23] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1189 ms returned unsat
[2023-03-24 05:15:25] [INFO ] [Real]Absence check using 65 positive place invariants in 572 ms returned sat
[2023-03-24 05:15:27] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1338 ms returned sat
[2023-03-24 05:15:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:16:08] [INFO ] [Real]Absence check using state equation in 41311 ms returned unknown
[2023-03-24 05:16:10] [INFO ] [Real]Absence check using 65 positive place invariants in 576 ms returned sat
[2023-03-24 05:16:12] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1252 ms returned sat
[2023-03-24 05:16:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:16:53] [INFO ] [Real]Absence check using state equation in 41378 ms returned unknown
[2023-03-24 05:16:55] [INFO ] [Real]Absence check using 65 positive place invariants in 594 ms returned sat
[2023-03-24 05:16:57] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1375 ms returned sat
[2023-03-24 05:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:17:38] [INFO ] [Real]Absence check using state equation in 41255 ms returned unknown
[2023-03-24 05:17:40] [INFO ] [Real]Absence check using 65 positive place invariants in 584 ms returned sat
[2023-03-24 05:17:42] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1342 ms returned sat
[2023-03-24 05:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:18:23] [INFO ] [Real]Absence check using state equation in 41290 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 2, 1] Max seen :[0, 0, 1, 0, 1, 1, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 18016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18016/18016 places, 33221/33221 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 18016 transition count 33217
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 18012 transition count 33217
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 15 place count 18012 transition count 33210
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 22 place count 18005 transition count 33210
Applied a total of 22 rules in 2807 ms. Remains 18005 /18016 variables (removed 11) and now considering 33210/33221 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2807 ms. Remains : 18005/18016 places, 33210/33221 transitions.
Normalized transition count is 31645 out of 33210 initially.
// Phase 1: matrix 31645 rows 18005 cols
[2023-03-24 05:18:37] [INFO ] Computed 1769 place invariants in 10805 ms
Interrupted random walk after 296951 steps, including 5363 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 1
FORMULA MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 447610 steps, including 787 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 448174 steps, including 788 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 448339 steps, including 788 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 449391 steps, including 790 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 453477 steps, including 797 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 0
Interrupted Best-First random walk after 454935 steps, including 800 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 0
[2023-03-24 05:19:37] [INFO ] Flow matrix only has 31645 transitions (discarded 1565 similar events)
// Phase 1: matrix 31645 rows 18005 cols
[2023-03-24 05:19:47] [INFO ] Computed 1769 place invariants in 10754 ms
[2023-03-24 05:19:50] [INFO ] [Real]Absence check using 65 positive place invariants in 589 ms returned sat
[2023-03-24 05:19:51] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1352 ms returned sat
[2023-03-24 05:19:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:20:33] [INFO ] [Real]Absence check using state equation in 41261 ms returned unknown
[2023-03-24 05:20:35] [INFO ] [Real]Absence check using 65 positive place invariants in 565 ms returned sat
[2023-03-24 05:20:36] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1036 ms returned sat
[2023-03-24 05:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:21:18] [INFO ] [Real]Absence check using state equation in 41626 ms returned unknown
[2023-03-24 05:21:20] [INFO ] [Real]Absence check using 65 positive place invariants in 571 ms returned sat
[2023-03-24 05:21:21] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1106 ms returned sat
[2023-03-24 05:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:22:03] [INFO ] [Real]Absence check using state equation in 41524 ms returned unknown
[2023-03-24 05:22:05] [INFO ] [Real]Absence check using 65 positive place invariants in 570 ms returned sat
[2023-03-24 05:22:06] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1094 ms returned sat
[2023-03-24 05:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:22:48] [INFO ] [Real]Absence check using state equation in 41537 ms returned unknown
[2023-03-24 05:22:50] [INFO ] [Real]Absence check using 65 positive place invariants in 561 ms returned sat
[2023-03-24 05:22:51] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 990 ms returned sat
[2023-03-24 05:22:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:23:33] [INFO ] [Real]Absence check using state equation in 41717 ms returned unknown
[2023-03-24 05:23:35] [INFO ] [Real]Absence check using 65 positive place invariants in 564 ms returned sat
[2023-03-24 05:23:36] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1000 ms returned sat
[2023-03-24 05:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:24:18] [INFO ] [Real]Absence check using state equation in 41677 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 2, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 18005 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18005/18005 places, 33210/33210 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18005 transition count 33209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18004 transition count 33209
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 18004 transition count 33208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 18003 transition count 33208
Applied a total of 4 rules in 2732 ms. Remains 18003 /18005 variables (removed 2) and now considering 33208/33210 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2733 ms. Remains : 18003/18005 places, 33208/33210 transitions.
Normalized transition count is 31643 out of 33208 initially.
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-24 05:24:30] [INFO ] Computed 1769 place invariants in 9221 ms
Interrupted random walk after 304343 steps, including 5497 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 464640 steps, including 817 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen 0
Interrupted Best-First random walk after 469413 steps, including 825 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen 0
Interrupted Best-First random walk after 468765 steps, including 824 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen 0
Interrupted Best-First random walk after 459618 steps, including 808 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen 0
Interrupted Best-First random walk after 467047 steps, including 821 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen 0
Interrupted Best-First random walk after 465565 steps, including 819 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen 0
[2023-03-24 05:25:30] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-24 05:25:39] [INFO ] Computed 1769 place invariants in 9182 ms
[2023-03-24 05:25:41] [INFO ] [Real]Absence check using 65 positive place invariants in 562 ms returned sat
[2023-03-24 05:25:42] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 926 ms returned sat
[2023-03-24 05:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:26:24] [INFO ] [Real]Absence check using state equation in 41824 ms returned unknown
[2023-03-24 05:26:26] [INFO ] [Real]Absence check using 65 positive place invariants in 576 ms returned sat
[2023-03-24 05:26:27] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 964 ms returned sat
[2023-03-24 05:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:27:09] [INFO ] [Real]Absence check using state equation in 41738 ms returned unknown
[2023-03-24 05:27:11] [INFO ] [Real]Absence check using 65 positive place invariants in 583 ms returned sat
[2023-03-24 05:27:12] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 954 ms returned sat
[2023-03-24 05:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:27:54] [INFO ] [Real]Absence check using state equation in 41715 ms returned unknown
[2023-03-24 05:27:56] [INFO ] [Real]Absence check using 65 positive place invariants in 572 ms returned sat
[2023-03-24 05:27:57] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 912 ms returned sat
[2023-03-24 05:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:28:39] [INFO ] [Real]Absence check using state equation in 41762 ms returned unknown
[2023-03-24 05:28:41] [INFO ] [Real]Absence check using 65 positive place invariants in 600 ms returned sat
[2023-03-24 05:28:42] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 986 ms returned sat
[2023-03-24 05:28:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:29:24] [INFO ] [Real]Absence check using state equation in 41676 ms returned unknown
[2023-03-24 05:29:26] [INFO ] [Real]Absence check using 65 positive place invariants in 561 ms returned sat
[2023-03-24 05:29:27] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 922 ms returned sat
[2023-03-24 05:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:30:09] [INFO ] [Real]Absence check using state equation in 41802 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 2, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 18003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Applied a total of 0 rules in 1242 ms. Remains 18003 /18003 variables (removed 0) and now considering 33208/33208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1242 ms. Remains : 18003/18003 places, 33208/33208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Applied a total of 0 rules in 1246 ms. Remains 18003 /18003 variables (removed 0) and now considering 33208/33208 (removed 0) transitions.
[2023-03-24 05:30:11] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
[2023-03-24 05:30:11] [INFO ] Invariant cache hit.
[2023-03-24 05:30:13] [INFO ] Implicit Places using invariants in 1432 ms returned []
Implicit Place search using SMT only with invariants took 1433 ms to find 0 implicit places.
[2023-03-24 05:30:13] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
[2023-03-24 05:30:13] [INFO ] Invariant cache hit.
[2023-03-24 05:30:14] [INFO ] Dead Transitions using invariants and state equation in 1450 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4138 ms. Remains : 18003/18003 places, 33208/33208 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00
Normalized transition count is 31643 out of 33208 initially.
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-24 05:30:24] [INFO ] Computed 1769 place invariants in 9360 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 980 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
[2023-03-24 05:30:25] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-24 05:30:34] [INFO ] Computed 1769 place invariants in 9169 ms
[2023-03-24 05:30:36] [INFO ] [Real]Absence check using 65 positive place invariants in 568 ms returned sat
[2023-03-24 05:30:37] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 947 ms returned sat
[2023-03-24 05:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:30:39] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18003 transition count 33206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 18001 transition count 33206
Applied a total of 4 rules in 2509 ms. Remains 18001 /18003 variables (removed 2) and now considering 33206/33208 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2511 ms. Remains : 18001/18003 places, 33206/33208 transitions.
Normalized transition count is 31640 out of 33206 initially.
// Phase 1: matrix 31640 rows 18001 cols
[2023-03-24 05:30:51] [INFO ] Computed 1769 place invariants in 9122 ms
Interrupted random walk after 305266 steps, including 5513 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 471787 steps, including 830 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
[2023-03-24 05:31:26] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2023-03-24 05:31:35] [INFO ] Computed 1769 place invariants in 9080 ms
[2023-03-24 05:31:37] [INFO ] [Real]Absence check using 65 positive place invariants in 558 ms returned sat
[2023-03-24 05:31:38] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 885 ms returned sat
[2023-03-24 05:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:32:20] [INFO ] [Real]Absence check using state equation in 41815 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1234 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1234 ms. Remains : 18001/18001 places, 33206/33206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1220 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
[2023-03-24 05:32:22] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
[2023-03-24 05:32:22] [INFO ] Invariant cache hit.
[2023-03-24 05:32:24] [INFO ] Implicit Places using invariants in 1444 ms returned []
Implicit Place search using SMT only with invariants took 1446 ms to find 0 implicit places.
[2023-03-24 05:32:24] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
[2023-03-24 05:32:24] [INFO ] Invariant cache hit.
[2023-03-24 05:32:25] [INFO ] Dead Transitions using invariants and state equation in 1403 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4077 ms. Remains : 18001/18001 places, 33206/33206 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-00 in 130861 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01
Normalized transition count is 31643 out of 33208 initially.
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-24 05:32:34] [INFO ] Computed 1769 place invariants in 9144 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 987 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
[2023-03-24 05:32:36] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-24 05:32:45] [INFO ] Computed 1769 place invariants in 9254 ms
[2023-03-24 05:32:47] [INFO ] [Real]Absence check using 65 positive place invariants in 565 ms returned sat
[2023-03-24 05:32:48] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 965 ms returned sat
[2023-03-24 05:32:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:32:50] [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: Stream closed... 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: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 18003 transition count 33207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 18002 transition count 33207
Applied a total of 2 rules in 2474 ms. Remains 18002 /18003 variables (removed 1) and now considering 33207/33208 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2475 ms. Remains : 18002/18003 places, 33207/33208 transitions.
Normalized transition count is 31642 out of 33207 initially.
// Phase 1: matrix 31642 rows 18002 cols
[2023-03-24 05:33:02] [INFO ] Computed 1769 place invariants in 9170 ms
Interrupted random walk after 307912 steps, including 5561 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 467049 steps, including 821 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen 0
[2023-03-24 05:33:37] [INFO ] Flow matrix only has 31642 transitions (discarded 1565 similar events)
// Phase 1: matrix 31642 rows 18002 cols
[2023-03-24 05:33:46] [INFO ] Computed 1769 place invariants in 9095 ms
[2023-03-24 05:33:48] [INFO ] [Real]Absence check using 65 positive place invariants in 575 ms returned sat
[2023-03-24 05:33:49] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1003 ms returned sat
[2023-03-24 05:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:34:31] [INFO ] [Real]Absence check using state equation in 41690 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18002/18002 places, 33207/33207 transitions.
Applied a total of 0 rules in 1238 ms. Remains 18002 /18002 variables (removed 0) and now considering 33207/33207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1239 ms. Remains : 18002/18002 places, 33207/33207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18002/18002 places, 33207/33207 transitions.
Applied a total of 0 rules in 1240 ms. Remains 18002 /18002 variables (removed 0) and now considering 33207/33207 (removed 0) transitions.
[2023-03-24 05:34:33] [INFO ] Flow matrix only has 31642 transitions (discarded 1565 similar events)
[2023-03-24 05:34:33] [INFO ] Invariant cache hit.
[2023-03-24 05:34:35] [INFO ] Implicit Places using invariants in 1390 ms returned []
Implicit Place search using SMT only with invariants took 1391 ms to find 0 implicit places.
[2023-03-24 05:34:35] [INFO ] Flow matrix only has 31642 transitions (discarded 1565 similar events)
[2023-03-24 05:34:35] [INFO ] Invariant cache hit.
[2023-03-24 05:34:36] [INFO ] Dead Transitions using invariants and state equation in 1385 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4023 ms. Remains : 18002/18002 places, 33207/33207 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-01 in 130686 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05
Normalized transition count is 31643 out of 33208 initially.
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-24 05:34:46] [INFO ] Computed 1769 place invariants in 9988 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 1000 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
[2023-03-24 05:34:47] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-24 05:34:56] [INFO ] Computed 1769 place invariants in 9192 ms
[2023-03-24 05:34:59] [INFO ] [Real]Absence check using 65 positive place invariants in 584 ms returned sat
[2023-03-24 05:35:00] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 970 ms returned sat
[2023-03-24 05:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:35:01] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18003 transition count 33206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 18001 transition count 33206
Applied a total of 4 rules in 2497 ms. Remains 18001 /18003 variables (removed 2) and now considering 33206/33208 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2498 ms. Remains : 18001/18003 places, 33206/33208 transitions.
Normalized transition count is 31640 out of 33206 initially.
// Phase 1: matrix 31640 rows 18001 cols
[2023-03-24 05:35:13] [INFO ] Computed 1769 place invariants in 9390 ms
Interrupted random walk after 306839 steps, including 5541 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 470795 steps, including 828 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
[2023-03-24 05:35:48] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2023-03-24 05:35:57] [INFO ] Computed 1769 place invariants in 9070 ms
[2023-03-24 05:36:00] [INFO ] [Real]Absence check using 65 positive place invariants in 564 ms returned sat
[2023-03-24 05:36:01] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 946 ms returned sat
[2023-03-24 05:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:36:42] [INFO ] [Real]Absence check using state equation in 41774 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1207 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1207 ms. Remains : 18001/18001 places, 33206/33206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1216 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
[2023-03-24 05:36:45] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
[2023-03-24 05:36:45] [INFO ] Invariant cache hit.
[2023-03-24 05:36:46] [INFO ] Implicit Places using invariants in 1412 ms returned []
Implicit Place search using SMT only with invariants took 1414 ms to find 0 implicit places.
[2023-03-24 05:36:46] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
[2023-03-24 05:36:46] [INFO ] Invariant cache hit.
[2023-03-24 05:36:48] [INFO ] Dead Transitions using invariants and state equation in 1387 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4026 ms. Remains : 18001/18001 places, 33206/33206 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-05 in 131691 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08
Normalized transition count is 31643 out of 33208 initially.
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-24 05:36:57] [INFO ] Computed 1769 place invariants in 9049 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 965 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
[2023-03-24 05:36:58] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-24 05:37:07] [INFO ] Computed 1769 place invariants in 9222 ms
[2023-03-24 05:37:09] [INFO ] [Real]Absence check using 65 positive place invariants in 550 ms returned sat
[2023-03-24 05:37:10] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 948 ms returned sat
[2023-03-24 05:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:37:12] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18003 transition count 33206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 18001 transition count 33206
Applied a total of 4 rules in 2448 ms. Remains 18001 /18003 variables (removed 2) and now considering 33206/33208 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2448 ms. Remains : 18001/18003 places, 33206/33208 transitions.
Normalized transition count is 31640 out of 33206 initially.
// Phase 1: matrix 31640 rows 18001 cols
[2023-03-24 05:37:24] [INFO ] Computed 1769 place invariants in 9037 ms
Interrupted random walk after 309909 steps, including 5599 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 471859 steps, including 830 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
[2023-03-24 05:37:59] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2023-03-24 05:38:08] [INFO ] Computed 1769 place invariants in 9210 ms
[2023-03-24 05:38:10] [INFO ] [Real]Absence check using 65 positive place invariants in 574 ms returned sat
[2023-03-24 05:38:11] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 989 ms returned sat
[2023-03-24 05:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:38:53] [INFO ] [Real]Absence check using state equation in 41751 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1302 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1303 ms. Remains : 18001/18001 places, 33206/33206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1294 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
[2023-03-24 05:38:55] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
[2023-03-24 05:38:55] [INFO ] Invariant cache hit.
[2023-03-24 05:38:57] [INFO ] Implicit Places using invariants in 1425 ms returned []
Implicit Place search using SMT only with invariants took 1426 ms to find 0 implicit places.
[2023-03-24 05:38:57] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
[2023-03-24 05:38:57] [INFO ] Invariant cache hit.
[2023-03-24 05:38:58] [INFO ] Dead Transitions using invariants and state equation in 1404 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4136 ms. Remains : 18001/18001 places, 33206/33206 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-08 in 130668 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13
Normalized transition count is 31643 out of 33208 initially.
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-24 05:39:08] [INFO ] Computed 1769 place invariants in 9282 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 971 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
[2023-03-24 05:39:09] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-24 05:39:18] [INFO ] Computed 1769 place invariants in 9269 ms
[2023-03-24 05:39:20] [INFO ] [Real]Absence check using 65 positive place invariants in 574 ms returned sat
[2023-03-24 05:39:21] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 980 ms returned sat
[2023-03-24 05:39:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:39:23] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 18003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 18003 transition count 33207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 18002 transition count 33207
Applied a total of 2 rules in 2468 ms. Remains 18002 /18003 variables (removed 1) and now considering 33207/33208 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2469 ms. Remains : 18002/18003 places, 33207/33208 transitions.
Normalized transition count is 31641 out of 33207 initially.
// Phase 1: matrix 31641 rows 18002 cols
[2023-03-24 05:39:35] [INFO ] Computed 1769 place invariants in 9089 ms
Interrupted random walk after 308732 steps, including 5577 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 467899 steps, including 823 resets, run timeout after 5001 ms. (steps per millisecond=93 ) properties seen 0
[2023-03-24 05:40:10] [INFO ] Flow matrix only has 31641 transitions (discarded 1566 similar events)
// Phase 1: matrix 31641 rows 18002 cols
[2023-03-24 05:40:19] [INFO ] Computed 1769 place invariants in 9432 ms
[2023-03-24 05:40:21] [INFO ] [Real]Absence check using 65 positive place invariants in 562 ms returned sat
[2023-03-24 05:40:22] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 1000 ms returned sat
[2023-03-24 05:40:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:41:04] [INFO ] [Real]Absence check using state equation in 41698 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 18002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18002/18002 places, 33207/33207 transitions.
Applied a total of 0 rules in 1256 ms. Remains 18002 /18002 variables (removed 0) and now considering 33207/33207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1256 ms. Remains : 18002/18002 places, 33207/33207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18002/18002 places, 33207/33207 transitions.
Applied a total of 0 rules in 1225 ms. Remains 18002 /18002 variables (removed 0) and now considering 33207/33207 (removed 0) transitions.
[2023-03-24 05:41:07] [INFO ] Flow matrix only has 31641 transitions (discarded 1566 similar events)
[2023-03-24 05:41:07] [INFO ] Invariant cache hit.
[2023-03-24 05:41:08] [INFO ] Implicit Places using invariants in 1404 ms returned []
Implicit Place search using SMT only with invariants took 1405 ms to find 0 implicit places.
[2023-03-24 05:41:08] [INFO ] Flow matrix only has 31641 transitions (discarded 1566 similar events)
[2023-03-24 05:41:08] [INFO ] Invariant cache hit.
[2023-03-24 05:41:09] [INFO ] Dead Transitions using invariants and state equation in 1386 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4028 ms. Remains : 18002/18002 places, 33207/33207 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-13 in 131094 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-14
Normalized transition count is 31643 out of 33208 initially.
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-24 05:41:18] [INFO ] Computed 1769 place invariants in 9085 ms
Incomplete random walk after 10000 steps, including 180 resets, run finished after 983 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
[2023-03-24 05:41:20] [INFO ] Flow matrix only has 31643 transitions (discarded 1565 similar events)
// Phase 1: matrix 31643 rows 18003 cols
[2023-03-24 05:41:29] [INFO ] Computed 1769 place invariants in 9049 ms
[2023-03-24 05:41:31] [INFO ] [Real]Absence check using 65 positive place invariants in 595 ms returned sat
[2023-03-24 05:41:32] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 959 ms returned sat
[2023-03-24 05:41:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:41:34] [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: Stream closed... 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: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18003/18003 places, 33208/33208 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18003 transition count 33206
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 18001 transition count 33206
Applied a total of 4 rules in 2486 ms. Remains 18001 /18003 variables (removed 2) and now considering 33206/33208 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2487 ms. Remains : 18001/18003 places, 33206/33208 transitions.
Normalized transition count is 31640 out of 33206 initially.
// Phase 1: matrix 31640 rows 18001 cols
[2023-03-24 05:41:45] [INFO ] Computed 1769 place invariants in 9042 ms
Interrupted random walk after 311180 steps, including 5620 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 471938 steps, including 830 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
[2023-03-24 05:42:20] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
// Phase 1: matrix 31640 rows 18001 cols
[2023-03-24 05:42:29] [INFO ] Computed 1769 place invariants in 9079 ms
[2023-03-24 05:42:32] [INFO ] [Real]Absence check using 65 positive place invariants in 557 ms returned sat
[2023-03-24 05:42:33] [INFO ] [Real]Absence check using 65 positive and 1704 generalized place invariants in 911 ms returned sat
[2023-03-24 05:42:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 05:43:14] [INFO ] [Real]Absence check using state equation in 41834 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 18001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1220 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1220 ms. Remains : 18001/18001 places, 33206/33206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18001/18001 places, 33206/33206 transitions.
Applied a total of 0 rules in 1217 ms. Remains 18001 /18001 variables (removed 0) and now considering 33206/33206 (removed 0) transitions.
[2023-03-24 05:43:17] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
[2023-03-24 05:43:17] [INFO ] Invariant cache hit.
[2023-03-24 05:43:18] [INFO ] Implicit Places using invariants in 1390 ms returned []
Implicit Place search using SMT only with invariants took 1391 ms to find 0 implicit places.
[2023-03-24 05:43:18] [INFO ] Flow matrix only has 31640 transitions (discarded 1566 similar events)
[2023-03-24 05:43:18] [INFO ] Invariant cache hit.
[2023-03-24 05:43:20] [INFO ] Dead Transitions using invariants and state equation in 1414 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4027 ms. Remains : 18001/18001 places, 33206/33206 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C09-UpperBounds-14 in 130272 ms.
[2023-03-24 05:43:22] [INFO ] Flatten gal took : 1716 ms
[2023-03-24 05:43:23] [INFO ] Applying decomposition
[2023-03-24 05:43:24] [INFO ] Flatten gal took : 1432 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15435278949807776077.txt' '-o' '/tmp/graph15435278949807776077.bin' '-w' '/tmp/graph15435278949807776077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15435278949807776077.bin' '-l' '-1' '-v' '-w' '/tmp/graph15435278949807776077.weights' '-q' '0' '-e' '0.001'
[2023-03-24 05:43:27] [INFO ] Decomposing Gal with order
[2023-03-24 05:43:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-24 05:44:01] [INFO ] Removed a total of 51002 redundant transitions.
[2023-03-24 05:44:05] [INFO ] Flatten gal took : 31585 ms
[2023-03-24 05:44:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 35985 labels/synchronizations in 8885 ms.
[2023-03-24 05:44:25] [INFO ] Time to serialize gal into /tmp/UpperBounds6490764550427536080.gal : 330 ms
[2023-03-24 05:44:25] [INFO ] Time to serialize properties into /tmp/UpperBounds16908708863678112586.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6490764550427536080.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16908708863678112586.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds16908708863678112586.prop.
ITS-tools command line returned an error code 137
[2023-03-24 05:55:27] [INFO ] Flatten gal took : 1615 ms
[2023-03-24 05:55:28] [INFO ] Time to serialize gal into /tmp/UpperBounds5931633304911466653.gal : 278 ms
[2023-03-24 05:55:28] [INFO ] Time to serialize properties into /tmp/UpperBounds8302228580573643095.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5931633304911466653.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8302228580573643095.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds8302228580573643095.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6943600 kB
After kill :
MemTotal: 16393232 kB
MemFree: 14872228 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-S32C09"
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-5348"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S32C09, 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 r229-tall-167856414000949"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C09.tgz
mv MultiCrashLeafsetExtension-PT-S32C09 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 ;