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

About the Execution of LTSMin+red for DLCround-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4782.004 3584534.00 14259997.00 263.30 TTFFTFTFTTTFTTFF 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.r105-tall-167814481600726.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 DLCround-PT-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481600726
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 18:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Feb 25 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 18:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 DLCround-PT-09b-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-09b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678367750316

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=DLCround-PT-09b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 13:15:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 13:15:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:15:52] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2023-03-09 13:15:52] [INFO ] Transformed 3495 places.
[2023-03-09 13:15:52] [INFO ] Transformed 5439 transitions.
[2023-03-09 13:15:52] [INFO ] Found NUPN structural information;
[2023-03-09 13:15:52] [INFO ] Parsed PT model containing 3495 places and 5439 transitions and 15081 arcs in 327 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA DLCround-PT-09b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-09b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 11) seen :9
FORMULA DLCround-PT-09b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-09b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5439 rows 3495 cols
[2023-03-09 13:15:53] [INFO ] Computed 184 place invariants in 59 ms
[2023-03-09 13:15:54] [INFO ] [Real]Absence check using 184 positive place invariants in 163 ms returned sat
[2023-03-09 13:15:54] [INFO ] After 1284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 13:15:55] [INFO ] [Nat]Absence check using 184 positive place invariants in 137 ms returned sat
[2023-03-09 13:15:57] [INFO ] After 2542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 13:15:58] [INFO ] Deduced a trap composed of 121 places in 951 ms of which 8 ms to minimize.
[2023-03-09 13:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1362 ms
[2023-03-09 13:16:00] [INFO ] Deduced a trap composed of 176 places in 845 ms of which 1 ms to minimize.
[2023-03-09 13:16:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1245 ms
[2023-03-09 13:16:00] [INFO ] After 5455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 431 ms.
[2023-03-09 13:16:01] [INFO ] After 6765ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 84 ms.
Support contains 36 out of 3495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3495/3495 places, 5439/5439 transitions.
Graph (trivial) has 3185 edges and 3495 vertex of which 550 / 3495 are part of one of the 43 SCC in 13 ms
Free SCC test removed 507 places
Drop transitions removed 569 transitions
Reduce isomorphic transitions removed 569 transitions.
Drop transitions removed 1265 transitions
Trivial Post-agglo rules discarded 1265 transitions
Performed 1265 trivial Post agglomeration. Transition count delta: 1265
Iterating post reduction 0 with 1265 rules applied. Total rules applied 1266 place count 2988 transition count 3605
Reduce places removed 1265 places and 0 transitions.
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 1336 rules applied. Total rules applied 2602 place count 1723 transition count 3534
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 38 rules applied. Total rules applied 2640 place count 1693 transition count 3526
Reduce places removed 4 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 3 with 20 rules applied. Total rules applied 2660 place count 1689 transition count 3510
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 2676 place count 1673 transition count 3510
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 2676 place count 1673 transition count 3495
Deduced a syphon composed of 15 places in 19 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 2706 place count 1658 transition count 3495
Discarding 437 places :
Symmetric choice reduction at 5 with 437 rule applications. Total rules 3143 place count 1221 transition count 3058
Iterating global reduction 5 with 437 rules applied. Total rules applied 3580 place count 1221 transition count 3058
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 185 Pre rules applied. Total rules applied 3580 place count 1221 transition count 2873
Deduced a syphon composed of 185 places in 41 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 5 with 370 rules applied. Total rules applied 3950 place count 1036 transition count 2873
Discarding 61 places :
Symmetric choice reduction at 5 with 61 rule applications. Total rules 4011 place count 975 transition count 2092
Iterating global reduction 5 with 61 rules applied. Total rules applied 4072 place count 975 transition count 2092
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 4091 place count 975 transition count 2073
Performed 262 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 262 places in 1 ms
Reduce places removed 262 places and 0 transitions.
Iterating global reduction 6 with 524 rules applied. Total rules applied 4615 place count 713 transition count 1802
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 4623 place count 713 transition count 1794
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 4626 place count 710 transition count 1755
Iterating global reduction 7 with 3 rules applied. Total rules applied 4629 place count 710 transition count 1755
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -565
Deduced a syphon composed of 57 places in 4 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 7 with 114 rules applied. Total rules applied 4743 place count 653 transition count 2320
Drop transitions removed 62 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 7 with 67 rules applied. Total rules applied 4810 place count 653 transition count 2253
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 4829 place count 634 transition count 1767
Iterating global reduction 8 with 19 rules applied. Total rules applied 4848 place count 634 transition count 1767
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 4861 place count 634 transition count 1754
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 4869 place count 630 transition count 1792
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 4871 place count 630 transition count 1790
Drop transitions removed 182 transitions
Redundant transition composition rules discarded 182 transitions
Iterating global reduction 10 with 182 rules applied. Total rules applied 5053 place count 630 transition count 1608
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 5063 place count 620 transition count 1464
Iterating global reduction 10 with 10 rules applied. Total rules applied 5073 place count 620 transition count 1464
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 5083 place count 620 transition count 1454
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 5087 place count 618 transition count 1468
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 5089 place count 618 transition count 1466
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 5091 place count 618 transition count 1464
Free-agglomeration rule applied 337 times with reduction of 182 identical transitions.
Iterating global reduction 12 with 337 rules applied. Total rules applied 5428 place count 618 transition count 945
Reduce places removed 337 places and 0 transitions.
Drop transitions removed 376 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 382 transitions.
Graph (complete) has 755 edges and 281 vertex of which 258 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 720 rules applied. Total rules applied 6148 place count 258 transition count 563
Drop transitions removed 6 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 6168 place count 258 transition count 543
Discarding 62 places :
Symmetric choice reduction at 14 with 62 rule applications. Total rules 6230 place count 196 transition count 446
Iterating global reduction 14 with 62 rules applied. Total rules applied 6292 place count 196 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 6294 place count 195 transition count 445
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 14 with 55 rules applied. Total rules applied 6349 place count 195 transition count 390
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 524 edges and 193 vertex of which 191 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 3 rules applied. Total rules applied 6352 place count 191 transition count 390
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 6354 place count 191 transition count 388
Discarding 20 places :
Symmetric choice reduction at 16 with 20 rule applications. Total rules 6374 place count 171 transition count 359
Iterating global reduction 16 with 20 rules applied. Total rules applied 6394 place count 171 transition count 359
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 6395 place count 171 transition count 364
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 6401 place count 170 transition count 359
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 6402 place count 170 transition count 358
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 6403 place count 170 transition count 358
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 6404 place count 169 transition count 357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 6405 place count 168 transition count 357
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 6409 place count 166 transition count 355
Drop transitions removed 4 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 18 with 13 rules applied. Total rules applied 6422 place count 166 transition count 342
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 6424 place count 164 transition count 340
Iterating global reduction 19 with 2 rules applied. Total rules applied 6426 place count 164 transition count 340
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 3 rules applied. Total rules applied 6429 place count 162 transition count 339
Drop transitions removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 12 edges and 162 vertex of which 6 / 162 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 19 with 6 rules applied. Total rules applied 6435 place count 157 transition count 334
Drop transitions removed 32 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 20 with 42 rules applied. Total rules applied 6477 place count 157 transition count 292
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 21 with 8 rules applied. Total rules applied 6485 place count 157 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 6486 place count 156 transition count 284
Discarding 4 places :
Symmetric choice reduction at 22 with 4 rule applications. Total rules 6490 place count 152 transition count 277
Iterating global reduction 22 with 4 rules applied. Total rules applied 6494 place count 152 transition count 277
Applied a total of 6494 rules in 1010 ms. Remains 152 /3495 variables (removed 3343) and now considering 277/5439 (removed 5162) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1011 ms. Remains : 152/3495 places, 277/5439 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :1
FORMULA DLCround-PT-09b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 4660 steps, including 1 resets, run visited all 1 properties in 18 ms. (steps per millisecond=258 )
FORMULA DLCround-PT-09b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 10418 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/463/inv_0_ --invariant=/tmp/463/inv_1_ --invariant=/tmp/463/inv_2_ --invariant=/tmp/463/inv_3_ --invariant=/tmp/463/inv_4_ --invariant=/tmp/463/inv_5_ --invariant=/tmp/463/inv_6_ --invariant=/tmp/463/inv_7_ --invariant=/tmp/463/inv_8_ --invariant=/tmp/463/inv_9_ --invariant=/tmp/463/inv_10_ --invariant=/tmp/463/inv_11_ --invariant=/tmp/463/inv_12_ --invariant=/tmp/463/inv_13_ --invariant=/tmp/463/inv_14_ --invariant=/tmp/463/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393216 kB
MemFree: 11366200 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097820 kB
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-00
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-01
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-02
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-03
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-04
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-05
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-06
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-07
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-08
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-09
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-10
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-11
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-12
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-13
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-14
Could not compute solution for formula : DLCround-PT-09b-ReachabilityCardinality-15

BK_STOP 1678371334850

--------------------
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.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 DLCround-PT-09b-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/463/inv_0_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/463/inv_1_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/463/inv_2_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/463/inv_3_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-04
rfs formula type AG
rfs formula formula --invariant=/tmp/463/inv_4_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/463/inv_5_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/463/inv_6_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/463/inv_7_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/463/inv_8_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/463/inv_9_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/463/inv_10_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-11
rfs formula type AG
rfs formula formula --invariant=/tmp/463/inv_11_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/463/inv_12_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-13
rfs formula type AG
rfs formula formula --invariant=/tmp/463/inv_13_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/463/inv_14_
rfs formula name DLCround-PT-09b-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/463/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 3495 places, 5439 transitions and 15081 arcs
pnml2lts-sym: Petri net DLCround-PT-09b analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.060 real 0.040 user 0.020 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: 5439->5439 groups
pnml2lts-sym: Regrouping took 14.100 real 14.050 user 0.050 sys
pnml2lts-sym: state vector length is 3495; there are 5439 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: got initial state
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
Killing (15) : 469
Killing (9) : 469

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="DLCround-PT-09b"
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 DLCround-PT-09b, 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 r105-tall-167814481600726"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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