fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472282500655
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for RERS2020-PT-pb104

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16212.792 2079010.00 2812686.00 24908.80 ??????????FT???T normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282500655.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RERS2020-PT-pb104, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282500655
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 80M
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 7 17:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 17:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 7 17:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 6 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Jun 7 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Jun 7 17:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 7 17:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 79M Jun 6 12:11 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654912791184

Running Version 202205111006
[2022-06-11 01:59:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 01:59:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 01:59:55] [INFO ] Load time of PNML (sax parser for PT used): 2708 ms
[2022-06-11 01:59:55] [INFO ] Transformed 1353 places.
[2022-06-11 01:59:55] [INFO ] Transformed 143642 transitions.
[2022-06-11 01:59:55] [INFO ] Found NUPN structural information;
[2022-06-11 01:59:55] [INFO ] Parsed PT model containing 1353 places and 143642 transitions in 3200 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 113 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 13930 transitions
Reduce redundant transitions removed 13930 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1568 ms. (steps per millisecond=6 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 4784 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4784 steps, saw 3670 distinct states, run finished after 3007 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 16 properties.
[2022-06-11 02:00:02] [INFO ] Flow matrix only has 96758 transitions (discarded 32954 similar events)
// Phase 1: matrix 96758 rows 1353 cols
[2022-06-11 02:00:02] [INFO ] Computed 17 place invariants in 593 ms
[2022-06-11 02:00:03] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-06-11 02:00:03] [INFO ] [Real]Absence check using 9 positive and 8 generalized place invariants in 23 ms returned sat
[2022-06-11 02:00:27] [INFO ] After 24158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:15
[2022-06-11 02:00:30] [INFO ] State equation strengthened by 3455 read => feed constraints.
[2022-06-11 02:00:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 02:00:30] [INFO ] After 27202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 268 out of 1353 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1353/1353 places, 129712/129712 transitions.
Ensure Unique test removed 8 places
Drop transitions removed 2126 transitions
Reduce isomorphic transitions removed 2126 transitions.
Iterating post reduction 0 with 2134 rules applied. Total rules applied 2134 place count 1345 transition count 127586
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 2134 place count 1345 transition count 127578
Deduced a syphon composed of 8 places in 162 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 2150 place count 1337 transition count 127578
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 55 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 2192 place count 1316 transition count 127557
Free-agglomeration rule applied 17 times.
Iterating global reduction 1 with 17 rules applied. Total rules applied 2209 place count 1316 transition count 127540
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 2231 place count 1299 transition count 127535
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2235 place count 1299 transition count 127531
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 2254 place count 1295 transition count 127516
Free-agglomeration rule (complex) applied 20 times with reduction of 408 identical transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 2274 place count 1295 transition count 130621
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 396 transitions
Reduce isomorphic transitions removed 399 transitions.
Iterating post reduction 3 with 419 rules applied. Total rules applied 2693 place count 1275 transition count 130222
Applied a total of 2693 rules in 6582 ms. Remains 1275 /1353 variables (removed 78) and now considering 130222/129712 (removed -510) transitions.
Finished structural reductions, in 1 iterations. Remains : 1275/1353 places, 130222/129712 transitions.
Interrupted random walk after 198752 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen 1
FORMULA RERS2020-PT-pb104-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1785 ms. (steps per millisecond=56 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1497 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1587 ms. (steps per millisecond=63 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1567 ms. (steps per millisecond=63 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 1450 ms. (steps per millisecond=68 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1308 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 2 resets, run finished after 1492 ms. (steps per millisecond=67 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1278 ms. (steps per millisecond=78 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 2 resets, run finished after 1539 ms. (steps per millisecond=64 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1529 ms. (steps per millisecond=65 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 1348 ms. (steps per millisecond=74 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1362 ms. (steps per millisecond=73 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1443 ms. (steps per millisecond=69 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 1144 ms. (steps per millisecond=87 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2105 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 271247 steps, run timeout after 156001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 271247 steps, saw 195271 distinct states, run finished after 156002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 15 properties.
[2022-06-11 02:04:05] [INFO ] Flow matrix only has 99238 transitions (discarded 30984 similar events)
// Phase 1: matrix 99238 rows 1275 cols
[2022-06-11 02:04:05] [INFO ] Computed 9 place invariants in 524 ms
[2022-06-11 02:04:06] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2022-06-11 02:04:06] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-06-11 02:04:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2022-06-11 02:04:49] [INFO ] After 42157ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :13
[2022-06-11 02:04:51] [INFO ] State equation strengthened by 3534 read => feed constraints.
[2022-06-11 02:05:20] [INFO ] After 29384ms SMT Verify possible using 3534 Read/Feed constraints in natural domain returned unsat :2 sat :13
[2022-06-11 02:05:31] [INFO ] Deduced a trap composed of 126 places in 9613 ms of which 17 ms to minimize.
[2022-06-11 02:05:43] [INFO ] Deduced a trap composed of 75 places in 10931 ms of which 3 ms to minimize.
[2022-06-11 02:05:54] [INFO ] Deduced a trap composed of 78 places in 9727 ms of which 1 ms to minimize.
[2022-06-11 02:06:05] [INFO ] Deduced a trap composed of 200 places in 9518 ms of which 2 ms to minimize.
[2022-06-11 02:06:16] [INFO ] Deduced a trap composed of 101 places in 9726 ms of which 2 ms to minimize.
[2022-06-11 02:06:27] [INFO ] Deduced a trap composed of 146 places in 9123 ms of which 1 ms to minimize.
[2022-06-11 02:06:38] [INFO ] Deduced a trap composed of 112 places in 9702 ms of which 2 ms to minimize.
[2022-06-11 02:06:48] [INFO ] Deduced a trap composed of 350 places in 9091 ms of which 1 ms to minimize.
[2022-06-11 02:07:00] [INFO ] Deduced a trap composed of 106 places in 9937 ms of which 2 ms to minimize.
[2022-06-11 02:07:13] [INFO ] Deduced a trap composed of 292 places in 11487 ms of which 2 ms to minimize.
[2022-06-11 02:07:24] [INFO ] Deduced a trap composed of 150 places in 10059 ms of which 3 ms to minimize.
[2022-06-11 02:07:36] [INFO ] Deduced a trap composed of 110 places in 10979 ms of which 21 ms to minimize.
[2022-06-11 02:07:47] [INFO ] Deduced a trap composed of 135 places in 8930 ms of which 1 ms to minimize.
[2022-06-11 02:07:56] [INFO ] Deduced a trap composed of 212 places in 8251 ms of which 1 ms to minimize.
[2022-06-11 02:07:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 02:07:56] [INFO ] After 230256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
FORMULA RERS2020-PT-pb104-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RERS2020-PT-pb104-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 119 out of 1275 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1275/1275 places, 130222/130222 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1275 transition count 130221
Deduced a syphon composed of 1 places in 79 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1274 transition count 130221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 56 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1273 transition count 130220
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1273 transition count 130219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 1272 transition count 130219
Free-agglomeration rule (complex) applied 7 times with reduction of 172 identical transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 13 place count 1272 transition count 132118
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 146 transitions.
Iterating post reduction 1 with 153 rules applied. Total rules applied 166 place count 1265 transition count 131972
Applied a total of 166 rules in 3148 ms. Remains 1265 /1275 variables (removed 10) and now considering 131972/130222 (removed -1750) transitions.
Finished structural reductions, in 1 iterations. Remains : 1265/1275 places, 131972/130222 transitions.
Interrupted random walk after 224069 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 0
Interrupted Best-First random walk after 332494 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=66 ) properties seen 0
Interrupted Best-First random walk after 348642 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=69 ) properties seen 0
Interrupted Best-First random walk after 342599 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=68 ) properties seen 0
Interrupted Best-First random walk after 347600 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=69 ) properties seen 0
Interrupted Best-First random walk after 363241 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 360430 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=72 ) properties seen 0
Interrupted Best-First random walk after 396636 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=79 ) properties seen 0
Interrupted Best-First random walk after 459057 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen 0
Interrupted Best-First random walk after 414413 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen 0
Interrupted Best-First random walk after 415043 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen 0
Interrupted Best-First random walk after 399404 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=79 ) properties seen 0
Interrupted Best-First random walk after 391386 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 0
Interrupted Best-First random walk after 464730 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen 0
Interrupted probabilistic random walk after 524427 steps, run timeout after 285003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 524427 steps, saw 366283 distinct states, run finished after 285004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 13 properties.
[2022-06-11 02:14:20] [INFO ] Flow matrix only has 100930 transitions (discarded 31042 similar events)
// Phase 1: matrix 100930 rows 1265 cols
[2022-06-11 02:14:20] [INFO ] Computed 9 place invariants in 498 ms
[2022-06-11 02:14:21] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2022-06-11 02:14:21] [INFO ] After 501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-11 02:14:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2022-06-11 02:15:06] [INFO ] After 44713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-06-11 02:15:07] [INFO ] State equation strengthened by 3580 read => feed constraints.
[2022-06-11 02:15:34] [INFO ] After 26917ms SMT Verify possible using 3580 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2022-06-11 02:15:43] [INFO ] Deduced a trap composed of 97 places in 8244 ms of which 1 ms to minimize.
[2022-06-11 02:15:53] [INFO ] Deduced a trap composed of 43 places in 9048 ms of which 1 ms to minimize.
[2022-06-11 02:16:05] [INFO ] Deduced a trap composed of 49 places in 10099 ms of which 2 ms to minimize.
[2022-06-11 02:16:17] [INFO ] Deduced a trap composed of 203 places in 10553 ms of which 2 ms to minimize.
[2022-06-11 02:16:29] [INFO ] Deduced a trap composed of 78 places in 10408 ms of which 1 ms to minimize.
[2022-06-11 02:16:39] [INFO ] Deduced a trap composed of 328 places in 9115 ms of which 1 ms to minimize.
[2022-06-11 02:16:50] [INFO ] Deduced a trap composed of 43 places in 9300 ms of which 1 ms to minimize.
[2022-06-11 02:16:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 79666 ms
[2022-06-11 02:17:47] [INFO ] After 160670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 18299 ms.
[2022-06-11 02:18:06] [INFO ] After 225016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 119 out of 1265 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1265/1265 places, 131972/131972 transitions.
Applied a total of 0 rules in 747 ms. Remains 1265 /1265 variables (removed 0) and now considering 131972/131972 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1265/1265 places, 131972/131972 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1265/1265 places, 131972/131972 transitions.
Applied a total of 0 rules in 740 ms. Remains 1265 /1265 variables (removed 0) and now considering 131972/131972 (removed 0) transitions.
[2022-06-11 02:18:07] [INFO ] Flow matrix only has 100930 transitions (discarded 31042 similar events)
// Phase 1: matrix 100930 rows 1265 cols
[2022-06-11 02:18:08] [INFO ] Computed 9 place invariants in 594 ms
[2022-06-11 02:18:11] [INFO ] Implicit Places using invariants in 4423 ms returned []
Implicit Place search using SMT only with invariants took 4424 ms to find 0 implicit places.
[2022-06-11 02:18:12] [INFO ] Flow matrix only has 100930 transitions (discarded 31042 similar events)
// Phase 1: matrix 100930 rows 1265 cols
[2022-06-11 02:18:12] [INFO ] Computed 9 place invariants in 522 ms
[2022-06-11 02:18:42] [INFO ] Performed 78680/131972 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 02:19:01] [INFO ] Dead Transitions using invariants and state equation in 49455 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1265/1265 places, 131972/131972 transitions.
Interrupted random walk after 230601 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 0
Interrupted Best-First random walk after 349074 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=69 ) properties seen 0
Interrupted Best-First random walk after 353612 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=70 ) properties seen 0
Interrupted Best-First random walk after 330118 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=66 ) properties seen 0
Interrupted Best-First random walk after 282820 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=56 ) properties seen 0
Interrupted Best-First random walk after 291766 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=58 ) properties seen 0
Interrupted Best-First random walk after 309515 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=61 ) properties seen 0
Interrupted Best-First random walk after 290909 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=58 ) properties seen 0
Interrupted Best-First random walk after 289833 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=57 ) properties seen 0
Interrupted Best-First random walk after 267621 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=53 ) properties seen 0
Interrupted Best-First random walk after 287550 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=57 ) properties seen 0
Interrupted Best-First random walk after 322315 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=64 ) properties seen 0
Interrupted Best-First random walk after 333157 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=66 ) properties seen 0
Interrupted Best-First random walk after 379667 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=75 ) properties seen 0
Interrupted probabilistic random walk after 539419 steps, run timeout after 285006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 539419 steps, saw 376180 distinct states, run finished after 285009 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 13 properties.
[2022-06-11 02:25:21] [INFO ] Flow matrix only has 100930 transitions (discarded 31042 similar events)
// Phase 1: matrix 100930 rows 1265 cols
[2022-06-11 02:25:22] [INFO ] Computed 9 place invariants in 466 ms
[2022-06-11 02:25:22] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2022-06-11 02:25:22] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-11 02:25:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2022-06-11 02:26:06] [INFO ] After 43566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-06-11 02:26:07] [INFO ] State equation strengthened by 3580 read => feed constraints.
[2022-06-11 02:26:35] [INFO ] After 27546ms SMT Verify possible using 3580 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2022-06-11 02:26:44] [INFO ] Deduced a trap composed of 97 places in 7889 ms of which 2 ms to minimize.
[2022-06-11 02:26:53] [INFO ] Deduced a trap composed of 43 places in 8004 ms of which 1 ms to minimize.
[2022-06-11 02:27:04] [INFO ] Deduced a trap composed of 49 places in 9176 ms of which 1 ms to minimize.
[2022-06-11 02:27:14] [INFO ] Deduced a trap composed of 203 places in 8951 ms of which 1 ms to minimize.
[2022-06-11 02:27:24] [INFO ] Deduced a trap composed of 78 places in 8938 ms of which 1 ms to minimize.
[2022-06-11 02:27:34] [INFO ] Deduced a trap composed of 328 places in 8626 ms of which 1 ms to minimize.
[2022-06-11 02:27:44] [INFO ] Deduced a trap composed of 43 places in 8137 ms of which 1 ms to minimize.
[2022-06-11 02:27:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 71965 ms
[2022-06-11 02:28:38] [INFO ] After 150337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 18012 ms.
[2022-06-11 02:28:56] [INFO ] After 213350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 119 out of 1265 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1265/1265 places, 131972/131972 transitions.
Applied a total of 0 rules in 958 ms. Remains 1265 /1265 variables (removed 0) and now considering 131972/131972 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1265/1265 places, 131972/131972 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1265/1265 places, 131972/131972 transitions.
Applied a total of 0 rules in 845 ms. Remains 1265 /1265 variables (removed 0) and now considering 131972/131972 (removed 0) transitions.
[2022-06-11 02:28:57] [INFO ] Flow matrix only has 100930 transitions (discarded 31042 similar events)
// Phase 1: matrix 100930 rows 1265 cols
[2022-06-11 02:28:58] [INFO ] Computed 9 place invariants in 571 ms
[2022-06-11 02:29:01] [INFO ] Implicit Places using invariants in 4077 ms returned []
Implicit Place search using SMT only with invariants took 4081 ms to find 0 implicit places.
[2022-06-11 02:29:02] [INFO ] Flow matrix only has 100930 transitions (discarded 31042 similar events)
// Phase 1: matrix 100930 rows 1265 cols
[2022-06-11 02:29:02] [INFO ] Computed 9 place invariants in 518 ms
[2022-06-11 02:29:32] [INFO ] Performed 78845/131972 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 02:29:51] [INFO ] Dead Transitions using invariants and state equation in 49554 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1265/1265 places, 131972/131972 transitions.
Graph (trivial) has 25156 edges and 1265 vertex of which 780 / 1265 are part of one of the 130 SCC in 19 ms
Free SCC test removed 650 places
Drop transitions removed 29289 transitions
Ensure Unique test removed 70267 transitions
Reduce isomorphic transitions removed 99556 transitions.
Graph (complete) has 22550 edges and 615 vertex of which 609 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.29 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 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 9 rules applied. Total rules applied 11 place count 609 transition count 32407
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 607 transition count 32407
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 604 transition count 32386
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 604 transition count 32386
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 603 transition count 32378
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 603 transition count 32378
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 602 transition count 32377
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 602 transition count 32377
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 41 place count 593 transition count 32368
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 2 with 96 rules applied. Total rules applied 137 place count 593 transition count 32272
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 140 place count 593 transition count 32269
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 143 place count 590 transition count 32269
Free-agglomeration rule (complex) applied 9 times with reduction of 134 identical transitions.
Iterating global reduction 4 with 9 rules applied. Total rules applied 152 place count 590 transition count 32739
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 209 place count 581 transition count 32691
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 224 place count 581 transition count 32691
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 232 place count 581 transition count 32683
Applied a total of 232 rules in 3575 ms. Remains 581 /1265 variables (removed 684) and now considering 32683/131972 (removed 99289) transitions.
Running SMT prover for 13 properties.
[2022-06-11 02:29:55] [INFO ] Flow matrix only has 27833 transitions (discarded 4850 similar events)
// Phase 1: matrix 27833 rows 581 cols
[2022-06-11 02:29:55] [INFO ] Computed 3 place invariants in 175 ms
[2022-06-11 02:29:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 02:29:55] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-11 02:29:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 02:30:07] [INFO ] After 11753ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-06-11 02:30:07] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-06-11 02:30:13] [INFO ] After 5855ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2022-06-11 02:30:24] [INFO ] After 17002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 5660 ms.
[2022-06-11 02:30:30] [INFO ] After 34781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
[2022-06-11 02:30:35] [INFO ] Flatten gal took : 4477 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15754336051207347131
[2022-06-11 02:30:38] [INFO ] Too many transitions (131972) to apply POR reductions. Disabling POR matrices.
[2022-06-11 02:30:39] [INFO ] Built C files in 1249ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15754336051207347131
Running compilation step : cd /tmp/ltsmin15754336051207347131;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '55' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 02:30:42] [INFO ] Applying decomposition
[2022-06-11 02:30:45] [INFO ] Flatten gal took : 7293 ms
[2022-06-11 02:30:48] [INFO ] Flatten gal took : 6016 ms
[2022-06-11 02:30:51] [INFO ] Input system was already deterministic with 131972 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7323706450230137523.txt' '-o' '/tmp/graph7323706450230137523.bin' '-w' '/tmp/graph7323706450230137523.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7323706450230137523.bin' '-l' '-1' '-v' '-w' '/tmp/graph7323706450230137523.weights' '-q' '0' '-e' '0.001'
[2022-06-11 02:30:59] [INFO ] Decomposing Gal with order
[2022-06-11 02:30:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 02:31:13] [INFO ] Removed a total of 236545 redundant transitions.
[2022-06-11 02:31:15] [INFO ] Flatten gal took : 12038 ms
[2022-06-11 02:31:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 4526 labels/synchronizations in 6757 ms.
[2022-06-11 02:31:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3067048680873825261.gal : 333 ms
[2022-06-11 02:31:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2790297600977581672.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability3067048680873825261.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2790297600977581672.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
[2022-06-11 02:31:30] [INFO ] Ran tautology test, simplified 0 / 13 in 44631 ms.
[2022-06-11 02:31:30] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-00(UNSAT) depth K=0 took 32 ms
[2022-06-11 02:31:30] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-01(UNSAT) depth K=0 took 1 ms
[2022-06-11 02:31:30] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-02(UNSAT) depth K=0 took 1 ms
[2022-06-11 02:31:30] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-03(UNSAT) depth K=0 took 0 ms
[2022-06-11 02:31:30] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-04(UNSAT) depth K=0 took 0 ms
[2022-06-11 02:31:30] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-05(UNSAT) depth K=0 took 0 ms
[2022-06-11 02:31:30] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-06(UNSAT) depth K=0 took 0 ms
[2022-06-11 02:31:30] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-07(UNSAT) depth K=0 took 1 ms
[2022-06-11 02:31:30] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-08(UNSAT) depth K=0 took 0 ms
[2022-06-11 02:31:30] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-09(UNSAT) depth K=0 took 1 ms
[2022-06-11 02:31:30] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-12(UNSAT) depth K=0 took 0 ms
[2022-06-11 02:31:30] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-13(UNSAT) depth K=0 took 1 ms
[2022-06-11 02:31:30] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-14(UNSAT) depth K=0 took 0 ms
[2022-06-11 02:31:31] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-00(UNSAT) depth K=1 took 11 ms
[2022-06-11 02:31:31] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-01(UNSAT) depth K=1 took 1 ms
[2022-06-11 02:31:31] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-02(UNSAT) depth K=1 took 2 ms
[2022-06-11 02:31:31] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-03(UNSAT) depth K=1 took 1 ms
[2022-06-11 02:31:31] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-04(UNSAT) depth K=1 took 1 ms
[2022-06-11 02:31:31] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-05(UNSAT) depth K=1 took 1 ms
[2022-06-11 02:31:31] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-06(UNSAT) depth K=1 took 1 ms
[2022-06-11 02:31:31] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-07(UNSAT) depth K=1 took 1 ms
[2022-06-11 02:31:31] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-08(UNSAT) depth K=1 took 1 ms
[2022-06-11 02:31:31] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-09(UNSAT) depth K=1 took 1 ms
[2022-06-11 02:31:31] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-12(UNSAT) depth K=1 took 0 ms
[2022-06-11 02:31:31] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-13(UNSAT) depth K=1 took 0 ms
[2022-06-11 02:31:31] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-14(UNSAT) depth K=1 took 1 ms
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15754336051207347131;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '55' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 55 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15754336051207347131;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '55' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 55 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Loading property file /tmp/ReachabilityFireability2790297600977581672.prop.
[2022-06-11 02:31:59] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-00(UNSAT) depth K=2 took 26508 ms
[2022-06-11 02:31:59] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-01(UNSAT) depth K=2 took 62 ms
[2022-06-11 02:31:59] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-02(UNSAT) depth K=2 took 152 ms
[2022-06-11 02:31:59] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-03(UNSAT) depth K=2 took 87 ms
[2022-06-11 02:31:59] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-04(UNSAT) depth K=2 took 57 ms
[2022-06-11 02:31:59] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-05(UNSAT) depth K=2 took 59 ms
[2022-06-11 02:31:59] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-06(UNSAT) depth K=2 took 79 ms
[2022-06-11 02:31:59] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-07(UNSAT) depth K=2 took 57 ms
[2022-06-11 02:32:00] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-08(UNSAT) depth K=2 took 335 ms
[2022-06-11 02:32:00] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-09(UNSAT) depth K=2 took 59 ms
[2022-06-11 02:32:00] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-12(UNSAT) depth K=2 took 58 ms
[2022-06-11 02:32:00] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-13(UNSAT) depth K=2 took 59 ms
[2022-06-11 02:32:00] [INFO ] BMC solution for property RERS2020-PT-pb104-ReachabilityFireability-14(UNSAT) depth K=2 took 57 ms
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :1 after 4
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :4 after 7.06532e+06
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :7.06532e+06 after 7.12984e+06
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :7.12984e+06 after 7.54916e+06
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :7.54916e+06 after 8.10212e+06
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :8.10212e+06 after 9.17118e+06
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 100930 out of 131972 initially.
// Phase 1: matrix 100930 rows 1265 cols
[2022-06-11 02:32:59] [INFO ] Computed 9 place invariants in 707 ms
[2022-06-11 02:32:59] [INFO ] Computed 9 place invariants in 713 ms
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :9.17118e+06 after 6.29925e+08
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :6.29925e+08 after 6.31189e+08

BK_STOP 1654914870194

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RERS2020-PT-pb104, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472282500655"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb104.tgz
mv RERS2020-PT-pb104 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;