fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r186-tajo-165281571900174
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for RERS17pb115-PT-4

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

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281571900174.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RERS17pb115-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281571900174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 6.8K Apr 30 06:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 06:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 30 06:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 06:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 30 06:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 06:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 30 06:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 30 06:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 69M May 10 09:34 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 RERS17pb115-PT-4-ReachabilityCardinality-00
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-01
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-02
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-03
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-04
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-05
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-06
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-07
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-08
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-09
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-10
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-11
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-12
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-13
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-14
FORMULA_NAME RERS17pb115-PT-4-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654447615732

Running Version 202205111006
[2022-06-05 16:46:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-05 16:46:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-05 16:47:00] [INFO ] Load time of PNML (sax parser for PT used): 3166 ms
[2022-06-05 16:47:00] [INFO ] Transformed 1399 places.
[2022-06-05 16:47:01] [INFO ] Transformed 144369 transitions.
[2022-06-05 16:47:01] [INFO ] Parsed PT model containing 1399 places and 144369 transitions in 4264 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2567 ms. (steps per millisecond=3 ) properties (out of 16) seen :7
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2022-06-05 16:47:07] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1399 cols
[2022-06-05 16:47:08] [INFO ] Computed 37 place invariants in 562 ms
[2022-06-05 16:47:10] [INFO ] After 2574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-05 16:47:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 35 ms returned sat
[2022-06-05 16:47:11] [INFO ] [Nat]Absence check using 19 positive and 18 generalized place invariants in 4 ms returned sat
[2022-06-05 16:47:35] [INFO ] After 24068ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2022-06-05 16:47:38] [INFO ] State equation strengthened by 2277 read => feed constraints.
[2022-06-05 16:47:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-05 16:47:38] [INFO ] After 27217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 68 out of 1399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Ensure Unique test removed 16 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1383 transition count 144369
Applied a total of 16 rules in 3442 ms. Remains 1383 /1399 variables (removed 16) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1383/1399 places, 144369/144369 transitions.
Interrupted random walk after 174705 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen 1
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 928385 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen 0
Interrupted Best-First random walk after 272682 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=54 ) properties seen 0
Interrupted Best-First random walk after 695889 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=139 ) properties seen 0
Interrupted Best-First random walk after 951497 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=190 ) properties seen 0
Interrupted Best-First random walk after 889226 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=177 ) properties seen 0
Running SMT prover for 5 properties.
[2022-06-05 16:48:37] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1383 cols
[2022-06-05 16:48:37] [INFO ] Computed 21 place invariants in 371 ms
[2022-06-05 16:48:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-05 16:48:38] [INFO ] [Real]Absence check using 3 positive and 18 generalized place invariants in 51 ms returned sat
[2022-06-05 16:48:38] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-05 16:48:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-05 16:48:38] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 56 ms returned sat
[2022-06-05 16:49:08] [INFO ] After 30216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-05 16:49:10] [INFO ] State equation strengthened by 2277 read => feed constraints.
[2022-06-05 16:49:38] [INFO ] After 27158ms SMT Verify possible using 2277 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-05 16:49:49] [INFO ] Deduced a trap composed of 17 places in 9902 ms of which 10 ms to minimize.
[2022-06-05 16:50:00] [INFO ] Deduced a trap composed of 65 places in 9092 ms of which 3 ms to minimize.
[2022-06-05 16:50:15] [INFO ] Deduced a trap composed of 41 places in 13552 ms of which 3 ms to minimize.
[2022-06-05 16:50:26] [INFO ] Deduced a trap composed of 65 places in 9555 ms of which 4 ms to minimize.
[2022-06-05 16:50:40] [INFO ] Deduced a trap composed of 97 places in 12165 ms of which 2 ms to minimize.
[2022-06-05 16:50:51] [INFO ] Deduced a trap composed of 65 places in 9292 ms of which 1 ms to minimize.
[2022-06-05 16:50:58] [INFO ] Deduced a trap composed of 65 places in 5857 ms of which 1 ms to minimize.
[2022-06-05 16:51:05] [INFO ] Deduced a trap composed of 97 places in 5596 ms of which 1 ms to minimize.
[2022-06-05 16:51:10] [INFO ] Deduced a trap composed of 41 places in 3812 ms of which 1 ms to minimize.
[2022-06-05 16:51:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 97256 ms
[2022-06-05 16:51:39] [INFO ] After 148031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 8650 ms.
[2022-06-05 16:51:47] [INFO ] After 189612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 66 out of 1383 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1383/1383 places, 144369/144369 transitions.
Applied a total of 0 rules in 1266 ms. Remains 1383 /1383 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1383/1383 places, 144369/144369 transitions.
Interrupted random walk after 148558 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen 1
FORMULA RERS17pb115-PT-4-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 228175 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=45 ) properties seen 0
Interrupted Best-First random walk after 594281 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=118 ) properties seen 0
Interrupted Best-First random walk after 820842 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen 0
Interrupted Best-First random walk after 725121 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen 0
Running SMT prover for 4 properties.
[2022-06-05 16:52:39] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1383 cols
[2022-06-05 16:52:40] [INFO ] Computed 21 place invariants in 672 ms
[2022-06-05 16:52:40] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-05 16:52:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-05 16:52:41] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 64 ms returned sat
[2022-06-05 16:53:09] [INFO ] After 27901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-05 16:53:10] [INFO ] State equation strengthened by 2277 read => feed constraints.
[2022-06-05 16:53:39] [INFO ] After 29406ms SMT Verify possible using 2277 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-05 16:53:51] [INFO ] Deduced a trap composed of 17 places in 9373 ms of which 2 ms to minimize.
[2022-06-05 16:54:07] [INFO ] Deduced a trap composed of 65 places in 15019 ms of which 3 ms to minimize.
[2022-06-05 16:54:18] [INFO ] Deduced a trap composed of 41 places in 9131 ms of which 2 ms to minimize.
[2022-06-05 16:54:29] [INFO ] Deduced a trap composed of 65 places in 9665 ms of which 1 ms to minimize.
[2022-06-05 16:54:40] [INFO ] Deduced a trap composed of 41 places in 9301 ms of which 29 ms to minimize.
[2022-06-05 16:54:48] [INFO ] Deduced a trap composed of 101 places in 5921 ms of which 1 ms to minimize.
[2022-06-05 16:54:58] [INFO ] Deduced a trap composed of 97 places in 8274 ms of which 26 ms to minimize.
[2022-06-05 16:55:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 82609 ms
[2022-06-05 16:55:21] [INFO ] After 130707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7965 ms.
[2022-06-05 16:55:29] [INFO ] After 168462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 65 out of 1383 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1383/1383 places, 144369/144369 transitions.
Applied a total of 0 rules in 2527 ms. Remains 1383 /1383 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1383/1383 places, 144369/144369 transitions.
Interrupted random walk after 151813 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen 0
Interrupted Best-First random walk after 228744 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=45 ) properties seen 0
Interrupted Best-First random walk after 768545 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=153 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4619 ms. (steps per millisecond=216 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 851576 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 0
Interrupted probabilistic random walk after 211321 steps, run timeout after 147004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 211321 steps, saw 191716 distinct states, run finished after 147010 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-05 16:58:49] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1383 cols
[2022-06-05 16:58:49] [INFO ] Computed 21 place invariants in 421 ms
[2022-06-05 16:58:49] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-05 16:58:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-05 16:58:50] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 26 ms returned sat
[2022-06-05 16:59:18] [INFO ] After 27772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-05 16:59:19] [INFO ] State equation strengthened by 2277 read => feed constraints.
[2022-06-05 16:59:44] [INFO ] After 24954ms SMT Verify possible using 2277 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-05 16:59:56] [INFO ] Deduced a trap composed of 17 places in 10187 ms of which 1 ms to minimize.
[2022-06-05 17:00:08] [INFO ] Deduced a trap composed of 65 places in 9568 ms of which 2 ms to minimize.
[2022-06-05 17:00:19] [INFO ] Deduced a trap composed of 41 places in 9279 ms of which 1 ms to minimize.
[2022-06-05 17:00:29] [INFO ] Deduced a trap composed of 65 places in 8566 ms of which 1 ms to minimize.
[2022-06-05 17:00:37] [INFO ] Deduced a trap composed of 41 places in 6677 ms of which 0 ms to minimize.
[2022-06-05 17:00:44] [INFO ] Deduced a trap composed of 101 places in 5562 ms of which 1 ms to minimize.
[2022-06-05 17:00:50] [INFO ] Deduced a trap composed of 97 places in 4319 ms of which 1 ms to minimize.
[2022-06-05 17:00:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 70300 ms
[2022-06-05 17:01:12] [INFO ] After 112364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 7147 ms.
[2022-06-05 17:01:19] [INFO ] After 149447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 65 out of 1383 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1383/1383 places, 144369/144369 transitions.
Applied a total of 0 rules in 1679 ms. Remains 1383 /1383 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1383/1383 places, 144369/144369 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1383/1383 places, 144369/144369 transitions.
Applied a total of 0 rules in 1562 ms. Remains 1383 /1383 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2022-06-05 17:01:22] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1383 cols
[2022-06-05 17:01:23] [INFO ] Computed 21 place invariants in 503 ms
[2022-06-05 17:01:31] [INFO ] Implicit Places using invariants in 8755 ms returned []
Implicit Place search using SMT only with invariants took 8756 ms to find 0 implicit places.
[2022-06-05 17:01:31] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1383 cols
[2022-06-05 17:01:31] [INFO ] Computed 21 place invariants in 402 ms
[2022-06-05 17:02:02] [INFO ] Performed 69087/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-05 17:02:31] [INFO ] Dead Transitions using invariants and state equation in 60472 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1383/1383 places, 144369/144369 transitions.
Interrupted random walk after 209235 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen 0
Interrupted Best-First random walk after 302051 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=60 ) properties seen 0
Interrupted Best-First random walk after 827111 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4366 ms. (steps per millisecond=229 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4835 ms. (steps per millisecond=206 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 247744 steps, run timeout after 147011 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 247744 steps, saw 224950 distinct states, run finished after 147016 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-05 17:05:48] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1383 cols
[2022-06-05 17:05:49] [INFO ] Computed 21 place invariants in 445 ms
[2022-06-05 17:05:49] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-05 17:05:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-05 17:05:49] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 30 ms returned sat
[2022-06-05 17:06:15] [INFO ] After 25405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-05 17:06:17] [INFO ] State equation strengthened by 2277 read => feed constraints.
[2022-06-05 17:06:43] [INFO ] After 26477ms SMT Verify possible using 2277 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-05 17:06:54] [INFO ] Deduced a trap composed of 17 places in 9353 ms of which 2 ms to minimize.
[2022-06-05 17:07:07] [INFO ] Deduced a trap composed of 65 places in 10641 ms of which 27 ms to minimize.
[2022-06-05 17:07:17] [INFO ] Deduced a trap composed of 41 places in 8534 ms of which 2 ms to minimize.
[2022-06-05 17:07:29] [INFO ] Deduced a trap composed of 65 places in 9565 ms of which 1 ms to minimize.
[2022-06-05 17:07:37] [INFO ] Deduced a trap composed of 41 places in 6562 ms of which 0 ms to minimize.
[2022-06-05 17:07:44] [INFO ] Deduced a trap composed of 101 places in 5385 ms of which 1 ms to minimize.
[2022-06-05 17:07:50] [INFO ] Deduced a trap composed of 97 places in 4329 ms of which 0 ms to minimize.
[2022-06-05 17:07:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 71074 ms
[2022-06-05 17:08:11] [INFO ] After 114052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6122 ms.
[2022-06-05 17:08:17] [INFO ] After 148213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 65 out of 1383 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1383/1383 places, 144369/144369 transitions.
Applied a total of 0 rules in 1512 ms. Remains 1383 /1383 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1383/1383 places, 144369/144369 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1383/1383 places, 144369/144369 transitions.
Applied a total of 0 rules in 1598 ms. Remains 1383 /1383 variables (removed 0) and now considering 144369/144369 (removed 0) transitions.
[2022-06-05 17:08:20] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1383 cols
[2022-06-05 17:08:21] [INFO ] Computed 21 place invariants in 379 ms
[2022-06-05 17:08:29] [INFO ] Implicit Places using invariants in 8636 ms returned []
Implicit Place search using SMT only with invariants took 8641 ms to find 0 implicit places.
[2022-06-05 17:08:29] [INFO ] Flow matrix only has 81238 transitions (discarded 63131 similar events)
// Phase 1: matrix 81238 rows 1383 cols
[2022-06-05 17:08:29] [INFO ] Computed 21 place invariants in 330 ms
[2022-06-05 17:09:00] [INFO ] Performed 76634/144369 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-05 17:09:28] [INFO ] Dead Transitions using invariants and state equation in 59159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1383/1383 places, 144369/144369 transitions.
Ensure Unique test removed 63131 transitions
Reduce isomorphic transitions removed 63131 transitions.
Iterating post reduction 0 with 63131 rules applied. Total rules applied 63131 place count 1383 transition count 81238
Applied a total of 63131 rules in 2582 ms. Remains 1383 /1383 variables (removed 0) and now considering 81238/144369 (removed 63131) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 81238 rows 1383 cols
[2022-06-05 17:09:32] [INFO ] Computed 21 place invariants in 215 ms
[2022-06-05 17:09:32] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-05 17:09:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-05 17:09:32] [INFO ] [Nat]Absence check using 3 positive and 18 generalized place invariants in 42 ms returned sat
[2022-06-05 17:10:01] [INFO ] After 28698ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-05 17:10:08] [INFO ] Deduced a trap composed of 41 places in 5758 ms of which 4 ms to minimize.
[2022-06-05 17:10:14] [INFO ] Deduced a trap composed of 65 places in 4749 ms of which 1 ms to minimize.
[2022-06-05 17:10:20] [INFO ] Deduced a trap composed of 65 places in 4237 ms of which 2 ms to minimize.
[2022-06-05 17:10:25] [INFO ] Deduced a trap composed of 97 places in 3486 ms of which 0 ms to minimize.
[2022-06-05 17:10:28] [INFO ] Deduced a trap composed of 97 places in 2445 ms of which 1 ms to minimize.
[2022-06-05 17:10:31] [INFO ] Deduced a trap composed of 65 places in 1702 ms of which 3 ms to minimize.
[2022-06-05 17:10:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 32212 ms
[2022-06-05 17:10:44] [INFO ] After 71963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5738 ms.
[2022-06-05 17:10:50] [INFO ] After 78132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-06-05 17:10:56] [INFO ] Flatten gal took : 4716 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10379824035304691612
[2022-06-05 17:11:00] [INFO ] Too many transitions (144369) to apply POR reductions. Disabling POR matrices.
[2022-06-05 17:11:02] [INFO ] Built C files in 1973ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10379824035304691612
Running compilation step : cd /tmp/ltsmin10379824035304691612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' '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-05 17:11:08] [INFO ] Applying decomposition
[2022-06-05 17:11:10] [INFO ] Flatten gal took : 9731 ms
[2022-06-05 17:11:18] [INFO ] Input system was already deterministic with 144369 transitions.
[2022-06-05 17:11:19] [INFO ] Flatten gal took : 10641 ms
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/graph9872316424142106565.txt' '-o' '/tmp/graph9872316424142106565.bin' '-w' '/tmp/graph9872316424142106565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9872316424142106565.bin' '-l' '-1' '-v' '-w' '/tmp/graph9872316424142106565.weights' '-q' '0' '-e' '0.001'
[2022-06-05 17:11:40] [INFO ] Decomposing Gal with order
[2022-06-05 17:11:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-05 17:11:54] [INFO ] Removed a total of 435778 redundant transitions.
[2022-06-05 17:11:57] [INFO ] Flatten gal took : 11456 ms
[2022-06-05 17:12:22] [INFO ] Ran tautology test, simplified 0 / 4 in 72103 ms.
[2022-06-05 17:12:22] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-05(UNSAT) depth K=0 took 66 ms
[2022-06-05 17:12:22] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-10(UNSAT) depth K=0 took 12 ms
[2022-06-05 17:12:22] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-12(UNSAT) depth K=0 took 2 ms
[2022-06-05 17:12:22] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-14(UNSAT) depth K=0 took 0 ms
[2022-06-05 17:12:23] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-05(UNSAT) depth K=1 took 68 ms
[2022-06-05 17:12:23] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-10(UNSAT) depth K=1 took 6 ms
[2022-06-05 17:12:23] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-12(UNSAT) depth K=1 took 2 ms
[2022-06-05 17:12:23] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-14(UNSAT) depth K=1 took 1 ms
[2022-06-05 17:12:39] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-05(UNSAT) depth K=2 took 10326 ms
[2022-06-05 17:12:39] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-10(UNSAT) depth K=2 took 56 ms
[2022-06-05 17:12:39] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-12(UNSAT) depth K=2 took 50 ms
[2022-06-05 17:12:39] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-14(UNSAT) depth K=2 took 34 ms
[2022-06-05 17:12:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 4899 labels/synchronizations in 27672 ms.
[2022-06-05 17:12:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4794041520009783994.gal : 637 ms
[2022-06-05 17:12:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2029778188508802465.prop : 1 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/ReachabilityCardinality4794041520009783994.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2029778188508802465.prop' '--nowitness' '--gen-order' 'FOLLOW'

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...319
[2022-06-05 17:12:56] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-05(UNSAT) depth K=3 took 13624 ms
[2022-06-05 17:12:58] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-10(UNSAT) depth K=3 took 1955 ms
[2022-06-05 17:13:01] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-12(UNSAT) depth K=3 took 2562 ms
[2022-06-05 17:13:03] [INFO ] BMC solution for property RERS17pb115-PT-4-ReachabilityCardinality-14(UNSAT) depth K=3 took 2733 ms

BK_STOP 1654449208841

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -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="RERS17pb115-PT-4"
export BK_EXAMINATION="ReachabilityCardinality"
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 RERS17pb115-PT-4, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-tajo-165281571900174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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