About the Execution of 2022-gold for RERS17pb114-PT-3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3492.695 | 741053.00 | 822076.00 | 2457.10 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r352-tall-167889221000058.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is RERS17pb114-PT-3, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r352-tall-167889221000058
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 7.9K Feb 26 04:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 04:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 04:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 04:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 04:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 04:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 04:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 73M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1679138146806
Running Version 202205111006
[2023-03-18 11:15:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2023-03-18 11:15:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 11:15:50] [INFO ] Load time of PNML (sax parser for PT used): 2134 ms
[2023-03-18 11:15:50] [INFO ] Transformed 1446 places.
[2023-03-18 11:15:51] [INFO ] Transformed 151085 transitions.
[2023-03-18 11:15:51] [INFO ] Parsed PT model containing 1446 places and 151085 transitions in 3182 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1784 ms. (steps per millisecond=5 ) properties (out of 1446) seen :1107
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 339) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 339) seen :0
Running SMT prover for 339 properties.
[2023-03-18 11:15:54] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2023-03-18 11:15:55] [INFO ] Computed 35 place invariants in 453 ms
[2023-03-18 11:16:05] [INFO ] After 9860ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:339
[2023-03-18 11:16:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 26 ms returned sat
[2023-03-18 11:16:13] [INFO ] [Nat]Absence check using 18 positive and 17 generalized place invariants in 25 ms returned sat
[2023-03-18 11:16:30] [INFO ] After 7609ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :338
[2023-03-18 11:16:32] [INFO ] State equation strengthened by 2342 read => feed constraints.
[2023-03-18 11:16:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 11:16:32] [INFO ] After 27490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:339
Fused 339 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 339 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
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 530 place count 1428 transition count 150572
Applied a total of 530 rules in 3635 ms. Remains 1428 /1446 variables (removed 18) and now considering 150572/151085 (removed 513) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1446 places, 150572/151085 transitions.
Interrupted random walk after 276771 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 338
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3322 ms. (steps per millisecond=301 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:17:10] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 11:17:10] [INFO ] Computed 18 place invariants in 408 ms
[2023-03-18 11:17:10] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:17:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-18 11:17:31] [INFO ] After 20767ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:17:32] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 11:17:40] [INFO ] After 7560ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:17:54] [INFO ] Deduced a trap composed of 64 places in 12885 ms of which 8 ms to minimize.
[2023-03-18 11:18:06] [INFO ] Deduced a trap composed of 40 places in 10306 ms of which 3 ms to minimize.
[2023-03-18 11:18:18] [INFO ] Deduced a trap composed of 96 places in 10477 ms of which 3 ms to minimize.
[2023-03-18 11:18:30] [INFO ] Deduced a trap composed of 96 places in 10076 ms of which 2 ms to minimize.
[2023-03-18 11:18:41] [INFO ] Deduced a trap composed of 40 places in 9643 ms of which 2 ms to minimize.
[2023-03-18 11:18:52] [INFO ] Deduced a trap composed of 64 places in 9862 ms of which 2 ms to minimize.
[2023-03-18 11:19:03] [INFO ] Deduced a trap composed of 96 places in 9465 ms of which 1 ms to minimize.
[2023-03-18 11:19:13] [INFO ] Deduced a trap composed of 128 places in 8310 ms of which 1 ms to minimize.
[2023-03-18 11:19:21] [INFO ] Deduced a trap composed of 64 places in 7314 ms of which 1 ms to minimize.
[2023-03-18 11:19:30] [INFO ] Deduced a trap composed of 64 places in 6953 ms of which 1 ms to minimize.
[2023-03-18 11:19:38] [INFO ] Deduced a trap composed of 64 places in 6611 ms of which 1 ms to minimize.
[2023-03-18 11:19:45] [INFO ] Deduced a trap composed of 128 places in 5841 ms of which 1 ms to minimize.
[2023-03-18 11:19:51] [INFO ] Deduced a trap composed of 96 places in 4550 ms of which 1 ms to minimize.
[2023-03-18 11:19:57] [INFO ] Deduced a trap composed of 64 places in 3982 ms of which 0 ms to minimize.
[2023-03-18 11:20:02] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 141774 ms
[2023-03-18 11:20:03] [INFO ] After 150135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1659 ms.
[2023-03-18 11:20:04] [INFO ] After 173867ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1199 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 313708 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3301 ms. (steps per millisecond=302 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 174307 steps, run timeout after 99006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 174307 steps, saw 160927 distinct states, run finished after 99008 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:22:18] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 11:22:18] [INFO ] Computed 18 place invariants in 314 ms
[2023-03-18 11:22:19] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:22:19] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-18 11:22:41] [INFO ] After 21807ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:22:41] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 11:22:50] [INFO ] After 8594ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:23:05] [INFO ] Deduced a trap composed of 64 places in 13186 ms of which 2 ms to minimize.
[2023-03-18 11:23:17] [INFO ] Deduced a trap composed of 40 places in 11491 ms of which 2 ms to minimize.
[2023-03-18 11:23:31] [INFO ] Deduced a trap composed of 96 places in 12048 ms of which 2 ms to minimize.
[2023-03-18 11:23:44] [INFO ] Deduced a trap composed of 96 places in 11475 ms of which 2 ms to minimize.
[2023-03-18 11:23:55] [INFO ] Deduced a trap composed of 40 places in 9679 ms of which 2 ms to minimize.
[2023-03-18 11:24:05] [INFO ] Deduced a trap composed of 64 places in 8838 ms of which 1 ms to minimize.
[2023-03-18 11:24:15] [INFO ] Deduced a trap composed of 96 places in 8574 ms of which 2 ms to minimize.
[2023-03-18 11:24:25] [INFO ] Deduced a trap composed of 128 places in 8618 ms of which 1 ms to minimize.
[2023-03-18 11:24:34] [INFO ] Deduced a trap composed of 64 places in 7031 ms of which 1 ms to minimize.
[2023-03-18 11:24:42] [INFO ] Deduced a trap composed of 64 places in 6876 ms of which 1 ms to minimize.
[2023-03-18 11:24:50] [INFO ] Deduced a trap composed of 64 places in 6553 ms of which 1 ms to minimize.
[2023-03-18 11:24:57] [INFO ] Deduced a trap composed of 128 places in 5613 ms of which 1 ms to minimize.
[2023-03-18 11:25:03] [INFO ] Deduced a trap composed of 96 places in 4524 ms of which 1 ms to minimize.
[2023-03-18 11:25:08] [INFO ] Deduced a trap composed of 64 places in 3875 ms of which 0 ms to minimize.
[2023-03-18 11:25:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 142630 ms
[2023-03-18 11:25:13] [INFO ] After 152026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1363 ms.
[2023-03-18 11:25:15] [INFO ] After 176041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1190 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1151 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-18 11:25:17] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 11:25:17] [INFO ] Computed 18 place invariants in 259 ms
[2023-03-18 11:25:25] [INFO ] Implicit Places using invariants in 8408 ms returned []
Implicit Place search using SMT only with invariants took 8410 ms to find 0 implicit places.
[2023-03-18 11:25:26] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 11:25:26] [INFO ] Computed 18 place invariants in 244 ms
[2023-03-18 11:25:56] [INFO ] Performed 97280/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 11:26:12] [INFO ] Dead Transitions using invariants and state equation in 46924 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 8282 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 11:26:21] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 11:26:21] [INFO ] Computed 18 place invariants in 262 ms
[2023-03-18 11:26:22] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 11:26:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-18 11:26:43] [INFO ] After 21324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 11:26:44] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 11:26:51] [INFO ] After 7165ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 11:27:03] [INFO ] Deduced a trap composed of 64 places in 10395 ms of which 1 ms to minimize.
[2023-03-18 11:27:14] [INFO ] Deduced a trap composed of 40 places in 9691 ms of which 2 ms to minimize.
[2023-03-18 11:27:25] [INFO ] Deduced a trap composed of 96 places in 9364 ms of which 1 ms to minimize.
[2023-03-18 11:27:36] [INFO ] Deduced a trap composed of 96 places in 9877 ms of which 2 ms to minimize.
[2023-03-18 11:27:46] [INFO ] Deduced a trap composed of 40 places in 8782 ms of which 14 ms to minimize.
[2023-03-18 11:27:56] [INFO ] Deduced a trap composed of 64 places in 8428 ms of which 1 ms to minimize.
[2023-03-18 11:28:05] [INFO ] Deduced a trap composed of 96 places in 8308 ms of which 1 ms to minimize.
[2023-03-18 11:28:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 11:28:05] [INFO ] After 103906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Finished random walk after 21988 steps, including 0 resets, run visited all 1 properties in 1780 ms. (steps per millisecond=12 )
Able to resolve query StableMarking after proving 1446 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK TOPOLOGICAL
Total runtime 739783 ms.
BK_STOP 1679138887859
--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -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 1800 -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-3"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is RERS17pb114-PT-3, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r352-tall-167889221000058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb114-PT-3.tgz
mv RERS17pb114-PT-3 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;