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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 1682546.00 0.00 0.00 ??????F????????? normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282600671.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-pb106, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282600671
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.4K Jun 7 17:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 7 17:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Jun 7 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 17:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jun 6 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 16K Jun 7 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Jun 7 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 7 17:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Jun 7 17:46 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 69M 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-pb106-ReachabilityFireability-00
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-01
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-02
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-03
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-04
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-05
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-06
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-07
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-08
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-09
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-10
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-11
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-12
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-13
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-14
FORMULA_NAME RERS2020-PT-pb106-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654917394082

Running Version 202205111006
[2022-06-11 03:16:35] [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 03:16:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 03:16:37] [INFO ] Load time of PNML (sax parser for PT used): 2552 ms
[2022-06-11 03:16:38] [INFO ] Transformed 2041 places.
[2022-06-11 03:16:38] [INFO ] Transformed 125740 transitions.
[2022-06-11 03:16:38] [INFO ] Found NUPN structural information;
[2022-06-11 03:16:38] [INFO ] Parsed PT model containing 2041 places and 125740 transitions in 3051 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 5937 transitions
Reduce redundant transitions removed 5937 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1601 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 42 ms. (steps per millisecond=23 ) 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 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 33 ms. (steps per millisecond=30 ) 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 1000 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 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 24 ms. (steps per millisecond=41 ) 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 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 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 32 ms. (steps per millisecond=31 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 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 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 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 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 10362 steps, run timeout after 6005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 10362 steps, saw 6525 distinct states, run finished after 6009 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 16 properties.
[2022-06-11 03:16:47] [INFO ] Flow matrix only has 94825 transitions (discarded 24978 similar events)
// Phase 1: matrix 94825 rows 2041 cols
[2022-06-11 03:16:48] [INFO ] Computed 23 place invariants in 756 ms
[2022-06-11 03:16:49] [INFO ] After 1127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-06-11 03:16:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 31 ms returned sat
[2022-06-11 03:16:50] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 34 ms returned sat
[2022-06-11 03:17:14] [INFO ] After 23512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-06-11 03:17:15] [INFO ] State equation strengthened by 4560 read => feed constraints.
[2022-06-11 03:17:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 03:17:15] [INFO ] After 26229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 311 out of 2041 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2041/2041 places, 119803/119803 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 2251 transitions
Reduce isomorphic transitions removed 2251 transitions.
Iterating post reduction 0 with 2262 rules applied. Total rules applied 2262 place count 2030 transition count 117552
Performed 44 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 44 places in 87 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 1 with 88 rules applied. Total rules applied 2350 place count 1986 transition count 117492
Drop transitions removed 2 transitions
Ensure Unique test removed 1653 transitions
Reduce isomorphic transitions removed 1655 transitions.
Iterating post reduction 1 with 1655 rules applied. Total rules applied 4005 place count 1986 transition count 115837
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 111 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 4013 place count 1982 transition count 115833
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4015 place count 1982 transition count 115831
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 14 places in 153 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 4043 place count 1968 transition count 115841
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 4056 place count 1968 transition count 115828
Free-agglomeration rule applied 59 times with reduction of 1 identical transitions.
Iterating global reduction 4 with 59 rules applied. Total rules applied 4115 place count 1968 transition count 115768
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 26 transitions
Ensure Unique test removed 142 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 4 with 227 rules applied. Total rules applied 4342 place count 1909 transition count 115600
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 4345 place count 1909 transition count 115597
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 4352 place count 1906 transition count 115593
Free-agglomeration rule (complex) applied 174 times with reduction of 8652 identical transitions.
Iterating global reduction 6 with 174 rules applied. Total rules applied 4526 place count 1906 transition count 148756
Reduce places removed 174 places and 0 transitions.
Drop transitions removed 98 transitions
Ensure Unique test removed 6320 transitions
Reduce isomorphic transitions removed 6418 transitions.
Iterating post reduction 6 with 6592 rules applied. Total rules applied 11118 place count 1732 transition count 142338
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 11125 place count 1732 transition count 142338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 11126 place count 1732 transition count 142337
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 11127 place count 1731 transition count 142336
Iterating global reduction 8 with 1 rules applied. Total rules applied 11128 place count 1731 transition count 142336
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 8 with 46 rules applied. Total rules applied 11174 place count 1731 transition count 142290
Applied a total of 11174 rules in 11333 ms. Remains 1731 /2041 variables (removed 310) and now considering 142290/119803 (removed -22487) transitions.
Finished structural reductions, in 1 iterations. Remains : 1731/2041 places, 142290/119803 transitions.
Interrupted random walk after 296798 steps, including 5 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 1
FORMULA RERS2020-PT-pb106-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 100001 steps, including 7 resets, run finished after 1172 ms. (steps per millisecond=85 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 4 resets, run finished after 1309 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 11 resets, run finished after 1462 ms. (steps per millisecond=68 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 1917 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 874 ms. (steps per millisecond=114 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 1415 ms. (steps per millisecond=70 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 6 resets, run finished after 1309 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 11 resets, run finished after 1363 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 1284 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 5 resets, run finished after 1902 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 8 resets, run finished after 1084 ms. (steps per millisecond=92 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 5 resets, run finished after 1212 ms. (steps per millisecond=82 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 1206 ms. (steps per millisecond=82 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 995 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1724 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 275308 steps, run timeout after 150001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 275308 steps, saw 191340 distinct states, run finished after 150002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 15 properties.
[2022-06-11 03:20:47] [INFO ] Flow matrix only has 118794 transitions (discarded 23496 similar events)
// Phase 1: matrix 118794 rows 1731 cols
[2022-06-11 03:20:48] [INFO ] Computed 12 place invariants in 1255 ms
[2022-06-11 03:20:49] [INFO ] After 609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-06-11 03:20:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-11 03:21:54] [INFO ] After 63777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-06-11 03:21:54] [INFO ] State equation strengthened by 5536 read => feed constraints.
[2022-06-11 03:22:25] [INFO ] After 30808ms SMT Verify possible using 5536 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-06-11 03:22:39] [INFO ] Deduced a trap composed of 31 places in 11782 ms of which 14 ms to minimize.
[2022-06-11 03:22:53] [INFO ] Deduced a trap composed of 52 places in 12580 ms of which 3 ms to minimize.
[2022-06-11 03:23:08] [INFO ] Deduced a trap composed of 67 places in 13161 ms of which 3 ms to minimize.
[2022-06-11 03:23:21] [INFO ] Deduced a trap composed of 37 places in 11361 ms of which 4 ms to minimize.
[2022-06-11 03:23:35] [INFO ] Deduced a trap composed of 217 places in 12470 ms of which 3 ms to minimize.
[2022-06-11 03:23:48] [INFO ] Deduced a trap composed of 50 places in 11162 ms of which 2 ms to minimize.
[2022-06-11 03:24:01] [INFO ] Deduced a trap composed of 21 places in 10956 ms of which 1 ms to minimize.
[2022-06-11 03:24:14] [INFO ] Deduced a trap composed of 196 places in 11429 ms of which 2 ms to minimize.
[2022-06-11 03:24:26] [INFO ] Deduced a trap composed of 340 places in 11059 ms of which 1 ms to minimize.
[2022-06-11 03:24:39] [INFO ] Deduced a trap composed of 223 places in 10979 ms of which 2 ms to minimize.
[2022-06-11 03:24:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 03:24:39] [INFO ] After 229709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 287 out of 1731 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1731/1731 places, 142290/142290 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1731 transition count 142705
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 27 place count 1728 transition count 142684
Applied a total of 27 rules in 1562 ms. Remains 1728 /1731 variables (removed 3) and now considering 142684/142290 (removed -394) transitions.
Finished structural reductions, in 1 iterations. Remains : 1728/1731 places, 142684/142290 transitions.
Interrupted random walk after 325346 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1328 ms. (steps per millisecond=75 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 5 resets, run finished after 1257 ms. (steps per millisecond=79 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 7 resets, run finished after 1287 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 17 resets, run finished after 1847 ms. (steps per millisecond=54 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 844 ms. (steps per millisecond=118 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1349 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 1239 ms. (steps per millisecond=80 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 14 resets, run finished after 1334 ms. (steps per millisecond=74 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 10 resets, run finished after 1056 ms. (steps per millisecond=94 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 18 resets, run finished after 1613 ms. (steps per millisecond=61 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 6 resets, run finished after 874 ms. (steps per millisecond=114 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 14 resets, run finished after 1270 ms. (steps per millisecond=78 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 6 resets, run finished after 1032 ms. (steps per millisecond=96 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 785 ms. (steps per millisecond=127 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 2 resets, run finished after 1398 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 260113 steps, run timeout after 144002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 260113 steps, saw 180197 distinct states, run finished after 144003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 15 properties.
[2022-06-11 03:27:53] [INFO ] Flow matrix only has 119177 transitions (discarded 23507 similar events)
// Phase 1: matrix 119177 rows 1728 cols
[2022-06-11 03:27:54] [INFO ] Computed 12 place invariants in 1142 ms
[2022-06-11 03:27:55] [INFO ] After 604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-06-11 03:27:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-11 03:28:54] [INFO ] After 58178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-06-11 03:28:55] [INFO ] State equation strengthened by 5551 read => feed constraints.
[2022-06-11 03:29:25] [INFO ] After 30003ms SMT Verify possible using 5551 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-06-11 03:29:38] [INFO ] Deduced a trap composed of 178 places in 11484 ms of which 2 ms to minimize.
[2022-06-11 03:29:51] [INFO ] Deduced a trap composed of 50 places in 11252 ms of which 1 ms to minimize.
[2022-06-11 03:30:02] [INFO ] Deduced a trap composed of 67 places in 10133 ms of which 2 ms to minimize.
[2022-06-11 03:30:14] [INFO ] Deduced a trap composed of 217 places in 9946 ms of which 1 ms to minimize.
[2022-06-11 03:30:26] [INFO ] Deduced a trap composed of 78 places in 10483 ms of which 1 ms to minimize.
[2022-06-11 03:30:38] [INFO ] Deduced a trap composed of 197 places in 10685 ms of which 2 ms to minimize.
[2022-06-11 03:30:51] [INFO ] Deduced a trap composed of 102 places in 11158 ms of which 1 ms to minimize.
[2022-06-11 03:31:05] [INFO ] Deduced a trap composed of 401 places in 12878 ms of which 2 ms to minimize.
[2022-06-11 03:31:17] [INFO ] Deduced a trap composed of 152 places in 10183 ms of which 2 ms to minimize.
[2022-06-11 03:31:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 114817 ms
[2022-06-11 03:31:52] [INFO ] Deduced a trap composed of 13 places in 12641 ms of which 2 ms to minimize.
[2022-06-11 03:31:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 03:31:52] [INFO ] After 237661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 287 out of 1728 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1728/1728 places, 142684/142684 transitions.
Applied a total of 0 rules in 730 ms. Remains 1728 /1728 variables (removed 0) and now considering 142684/142684 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1728/1728 places, 142684/142684 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1728/1728 places, 142684/142684 transitions.
Applied a total of 0 rules in 727 ms. Remains 1728 /1728 variables (removed 0) and now considering 142684/142684 (removed 0) transitions.
[2022-06-11 03:31:54] [INFO ] Flow matrix only has 119177 transitions (discarded 23507 similar events)
// Phase 1: matrix 119177 rows 1728 cols
[2022-06-11 03:31:55] [INFO ] Computed 12 place invariants in 932 ms
[2022-06-11 03:31:58] [INFO ] Implicit Places using invariants in 4491 ms returned []
Implicit Place search using SMT only with invariants took 4492 ms to find 0 implicit places.
[2022-06-11 03:31:58] [INFO ] Flow matrix only has 119177 transitions (discarded 23507 similar events)
// Phase 1: matrix 119177 rows 1728 cols
[2022-06-11 03:31:59] [INFO ] Computed 12 place invariants in 845 ms
[2022-06-11 03:32:29] [INFO ] Performed 92518/142684 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 03:32:45] [INFO ] Dead Transitions using invariants and state equation in 46482 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1728/1728 places, 142684/142684 transitions.
Interrupted random walk after 327528 steps, including 5 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1070 ms. (steps per millisecond=93 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 21 resets, run finished after 1299 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1247 ms. (steps per millisecond=80 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 36 resets, run finished after 1822 ms. (steps per millisecond=54 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 6 resets, run finished after 867 ms. (steps per millisecond=115 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 6 resets, run finished after 1421 ms. (steps per millisecond=70 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 6 resets, run finished after 1281 ms. (steps per millisecond=78 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1301 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 1030 ms. (steps per millisecond=97 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 7 resets, run finished after 1615 ms. (steps per millisecond=61 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 928 ms. (steps per millisecond=107 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 912 ms. (steps per millisecond=109 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 14 resets, run finished after 1170 ms. (steps per millisecond=85 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 3 resets, run finished after 814 ms. (steps per millisecond=122 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 4 resets, run finished after 1431 ms. (steps per millisecond=69 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 244257 steps, run timeout after 144003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 244257 steps, saw 171272 distinct states, run finished after 144003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 15 properties.
[2022-06-11 03:35:57] [INFO ] Flow matrix only has 119177 transitions (discarded 23507 similar events)
// Phase 1: matrix 119177 rows 1728 cols
[2022-06-11 03:35:58] [INFO ] Computed 12 place invariants in 960 ms
[2022-06-11 03:35:59] [INFO ] After 607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-06-11 03:35:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-11 03:36:58] [INFO ] After 58130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-06-11 03:36:59] [INFO ] State equation strengthened by 5551 read => feed constraints.
[2022-06-11 03:37:28] [INFO ] After 29629ms SMT Verify possible using 5551 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-06-11 03:37:41] [INFO ] Deduced a trap composed of 178 places in 11474 ms of which 3 ms to minimize.
[2022-06-11 03:37:54] [INFO ] Deduced a trap composed of 50 places in 11354 ms of which 3 ms to minimize.
[2022-06-11 03:38:06] [INFO ] Deduced a trap composed of 67 places in 9930 ms of which 1 ms to minimize.
[2022-06-11 03:38:17] [INFO ] Deduced a trap composed of 217 places in 9816 ms of which 1 ms to minimize.
[2022-06-11 03:38:29] [INFO ] Deduced a trap composed of 78 places in 10348 ms of which 2 ms to minimize.
[2022-06-11 03:38:41] [INFO ] Deduced a trap composed of 197 places in 10451 ms of which 5 ms to minimize.
[2022-06-11 03:38:54] [INFO ] Deduced a trap composed of 102 places in 11519 ms of which 1 ms to minimize.
[2022-06-11 03:39:06] [INFO ] Deduced a trap composed of 401 places in 11392 ms of which 2 ms to minimize.
[2022-06-11 03:39:18] [INFO ] Deduced a trap composed of 152 places in 10475 ms of which 2 ms to minimize.
[2022-06-11 03:39:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 113043 ms
[2022-06-11 03:39:44] [INFO ] After 165854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-11 03:39:44] [INFO ] After 225512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 287 out of 1728 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1728/1728 places, 142684/142684 transitions.
Applied a total of 0 rules in 732 ms. Remains 1728 /1728 variables (removed 0) and now considering 142684/142684 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1728/1728 places, 142684/142684 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1728/1728 places, 142684/142684 transitions.
Applied a total of 0 rules in 733 ms. Remains 1728 /1728 variables (removed 0) and now considering 142684/142684 (removed 0) transitions.
[2022-06-11 03:39:46] [INFO ] Flow matrix only has 119177 transitions (discarded 23507 similar events)
// Phase 1: matrix 119177 rows 1728 cols
[2022-06-11 03:39:47] [INFO ] Computed 12 place invariants in 1072 ms
[2022-06-11 03:39:51] [INFO ] Implicit Places using invariants in 4697 ms returned []
Implicit Place search using SMT only with invariants took 4700 ms to find 0 implicit places.
[2022-06-11 03:39:51] [INFO ] Flow matrix only has 119177 transitions (discarded 23507 similar events)
// Phase 1: matrix 119177 rows 1728 cols
[2022-06-11 03:39:52] [INFO ] Computed 12 place invariants in 883 ms
[2022-06-11 03:40:22] [INFO ] Performed 91895/142684 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 03:40:39] [INFO ] Dead Transitions using invariants and state equation in 48054 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1728/1728 places, 142684/142684 transitions.
Graph (trivial) has 15288 edges and 1728 vertex of which 963 / 1728 are part of one of the 188 SCC in 11 ms
Free SCC test removed 775 places
Drop transitions removed 10634 transitions
Ensure Unique test removed 67939 transitions
Reduce isomorphic transitions removed 78573 transitions.
Graph (complete) has 44078 edges and 953 vertex of which 948 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.40 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 948 transition count 64106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 947 transition count 64104
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 947 transition count 64104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 947 transition count 64103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 28 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 946 transition count 64102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 946 transition count 64101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 945 transition count 64100
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 28 place count 945 transition count 64100
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 35 place count 945 transition count 64093
Applied a total of 35 rules in 4796 ms. Remains 945 /1728 variables (removed 783) and now considering 64093/142684 (removed 78591) transitions.
Running SMT prover for 15 properties.
[2022-06-11 03:40:44] [INFO ] Flow matrix only has 58275 transitions (discarded 5818 similar events)
// Phase 1: matrix 58275 rows 945 cols
[2022-06-11 03:40:44] [INFO ] Computed 8 place invariants in 358 ms
[2022-06-11 03:40:44] [INFO ] After 352ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-06-11 03:40:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-11 03:41:18] [INFO ] After 33167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-06-11 03:41:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 03:41:32] [INFO ] After 13972ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-06-11 03:42:00] [INFO ] After 41947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 14202 ms.
[2022-06-11 03:42:14] [INFO ] After 89952ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
[2022-06-11 03:42:20] [INFO ] Flatten gal took : 5257 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16343755726742354161
[2022-06-11 03:42:23] [INFO ] Too many transitions (142684) to apply POR reductions. Disabling POR matrices.
[2022-06-11 03:42:25] [INFO ] Built C files in 1763ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16343755726742354161
Running compilation step : cd /tmp/ltsmin16343755726742354161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '48' '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 03:42:28] [INFO ] Applying decomposition
[2022-06-11 03:42:32] [INFO ] Flatten gal took : 8907 ms
[2022-06-11 03:42:35] [INFO ] Flatten gal took : 7056 ms
[2022-06-11 03:42:39] [INFO ] Input system was already deterministic with 142684 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/graph3174717676530201289.txt' '-o' '/tmp/graph3174717676530201289.bin' '-w' '/tmp/graph3174717676530201289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3174717676530201289.bin' '-l' '-1' '-v' '-w' '/tmp/graph3174717676530201289.weights' '-q' '0' '-e' '0.001'
[2022-06-11 03:42:46] [INFO ] Decomposing Gal with order
[2022-06-11 03:42:46] [INFO ] Rewriting arrays to variables to allow decomposition.
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/ltsmin16343755726742354161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '48' '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 48 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16343755726742354161;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '48' '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 48 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)
[2022-06-11 03:43:20] [INFO ] Ran tautology test, simplified 0 / 15 in 47664 ms.
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-00(UNSAT) depth K=0 took 29 ms
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-01(UNSAT) depth K=0 took 13 ms
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-02(UNSAT) depth K=0 took 1 ms
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-03(UNSAT) depth K=0 took 1 ms
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-04(UNSAT) depth K=0 took 1 ms
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-05(UNSAT) depth K=0 took 17 ms
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-07(UNSAT) depth K=0 took 0 ms
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-08(UNSAT) depth K=0 took 1 ms
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-09(UNSAT) depth K=0 took 1 ms
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-10(UNSAT) depth K=0 took 1 ms
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-11(UNSAT) depth K=0 took 1 ms
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-12(UNSAT) depth K=0 took 0 ms
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-13(UNSAT) depth K=0 took 0 ms
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-14(UNSAT) depth K=0 took 0 ms
[2022-06-11 03:43:20] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-15(UNSAT) depth K=0 took 1 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-00(UNSAT) depth K=1 took 57 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-01(UNSAT) depth K=1 took 0 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-02(UNSAT) depth K=1 took 1 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-03(UNSAT) depth K=1 took 13 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-04(UNSAT) depth K=1 took 2 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-05(UNSAT) depth K=1 took 1 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-07(UNSAT) depth K=1 took 0 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-08(UNSAT) depth K=1 took 1 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-09(UNSAT) depth K=1 took 2 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-10(UNSAT) depth K=1 took 4 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-11(UNSAT) depth K=1 took 0 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-12(UNSAT) depth K=1 took 1 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-13(UNSAT) depth K=1 took 0 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-14(UNSAT) depth K=1 took 0 ms
[2022-06-11 03:43:21] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-15(UNSAT) depth K=1 took 16 ms
[2022-06-11 03:43:25] [INFO ] Removed a total of 324470 redundant transitions.
[2022-06-11 03:43:29] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-00(UNSAT) depth K=2 took 5149 ms
[2022-06-11 03:43:29] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-01(UNSAT) depth K=2 took 50 ms
[2022-06-11 03:43:29] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-02(UNSAT) depth K=2 took 231 ms
[2022-06-11 03:43:29] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-03(UNSAT) depth K=2 took 158 ms
[2022-06-11 03:43:29] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-04(UNSAT) depth K=2 took 70 ms
[2022-06-11 03:43:29] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-05(UNSAT) depth K=2 took 50 ms
[2022-06-11 03:43:29] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-07(UNSAT) depth K=2 took 49 ms
[2022-06-11 03:43:29] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-08(UNSAT) depth K=2 took 49 ms
[2022-06-11 03:43:30] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-09(UNSAT) depth K=2 took 69 ms
[2022-06-11 03:43:30] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-10(UNSAT) depth K=2 took 53 ms
[2022-06-11 03:43:30] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-11(UNSAT) depth K=2 took 73 ms
[2022-06-11 03:43:30] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-12(UNSAT) depth K=2 took 50 ms
[2022-06-11 03:43:30] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-13(UNSAT) depth K=2 took 55 ms
[2022-06-11 03:43:30] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-14(UNSAT) depth K=2 took 50 ms
[2022-06-11 03:43:30] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-15(UNSAT) depth K=2 took 80 ms
[2022-06-11 03:43:32] [INFO ] Flatten gal took : 42167 ms
[2022-06-11 03:44:00] [INFO ] BMC solution for property RERS2020-PT-pb106-ReachabilityFireability-00(UNSAT) depth K=3 took 29037 ms
[2022-06-11 03:44:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 12431 labels/synchronizations in 13850 ms.
[2022-06-11 03:44:27] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10673169274644399337.gal : 4479 ms
[2022-06-11 03:44:28] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3210358600805250957.prop : 21 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/ReachabilityFireability10673169274644399337.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3210358600805250957.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...299

BK_STOP 1654919076628

--------------------
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-pb106"
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-pb106, 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-165472282600671"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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