fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r521-tall-167987246100062
Last Updated
May 14, 2023

About the Execution of LTSMin+red for Anderson-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
641.056 3600000.00 14239617.00 556.20 FFFFFT?F?TFFF?FF 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.r521-tall-167987246100062.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 ltsminxred
Input is Anderson-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246100062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 31 16:48 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 Anderson-PT-11-ReachabilityCardinality-00
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-01
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-02
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-03
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-04
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-05
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-06
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-07
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-08
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-09
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-10
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-11
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-12
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-13
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-14
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680867839871

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 11:44:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 11:44:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 11:44:03] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-04-07 11:44:03] [INFO ] Transformed 749 places.
[2023-04-07 11:44:03] [INFO ] Transformed 3245 transitions.
[2023-04-07 11:44:03] [INFO ] Found NUPN structural information;
[2023-04-07 11:44:03] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-11-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 13) seen :5
FORMULA Anderson-PT-11-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :1
FORMULA Anderson-PT-11-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 3245 rows 749 cols
[2023-04-07 11:44:04] [INFO ] Computed 25 invariants in 76 ms
[2023-04-07 11:44:05] [INFO ] After 514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 11:44:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-04-07 11:44:05] [INFO ] [Nat]Absence check using 12 positive and 13 generalized place invariants in 29 ms returned sat
[2023-04-07 11:44:10] [INFO ] After 4225ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-04-07 11:44:10] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:11] [INFO ] After 1410ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :1 sat :6
[2023-04-07 11:44:13] [INFO ] After 3422ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 1305 ms.
[2023-04-07 11:44:14] [INFO ] After 9392ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA Anderson-PT-11-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 96 ms.
Support contains 42 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 86 Pre rules applied. Total rules applied 0 place count 749 transition count 3159
Deduced a syphon composed of 86 places in 7 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 0 with 172 rules applied. Total rules applied 172 place count 663 transition count 3159
Discarding 197 places :
Symmetric choice reduction at 0 with 197 rule applications. Total rules 369 place count 466 transition count 922
Iterating global reduction 0 with 197 rules applied. Total rules applied 566 place count 466 transition count 922
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 594 place count 452 transition count 908
Applied a total of 594 rules in 244 ms. Remains 452 /749 variables (removed 297) and now considering 908/3245 (removed 2337) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 452/749 places, 908/3245 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :2
FORMULA Anderson-PT-11-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 908 rows 452 cols
[2023-04-07 11:44:15] [INFO ] Computed 25 invariants in 44 ms
[2023-04-07 11:44:15] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-04-07 11:44:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 20 ms returned sat
[2023-04-07 11:44:16] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 18 ms returned sat
[2023-04-07 11:44:16] [INFO ] After 740ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-04-07 11:44:16] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:17] [INFO ] After 741ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 11:44:18] [INFO ] After 1071ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 316 ms.
[2023-04-07 11:44:18] [INFO ] After 2389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 28 ms.
Support contains 23 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 908/908 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 452 transition count 904
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 448 transition count 904
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 444 transition count 820
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 444 transition count 820
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 26 place count 439 transition count 815
Applied a total of 26 rules in 64 ms. Remains 439 /452 variables (removed 13) and now considering 815/908 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 439/452 places, 815/908 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 316679 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{0=1}
Probabilistic random walk after 316679 steps, saw 246335 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :1
FORMULA Anderson-PT-11-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 815 rows 439 cols
[2023-04-07 11:44:21] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 11:44:21] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 11:44:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-04-07 11:44:21] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 13 ms returned sat
[2023-04-07 11:44:22] [INFO ] After 618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 11:44:22] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:23] [INFO ] After 1196ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 11:44:24] [INFO ] After 1545ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 299 ms.
[2023-04-07 11:44:24] [INFO ] After 2644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 21 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 815/815 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 437 transition count 813
Applied a total of 4 rules in 70 ms. Remains 437 /439 variables (removed 2) and now considering 813/815 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 437/439 places, 813/815 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 370107 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 370107 steps, saw 286860 distinct states, run finished after 3002 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 813 rows 437 cols
[2023-04-07 11:44:27] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 11:44:28] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 11:44:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 11:44:28] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 20 ms returned sat
[2023-04-07 11:44:29] [INFO ] After 641ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 11:44:29] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:29] [INFO ] After 334ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 11:44:29] [INFO ] After 581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 265 ms.
[2023-04-07 11:44:29] [INFO ] After 1685ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 20 ms.
Support contains 21 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 813/813 transitions.
Applied a total of 0 rules in 18 ms. Remains 437 /437 variables (removed 0) and now considering 813/813 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 437/437 places, 813/813 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 813/813 transitions.
Applied a total of 0 rules in 17 ms. Remains 437 /437 variables (removed 0) and now considering 813/813 (removed 0) transitions.
[2023-04-07 11:44:29] [INFO ] Invariant cache hit.
[2023-04-07 11:44:30] [INFO ] Implicit Places using invariants in 678 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 680 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 436/437 places, 813/813 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 436 transition count 718
Reduce places removed 95 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 105 rules applied. Total rules applied 200 place count 341 transition count 708
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 210 place count 331 transition count 708
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 223 place count 331 transition count 695
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 236 place count 318 transition count 695
Applied a total of 236 rules in 41 ms. Remains 318 /436 variables (removed 118) and now considering 695/813 (removed 118) transitions.
// Phase 1: matrix 695 rows 318 cols
[2023-04-07 11:44:30] [INFO ] Computed 24 invariants in 8 ms
[2023-04-07 11:44:31] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-04-07 11:44:31] [INFO ] Invariant cache hit.
[2023-04-07 11:44:31] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:32] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 318/437 places, 695/813 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2212 ms. Remains : 318/437 places, 695/813 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 246932 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246932 steps, saw 189713 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-07 11:44:35] [INFO ] Invariant cache hit.
[2023-04-07 11:44:35] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 11:44:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 11:44:35] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 11:44:36] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 11:44:36] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:36] [INFO ] After 174ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 11:44:36] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-04-07 11:44:36] [INFO ] After 1028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 17 ms.
Support contains 21 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 695/695 transitions.
Applied a total of 0 rules in 12 ms. Remains 318 /318 variables (removed 0) and now considering 695/695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 318/318 places, 695/695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 695/695 transitions.
Applied a total of 0 rules in 10 ms. Remains 318 /318 variables (removed 0) and now considering 695/695 (removed 0) transitions.
[2023-04-07 11:44:36] [INFO ] Invariant cache hit.
[2023-04-07 11:44:37] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-04-07 11:44:37] [INFO ] Invariant cache hit.
[2023-04-07 11:44:37] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 11:44:38] [INFO ] Implicit Places using invariants and state equation in 1385 ms returned []
Implicit Place search using SMT with State Equation took 1690 ms to find 0 implicit places.
[2023-04-07 11:44:38] [INFO ] Redundant transitions in 49 ms returned []
[2023-04-07 11:44:38] [INFO ] Invariant cache hit.
[2023-04-07 11:44:39] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2446 ms. Remains : 318/318 places, 695/695 transitions.
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 116 Pre rules applied. Total rules applied 0 place count 318 transition count 579
Deduced a syphon composed of 116 places in 0 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 0 with 232 rules applied. Total rules applied 232 place count 202 transition count 579
Applied a total of 232 rules in 36 ms. Remains 202 /318 variables (removed 116) and now considering 579/695 (removed 116) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 579 rows 202 cols
[2023-04-07 11:44:39] [INFO ] Computed 24 invariants in 5 ms
[2023-04-07 11:44:39] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 11:44:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 11:44:39] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 6 ms returned sat
[2023-04-07 11:44:39] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 11:44:39] [INFO ] After 468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-04-07 11:44:39] [INFO ] After 607ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-04-07 11:44:39] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 16 ms.
[2023-04-07 11:44:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 318 places, 695 transitions and 2746 arcs took 4 ms.
[2023-04-07 11:44:40] [INFO ] Flatten gal took : 102 ms
Total runtime 37018 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/524/inv_0_ --invariant=/tmp/524/inv_1_ --invariant=/tmp/524/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15613932 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102416 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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="Anderson-PT-11"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-11, 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 r521-tall-167987246100062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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