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

About the Execution of Smart+red for FlexibleBarrier-PT-20b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1275.896 3600000.00 3674811.00 10942.30 TTFFTFTFTTTTTTTT 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.r171-tall-167838858800583.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 smartxred
Input is FlexibleBarrier-PT-20b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858800583
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:31 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.7K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 25 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 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.5M 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-20b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679483389032

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 11:09:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 11:09:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:09:50] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2023-03-22 11:09:50] [INFO ] Transformed 5372 places.
[2023-03-22 11:09:50] [INFO ] Transformed 6193 transitions.
[2023-03-22 11:09:50] [INFO ] Found NUPN structural information;
[2023-03-22 11:09:50] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 447 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 74 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 16) seen :2
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 6193 rows 5372 cols
[2023-03-22 11:09:52] [INFO ] Computed 22 place invariants in 176 ms
[2023-03-22 11:09:54] [INFO ] After 2220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 11:09:56] [INFO ] [Nat]Absence check using 22 positive place invariants in 70 ms returned sat
[2023-03-22 11:10:03] [INFO ] After 6718ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :11
[2023-03-22 11:10:04] [INFO ] Deduced a trap composed of 176 places in 327 ms of which 7 ms to minimize.
[2023-03-22 11:10:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 687 ms
[2023-03-22 11:10:08] [INFO ] Deduced a trap composed of 1939 places in 2933 ms of which 4 ms to minimize.
[2023-03-22 11:10:11] [INFO ] Deduced a trap composed of 1939 places in 2923 ms of which 4 ms to minimize.
[2023-03-22 11:10:14] [INFO ] Deduced a trap composed of 1940 places in 2738 ms of which 4 ms to minimize.
[2023-03-22 11:10:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 9457 ms
[2023-03-22 11:10:17] [INFO ] Deduced a trap composed of 686 places in 443 ms of which 2 ms to minimize.
[2023-03-22 11:10:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 821 ms
[2023-03-22 11:10:18] [INFO ] After 20907ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :11
Attempting to minimize the solution found.
Minimization took 1631 ms.
[2023-03-22 11:10:19] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :11
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 11 different solutions.
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 195 ms.
Support contains 65 out of 5372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 4249 edges and 5372 vertex of which 74 / 5372 are part of one of the 12 SCC in 23 ms
Free SCC test removed 62 places
Drop transitions removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions removed 925 transitions
Trivial Post-agglo rules discarded 925 transitions
Performed 925 trivial Post agglomeration. Transition count delta: 925
Iterating post reduction 0 with 925 rules applied. Total rules applied 926 place count 5310 transition count 5193
Reduce places removed 925 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 939 rules applied. Total rules applied 1865 place count 4385 transition count 5179
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1879 place count 4371 transition count 5179
Performed 728 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 728 Pre rules applied. Total rules applied 1879 place count 4371 transition count 4451
Deduced a syphon composed of 728 places in 4 ms
Reduce places removed 728 places and 0 transitions.
Iterating global reduction 3 with 1456 rules applied. Total rules applied 3335 place count 3643 transition count 4451
Discarding 2172 places :
Symmetric choice reduction at 3 with 2172 rule applications. Total rules 5507 place count 1471 transition count 2279
Iterating global reduction 3 with 2172 rules applied. Total rules applied 7679 place count 1471 transition count 2279
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 7679 place count 1471 transition count 2268
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 7701 place count 1460 transition count 2268
Discarding 338 places :
Symmetric choice reduction at 3 with 338 rule applications. Total rules 8039 place count 1122 transition count 1930
Iterating global reduction 3 with 338 rules applied. Total rules applied 8377 place count 1122 transition count 1930
Ensure Unique test removed 329 transitions
Reduce isomorphic transitions removed 329 transitions.
Iterating post reduction 3 with 329 rules applied. Total rules applied 8706 place count 1122 transition count 1601
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 4 with 254 rules applied. Total rules applied 8960 place count 995 transition count 1474
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 8979 place count 995 transition count 1455
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 8998 place count 976 transition count 1436
Iterating global reduction 5 with 19 rules applied. Total rules applied 9017 place count 976 transition count 1436
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 9029 place count 970 transition count 1436
Free-agglomeration rule applied 299 times.
Iterating global reduction 5 with 299 rules applied. Total rules applied 9328 place count 970 transition count 1137
Reduce places removed 299 places and 0 transitions.
Iterating post reduction 5 with 299 rules applied. Total rules applied 9627 place count 671 transition count 1137
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 9644 place count 654 transition count 1120
Iterating global reduction 6 with 17 rules applied. Total rules applied 9661 place count 654 transition count 1120
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 9678 place count 654 transition count 1103
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 9692 place count 654 transition count 1089
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 9700 place count 654 transition count 1089
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 9701 place count 653 transition count 1088
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 103 edges and 652 vertex of which 26 / 652 are part of one of the 12 SCC in 0 ms
Free SCC test removed 14 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 7 with 3 rules applied. Total rules applied 9704 place count 638 transition count 1087
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 9731 place count 637 transition count 1061
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 20 Pre rules applied. Total rules applied 9731 place count 637 transition count 1041
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 9771 place count 617 transition count 1041
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 9778 place count 610 transition count 1034
Iterating global reduction 9 with 7 rules applied. Total rules applied 9785 place count 610 transition count 1034
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 9792 place count 610 transition count 1027
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 10 with 58 rules applied. Total rules applied 9850 place count 581 transition count 998
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 9851 place count 581 transition count 997
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 9861 place count 576 transition count 997
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 9870 place count 576 transition count 988
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 12 with 15 rules applied. Total rules applied 9885 place count 576 transition count 973
Free-agglomeration rule applied 14 times.
Iterating global reduction 12 with 14 rules applied. Total rules applied 9899 place count 576 transition count 959
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 12 with 27 rules applied. Total rules applied 9926 place count 562 transition count 946
Applied a total of 9926 rules in 2294 ms. Remains 562 /5372 variables (removed 4810) and now considering 946/6193 (removed 5247) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2295 ms. Remains : 562/5372 places, 946/6193 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 11:10:22] [INFO ] Flow matrix only has 927 transitions (discarded 19 similar events)
// Phase 1: matrix 927 rows 562 cols
[2023-03-22 11:10:22] [INFO ] Computed 21 place invariants in 20 ms
[2023-03-22 11:10:22] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-03-22 11:10:22] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 11:10:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-22 11:10:23] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 11:10:23] [INFO ] State equation strengthened by 136 read => feed constraints.
[2023-03-22 11:10:23] [INFO ] After 151ms SMT Verify possible using 136 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 11:10:23] [INFO ] After 401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-22 11:10:23] [INFO ] After 1047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 25 ms.
Support contains 22 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 946/946 transitions.
Graph (trivial) has 476 edges and 562 vertex of which 17 / 562 are part of one of the 7 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions removed 18 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 552 transition count 922
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 547 transition count 922
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 20 place count 538 transition count 913
Iterating global reduction 2 with 9 rules applied. Total rules applied 29 place count 538 transition count 913
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 538 transition count 911
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 41 rules applied. Total rules applied 72 place count 517 transition count 891
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 427 edges and 517 vertex of which 2 / 517 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 75 place count 516 transition count 889
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 101 place count 516 transition count 863
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 108 place count 509 transition count 856
Iterating global reduction 5 with 7 rules applied. Total rules applied 115 place count 509 transition count 856
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 122 place count 509 transition count 849
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 124 place count 508 transition count 849
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 130 place count 508 transition count 843
Free-agglomeration rule applied 417 times with reduction of 1 identical transitions.
Iterating global reduction 6 with 417 rules applied. Total rules applied 547 place count 508 transition count 425
Reduce places removed 418 places and 0 transitions.
Drop transitions removed 228 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 232 transitions.
Iterating post reduction 6 with 650 rules applied. Total rules applied 1197 place count 90 transition count 193
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1201 place count 86 transition count 189
Iterating global reduction 7 with 4 rules applied. Total rules applied 1205 place count 86 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1209 place count 86 transition count 185
Drop transitions removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 8 with 59 rules applied. Total rules applied 1268 place count 86 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1269 place count 85 transition count 125
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1272 place count 82 transition count 125
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1278 place count 76 transition count 119
Iterating global reduction 9 with 6 rules applied. Total rules applied 1284 place count 76 transition count 119
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1290 place count 76 transition count 113
Applied a total of 1290 rules in 195 ms. Remains 76 /562 variables (removed 486) and now considering 113/946 (removed 833) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 76/562 places, 113/946 transitions.
Finished random walk after 9531 steps, including 2 resets, run visited all 3 properties in 28 ms. (steps per millisecond=340 )
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 33608 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FlexibleBarrier (PT), instance 20b
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 5372 places, 6193 transitions, 15575 arcs.
Final Score: 5992458.785
Took : 50 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14873696 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100840 kB

BK_TIME_CONFINEMENT_REACHED

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

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

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-20b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is FlexibleBarrier-PT-20b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r171-tall-167838858800583"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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