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

About the Execution of LTSMin+red for FlexibleBarrier-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
699.855 3594537.00 14275754.00 366.50 TTFFTTFFFTFTFTTT 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-167838856000518.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 FlexibleBarrier-PT-12b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856000518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 7.6K Feb 25 12:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 12:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 12:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 12:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 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 536K 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 FlexibleBarrier-PT-12b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678558571382

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=FlexibleBarrier-PT-12b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 18:16:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 18:16:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 18:16:13] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-11 18:16:13] [INFO ] Transformed 1988 places.
[2023-03-11 18:16:13] [INFO ] Transformed 2289 transitions.
[2023-03-11 18:16:13] [INFO ] Found NUPN structural information;
[2023-03-11 18:16:13] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 114 resets, run finished after 641 ms. (steps per millisecond=15 ) properties (out of 13) seen :4
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2289 rows 1988 cols
[2023-03-11 18:16:14] [INFO ] Computed 14 place invariants in 56 ms
[2023-03-11 18:16:15] [INFO ] [Real]Absence check using 14 positive place invariants in 27 ms returned sat
[2023-03-11 18:16:15] [INFO ] After 1085ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 18:16:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-11 18:16:18] [INFO ] After 1584ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-11 18:16:18] [INFO ] Deduced a trap composed of 122 places in 273 ms of which 17 ms to minimize.
[2023-03-11 18:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 455 ms
[2023-03-11 18:16:19] [INFO ] Deduced a trap composed of 710 places in 719 ms of which 2 ms to minimize.
[2023-03-11 18:16:20] [INFO ] Deduced a trap composed of 717 places in 735 ms of which 2 ms to minimize.
[2023-03-11 18:16:21] [INFO ] Deduced a trap composed of 683 places in 675 ms of which 3 ms to minimize.
[2023-03-11 18:16:21] [INFO ] Deduced a trap composed of 688 places in 684 ms of which 2 ms to minimize.
[2023-03-11 18:16:22] [INFO ] Deduced a trap composed of 719 places in 635 ms of which 1 ms to minimize.
[2023-03-11 18:16:23] [INFO ] Deduced a trap composed of 687 places in 625 ms of which 1 ms to minimize.
[2023-03-11 18:16:24] [INFO ] Deduced a trap composed of 687 places in 710 ms of which 2 ms to minimize.
[2023-03-11 18:16:24] [INFO ] Deduced a trap composed of 695 places in 647 ms of which 1 ms to minimize.
[2023-03-11 18:16:25] [INFO ] Deduced a trap composed of 680 places in 543 ms of which 2 ms to minimize.
[2023-03-11 18:16:26] [INFO ] Deduced a trap composed of 647 places in 517 ms of which 6 ms to minimize.
[2023-03-11 18:16:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 7409 ms
[2023-03-11 18:16:27] [INFO ] Deduced a trap composed of 116 places in 615 ms of which 1 ms to minimize.
[2023-03-11 18:16:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 767 ms
[2023-03-11 18:16:27] [INFO ] Deduced a trap composed of 713 places in 618 ms of which 2 ms to minimize.
[2023-03-11 18:16:28] [INFO ] Deduced a trap composed of 682 places in 607 ms of which 2 ms to minimize.
[2023-03-11 18:16:29] [INFO ] Deduced a trap composed of 649 places in 508 ms of which 1 ms to minimize.
[2023-03-11 18:16:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2037 ms
[2023-03-11 18:16:29] [INFO ] Deduced a trap composed of 642 places in 505 ms of which 1 ms to minimize.
[2023-03-11 18:16:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 663 ms
[2023-03-11 18:16:30] [INFO ] Deduced a trap composed of 678 places in 659 ms of which 2 ms to minimize.
[2023-03-11 18:16:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 823 ms
[2023-03-11 18:16:31] [INFO ] After 14481ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 669 ms.
[2023-03-11 18:16:31] [INFO ] After 16109ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 217 ms.
Support contains 83 out of 1988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1812 edges and 1988 vertex of which 50 / 1988 are part of one of the 8 SCC in 13 ms
Free SCC test removed 42 places
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 459 transitions
Trivial Post-agglo rules discarded 459 transitions
Performed 459 trivial Post agglomeration. Transition count delta: 459
Iterating post reduction 0 with 459 rules applied. Total rules applied 460 place count 1946 transition count 1779
Reduce places removed 459 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 478 rules applied. Total rules applied 938 place count 1487 transition count 1760
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 957 place count 1468 transition count 1760
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 116 Pre rules applied. Total rules applied 957 place count 1468 transition count 1644
Deduced a syphon composed of 116 places in 3 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 1189 place count 1352 transition count 1644
Discarding 697 places :
Symmetric choice reduction at 3 with 697 rule applications. Total rules 1886 place count 655 transition count 947
Iterating global reduction 3 with 697 rules applied. Total rules applied 2583 place count 655 transition count 947
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 2583 place count 655 transition count 942
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 2593 place count 650 transition count 942
Discarding 91 places :
Symmetric choice reduction at 3 with 91 rule applications. Total rules 2684 place count 559 transition count 851
Iterating global reduction 3 with 91 rules applied. Total rules applied 2775 place count 559 transition count 851
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 2855 place count 559 transition count 771
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 3009 place count 482 transition count 694
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 3026 place count 482 transition count 677
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 3034 place count 474 transition count 669
Iterating global reduction 5 with 8 rules applied. Total rules applied 3042 place count 474 transition count 669
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 3048 place count 471 transition count 681
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 3053 place count 471 transition count 676
Free-agglomeration rule applied 289 times.
Iterating global reduction 5 with 289 rules applied. Total rules applied 3342 place count 471 transition count 387
Reduce places removed 289 places and 0 transitions.
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 5 with 332 rules applied. Total rules applied 3674 place count 182 transition count 344
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 6 with 30 rules applied. Total rules applied 3704 place count 182 transition count 314
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3705 place count 182 transition count 313
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3707 place count 181 transition count 312
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 3708 place count 181 transition count 312
Applied a total of 3708 rules in 501 ms. Remains 181 /1988 variables (removed 1807) and now considering 312/2289 (removed 1977) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 501 ms. Remains : 181/1988 places, 312/2289 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 6) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :1
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 18:16:32] [INFO ] Flow matrix only has 292 transitions (discarded 20 similar events)
// Phase 1: matrix 292 rows 181 cols
[2023-03-11 18:16:32] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-11 18:16:32] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 18:16:32] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 18:16:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2023-03-11 18:16:32] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 18:16:33] [INFO ] State equation strengthened by 163 read => feed constraints.
[2023-03-11 18:16:33] [INFO ] After 52ms SMT Verify possible using 163 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 18:16:33] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2023-03-11 18:16:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-11 18:16:33] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2023-03-11 18:16:33] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2023-03-11 18:16:33] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2023-03-11 18:16:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2023-03-11 18:16:33] [INFO ] After 372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-11 18:16:33] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 13 ms.
Support contains 33 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 312/312 transitions.
Graph (trivial) has 78 edges and 181 vertex of which 8 / 181 are part of one of the 3 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 176 transition count 288
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 160 transition count 288
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 58 place count 135 transition count 263
Iterating global reduction 2 with 25 rules applied. Total rules applied 83 place count 135 transition count 263
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 115 place count 119 transition count 247
Drop transitions removed 25 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 144 place count 119 transition count 218
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 118 transition count 217
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 118 transition count 217
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 161 place count 118 transition count 202
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 172 place count 118 transition count 191
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 203 place count 107 transition count 171
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 107 transition count 169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 206 place count 106 transition count 168
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1979.t1510.t1511.t1489.t1490.t12 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 58 edges and 104 vertex of which 19 / 104 are part of one of the 9 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 210 place count 94 transition count 165
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 230 place count 93 transition count 146
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 230 place count 93 transition count 132
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 258 place count 79 transition count 132
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 270 place count 79 transition count 120
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 290 place count 69 transition count 110
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 291 place count 69 transition count 109
Free-agglomeration rule applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 304 place count 69 transition count 96
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 33 rules applied. Total rules applied 337 place count 55 transition count 77
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 338 place count 55 transition count 76
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 339 place count 55 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 340 place count 54 transition count 75
Applied a total of 340 rules in 69 ms. Remains 54 /181 variables (removed 127) and now considering 75/312 (removed 237) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 54/181 places, 75/312 transitions.
Finished random walk after 3933 steps, including 1 resets, run visited all 3 properties in 13 ms. (steps per millisecond=302 )
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 20438 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/527/inv_0_ --invariant=/tmp/527/inv_1_ --invariant=/tmp/527/inv_2_ --invariant=/tmp/527/inv_3_ --invariant=/tmp/527/inv_4_ --invariant=/tmp/527/inv_5_ --invariant=/tmp/527/inv_6_ --invariant=/tmp/527/inv_7_ --invariant=/tmp/527/inv_8_ --invariant=/tmp/527/inv_9_ --invariant=/tmp/527/inv_10_ --invariant=/tmp/527/inv_11_ --invariant=/tmp/527/inv_12_ --invariant=/tmp/527/inv_13_ --invariant=/tmp/527/inv_14_ --invariant=/tmp/527/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393232 kB
MemFree: 15449020 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16098936 kB
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-00
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-01
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-02
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-03
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-04
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-05
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-06
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-07
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-08
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-09
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-10
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-11
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-12
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-13
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-14
Could not compute solution for formula : FlexibleBarrier-PT-12b-ReachabilityCardinality-15

BK_STOP 1678562165919

--------------------
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 FlexibleBarrier-PT-12b-ReachabilityCardinality-00
rfs formula type EF
rfs formula formula --invariant=/tmp/527/inv_0_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-01
rfs formula type EF
rfs formula formula --invariant=/tmp/527/inv_1_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-02
rfs formula type AG
rfs formula formula --invariant=/tmp/527/inv_2_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-03
rfs formula type AG
rfs formula formula --invariant=/tmp/527/inv_3_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-04
rfs formula type EF
rfs formula formula --invariant=/tmp/527/inv_4_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/527/inv_5_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-06
rfs formula type AG
rfs formula formula --invariant=/tmp/527/inv_6_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/527/inv_7_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-08
rfs formula type AG
rfs formula formula --invariant=/tmp/527/inv_8_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-09
rfs formula type EF
rfs formula formula --invariant=/tmp/527/inv_9_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/527/inv_10_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/527/inv_11_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-12
rfs formula type EF
rfs formula formula --invariant=/tmp/527/inv_12_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-13
rfs formula type EF
rfs formula formula --invariant=/tmp/527/inv_13_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-14
rfs formula type AG
rfs formula formula --invariant=/tmp/527/inv_14_
rfs formula name FlexibleBarrier-PT-12b-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/527/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 1988 places, 2289 transitions and 5727 arcs
pnml2lts-sym: Petri net FlexibleBarrier-PT-12b analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 user 0.010 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: 2289->2289 groups
pnml2lts-sym: Regrouping took 3.100 real 3.100 user 0.010 sys
pnml2lts-sym: state vector length is 1988; there are 2289 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: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 533
Killing (9) : 533

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="FlexibleBarrier-PT-12b"
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 FlexibleBarrier-PT-12b, 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-167838856000518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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