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.r231-tall-167856416800957.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 lolaxred
Input is MultiCrashLeafsetExtension-PT-S32C10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416800957
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 33M
-rw-r--r-- 1 mcc users 11K Feb 26 03:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 03:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K 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 16K Feb 26 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 03:13 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 32M 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-S32C10-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679520362900

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C10
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 21:26:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 21:26:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 21:26:05] [INFO ] Load time of PNML (sax parser for PT used): 921 ms
[2023-03-22 21:26:05] [INFO ] Transformed 32088 places.
[2023-03-22 21:26:05] [INFO ] Transformed 48223 transitions.
[2023-03-22 21:26:05] [INFO ] Parsed PT model containing 32088 places and 48223 transitions and 181342 arcs in 1220 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Normalized transition count is 47167 out of 48223 initially.
// Phase 1: matrix 47167 rows 32088 cols
[2023-03-22 21:26:16] [INFO ] Computed 1893 place invariants in 10245 ms
Incomplete random walk after 10000 steps, including 97 resets, run finished after 536 ms. (steps per millisecond=18 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 16) seen :2
[2023-03-22 21:26:18] [INFO ] Flow matrix only has 47167 transitions (discarded 1056 similar events)
// Phase 1: matrix 47167 rows 32088 cols
[2023-03-22 21:26:27] [INFO ] Computed 1893 place invariants in 9011 ms
[2023-03-22 21:26:32] [INFO ] [Real]Absence check using 90 positive place invariants in 496 ms returned unknown
[2023-03-22 21:26:37] [INFO ] [Real]Absence check using 90 positive place invariants in 848 ms returned unknown
[2023-03-22 21:26:42] [INFO ] [Real]Absence check using 90 positive place invariants in 765 ms returned unknown
[2023-03-22 21:26:47] [INFO ] [Real]Absence check using 90 positive place invariants in 804 ms returned unknown
[2023-03-22 21:26:52] [INFO ] [Real]Absence check using 90 positive place invariants in 843 ms returned unknown
[2023-03-22 21:26:57] [INFO ] [Real]Absence check using 90 positive place invariants in 784 ms returned unknown
[2023-03-22 21:27:02] [INFO ] [Real]Absence check using 90 positive place invariants in 690 ms returned unknown
[2023-03-22 21:27:07] [INFO ] [Real]Absence check using 90 positive place invariants in 855 ms returned unknown
[2023-03-22 21:27:12] [INFO ] [Real]Absence check using 90 positive place invariants in 875 ms returned unknown
[2023-03-22 21:27:17] [INFO ] [Real]Absence check using 90 positive place invariants in 793 ms returned unknown
[2023-03-22 21:27:22] [INFO ] [Real]Absence check using 90 positive place invariants in 834 ms returned unknown
[2023-03-22 21:27:27] [INFO ] [Real]Absence check using 90 positive place invariants in 756 ms returned unknown
[2023-03-22 21:27:32] [INFO ] [Real]Absence check using 90 positive place invariants in 886 ms returned unknown
[2023-03-22 21:27:37] [INFO ] [Real]Absence check using 90 positive place invariants in 856 ms returned unknown
[2023-03-22 21:27:42] [INFO ] [Real]Absence check using 90 positive place invariants in 709 ms returned unknown
[2023-03-22 21:27:47] [INFO ] [Real]Absence check using 90 positive place invariants in 743 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 33, 99, 33, 33, 99, 33, 1, 33, 99, 1, 33, 1, 1, 33, 33] Max seen :[0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
Support contains 16 out of 32088 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32088/32088 places, 48223/48223 transitions.
Graph (complete) has 105773 edges and 32088 vertex of which 32032 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.76 ms
Discarding 56 places :
Also discarding 0 output transitions
Drop transitions removed 10550 transitions
Trivial Post-agglo rules discarded 10550 transitions
Performed 10550 trivial Post agglomeration. Transition count delta: 10550
Iterating post reduction 0 with 10550 rules applied. Total rules applied 10551 place count 32032 transition count 37673
Reduce places removed 10550 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 10553 rules applied. Total rules applied 21104 place count 21482 transition count 37670
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21107 place count 21479 transition count 37670
Performed 660 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 660 Pre rules applied. Total rules applied 21107 place count 21479 transition count 37010
Deduced a syphon composed of 660 places in 62 ms
Reduce places removed 660 places and 0 transitions.
Iterating global reduction 3 with 1320 rules applied. Total rules applied 22427 place count 20819 transition count 37010
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 49 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 22493 place count 20786 transition count 36977
Free-agglomeration rule (complex) applied 1578 times.
Iterating global reduction 3 with 1578 rules applied. Total rules applied 24071 place count 20786 transition count 35399
Reduce places removed 1578 places and 0 transitions.
Iterating post reduction 3 with 1578 rules applied. Total rules applied 25649 place count 19208 transition count 35399
Partial Free-agglomeration rule applied 4214 times.
Drop transitions removed 4214 transitions
Iterating global reduction 4 with 4214 rules applied. Total rules applied 29863 place count 19208 transition count 35399
Applied a total of 29863 rules in 12747 ms. Remains 19208 /32088 variables (removed 12880) and now considering 35399/48223 (removed 12824) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12757 ms. Remains : 19208/32088 places, 35399/48223 transitions.
Normalized transition count is 33833 out of 35399 initially.
// Phase 1: matrix 33833 rows 19208 cols
[2023-03-22 21:28:13] [INFO ] Computed 1837 place invariants in 13411 ms
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 286317 steps, including 4660 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 7
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 441121 steps, including 709 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 2
Interrupted Best-First random walk after 431483 steps, including 694 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen 3
Interrupted Best-First random walk after 430170 steps, including 692 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen 2
Interrupted Best-First random walk after 437794 steps, including 704 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 1
Interrupted Best-First random walk after 436750 steps, including 702 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 0
Interrupted Best-First random walk after 436686 steps, including 702 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 2
Interrupted Best-First random walk after 436695 steps, including 702 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 2
Interrupted Best-First random walk after 438320 steps, including 705 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 1
Interrupted Best-First random walk after 438652 steps, including 705 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 3
Interrupted Best-First random walk after 439646 steps, including 707 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 3
[2023-03-22 21:29:33] [INFO ] Flow matrix only has 33833 transitions (discarded 1566 similar events)
// Phase 1: matrix 33833 rows 19208 cols
[2023-03-22 21:29:45] [INFO ] Computed 1837 place invariants in 11412 ms
[2023-03-22 21:29:48] [INFO ] [Real]Absence check using 65 positive place invariants in 701 ms returned sat
[2023-03-22 21:29:49] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1019 ms returned sat
[2023-03-22 21:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:30:30] [INFO ] [Real]Absence check using state equation in 41364 ms returned unknown
[2023-03-22 21:30:33] [INFO ] [Real]Absence check using 65 positive place invariants in 641 ms returned sat
[2023-03-22 21:30:34] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1029 ms returned sat
[2023-03-22 21:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:31:15] [INFO ] [Real]Absence check using state equation in 41406 ms returned unknown
[2023-03-22 21:31:18] [INFO ] [Real]Absence check using 65 positive place invariants in 667 ms returned sat
[2023-03-22 21:31:19] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 978 ms returned unsat
[2023-03-22 21:31:21] [INFO ] [Real]Absence check using 65 positive place invariants in 691 ms returned sat
[2023-03-22 21:31:23] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1322 ms returned sat
[2023-03-22 21:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:32:04] [INFO ] [Real]Absence check using state equation in 40984 ms returned unknown
[2023-03-22 21:32:06] [INFO ] [Real]Absence check using 65 positive place invariants in 649 ms returned sat
[2023-03-22 21:32:06] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 384 ms returned unsat
[2023-03-22 21:32:09] [INFO ] [Real]Absence check using 65 positive place invariants in 694 ms returned sat
[2023-03-22 21:32:10] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1092 ms returned sat
[2023-03-22 21:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:32:51] [INFO ] [Real]Absence check using state equation in 41254 ms returned unknown
[2023-03-22 21:32:54] [INFO ] [Real]Absence check using 65 positive place invariants in 686 ms returned sat
[2023-03-22 21:32:55] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 488 ms returned unsat
[2023-03-22 21:32:57] [INFO ] [Real]Absence check using 65 positive place invariants in 693 ms returned sat
[2023-03-22 21:32:59] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1295 ms returned sat
[2023-03-22 21:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:33:40] [INFO ] [Real]Absence check using state equation in 41045 ms returned unknown
[2023-03-22 21:33:42] [INFO ] [Real]Absence check using 65 positive place invariants in 649 ms returned sat
[2023-03-22 21:33:43] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1068 ms returned sat
[2023-03-22 21:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:34:25] [INFO ] [Real]Absence check using state equation in 41391 ms returned unknown
[2023-03-22 21:34:27] [INFO ] [Real]Absence check using 65 positive place invariants in 634 ms returned sat
[2023-03-22 21:34:28] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 965 ms returned sat
[2023-03-22 21:34:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:35:10] [INFO ] [Real]Absence check using state equation in 41548 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 1, 0, 1, 0, 1, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 19208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19208/19208 places, 35399/35399 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 19208 transition count 35394
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19203 transition count 35394
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 19203 transition count 35388
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 22 place count 19197 transition count 35388
Applied a total of 22 rules in 2704 ms. Remains 19197 /19208 variables (removed 11) and now considering 35388/35399 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2704 ms. Remains : 19197/19208 places, 35388/35399 transitions.
Normalized transition count is 33822 out of 35388 initially.
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:35:25] [INFO ] Computed 1837 place invariants in 12116 ms
Interrupted random walk after 293039 steps, including 4771 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 438958 steps, including 706 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 0
Interrupted Best-First random walk after 445896 steps, including 717 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 443637 steps, including 713 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
Interrupted Best-First random walk after 443571 steps, including 713 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
Interrupted Best-First random walk after 441815 steps, including 710 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
Interrupted Best-First random walk after 443009 steps, including 712 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
Interrupted Best-First random walk after 445343 steps, including 716 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
[2023-03-22 21:36:30] [INFO ] Flow matrix only has 33822 transitions (discarded 1566 similar events)
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:36:42] [INFO ] Computed 1837 place invariants in 12104 ms
[2023-03-22 21:36:44] [INFO ] [Real]Absence check using 65 positive place invariants in 673 ms returned sat
[2023-03-22 21:36:45] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1097 ms returned sat
[2023-03-22 21:36:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:37:27] [INFO ] [Real]Absence check using state equation in 41291 ms returned unknown
[2023-03-22 21:37:29] [INFO ] [Real]Absence check using 65 positive place invariants in 651 ms returned sat
[2023-03-22 21:37:30] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1077 ms returned sat
[2023-03-22 21:37:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:38:12] [INFO ] [Real]Absence check using state equation in 41398 ms returned unknown
[2023-03-22 21:38:14] [INFO ] [Real]Absence check using 65 positive place invariants in 683 ms returned sat
[2023-03-22 21:38:16] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1163 ms returned sat
[2023-03-22 21:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:38:57] [INFO ] [Real]Absence check using state equation in 41209 ms returned unknown
[2023-03-22 21:38:59] [INFO ] [Real]Absence check using 65 positive place invariants in 698 ms returned sat
[2023-03-22 21:39:01] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1152 ms returned sat
[2023-03-22 21:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:39:42] [INFO ] [Real]Absence check using state equation in 41200 ms returned unknown
[2023-03-22 21:39:44] [INFO ] [Real]Absence check using 65 positive place invariants in 692 ms returned sat
[2023-03-22 21:39:46] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1194 ms returned sat
[2023-03-22 21:39:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:40:27] [INFO ] [Real]Absence check using state equation in 41204 ms returned unknown
[2023-03-22 21:40:29] [INFO ] [Real]Absence check using 65 positive place invariants in 712 ms returned sat
[2023-03-22 21:40:31] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1152 ms returned sat
[2023-03-22 21:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:41:12] [INFO ] [Real]Absence check using state equation in 41227 ms returned unknown
[2023-03-22 21:41:14] [INFO ] [Real]Absence check using 65 positive place invariants in 690 ms returned sat
[2023-03-22 21:41:16] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1179 ms returned sat
[2023-03-22 21:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:41:57] [INFO ] [Real]Absence check using state equation in 41211 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 19197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19197/19197 places, 35388/35388 transitions.
Applied a total of 0 rules in 1333 ms. Remains 19197 /19197 variables (removed 0) and now considering 35388/35388 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1333 ms. Remains : 19197/19197 places, 35388/35388 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19197/19197 places, 35388/35388 transitions.
Applied a total of 0 rules in 1288 ms. Remains 19197 /19197 variables (removed 0) and now considering 35388/35388 (removed 0) transitions.
[2023-03-22 21:41:59] [INFO ] Flow matrix only has 33822 transitions (discarded 1566 similar events)
[2023-03-22 21:41:59] [INFO ] Invariant cache hit.
[2023-03-22 21:42:01] [INFO ] Implicit Places using invariants in 1506 ms returned []
Implicit Place search using SMT only with invariants took 1509 ms to find 0 implicit places.
[2023-03-22 21:42:01] [INFO ] Flow matrix only has 33822 transitions (discarded 1566 similar events)
[2023-03-22 21:42:01] [INFO ] Invariant cache hit.
[2023-03-22 21:42:02] [INFO ] Dead Transitions using invariants and state equation in 1489 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4296 ms. Remains : 19197/19197 places, 35388/35388 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00
Normalized transition count is 33822 out of 35388 initially.
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:42:14] [INFO ] Computed 1837 place invariants in 11267 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1064 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
[2023-03-22 21:42:15] [INFO ] Flow matrix only has 33822 transitions (discarded 1566 similar events)
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:42:27] [INFO ] Computed 1837 place invariants in 11675 ms
[2023-03-22 21:42:29] [INFO ] [Real]Absence check using 65 positive place invariants in 674 ms returned sat
[2023-03-22 21:42:30] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1071 ms returned sat
[2023-03-22 21:42:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:42:32] [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 19197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19197/19197 places, 35388/35388 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 19197 transition count 35386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19195 transition count 35386
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 19195 transition count 35384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 19193 transition count 35384
Applied a total of 8 rules in 2761 ms. Remains 19193 /19197 variables (removed 4) and now considering 35384/35388 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2764 ms. Remains : 19193/19197 places, 35384/35388 transitions.
Normalized transition count is 33818 out of 35384 initially.
// Phase 1: matrix 33818 rows 19193 cols
[2023-03-22 21:42:46] [INFO ] Computed 1837 place invariants in 11210 ms
Interrupted random walk after 293748 steps, including 4782 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 438034 steps, including 704 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 0
[2023-03-22 21:43:21] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2023-03-22 21:43:32] [INFO ] Computed 1837 place invariants in 11555 ms
[2023-03-22 21:43:35] [INFO ] [Real]Absence check using 65 positive place invariants in 659 ms returned sat
[2023-03-22 21:43:36] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1058 ms returned sat
[2023-03-22 21:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:44:17] [INFO ] [Real]Absence check using state equation in 41375 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1270 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1270 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1248 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
[2023-03-22 21:44:20] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2023-03-22 21:44:20] [INFO ] Invariant cache hit.
[2023-03-22 21:44:21] [INFO ] Implicit Places using invariants in 1500 ms returned []
Implicit Place search using SMT only with invariants took 1501 ms to find 0 implicit places.
[2023-03-22 21:44:21] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2023-03-22 21:44:21] [INFO ] Invariant cache hit.
[2023-03-22 21:44:23] [INFO ] Dead Transitions using invariants and state equation in 1536 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4293 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00 in 140465 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01
Normalized transition count is 33822 out of 35388 initially.
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:44:35] [INFO ] Computed 1837 place invariants in 12005 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1066 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
[2023-03-22 21:44:36] [INFO ] Flow matrix only has 33822 transitions (discarded 1566 similar events)
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:44:49] [INFO ] Computed 1837 place invariants in 12389 ms
[2023-03-22 21:44:51] [INFO ] [Real]Absence check using 65 positive place invariants in 645 ms returned sat
[2023-03-22 21:44:52] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1268 ms returned sat
[2023-03-22 21:44:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:44:54] [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 19197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19197/19197 places, 35388/35388 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 19197 transition count 35387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19196 transition count 35387
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 19196 transition count 35386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 19195 transition count 35386
Applied a total of 4 rules in 2757 ms. Remains 19195 /19197 variables (removed 2) and now considering 35386/35388 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2759 ms. Remains : 19195/19197 places, 35386/35388 transitions.
Normalized transition count is 33820 out of 35386 initially.
// Phase 1: matrix 33820 rows 19195 cols
[2023-03-22 21:45:08] [INFO ] Computed 1837 place invariants in 11531 ms
Interrupted random walk after 291503 steps, including 4746 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 443387 steps, including 713 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
[2023-03-22 21:45:43] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2023-03-22 21:45:54] [INFO ] Computed 1837 place invariants in 11223 ms
[2023-03-22 21:45:57] [INFO ] [Real]Absence check using 65 positive place invariants in 661 ms returned sat
[2023-03-22 21:45:58] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1074 ms returned sat
[2023-03-22 21:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:46:39] [INFO ] [Real]Absence check using state equation in 41334 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1272 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1272 ms. Remains : 19195/19195 places, 35386/35386 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1272 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
[2023-03-22 21:46:42] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
[2023-03-22 21:46:42] [INFO ] Invariant cache hit.
[2023-03-22 21:46:43] [INFO ] Implicit Places using invariants in 1519 ms returned []
Implicit Place search using SMT only with invariants took 1520 ms to find 0 implicit places.
[2023-03-22 21:46:43] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
[2023-03-22 21:46:43] [INFO ] Invariant cache hit.
[2023-03-22 21:46:45] [INFO ] Dead Transitions using invariants and state equation in 1507 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4309 ms. Remains : 19195/19195 places, 35386/35386 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01 in 141885 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04
Normalized transition count is 33822 out of 35388 initially.
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:46:56] [INFO ] Computed 1837 place invariants in 11147 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1051 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
[2023-03-22 21:46:57] [INFO ] Flow matrix only has 33822 transitions (discarded 1566 similar events)
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:47:08] [INFO ] Computed 1837 place invariants in 11312 ms
[2023-03-22 21:47:11] [INFO ] [Real]Absence check using 65 positive place invariants in 669 ms returned sat
[2023-03-22 21:47:12] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1070 ms returned sat
[2023-03-22 21:47:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:47:14] [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: Stream close... 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: Stream close...
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 19197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19197/19197 places, 35388/35388 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 19197 transition count 35387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19196 transition count 35387
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 19196 transition count 35386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 19195 transition count 35386
Applied a total of 4 rules in 2777 ms. Remains 19195 /19197 variables (removed 2) and now considering 35386/35388 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2782 ms. Remains : 19195/19197 places, 35386/35388 transitions.
Normalized transition count is 33820 out of 35386 initially.
// Phase 1: matrix 33820 rows 19195 cols
[2023-03-22 21:47:27] [INFO ] Computed 1837 place invariants in 11081 ms
Interrupted random walk after 289938 steps, including 4719 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 451409 steps, including 726 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 0
[2023-03-22 21:48:02] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
// Phase 1: matrix 33820 rows 19195 cols
[2023-03-22 21:48:13] [INFO ] Computed 1837 place invariants in 10995 ms
[2023-03-22 21:48:16] [INFO ] [Real]Absence check using 65 positive place invariants in 628 ms returned sat
[2023-03-22 21:48:17] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1010 ms returned sat
[2023-03-22 21:48:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:48:58] [INFO ] [Real]Absence check using state equation in 41527 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1262 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1262 ms. Remains : 19195/19195 places, 35386/35386 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19195/19195 places, 35386/35386 transitions.
Applied a total of 0 rules in 1258 ms. Remains 19195 /19195 variables (removed 0) and now considering 35386/35386 (removed 0) transitions.
[2023-03-22 21:49:01] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
[2023-03-22 21:49:01] [INFO ] Invariant cache hit.
[2023-03-22 21:49:02] [INFO ] Implicit Places using invariants in 1460 ms returned []
Implicit Place search using SMT only with invariants took 1460 ms to find 0 implicit places.
[2023-03-22 21:49:02] [INFO ] Flow matrix only has 33820 transitions (discarded 1566 similar events)
[2023-03-22 21:49:02] [INFO ] Invariant cache hit.
[2023-03-22 21:49:04] [INFO ] Dead Transitions using invariants and state equation in 1458 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4181 ms. Remains : 19195/19195 places, 35386/35386 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04 in 139137 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07
Normalized transition count is 33822 out of 35388 initially.
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:49:15] [INFO ] Computed 1837 place invariants in 11269 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1048 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
[2023-03-22 21:49:16] [INFO ] Flow matrix only has 33822 transitions (discarded 1566 similar events)
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:49:28] [INFO ] Computed 1837 place invariants in 11309 ms
[2023-03-22 21:49:30] [INFO ] [Real]Absence check using 65 positive place invariants in 683 ms returned sat
[2023-03-22 21:49:31] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1029 ms returned sat
[2023-03-22 21:49:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:49:33] [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 19197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19197/19197 places, 35388/35388 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 19197 transition count 35386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19195 transition count 35386
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 19195 transition count 35384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 19193 transition count 35384
Applied a total of 8 rules in 2781 ms. Remains 19193 /19197 variables (removed 4) and now considering 35384/35388 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2783 ms. Remains : 19193/19197 places, 35384/35388 transitions.
Normalized transition count is 33818 out of 35384 initially.
// Phase 1: matrix 33818 rows 19193 cols
[2023-03-22 21:49:47] [INFO ] Computed 1837 place invariants in 11225 ms
Interrupted random walk after 291868 steps, including 4751 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 440832 steps, including 709 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
[2023-03-22 21:50:22] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2023-03-22 21:50:33] [INFO ] Computed 1837 place invariants in 11618 ms
[2023-03-22 21:50:36] [INFO ] [Real]Absence check using 65 positive place invariants in 627 ms returned sat
[2023-03-22 21:50:37] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1028 ms returned sat
[2023-03-22 21:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:51:18] [INFO ] [Real]Absence check using state equation in 41515 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1246 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1246 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1235 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
[2023-03-22 21:51:21] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2023-03-22 21:51:21] [INFO ] Invariant cache hit.
[2023-03-22 21:51:22] [INFO ] Implicit Places using invariants in 1473 ms returned []
Implicit Place search using SMT only with invariants took 1474 ms to find 0 implicit places.
[2023-03-22 21:51:22] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2023-03-22 21:51:22] [INFO ] Invariant cache hit.
[2023-03-22 21:51:24] [INFO ] Dead Transitions using invariants and state equation in 1499 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4216 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07 in 140031 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10
Normalized transition count is 33822 out of 35388 initially.
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:51:35] [INFO ] Computed 1837 place invariants in 11163 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 982 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
[2023-03-22 21:51:36] [INFO ] Flow matrix only has 33822 transitions (discarded 1566 similar events)
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:51:48] [INFO ] Computed 1837 place invariants in 11235 ms
[2023-03-22 21:51:50] [INFO ] [Real]Absence check using 65 positive place invariants in 661 ms returned sat
[2023-03-22 21:51:51] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1050 ms returned sat
[2023-03-22 21:51:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:51:53] [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: Stream close... 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: Stream close...
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 19197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19197/19197 places, 35388/35388 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 19197 transition count 35386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19195 transition count 35386
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 19195 transition count 35384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 19193 transition count 35384
Applied a total of 8 rules in 2639 ms. Remains 19193 /19197 variables (removed 4) and now considering 35384/35388 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2640 ms. Remains : 19193/19197 places, 35384/35388 transitions.
Normalized transition count is 33818 out of 35384 initially.
// Phase 1: matrix 33818 rows 19193 cols
[2023-03-22 21:52:06] [INFO ] Computed 1837 place invariants in 11014 ms
Interrupted random walk after 293649 steps, including 4780 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 441072 steps, including 709 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen 0
[2023-03-22 21:52:41] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2023-03-22 21:52:53] [INFO ] Computed 1837 place invariants in 11274 ms
[2023-03-22 21:52:55] [INFO ] [Real]Absence check using 65 positive place invariants in 663 ms returned sat
[2023-03-22 21:52:56] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1029 ms returned sat
[2023-03-22 21:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:53:38] [INFO ] [Real]Absence check using state equation in 41401 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1251 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1251 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1257 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
[2023-03-22 21:53:40] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2023-03-22 21:53:40] [INFO ] Invariant cache hit.
[2023-03-22 21:53:42] [INFO ] Implicit Places using invariants in 1456 ms returned []
Implicit Place search using SMT only with invariants took 1456 ms to find 0 implicit places.
[2023-03-22 21:53:42] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2023-03-22 21:53:42] [INFO ] Invariant cache hit.
[2023-03-22 21:53:43] [INFO ] Dead Transitions using invariants and state equation in 1481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4201 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10 in 139065 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12
Normalized transition count is 33822 out of 35388 initially.
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:53:54] [INFO ] Computed 1837 place invariants in 11138 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1043 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
[2023-03-22 21:53:55] [INFO ] Flow matrix only has 33822 transitions (discarded 1566 similar events)
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:54:07] [INFO ] Computed 1837 place invariants in 11355 ms
[2023-03-22 21:54:09] [INFO ] [Real]Absence check using 65 positive place invariants in 671 ms returned sat
[2023-03-22 21:54:10] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1121 ms returned sat
[2023-03-22 21:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:54:12] [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 19197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19197/19197 places, 35388/35388 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 19197 transition count 35386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19195 transition count 35386
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 19195 transition count 35384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 19193 transition count 35384
Applied a total of 8 rules in 2779 ms. Remains 19193 /19197 variables (removed 4) and now considering 35384/35388 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2781 ms. Remains : 19193/19197 places, 35384/35388 transitions.
Normalized transition count is 33818 out of 35384 initially.
// Phase 1: matrix 33818 rows 19193 cols
[2023-03-22 21:54:26] [INFO ] Computed 1837 place invariants in 11734 ms
Interrupted random walk after 294439 steps, including 4795 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 434907 steps, including 699 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen 0
[2023-03-22 21:55:01] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2023-03-22 21:55:13] [INFO ] Computed 1837 place invariants in 11368 ms
[2023-03-22 21:55:15] [INFO ] [Real]Absence check using 65 positive place invariants in 640 ms returned sat
[2023-03-22 21:55:16] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 992 ms returned sat
[2023-03-22 21:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:55:58] [INFO ] [Real]Absence check using state equation in 41471 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1246 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1246 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1239 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
[2023-03-22 21:56:00] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2023-03-22 21:56:00] [INFO ] Invariant cache hit.
[2023-03-22 21:56:02] [INFO ] Implicit Places using invariants in 1493 ms returned []
Implicit Place search using SMT only with invariants took 1494 ms to find 0 implicit places.
[2023-03-22 21:56:02] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2023-03-22 21:56:02] [INFO ] Invariant cache hit.
[2023-03-22 21:56:03] [INFO ] Dead Transitions using invariants and state equation in 1481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4223 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12 in 140202 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13
Normalized transition count is 33822 out of 35388 initially.
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:56:15] [INFO ] Computed 1837 place invariants in 11233 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 1046 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
[2023-03-22 21:56:16] [INFO ] Flow matrix only has 33822 transitions (discarded 1566 similar events)
// Phase 1: matrix 33822 rows 19197 cols
[2023-03-22 21:56:27] [INFO ] Computed 1837 place invariants in 11350 ms
[2023-03-22 21:56:30] [INFO ] [Real]Absence check using 65 positive place invariants in 702 ms returned sat
[2023-03-22 21:56:31] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 1052 ms returned sat
[2023-03-22 21:56:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:56:32] [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 19197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19197/19197 places, 35388/35388 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 19197 transition count 35386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19195 transition count 35386
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 19195 transition count 35384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 19193 transition count 35384
Applied a total of 8 rules in 2638 ms. Remains 19193 /19197 variables (removed 4) and now considering 35384/35388 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2639 ms. Remains : 19193/19197 places, 35384/35388 transitions.
Normalized transition count is 33818 out of 35384 initially.
// Phase 1: matrix 33818 rows 19193 cols
[2023-03-22 21:56:46] [INFO ] Computed 1837 place invariants in 11228 ms
Interrupted random walk after 302406 steps, including 4923 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 451716 steps, including 726 resets, run timeout after 5001 ms. (steps per millisecond=90 ) properties seen 0
[2023-03-22 21:57:21] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
// Phase 1: matrix 33818 rows 19193 cols
[2023-03-22 21:57:32] [INFO ] Computed 1837 place invariants in 10922 ms
[2023-03-22 21:57:35] [INFO ] [Real]Absence check using 65 positive place invariants in 650 ms returned sat
[2023-03-22 21:57:35] [INFO ] [Real]Absence check using 65 positive and 1772 generalized place invariants in 977 ms returned sat
[2023-03-22 21:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:58:17] [INFO ] [Real]Absence check using state equation in 41500 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 19193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1204 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1204 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 19193/19193 places, 35384/35384 transitions.
Applied a total of 0 rules in 1200 ms. Remains 19193 /19193 variables (removed 0) and now considering 35384/35384 (removed 0) transitions.
[2023-03-22 21:58:19] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2023-03-22 21:58:19] [INFO ] Invariant cache hit.
[2023-03-22 21:58:21] [INFO ] Implicit Places using invariants in 1478 ms returned []
Implicit Place search using SMT only with invariants took 1478 ms to find 0 implicit places.
[2023-03-22 21:58:21] [INFO ] Flow matrix only has 33818 transitions (discarded 1566 similar events)
[2023-03-22 21:58:21] [INFO ] Invariant cache hit.
[2023-03-22 21:58:22] [INFO ] Dead Transitions using invariants and state equation in 1466 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4155 ms. Remains : 19193/19193 places, 35384/35384 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13 in 139124 ms.
[2023-03-22 21:58:25] [INFO ] Flatten gal took : 1788 ms
[2023-03-22 21:58:25] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 21:58:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 19197 places, 35388 transitions and 215204 arcs took 160 ms.
Total runtime 1940997 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MultiCrashLeafsetExtension-PT-S32C10
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
Upper Bounds

BK_STOP 1679522455590

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 5 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 10 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 15 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 20 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 25 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 35 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 40 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 45 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 50 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 55 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 60 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 65 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 70 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 75 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 80 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 85 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 90 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 95 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 100 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 105 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 110 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 115 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 120 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 125 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 131 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 140 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-00: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-01: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-04: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-07: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-10: BOUND 0 0 0 0 0 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-12: BOUND 0 0 0 0 1 0 0 0
MultiCrashLeafsetExtension-PT-S32C10-UpperBounds-13: BOUND 0 0 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 145 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 7
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 750 Killed lola --conf=$BIN_DIR/configfiles/upperboundsconf --formula=$DIR/UpperBounds.xml $DIR/model.pnml

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S32C10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is MultiCrashLeafsetExtension-PT-S32C10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r231-tall-167856416800957"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S32C10.tgz
mv MultiCrashLeafsetExtension-PT-S32C10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;