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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
673.415 3600000.00 14118999.00 656.70 F?FTTFTTT??T?TF? 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-167987246200071.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-12, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246200071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 8.2K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K 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 2.1M 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-12-ReachabilityFireability-00
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-01
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-02
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-03
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-04
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-05
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-06
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-07
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-08
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-09
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-10
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-11
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-12
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-13
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-14
FORMULA_NAME Anderson-PT-12-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1680871361520

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 12:42:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 12:42:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 12:42:43] [INFO ] Load time of PNML (sax parser for PT used): 274 ms
[2023-04-07 12:42:43] [INFO ] Transformed 889 places.
[2023-04-07 12:42:43] [INFO ] Transformed 4152 transitions.
[2023-04-07 12:42:43] [INFO ] Found NUPN structural information;
[2023-04-07 12:42:43] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 424 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 668 ms. (steps per millisecond=14 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :1
FORMULA Anderson-PT-12-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 133516 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{2=1}
Probabilistic random walk after 133516 steps, saw 106016 distinct states, run finished after 3004 ms. (steps per millisecond=44 ) properties seen :1
FORMULA Anderson-PT-12-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 14 properties.
// Phase 1: matrix 4152 rows 889 cols
[2023-04-07 12:42:48] [INFO ] Computed 27 invariants in 100 ms
[2023-04-07 12:42:49] [INFO ] After 635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-04-07 12:42:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 26 ms returned sat
[2023-04-07 12:42:49] [INFO ] [Nat]Absence check using 13 positive and 14 generalized place invariants in 14 ms returned sat
[2023-04-07 12:42:57] [INFO ] After 7287ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :12
[2023-04-07 12:42:57] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:43:02] [INFO ] After 4640ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :2 sat :12
[2023-04-07 12:43:04] [INFO ] Deduced a trap composed of 291 places in 696 ms of which 8 ms to minimize.
[2023-04-07 12:43:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 877 ms
[2023-04-07 12:43:05] [INFO ] Deduced a trap composed of 213 places in 665 ms of which 2 ms to minimize.
[2023-04-07 12:43:06] [INFO ] Deduced a trap composed of 253 places in 709 ms of which 2 ms to minimize.
[2023-04-07 12:43:07] [INFO ] Deduced a trap composed of 281 places in 627 ms of which 2 ms to minimize.
[2023-04-07 12:43:08] [INFO ] Deduced a trap composed of 213 places in 921 ms of which 1 ms to minimize.
[2023-04-07 12:43:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3367 ms
[2023-04-07 12:43:10] [INFO ] Deduced a trap composed of 181 places in 671 ms of which 1 ms to minimize.
[2023-04-07 12:43:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 863 ms
[2023-04-07 12:43:11] [INFO ] Deduced a trap composed of 426 places in 586 ms of which 1 ms to minimize.
[2023-04-07 12:43:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 776 ms
[2023-04-07 12:43:11] [INFO ] After 14161ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 2571 ms.
[2023-04-07 12:43:14] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :11
FORMULA Anderson-PT-12-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Anderson-PT-12-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 388 ms.
Support contains 132 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 122 Pre rules applied. Total rules applied 0 place count 889 transition count 4030
Deduced a syphon composed of 122 places in 2 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 0 with 244 rules applied. Total rules applied 244 place count 767 transition count 4030
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 423 place count 588 transition count 2641
Iterating global reduction 0 with 179 rules applied. Total rules applied 602 place count 588 transition count 2641
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 616 place count 581 transition count 2634
Applied a total of 616 rules in 451 ms. Remains 581 /889 variables (removed 308) and now considering 2634/4152 (removed 1518) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 581/889 places, 2634/4152 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :3
FORMULA Anderson-PT-12-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-12-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-12-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :1
FORMULA Anderson-PT-12-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :1
FORMULA Anderson-PT-12-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :1
FORMULA Anderson-PT-12-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2634 rows 581 cols
[2023-04-07 12:43:16] [INFO ] Computed 27 invariants in 75 ms
[2023-04-07 12:43:16] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 12:43:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-04-07 12:43:16] [INFO ] [Nat]Absence check using 13 positive and 14 generalized place invariants in 22 ms returned sat
[2023-04-07 12:43:19] [INFO ] After 2856ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 12:43:19] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:43:21] [INFO ] After 2150ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 12:43:23] [INFO ] After 3980ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1233 ms.
[2023-04-07 12:43:25] [INFO ] After 8328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 69 ms.
Support contains 79 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 2634/2634 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 540 transition count 1713
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 540 transition count 1713
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 86 place count 538 transition count 1711
Applied a total of 86 rules in 66 ms. Remains 538 /581 variables (removed 43) and now considering 1711/2634 (removed 923) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 538/581 places, 1711/2634 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :1
FORMULA Anderson-PT-12-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1711 rows 538 cols
[2023-04-07 12:43:25] [INFO ] Computed 27 invariants in 10 ms
[2023-04-07 12:43:25] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 12:43:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 12:43:25] [INFO ] [Nat]Absence check using 13 positive and 14 generalized place invariants in 22 ms returned sat
[2023-04-07 12:43:27] [INFO ] After 1841ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 12:43:27] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:43:30] [INFO ] After 2635ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 12:43:40] [INFO ] After 12736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 925 ms.
[2023-04-07 12:43:41] [INFO ] After 15684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 20 ms.
Support contains 37 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 1711/1711 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 538 transition count 1709
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 536 transition count 1709
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 24 place count 516 transition count 1249
Iterating global reduction 0 with 20 rules applied. Total rules applied 44 place count 516 transition count 1249
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 54 place count 511 transition count 1244
Applied a total of 54 rules in 54 ms. Remains 511 /538 variables (removed 27) and now considering 1244/1711 (removed 467) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 511/538 places, 1244/1711 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 262335 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262335 steps, saw 202659 distinct states, run finished after 3002 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1244 rows 511 cols
[2023-04-07 12:43:44] [INFO ] Computed 27 invariants in 7 ms
[2023-04-07 12:43:45] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 12:43:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-04-07 12:43:45] [INFO ] [Nat]Absence check using 14 positive and 13 generalized place invariants in 19 ms returned sat
[2023-04-07 12:43:46] [INFO ] After 1379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 12:43:46] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:43:56] [INFO ] After 9939ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-04-07 12:43:57] [INFO ] After 10750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 556 ms.
[2023-04-07 12:43:57] [INFO ] After 12872ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 49 ms.
Support contains 37 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1244/1244 transitions.
Applied a total of 0 rules in 23 ms. Remains 511 /511 variables (removed 0) and now considering 1244/1244 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 511/511 places, 1244/1244 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1244/1244 transitions.
Applied a total of 0 rules in 22 ms. Remains 511 /511 variables (removed 0) and now considering 1244/1244 (removed 0) transitions.
[2023-04-07 12:43:58] [INFO ] Invariant cache hit.
[2023-04-07 12:43:58] [INFO ] Implicit Places using invariants in 626 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 629 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 510/511 places, 1244/1244 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 510 transition count 1159
Reduce places removed 85 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 106 rules applied. Total rules applied 191 place count 425 transition count 1138
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 212 place count 404 transition count 1138
Free-agglomeration rule (complex) applied 35 times.
Iterating global reduction 3 with 35 rules applied. Total rules applied 247 place count 404 transition count 1103
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 282 place count 369 transition count 1103
Applied a total of 282 rules in 64 ms. Remains 369 /510 variables (removed 141) and now considering 1103/1244 (removed 141) transitions.
// Phase 1: matrix 1103 rows 369 cols
[2023-04-07 12:43:58] [INFO ] Computed 26 invariants in 5 ms
[2023-04-07 12:43:59] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-04-07 12:43:59] [INFO ] Invariant cache hit.
[2023-04-07 12:43:59] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:44:00] [INFO ] Implicit Places using invariants and state equation in 1284 ms returned []
Implicit Place search using SMT with State Equation took 1651 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 369/511 places, 1103/1244 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2366 ms. Remains : 369/511 places, 1103/1244 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 307497 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 307497 steps, saw 230644 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 5 properties.
[2023-04-07 12:44:03] [INFO ] Invariant cache hit.
[2023-04-07 12:44:03] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 12:44:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-04-07 12:44:03] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 16 ms returned sat
[2023-04-07 12:44:04] [INFO ] After 930ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 12:44:04] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:44:06] [INFO ] After 1425ms SMT Verify possible using 132 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-04-07 12:44:07] [INFO ] After 2505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 696 ms.
[2023-04-07 12:44:08] [INFO ] After 4264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 54 ms.
Support contains 37 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 1103/1103 transitions.
Applied a total of 0 rules in 17 ms. Remains 369 /369 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 369/369 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 1103/1103 transitions.
Applied a total of 0 rules in 30 ms. Remains 369 /369 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2023-04-07 12:44:08] [INFO ] Invariant cache hit.
[2023-04-07 12:44:08] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-04-07 12:44:08] [INFO ] Invariant cache hit.
[2023-04-07 12:44:08] [INFO ] State equation strengthened by 132 read => feed constraints.
[2023-04-07 12:44:10] [INFO ] Implicit Places using invariants and state equation in 1671 ms returned []
Implicit Place search using SMT with State Equation took 1973 ms to find 0 implicit places.
[2023-04-07 12:44:10] [INFO ] Redundant transitions in 59 ms returned []
[2023-04-07 12:44:10] [INFO ] Invariant cache hit.
[2023-04-07 12:44:10] [INFO ] Dead Transitions using invariants and state equation in 553 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2666 ms. Remains : 369/369 places, 1103/1103 transitions.
Performed 141 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 141 Pre rules applied. Total rules applied 0 place count 369 transition count 962
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 0 with 282 rules applied. Total rules applied 282 place count 228 transition count 962
Applied a total of 282 rules in 16 ms. Remains 228 /369 variables (removed 141) and now considering 962/1103 (removed 141) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 962 rows 228 cols
[2023-04-07 12:44:10] [INFO ] Computed 26 invariants in 5 ms
[2023-04-07 12:44:10] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-04-07 12:44:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-04-07 12:44:11] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 15 ms returned sat
[2023-04-07 12:44:11] [INFO ] After 667ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-04-07 12:44:12] [INFO ] After 1119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 387 ms.
[2023-04-07 12:44:12] [INFO ] After 1671ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-04-07 12:44:12] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-04-07 12:44:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 369 places, 1103 transitions and 4404 arcs took 26 ms.
[2023-04-07 12:44:13] [INFO ] Flatten gal took : 254 ms
Total runtime 89881 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 --inv-bin-par --invariant=/tmp/539/inv_0_ --invariant=/tmp/539/inv_1_ --invariant=/tmp/539/inv_2_ --invariant=/tmp/539/inv_3_ --invariant=/tmp/539/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15605440 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102796 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityFireability -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-12"
export BK_EXAMINATION="ReachabilityFireability"
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-12, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246200071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-12.tgz
mv Anderson-PT-12 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;