fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16215.579 3600000.00 3708728.00 30123.30 1 1 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-167856414000965.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-S32C11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856414000965
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 35M
-rw-r--r-- 1 mcc users 15K Feb 26 03:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 03:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 02:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 03:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 03:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 03:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 35M 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-S32C11-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679641969216

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-S32C11
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-24 07:12:50] [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 07:12:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 07:12:51] [INFO ] Load time of PNML (sax parser for PT used): 1041 ms
[2023-03-24 07:12:51] [INFO ] Transformed 34406 places.
[2023-03-24 07:12:51] [INFO ] Transformed 51525 transitions.
[2023-03-24 07:12:51] [INFO ] Parsed PT model containing 34406 places and 51525 transitions and 192310 arcs in 1291 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Normalized transition count is 50469 out of 51525 initially.
// Phase 1: matrix 50469 rows 34406 cols
[2023-03-24 07:13:00] [INFO ] Computed 1963 place invariants in 8186 ms
Incomplete random walk after 10000 steps, including 88 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 16) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 15) seen :0
[2023-03-24 07:13:02] [INFO ] Flow matrix only has 50469 transitions (discarded 1056 similar events)
// Phase 1: matrix 50469 rows 34406 cols
[2023-03-24 07:13:11] [INFO ] Computed 1963 place invariants in 8168 ms
[2023-03-24 07:13:31] [INFO ] [Real]Absence check using 92 positive place invariants in 116 ms returned unknown
[2023-03-24 07:13:36] [INFO ] [Real]Absence check using 92 positive place invariants in 185 ms returned unknown
[2023-03-24 07:13:41] [INFO ] [Real]Absence check using 92 positive place invariants in 155 ms returned unknown
[2023-03-24 07:13:46] [INFO ] [Real]Absence check using 92 positive place invariants in 274 ms returned unknown
[2023-03-24 07:13:51] [INFO ] [Real]Absence check using 92 positive place invariants in 377 ms returned unknown
[2023-03-24 07:13:56] [INFO ] [Real]Absence check using 92 positive place invariants in 288 ms returned unknown
[2023-03-24 07:14:01] [INFO ] [Real]Absence check using 92 positive place invariants in 181 ms returned unknown
[2023-03-24 07:14:06] [INFO ] [Real]Absence check using 92 positive place invariants in 124 ms returned unknown
[2023-03-24 07:14:11] [INFO ] [Real]Absence check using 92 positive place invariants in 263 ms returned unknown
[2023-03-24 07:14:21] [INFO ] [Real]Absence check using 92 positive place invariants in 199 ms returned unknown
Current structural bounds on expressions (after SMT) : [99, 33, 99, 1, 33, 33, 99, 33, 1, 99, 33, 33, 33, 33, 99] Max seen :[1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0]
Support contains 15 out of 34406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34406/34406 places, 51525/51525 transitions.
Graph (complete) has 112391 edges and 34406 vertex of which 34348 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.84 ms
Discarding 58 places :
Also discarding 0 output transitions
Drop transitions removed 11606 transitions
Trivial Post-agglo rules discarded 11606 transitions
Performed 11606 trivial Post agglomeration. Transition count delta: 11606
Iterating post reduction 0 with 11606 rules applied. Total rules applied 11607 place count 34348 transition count 39919
Reduce places removed 11606 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 11611 rules applied. Total rules applied 23218 place count 22742 transition count 39914
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 23223 place count 22737 transition count 39914
Performed 725 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 725 Pre rules applied. Total rules applied 23223 place count 22737 transition count 39189
Deduced a syphon composed of 725 places in 60 ms
Reduce places removed 725 places and 0 transitions.
Iterating global reduction 3 with 1450 rules applied. Total rules applied 24673 place count 22012 transition count 39189
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 122 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 24739 place count 21979 transition count 39156
Free-agglomeration rule (complex) applied 1579 times.
Iterating global reduction 3 with 1579 rules applied. Total rules applied 26318 place count 21979 transition count 37577
Reduce places removed 1579 places and 0 transitions.
Iterating post reduction 3 with 1579 rules applied. Total rules applied 27897 place count 20400 transition count 37577
Partial Free-agglomeration rule applied 4214 times.
Drop transitions removed 4214 transitions
Iterating global reduction 4 with 4214 rules applied. Total rules applied 32111 place count 20400 transition count 37577
Applied a total of 32111 rules in 14459 ms. Remains 20400 /34406 variables (removed 14006) and now considering 37577/51525 (removed 13948) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14467 ms. Remains : 20400/34406 places, 37577/51525 transitions.
Normalized transition count is 36011 out of 37577 initially.
// Phase 1: matrix 36011 rows 20400 cols
[2023-03-24 07:14:53] [INFO ] Computed 1905 place invariants in 12792 ms
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 254231 steps, including 3764 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 8
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 393487 steps, including 584 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 4
Interrupted Best-First random walk after 390273 steps, including 580 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 2
Interrupted Best-First random walk after 388134 steps, including 577 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen 2
Interrupted Best-First random walk after 388209 steps, including 577 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen 2
Interrupted Best-First random walk after 390410 steps, including 580 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 2
Interrupted Best-First random walk after 390977 steps, including 581 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 3
Interrupted Best-First random walk after 389138 steps, including 578 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen 4
Interrupted Best-First random walk after 382206 steps, including 568 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen 1
[2023-03-24 07:16:03] [INFO ] Flow matrix only has 36011 transitions (discarded 1566 similar events)
// Phase 1: matrix 36011 rows 20400 cols
[2023-03-24 07:16:18] [INFO ] Computed 1905 place invariants in 14373 ms
[2023-03-24 07:16:21] [INFO ] [Real]Absence check using 65 positive place invariants in 806 ms returned sat
[2023-03-24 07:16:22] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 925 ms returned unsat
[2023-03-24 07:16:25] [INFO ] [Real]Absence check using 65 positive place invariants in 742 ms returned sat
[2023-03-24 07:16:25] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 104 ms returned unsat
[2023-03-24 07:16:28] [INFO ] [Real]Absence check using 65 positive place invariants in 772 ms returned sat
[2023-03-24 07:16:29] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1168 ms returned sat
[2023-03-24 07:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:17:10] [INFO ] [Real]Absence check using state equation in 40973 ms returned unknown
[2023-03-24 07:17:13] [INFO ] [Real]Absence check using 65 positive place invariants in 823 ms returned sat
[2023-03-24 07:17:14] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1278 ms returned unsat
[2023-03-24 07:17:17] [INFO ] [Real]Absence check using 65 positive place invariants in 775 ms returned sat
[2023-03-24 07:17:18] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1198 ms returned sat
[2023-03-24 07:17:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:17:59] [INFO ] [Real]Absence check using state equation in 40939 ms returned unknown
[2023-03-24 07:18:02] [INFO ] [Real]Absence check using 65 positive place invariants in 757 ms returned sat
[2023-03-24 07:18:03] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1295 ms returned sat
[2023-03-24 07:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:18:44] [INFO ] [Real]Absence check using state equation in 40847 ms returned unknown
[2023-03-24 07:18:47] [INFO ] [Real]Absence check using 65 positive place invariants in 759 ms returned sat
[2023-03-24 07:18:47] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 382 ms returned unsat
[2023-03-24 07:18:50] [INFO ] [Real]Absence check using 65 positive place invariants in 775 ms returned sat
[2023-03-24 07:18:52] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1357 ms returned sat
[2023-03-24 07:18:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:19:32] [INFO ] [Real]Absence check using state equation in 40576 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 2] Max seen :[1, 1, 0, 1, 0, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 20400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20400/20400 places, 37577/37577 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 20400 transition count 37573
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 20396 transition count 37573
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 20396 transition count 37572
Deduced a syphon composed of 1 places in 28 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 20395 transition count 37572
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 17 place count 20395 transition count 37565
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 24 place count 20388 transition count 37565
Applied a total of 24 rules in 3157 ms. Remains 20388 /20400 variables (removed 12) and now considering 37565/37577 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3159 ms. Remains : 20388/20400 places, 37565/37577 transitions.
Normalized transition count is 35999 out of 37565 initially.
// Phase 1: matrix 35999 rows 20388 cols
[2023-03-24 07:19:48] [INFO ] Computed 1905 place invariants in 12417 ms
Interrupted random walk after 254592 steps, including 3772 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 388103 steps, including 577 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen 0
Interrupted Best-First random walk after 387936 steps, including 576 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen 0
Interrupted Best-First random walk after 353152 steps, including 525 resets, run timeout after 5001 ms. (steps per millisecond=70 ) properties seen 0
Interrupted Best-First random walk after 374513 steps, including 556 resets, run timeout after 5001 ms. (steps per millisecond=74 ) properties seen 0
[2023-03-24 07:20:38] [INFO ] Flow matrix only has 35999 transitions (discarded 1566 similar events)
// Phase 1: matrix 35999 rows 20388 cols
[2023-03-24 07:20:54] [INFO ] Computed 1905 place invariants in 15748 ms
[2023-03-24 07:20:57] [INFO ] [Real]Absence check using 65 positive place invariants in 760 ms returned sat
[2023-03-24 07:20:58] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1575 ms returned sat
[2023-03-24 07:20:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:21:39] [INFO ] [Real]Absence check using state equation in 40569 ms returned unknown
[2023-03-24 07:21:42] [INFO ] [Real]Absence check using 65 positive place invariants in 767 ms returned sat
[2023-03-24 07:21:43] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1168 ms returned sat
[2023-03-24 07:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:22:24] [INFO ] [Real]Absence check using state equation in 40942 ms returned unknown
[2023-03-24 07:22:27] [INFO ] [Real]Absence check using 65 positive place invariants in 812 ms returned sat
[2023-03-24 07:22:29] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1663 ms returned sat
[2023-03-24 07:22:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:23:09] [INFO ] [Real]Absence check using state equation in 40185 ms returned unknown
[2023-03-24 07:23:12] [INFO ] [Real]Absence check using 65 positive place invariants in 761 ms returned sat
[2023-03-24 07:23:13] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1195 ms returned sat
[2023-03-24 07:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:23:54] [INFO ] [Real]Absence check using state equation in 40911 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 2] Max seen :[0, 0, 0, 0]
Support contains 4 out of 20388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20388/20388 places, 37565/37565 transitions.
Applied a total of 0 rules in 1453 ms. Remains 20388 /20388 variables (removed 0) and now considering 37565/37565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1453 ms. Remains : 20388/20388 places, 37565/37565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20388/20388 places, 37565/37565 transitions.
Applied a total of 0 rules in 1459 ms. Remains 20388 /20388 variables (removed 0) and now considering 37565/37565 (removed 0) transitions.
[2023-03-24 07:23:57] [INFO ] Flow matrix only has 35999 transitions (discarded 1566 similar events)
[2023-03-24 07:23:57] [INFO ] Invariant cache hit.
[2023-03-24 07:23:59] [INFO ] Implicit Places using invariants in 1806 ms returned []
Implicit Place search using SMT only with invariants took 1807 ms to find 0 implicit places.
[2023-03-24 07:23:59] [INFO ] Flow matrix only has 35999 transitions (discarded 1566 similar events)
[2023-03-24 07:23:59] [INFO ] Invariant cache hit.
[2023-03-24 07:24:00] [INFO ] Dead Transitions using invariants and state equation in 1791 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5068 ms. Remains : 20388/20388 places, 37565/37565 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-04
Normalized transition count is 35999 out of 37565 initially.
// Phase 1: matrix 35999 rows 20388 cols
[2023-03-24 07:24:15] [INFO ] Computed 1905 place invariants in 14282 ms
Incomplete random walk after 10000 steps, including 148 resets, run finished after 1301 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
[2023-03-24 07:24:16] [INFO ] Flow matrix only has 35999 transitions (discarded 1566 similar events)
// Phase 1: matrix 35999 rows 20388 cols
[2023-03-24 07:24:30] [INFO ] Computed 1905 place invariants in 13936 ms
[2023-03-24 07:24:33] [INFO ] [Real]Absence check using 65 positive place invariants in 770 ms returned sat
[2023-03-24 07:24:35] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1281 ms returned sat
[2023-03-24 07:24:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:24:35] [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 20388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20388/20388 places, 37565/37565 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 20388 transition count 37564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20387 transition count 37564
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 20387 transition count 37562
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 20385 transition count 37562
Applied a total of 6 rules in 2975 ms. Remains 20385 /20388 variables (removed 3) and now considering 37562/37565 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2980 ms. Remains : 20385/20388 places, 37562/37565 transitions.
Normalized transition count is 35996 out of 37562 initially.
// Phase 1: matrix 35996 rows 20385 cols
[2023-03-24 07:24:52] [INFO ] Computed 1905 place invariants in 14262 ms
Interrupted random walk after 246639 steps, including 3654 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 364020 steps, including 541 resets, run timeout after 5001 ms. (steps per millisecond=72 ) properties seen 0
[2023-03-24 07:25:28] [INFO ] Flow matrix only has 35996 transitions (discarded 1566 similar events)
// Phase 1: matrix 35996 rows 20385 cols
[2023-03-24 07:25:41] [INFO ] Computed 1905 place invariants in 13243 ms
[2023-03-24 07:25:44] [INFO ] [Real]Absence check using 65 positive place invariants in 787 ms returned sat
[2023-03-24 07:25:45] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1303 ms returned sat
[2023-03-24 07:25:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:26:26] [INFO ] [Real]Absence check using state equation in 40611 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 20385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20385/20385 places, 37562/37562 transitions.
Applied a total of 0 rules in 1452 ms. Remains 20385 /20385 variables (removed 0) and now considering 37562/37562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1452 ms. Remains : 20385/20385 places, 37562/37562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20385/20385 places, 37562/37562 transitions.
Applied a total of 0 rules in 1396 ms. Remains 20385 /20385 variables (removed 0) and now considering 37562/37562 (removed 0) transitions.
[2023-03-24 07:26:29] [INFO ] Flow matrix only has 35996 transitions (discarded 1566 similar events)
[2023-03-24 07:26:29] [INFO ] Invariant cache hit.
[2023-03-24 07:26:30] [INFO ] Implicit Places using invariants in 1850 ms returned []
Implicit Place search using SMT only with invariants took 1856 ms to find 0 implicit places.
[2023-03-24 07:26:31] [INFO ] Flow matrix only has 35996 transitions (discarded 1566 similar events)
[2023-03-24 07:26:31] [INFO ] Invariant cache hit.
[2023-03-24 07:26:32] [INFO ] Dead Transitions using invariants and state equation in 1863 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5127 ms. Remains : 20385/20385 places, 37562/37562 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-04 in 152014 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-08
Normalized transition count is 35999 out of 37565 initially.
// Phase 1: matrix 35999 rows 20388 cols
[2023-03-24 07:26:47] [INFO ] Computed 1905 place invariants in 14464 ms
Incomplete random walk after 10000 steps, including 148 resets, run finished after 1199 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
[2023-03-24 07:26:48] [INFO ] Flow matrix only has 35999 transitions (discarded 1566 similar events)
// Phase 1: matrix 35999 rows 20388 cols
[2023-03-24 07:27:03] [INFO ] Computed 1905 place invariants in 14437 ms
[2023-03-24 07:27:06] [INFO ] [Real]Absence check using 65 positive place invariants in 768 ms returned sat
[2023-03-24 07:27:07] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1213 ms returned sat
[2023-03-24 07:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:27:08] [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 20388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20388/20388 places, 37565/37565 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 20388 transition count 37564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20387 transition count 37564
Applied a total of 2 rules in 2871 ms. Remains 20387 /20388 variables (removed 1) and now considering 37564/37565 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2877 ms. Remains : 20387/20388 places, 37564/37565 transitions.
Normalized transition count is 35998 out of 37564 initially.
// Phase 1: matrix 35998 rows 20387 cols
[2023-03-24 07:27:23] [INFO ] Computed 1905 place invariants in 12303 ms
Interrupted random walk after 252865 steps, including 3746 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 373517 steps, including 555 resets, run timeout after 5001 ms. (steps per millisecond=74 ) properties seen 0
[2023-03-24 07:27:58] [INFO ] Flow matrix only has 35998 transitions (discarded 1566 similar events)
// Phase 1: matrix 35998 rows 20387 cols
[2023-03-24 07:28:12] [INFO ] Computed 1905 place invariants in 14251 ms
[2023-03-24 07:28:15] [INFO ] [Real]Absence check using 65 positive place invariants in 790 ms returned sat
[2023-03-24 07:28:16] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1298 ms returned sat
[2023-03-24 07:28:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:28:57] [INFO ] [Real]Absence check using state equation in 40793 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 20387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20387/20387 places, 37564/37564 transitions.
Applied a total of 0 rules in 1419 ms. Remains 20387 /20387 variables (removed 0) and now considering 37564/37564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1419 ms. Remains : 20387/20387 places, 37564/37564 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20387/20387 places, 37564/37564 transitions.
Applied a total of 0 rules in 1410 ms. Remains 20387 /20387 variables (removed 0) and now considering 37564/37564 (removed 0) transitions.
[2023-03-24 07:29:00] [INFO ] Flow matrix only has 35998 transitions (discarded 1566 similar events)
[2023-03-24 07:29:00] [INFO ] Invariant cache hit.
[2023-03-24 07:29:02] [INFO ] Implicit Places using invariants in 1814 ms returned []
Implicit Place search using SMT only with invariants took 1815 ms to find 0 implicit places.
[2023-03-24 07:29:02] [INFO ] Flow matrix only has 35998 transitions (discarded 1566 similar events)
[2023-03-24 07:29:02] [INFO ] Invariant cache hit.
[2023-03-24 07:29:04] [INFO ] Dead Transitions using invariants and state equation in 1668 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4903 ms. Remains : 20387/20387 places, 37564/37564 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-08 in 151257 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-09
Normalized transition count is 35999 out of 37565 initially.
// Phase 1: matrix 35999 rows 20388 cols
[2023-03-24 07:29:18] [INFO ] Computed 1905 place invariants in 13917 ms
Incomplete random walk after 10000 steps, including 148 resets, run finished after 1193 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
[2023-03-24 07:29:19] [INFO ] Flow matrix only has 35999 transitions (discarded 1566 similar events)
// Phase 1: matrix 35999 rows 20388 cols
[2023-03-24 07:29:35] [INFO ] Computed 1905 place invariants in 15531 ms
[2023-03-24 07:29:37] [INFO ] [Real]Absence check using 65 positive place invariants in 796 ms returned sat
[2023-03-24 07:29:39] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1700 ms returned sat
[2023-03-24 07:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:29:40] [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 20388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20388/20388 places, 37565/37565 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 20388 transition count 37564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20387 transition count 37564
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 20387 transition count 37562
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 20385 transition count 37562
Applied a total of 6 rules in 3020 ms. Remains 20385 /20388 variables (removed 3) and now considering 37562/37565 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3021 ms. Remains : 20385/20388 places, 37562/37565 transitions.
Normalized transition count is 35996 out of 37562 initially.
// Phase 1: matrix 35996 rows 20385 cols
[2023-03-24 07:29:56] [INFO ] Computed 1905 place invariants in 13847 ms
Interrupted random walk after 256601 steps, including 3803 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 385551 steps, including 573 resets, run timeout after 5001 ms. (steps per millisecond=77 ) properties seen 0
[2023-03-24 07:30:31] [INFO ] Flow matrix only has 35996 transitions (discarded 1566 similar events)
// Phase 1: matrix 35996 rows 20385 cols
[2023-03-24 07:30:45] [INFO ] Computed 1905 place invariants in 13554 ms
[2023-03-24 07:30:48] [INFO ] [Real]Absence check using 65 positive place invariants in 766 ms returned sat
[2023-03-24 07:30:50] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1376 ms returned sat
[2023-03-24 07:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:31:30] [INFO ] [Real]Absence check using state equation in 40521 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 20385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20385/20385 places, 37562/37562 transitions.
Applied a total of 0 rules in 1390 ms. Remains 20385 /20385 variables (removed 0) and now considering 37562/37562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1390 ms. Remains : 20385/20385 places, 37562/37562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20385/20385 places, 37562/37562 transitions.
Applied a total of 0 rules in 1394 ms. Remains 20385 /20385 variables (removed 0) and now considering 37562/37562 (removed 0) transitions.
[2023-03-24 07:31:33] [INFO ] Flow matrix only has 35996 transitions (discarded 1566 similar events)
[2023-03-24 07:31:33] [INFO ] Invariant cache hit.
[2023-03-24 07:31:35] [INFO ] Implicit Places using invariants in 1713 ms returned []
Implicit Place search using SMT only with invariants took 1717 ms to find 0 implicit places.
[2023-03-24 07:31:35] [INFO ] Flow matrix only has 35996 transitions (discarded 1566 similar events)
[2023-03-24 07:31:35] [INFO ] Invariant cache hit.
[2023-03-24 07:31:36] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4823 ms. Remains : 20385/20385 places, 37562/37562 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-09 in 152669 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-15
Normalized transition count is 35999 out of 37565 initially.
// Phase 1: matrix 35999 rows 20388 cols
[2023-03-24 07:31:51] [INFO ] Computed 1905 place invariants in 14283 ms
Incomplete random walk after 10000 steps, including 147 resets, run finished after 1228 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
[2023-03-24 07:31:52] [INFO ] Flow matrix only has 35999 transitions (discarded 1566 similar events)
// Phase 1: matrix 35999 rows 20388 cols
[2023-03-24 07:32:11] [INFO ] Computed 1905 place invariants in 18772 ms
[2023-03-24 07:32:14] [INFO ] [Real]Absence check using 65 positive place invariants in 805 ms returned sat
[2023-03-24 07:32:16] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1840 ms returned sat
[2023-03-24 07:32:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:32:16] [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 20388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20388/20388 places, 37565/37565 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 20388 transition count 37564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20387 transition count 37564
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 20387 transition count 37563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 20386 transition count 37563
Applied a total of 4 rules in 3058 ms. Remains 20386 /20388 variables (removed 2) and now considering 37563/37565 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3059 ms. Remains : 20386/20388 places, 37563/37565 transitions.
Normalized transition count is 35997 out of 37563 initially.
// Phase 1: matrix 35997 rows 20386 cols
[2023-03-24 07:32:33] [INFO ] Computed 1905 place invariants in 14301 ms
Interrupted random walk after 250157 steps, including 3706 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 378693 steps, including 563 resets, run timeout after 5001 ms. (steps per millisecond=75 ) properties seen 0
[2023-03-24 07:33:08] [INFO ] Flow matrix only has 35997 transitions (discarded 1566 similar events)
// Phase 1: matrix 35997 rows 20386 cols
[2023-03-24 07:33:21] [INFO ] Computed 1905 place invariants in 12794 ms
[2023-03-24 07:33:24] [INFO ] [Real]Absence check using 65 positive place invariants in 753 ms returned sat
[2023-03-24 07:33:25] [INFO ] [Real]Absence check using 65 positive and 1840 generalized place invariants in 1226 ms returned sat
[2023-03-24 07:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:34:06] [INFO ] [Real]Absence check using state equation in 40729 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 20386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20386/20386 places, 37563/37563 transitions.
Applied a total of 0 rules in 1361 ms. Remains 20386 /20386 variables (removed 0) and now considering 37563/37563 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1361 ms. Remains : 20386/20386 places, 37563/37563 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20386/20386 places, 37563/37563 transitions.
Applied a total of 0 rules in 1348 ms. Remains 20386 /20386 variables (removed 0) and now considering 37563/37563 (removed 0) transitions.
[2023-03-24 07:34:09] [INFO ] Flow matrix only has 35997 transitions (discarded 1566 similar events)
[2023-03-24 07:34:09] [INFO ] Invariant cache hit.
[2023-03-24 07:34:11] [INFO ] Implicit Places using invariants in 1679 ms returned []
Implicit Place search using SMT only with invariants took 1680 ms to find 0 implicit places.
[2023-03-24 07:34:11] [INFO ] Flow matrix only has 35997 transitions (discarded 1566 similar events)
[2023-03-24 07:34:11] [INFO ] Invariant cache hit.
[2023-03-24 07:34:12] [INFO ] Dead Transitions using invariants and state equation in 1824 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4869 ms. Remains : 20386/20386 places, 37563/37563 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C11-UpperBounds-15 in 156048 ms.
[2023-03-24 07:34:15] [INFO ] Flatten gal took : 2155 ms
[2023-03-24 07:34:16] [INFO ] Applying decomposition
[2023-03-24 07:34:18] [INFO ] Flatten gal took : 1791 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/graph18285717196619421422.txt' '-o' '/tmp/graph18285717196619421422.bin' '-w' '/tmp/graph18285717196619421422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18285717196619421422.bin' '-l' '-1' '-v' '-w' '/tmp/graph18285717196619421422.weights' '-q' '0' '-e' '0.001'
[2023-03-24 07:34:22] [INFO ] Decomposing Gal with order
[2023-03-24 07:34:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-24 07:34:54] [INFO ] Removed a total of 68615 redundant transitions.
[2023-03-24 07:35:00] [INFO ] Flatten gal took : 29583 ms
[2023-03-24 07:35:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 35645 labels/synchronizations in 12894 ms.
[2023-03-24 07:35:29] [INFO ] Time to serialize gal into /tmp/UpperBounds9200153554152282810.gal : 355 ms
[2023-03-24 07:35:29] [INFO ] Time to serialize properties into /tmp/UpperBounds16749869780161387661.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/UpperBounds9200153554152282810.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16749869780161387661.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/UpperBounds16749869780161387661.prop.
ITS-tools command line returned an error code 137
[2023-03-24 07:46:11] [INFO ] Flatten gal took : 4136 ms
[2023-03-24 07:46:12] [INFO ] Time to serialize gal into /tmp/UpperBounds3033171346532575291.gal : 533 ms
[2023-03-24 07:46:12] [INFO ] Time to serialize properties into /tmp/UpperBounds9150397073740669523.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/UpperBounds3033171346532575291.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9150397073740669523.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/UpperBounds9150397073740669523.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393228 kB
MemFree: 7104632 kB
After kill :
MemTotal: 16393228 kB
MemFree: 10896996 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-S32C11"
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-S32C11, 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-167856414000965"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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