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

About the Execution of ITS-Tools for RERS17pb114-PT-8

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16170.991 1511336.00 1913107.00 12101.00 F?T?TF???F??FF?F normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281571800134.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 RERS17pb114-PT-8, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281571800134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 8.0K Apr 29 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 29 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 29 17:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 17:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 29 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 29 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 29 17:53 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 73M 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 RERS17pb114-PT-8-ReachabilityCardinality-00
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-01
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-02
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-03
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-04
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-05
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-06
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-07
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-08
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-09
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-10
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-11
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-12
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-13
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-14
FORMULA_NAME RERS17pb114-PT-8-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654445739319

Running Version 202205111006
[2022-06-05 16:15:40] [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:15:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-05 16:15:43] [INFO ] Load time of PNML (sax parser for PT used): 2676 ms
[2022-06-05 16:15:43] [INFO ] Transformed 1446 places.
[2022-06-05 16:15:44] [INFO ] Transformed 151085 transitions.
[2022-06-05 16:15:44] [INFO ] Parsed PT model containing 1446 places and 151085 transitions in 3651 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2449 ms. (steps per millisecond=4 ) properties (out of 16) seen :4
FORMULA RERS17pb114-PT-8-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-8-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-8-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-8-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2022-06-05 16:15:51] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2022-06-05 16:15:51] [INFO ] Computed 35 place invariants in 629 ms
[2022-06-05 16:15:52] [INFO ] After 689ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-05 16:15:52] [INFO ] [Nat]Absence check using 18 positive place invariants in 25 ms returned sat
[2022-06-05 16:15:52] [INFO ] [Nat]Absence check using 18 positive and 17 generalized place invariants in 28 ms returned sat
[2022-06-05 16:16:17] [INFO ] After 24496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-06-05 16:16:20] [INFO ] State equation strengthened by 2342 read => feed constraints.
[2022-06-05 16:16:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-05 16:16:20] [INFO ] After 28074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 122 out of 1446 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1446/1446 places, 151085/151085 transitions.
Ensure Unique test removed 17 places
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 529 rules applied. Total rules applied 529 place count 1429 transition count 150573
Applied a total of 529 rules in 3382 ms. Remains 1429 /1446 variables (removed 17) and now considering 150573/151085 (removed 512) transitions.
Finished structural reductions, in 1 iterations. Remains : 1429/1446 places, 150573/151085 transitions.
Interrupted random walk after 178339 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen 3
FORMULA RERS17pb114-PT-8-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-8-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-8-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 974630 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=194 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4975 ms. (steps per millisecond=201 ) properties (out of 9) seen :0
Interrupted Best-First random walk after 851099 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=170 ) properties seen 0
Interrupted Best-First random walk after 837231 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen 0
Interrupted Best-First random walk after 942572 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=188 ) properties seen 0
Interrupted Best-First random walk after 880973 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=176 ) properties seen 0
Interrupted Best-First random walk after 911428 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=182 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4501 ms. (steps per millisecond=222 ) properties (out of 9) seen :1
FORMULA RERS17pb114-PT-8-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 931937 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen 0
Running SMT prover for 8 properties.
[2022-06-05 16:17:39] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:17:39] [INFO ] Computed 18 place invariants in 622 ms
[2022-06-05 16:17:40] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2022-06-05 16:17:40] [INFO ] After 465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-05 16:17:40] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2022-06-05 16:18:12] [INFO ] After 32203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-05 16:18:14] [INFO ] State equation strengthened by 2341 read => feed constraints.
[2022-06-05 16:18:45] [INFO ] After 31641ms SMT Verify possible using 2341 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-06-05 16:18:57] [INFO ] Deduced a trap composed of 97 places in 9316 ms of which 6 ms to minimize.
[2022-06-05 16:19:07] [INFO ] Deduced a trap composed of 41 places in 8449 ms of which 3 ms to minimize.
[2022-06-05 16:19:17] [INFO ] Deduced a trap composed of 97 places in 8510 ms of which 2 ms to minimize.
[2022-06-05 16:19:24] [INFO ] Deduced a trap composed of 97 places in 5979 ms of which 2 ms to minimize.
[2022-06-05 16:19:31] [INFO ] Deduced a trap composed of 97 places in 4670 ms of which 1 ms to minimize.
[2022-06-05 16:19:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 49517 ms
[2022-06-05 16:20:14] [INFO ] After 120457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 12389 ms.
[2022-06-05 16:20:27] [INFO ] After 167087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 53 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 2258 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1429/1429 places, 150573/150573 transitions.
Interrupted random walk after 154790 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen 0
Interrupted Best-First random walk after 838582 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen 0
Interrupted Best-First random walk after 843087 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=168 ) properties seen 0
Interrupted Best-First random walk after 739170 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen 0
Interrupted Best-First random walk after 667187 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=133 ) properties seen 0
Interrupted Best-First random walk after 711870 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=142 ) properties seen 0
Interrupted Best-First random walk after 696214 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=139 ) properties seen 0
Interrupted Best-First random walk after 753624 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen 0
Interrupted Best-First random walk after 688746 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=137 ) properties seen 0
Interrupted probabilistic random walk after 249671 steps, run timeout after 210006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 249671 steps, saw 231869 distinct states, run finished after 210014 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 8 properties.
[2022-06-05 16:25:10] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:25:10] [INFO ] Computed 18 place invariants in 551 ms
[2022-06-05 16:25:11] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2022-06-05 16:25:11] [INFO ] After 428ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-05 16:25:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 24 ms returned sat
[2022-06-05 16:25:42] [INFO ] After 30825ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-05 16:25:44] [INFO ] State equation strengthened by 2341 read => feed constraints.
[2022-06-05 16:26:14] [INFO ] After 30690ms SMT Verify possible using 2341 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-06-05 16:26:24] [INFO ] Deduced a trap composed of 97 places in 8420 ms of which 1 ms to minimize.
[2022-06-05 16:26:33] [INFO ] Deduced a trap composed of 41 places in 7475 ms of which 2 ms to minimize.
[2022-06-05 16:26:42] [INFO ] Deduced a trap composed of 97 places in 7025 ms of which 2 ms to minimize.
[2022-06-05 16:26:50] [INFO ] Deduced a trap composed of 97 places in 6260 ms of which 2 ms to minimize.
[2022-06-05 16:26:56] [INFO ] Deduced a trap composed of 97 places in 4398 ms of which 0 ms to minimize.
[2022-06-05 16:27:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 45571 ms
[2022-06-05 16:27:38] [INFO ] After 114413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 12006 ms.
[2022-06-05 16:27:50] [INFO ] After 159430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 53 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 1769 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1429/1429 places, 150573/150573 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 2051 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
[2022-06-05 16:27:54] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:27:55] [INFO ] Computed 18 place invariants in 566 ms
[2022-06-05 16:28:02] [INFO ] Implicit Places using invariants in 8186 ms returned []
Implicit Place search using SMT only with invariants took 8187 ms to find 0 implicit places.
[2022-06-05 16:28:02] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:28:03] [INFO ] Computed 18 place invariants in 534 ms
[2022-06-05 16:28:33] [INFO ] Performed 104924/150573 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-05 16:28:46] [INFO ] Dead Transitions using invariants and state equation in 44122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1429/1429 places, 150573/150573 transitions.
Interrupted random walk after 212881 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4281 ms. (steps per millisecond=233 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4132 ms. (steps per millisecond=242 ) properties (out of 8) seen :0
Interrupted Best-First random walk after 666895 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=133 ) properties seen 0
Interrupted Best-First random walk after 599776 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=119 ) properties seen 0
Interrupted Best-First random walk after 648620 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=129 ) properties seen 0
Interrupted Best-First random walk after 702416 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=140 ) properties seen 0
Interrupted Best-First random walk after 687772 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=137 ) properties seen 0
Interrupted Best-First random walk after 834546 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen 0
Interrupted probabilistic random walk after 335086 steps, run timeout after 204005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 335086 steps, saw 310953 distinct states, run finished after 204006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 8 properties.
[2022-06-05 16:33:20] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:33:20] [INFO ] Computed 18 place invariants in 389 ms
[2022-06-05 16:33:20] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2022-06-05 16:33:20] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-05 16:33:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2022-06-05 16:33:52] [INFO ] After 31153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-05 16:33:53] [INFO ] State equation strengthened by 2341 read => feed constraints.
[2022-06-05 16:34:24] [INFO ] After 31328ms SMT Verify possible using 2341 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-06-05 16:34:34] [INFO ] Deduced a trap composed of 97 places in 8082 ms of which 2 ms to minimize.
[2022-06-05 16:34:44] [INFO ] Deduced a trap composed of 41 places in 7482 ms of which 2 ms to minimize.
[2022-06-05 16:34:52] [INFO ] Deduced a trap composed of 97 places in 7355 ms of which 1 ms to minimize.
[2022-06-05 16:35:00] [INFO ] Deduced a trap composed of 97 places in 5945 ms of which 1 ms to minimize.
[2022-06-05 16:35:05] [INFO ] Deduced a trap composed of 97 places in 3894 ms of which 1 ms to minimize.
[2022-06-05 16:35:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 45657 ms
[2022-06-05 16:35:50] [INFO ] After 117064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 13080 ms.
[2022-06-05 16:36:03] [INFO ] After 162863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 53 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 1695 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1429/1429 places, 150573/150573 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 1392 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
[2022-06-05 16:36:06] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:36:07] [INFO ] Computed 18 place invariants in 428 ms
[2022-06-05 16:36:15] [INFO ] Implicit Places using invariants in 8218 ms returned []
Implicit Place search using SMT only with invariants took 8220 ms to find 0 implicit places.
[2022-06-05 16:36:15] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:36:15] [INFO ] Computed 18 place invariants in 479 ms
[2022-06-05 16:36:45] [INFO ] Performed 95161/150573 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-05 16:37:04] [INFO ] Dead Transitions using invariants and state equation in 49072 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1429/1429 places, 150573/150573 transitions.
Ensure Unique test removed 65883 transitions
Reduce isomorphic transitions removed 65883 transitions.
Iterating post reduction 0 with 65883 rules applied. Total rules applied 65883 place count 1429 transition count 84690
Applied a total of 65883 rules in 3215 ms. Remains 1429 /1429 variables (removed 0) and now considering 84690/150573 (removed 65883) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:37:08] [INFO ] Computed 18 place invariants in 574 ms
[2022-06-05 16:37:09] [INFO ] [Real]Absence check using 18 positive place invariants in 19 ms returned sat
[2022-06-05 16:37:09] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-05 16:37:09] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2022-06-05 16:37:41] [INFO ] After 31815ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-05 16:37:46] [INFO ] Deduced a trap composed of 97 places in 3779 ms of which 1 ms to minimize.
[2022-06-05 16:37:50] [INFO ] Deduced a trap composed of 97 places in 2971 ms of which 1 ms to minimize.
[2022-06-05 16:37:54] [INFO ] Deduced a trap composed of 97 places in 2362 ms of which 1 ms to minimize.
[2022-06-05 16:37:58] [INFO ] Deduced a trap composed of 97 places in 1764 ms of which 1 ms to minimize.
[2022-06-05 16:38:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 19378 ms
[2022-06-05 16:38:25] [INFO ] After 75888ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 12594 ms.
[2022-06-05 16:38:38] [INFO ] After 89009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-06-05 16:38:44] [INFO ] Flatten gal took : 4807 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11265144193543304865
[2022-06-05 16:38:47] [INFO ] Too many transitions (150573) to apply POR reductions. Disabling POR matrices.
[2022-06-05 16:38:49] [INFO ] Built C files in 1731ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11265144193543304865
Running compilation step : cd /tmp/ltsmin11265144193543304865;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '90' '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 16:38:52] [INFO ] Applying decomposition
[2022-06-05 16:38:55] [INFO ] Flatten gal took : 8193 ms
[2022-06-05 16:38:58] [INFO ] Flatten gal took : 5847 ms
[2022-06-05 16:39:04] [INFO ] Input system was already deterministic with 150573 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/graph15824238157859042234.txt' '-o' '/tmp/graph15824238157859042234.bin' '-w' '/tmp/graph15824238157859042234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15824238157859042234.bin' '-l' '-1' '-v' '-w' '/tmp/graph15824238157859042234.weights' '-q' '0' '-e' '0.001'
[2022-06-05 16:39:12] [INFO ] Decomposing Gal with order
[2022-06-05 16:39:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-05 16:39:26] [INFO ] Removed a total of 457084 redundant transitions.
[2022-06-05 16:39:28] [INFO ] Flatten gal took : 9697 ms
[2022-06-05 16:39:55] [INFO ] Ran tautology test, simplified 0 / 8 in 59531 ms.
[2022-06-05 16:39:55] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-01(UNSAT) depth K=0 took 220 ms
[2022-06-05 16:39:55] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-03(UNSAT) depth K=0 took 18 ms
[2022-06-05 16:39:55] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-06(UNSAT) depth K=0 took 1 ms
[2022-06-05 16:39:55] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-07(UNSAT) depth K=0 took 0 ms
[2022-06-05 16:39:55] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-08(UNSAT) depth K=0 took 1 ms
[2022-06-05 16:39:55] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-10(UNSAT) depth K=0 took 0 ms
[2022-06-05 16:39:55] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-11(UNSAT) depth K=0 took 1 ms
[2022-06-05 16:39:55] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-14(UNSAT) depth K=0 took 0 ms
[2022-06-05 16:39:57] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-01(UNSAT) depth K=1 took 169 ms
[2022-06-05 16:39:57] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-03(UNSAT) depth K=1 took 69 ms
[2022-06-05 16:39:57] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-06(UNSAT) depth K=1 took 52 ms
[2022-06-05 16:39:57] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-07(UNSAT) depth K=1 took 52 ms
[2022-06-05 16:39:57] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-08(UNSAT) depth K=1 took 51 ms
[2022-06-05 16:39:57] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-10(UNSAT) depth K=1 took 52 ms
[2022-06-05 16:39:58] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-11(UNSAT) depth K=1 took 631 ms
[2022-06-05 16:39:58] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-14(UNSAT) depth K=1 took 152 ms
[2022-06-05 16:40:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 3857 labels/synchronizations in 21129 ms.
[2022-06-05 16:40:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13930106255723864753.gal : 677 ms
[2022-06-05 16:40:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15213772206802719776.prop : 2 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/ReachabilityCardinality13930106255723864753.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15213772206802719776.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...321
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/ltsmin11265144193543304865;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '90' '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 90 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11265144193543304865;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '90' '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 90 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-05 16:40:37] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-01(UNSAT) depth K=2 took 33530 ms
[2022-06-05 16:40:38] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-03(UNSAT) depth K=2 took 1251 ms
[2022-06-05 16:40:38] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-06(UNSAT) depth K=2 took 35 ms
[2022-06-05 16:40:39] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-07(UNSAT) depth K=2 took 59 ms
[2022-06-05 16:40:39] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-08(UNSAT) depth K=2 took 38 ms
[2022-06-05 16:40:39] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-10(UNSAT) depth K=2 took 42 ms
[2022-06-05 16:40:39] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-11(UNSAT) depth K=2 took 68 ms
[2022-06-05 16:40:39] [INFO ] BMC solution for property RERS17pb114-PT-8-ReachabilityCardinality-14(UNSAT) depth K=2 took 45 ms

BK_STOP 1654447250655

--------------------
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
++ 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 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="RERS17pb114-PT-8"
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 RERS17pb114-PT-8, 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-165281571800134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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