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

About the Execution of LTSMin+red for FamilyReunion-PT-L00050M0005C002P002G001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7311.071 218635.00 452451.00 726.30 TFFTTTTFTFFFFFTT 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.r169-tall-167838855800414.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 FamilyReunion-PT-L00050M0005C002P002G001, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855800414
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.6M
-rw-r--r-- 1 mcc users 113K Feb 26 12:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 682K Feb 26 12:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 26 12:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 726K Feb 26 12:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 32K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 238K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 26 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 26 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 297K Feb 26 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 994K Feb 26 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.7M Mar 5 18:22 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 FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678541201938

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=FamilyReunion-PT-L00050M0005C002P002G001
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 13:26:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 13:26:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 13:26:43] [INFO ] Load time of PNML (sax parser for PT used): 328 ms
[2023-03-11 13:26:43] [INFO ] Transformed 12194 places.
[2023-03-11 13:26:43] [INFO ] Transformed 10560 transitions.
[2023-03-11 13:26:43] [INFO ] Parsed PT model containing 12194 places and 10560 transitions and 32238 arcs in 558 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 727 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 17 places and 0 transitions.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 15) seen :5
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 10) seen :1
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 10560 rows 12177 cols
[2023-03-11 13:26:47] [INFO ] Computed 2768 place invariants in 668 ms
[2023-03-11 13:26:51] [INFO ] [Real]Absence check using 149 positive place invariants in 320 ms returned sat
[2023-03-11 13:26:52] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1412 ms returned sat
[2023-03-11 13:26:53] [INFO ] After 4924ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 13:26:56] [INFO ] [Nat]Absence check using 149 positive place invariants in 312 ms returned sat
[2023-03-11 13:26:57] [INFO ] [Nat]Absence check using 149 positive and 2619 generalized place invariants in 1299 ms returned sat
[2023-03-11 13:27:18] [INFO ] After 19173ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-11 13:27:18] [INFO ] After 19187ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 13:27:18] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2738 out of 12177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Graph (complete) has 18927 edges and 12177 vertex of which 11623 are kept as prefixes of interest. Removing 554 places using SCC suffix rule.25 ms
Discarding 554 places :
Also discarding 427 output transitions
Drop transitions removed 427 transitions
Drop transitions removed 15 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 1823 places :
Implicit places reduction removed 1823 places
Drop transitions removed 1233 transitions
Trivial Post-agglo rules discarded 1233 transitions
Performed 1233 trivial Post agglomeration. Transition count delta: 1233
Iterating post reduction 0 with 3072 rules applied. Total rules applied 3073 place count 9800 transition count 8884
Reduce places removed 1233 places and 0 transitions.
Performed 962 Post agglomeration using F-continuation condition.Transition count delta: 962
Iterating post reduction 1 with 2195 rules applied. Total rules applied 5268 place count 8567 transition count 7922
Reduce places removed 962 places and 0 transitions.
Iterating post reduction 2 with 962 rules applied. Total rules applied 6230 place count 7605 transition count 7922
Performed 452 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 452 Pre rules applied. Total rules applied 6230 place count 7605 transition count 7470
Deduced a syphon composed of 452 places in 23 ms
Ensure Unique test removed 198 places
Reduce places removed 650 places and 0 transitions.
Iterating global reduction 3 with 1102 rules applied. Total rules applied 7332 place count 6955 transition count 7470
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 7336 place count 6951 transition count 7470
Discarding 858 places :
Symmetric choice reduction at 4 with 858 rule applications. Total rules 8194 place count 6093 transition count 6568
Iterating global reduction 4 with 858 rules applied. Total rules applied 9052 place count 6093 transition count 6568
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Iterating post reduction 4 with 52 rules applied. Total rules applied 9104 place count 6093 transition count 6516
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 9156 place count 6041 transition count 6516
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 197 Pre rules applied. Total rules applied 9156 place count 6041 transition count 6319
Deduced a syphon composed of 197 places in 6 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 6 with 394 rules applied. Total rules applied 9550 place count 5844 transition count 6319
Discarding 100 places :
Symmetric choice reduction at 6 with 100 rule applications. Total rules 9650 place count 5744 transition count 6219
Iterating global reduction 6 with 100 rules applied. Total rules applied 9750 place count 5744 transition count 6219
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 49 Pre rules applied. Total rules applied 9750 place count 5744 transition count 6170
Deduced a syphon composed of 49 places in 5 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 9848 place count 5695 transition count 6170
Performed 151 Post agglomeration using F-continuation condition.Transition count delta: 151
Deduced a syphon composed of 151 places in 9 ms
Ensure Unique test removed 50 places
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 6 with 352 rules applied. Total rules applied 10200 place count 5494 transition count 6019
Free-agglomeration rule (complex) applied 297 times.
Iterating global reduction 6 with 297 rules applied. Total rules applied 10497 place count 5494 transition count 5722
Reduce places removed 297 places and 0 transitions.
Iterating post reduction 6 with 297 rules applied. Total rules applied 10794 place count 5197 transition count 5722
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 10797 place count 5197 transition count 5722
Applied a total of 10797 rules in 3014 ms. Remains 5197 /12177 variables (removed 6980) and now considering 5722/10560 (removed 4838) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3016 ms. Remains : 5197/12177 places, 5722/10560 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 7) seen :3
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 5722 rows 5197 cols
[2023-03-11 13:27:22] [INFO ] Computed 538 place invariants in 144 ms
[2023-03-11 13:27:23] [INFO ] After 736ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 13:27:24] [INFO ] [Nat]Absence check using 0 positive and 538 generalized place invariants in 218 ms returned sat
[2023-03-11 13:27:43] [INFO ] After 19408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 13:27:47] [INFO ] After 22905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 931 ms.
[2023-03-11 13:27:48] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 79 ms.
Support contains 306 out of 5197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5197/5197 places, 5722/5722 transitions.
Graph (complete) has 9079 edges and 5197 vertex of which 4441 are kept as prefixes of interest. Removing 756 places using SCC suffix rule.2 ms
Discarding 756 places :
Also discarding 745 output transitions
Drop transitions removed 745 transitions
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 2059 transitions
Trivial Post-agglo rules discarded 2059 transitions
Performed 2059 trivial Post agglomeration. Transition count delta: 2059
Iterating post reduction 0 with 2172 rules applied. Total rules applied 2173 place count 4430 transition count 2816
Reduce places removed 2059 places and 0 transitions.
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Iterating post reduction 1 with 2215 rules applied. Total rules applied 4388 place count 2371 transition count 2660
Reduce places removed 156 places and 0 transitions.
Iterating post reduction 2 with 156 rules applied. Total rules applied 4544 place count 2215 transition count 2660
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 4544 place count 2215 transition count 2504
Deduced a syphon composed of 156 places in 1 ms
Ensure Unique test removed 55 places
Reduce places removed 211 places and 0 transitions.
Iterating global reduction 3 with 367 rules applied. Total rules applied 4911 place count 2004 transition count 2504
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 3 with 51 rules applied. Total rules applied 4962 place count 1953 transition count 2504
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 4962 place count 1953 transition count 2453
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 5064 place count 1902 transition count 2453
Discarding 364 places :
Symmetric choice reduction at 4 with 364 rule applications. Total rules 5428 place count 1538 transition count 1839
Ensure Unique test removed 51 places
Iterating global reduction 4 with 415 rules applied. Total rules applied 5843 place count 1487 transition count 1839
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 4 with 153 rules applied. Total rules applied 5996 place count 1436 transition count 1737
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 54 Pre rules applied. Total rules applied 5996 place count 1436 transition count 1683
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 109 rules applied. Total rules applied 6105 place count 1381 transition count 1683
Discarding 155 places :
Symmetric choice reduction at 5 with 155 rule applications. Total rules 6260 place count 1226 transition count 1428
Iterating global reduction 5 with 155 rules applied. Total rules applied 6415 place count 1226 transition count 1428
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Iterating post reduction 5 with 204 rules applied. Total rules applied 6619 place count 1175 transition count 1275
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 51 Pre rules applied. Total rules applied 6619 place count 1175 transition count 1224
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 6721 place count 1124 transition count 1224
Discarding 102 places :
Symmetric choice reduction at 6 with 102 rule applications. Total rules 6823 place count 1022 transition count 1122
Iterating global reduction 6 with 102 rules applied. Total rules applied 6925 place count 1022 transition count 1122
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 6 with 255 rules applied. Total rules applied 7180 place count 971 transition count 918
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 7 with 102 rules applied. Total rules applied 7282 place count 869 transition count 918
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 7384 place count 818 transition count 867
Free-agglomeration rule (complex) applied 102 times.
Iterating global reduction 8 with 102 rules applied. Total rules applied 7486 place count 818 transition count 765
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 8 with 102 rules applied. Total rules applied 7588 place count 716 transition count 765
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 9 with 51 rules applied. Total rules applied 7639 place count 665 transition count 714
Applied a total of 7639 rules in 342 ms. Remains 665 /5197 variables (removed 4532) and now considering 714/5722 (removed 5008) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 665/5197 places, 714/5722 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1653720 steps, run timeout after 3001 ms. (steps per millisecond=551 ) properties seen :{}
Probabilistic random walk after 1653720 steps, saw 240973 distinct states, run finished after 3002 ms. (steps per millisecond=550 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 714 rows 665 cols
[2023-03-11 13:27:51] [INFO ] Computed 53 place invariants in 11 ms
[2023-03-11 13:27:51] [INFO ] [Real]Absence check using 0 positive and 53 generalized place invariants in 10 ms returned sat
[2023-03-11 13:27:52] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 13:27:52] [INFO ] [Nat]Absence check using 0 positive and 53 generalized place invariants in 11 ms returned sat
[2023-03-11 13:27:53] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 13:27:53] [INFO ] After 1121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 525 ms.
[2023-03-11 13:27:54] [INFO ] After 1749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 347 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=26 )
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 14 ms.
All properties solved without resorting to model-checking.
Total runtime 70830 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/477/inv_0_ --invariant=/tmp/477/inv_1_ --invariant=/tmp/477/inv_2_ --invariant=/tmp/477/inv_3_ --invariant=/tmp/477/inv_4_ --invariant=/tmp/477/inv_5_ --invariant=/tmp/477/inv_6_ --invariant=/tmp/477/inv_7_ --invariant=/tmp/477/inv_8_ --invariant=/tmp/477/inv_9_ --invariant=/tmp/477/inv_10_ --invariant=/tmp/477/inv_11_ --invariant=/tmp/477/inv_12_ --invariant=/tmp/477/inv_13_ --invariant=/tmp/477/inv_14_ --invariant=/tmp/477/inv_15_ --inv-par
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-00
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-01
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-02
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-03
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-04
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-05
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-06
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-07
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-08
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-09
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-10
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-11
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-12
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-13
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-14
Could not compute solution for formula : FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-15

BK_STOP 1678541420573

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_0_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-01
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_1_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_2_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_3_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_4_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_5_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_6_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-07
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_7_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_8_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_9_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-10
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_10_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_11_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_12_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/477/inv_13_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_14_
rfs formula name FamilyReunion-PT-L00050M0005C002P002G001-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/477/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 12194 places, 10560 transitions and 32238 arcs
pnml2lts-sym: Petri net FamilyReunion-PT-L00050M0005C002P002G001 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.200 real 0.120 user 0.090 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 10560->10560 groups
pnml2lts-sym: Regrouping took 74.110 real 73.700 user 0.400 sys
pnml2lts-sym: state vector length is 12194; there are 10560 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: got initial state

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="FamilyReunion-PT-L00050M0005C002P002G001"
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 FamilyReunion-PT-L00050M0005C002P002G001, 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 r169-tall-167838855800414"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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