fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r096-smll-165260575800142
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for FlexibleBarrier-PT-20b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
703.479 101178.00 181263.00 310.90 FTTFTFTTTTTTTTFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r096-smll-165260575800142.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575800142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.2K Apr 29 13:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 29 13:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 13:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 29 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 29 13:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 13:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.5M May 10 09:33 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-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654182147903

Running Version 202205111006
[2022-06-02 15:02:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 15:02:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 15:02:30] [INFO ] Load time of PNML (sax parser for PT used): 468 ms
[2022-06-02 15:02:30] [INFO ] Transformed 5372 places.
[2022-06-02 15:02:30] [INFO ] Transformed 6193 transitions.
[2022-06-02 15:02:30] [INFO ] Found NUPN structural information;
[2022-06-02 15:02:30] [INFO ] Parsed PT model containing 5372 places and 6193 transitions in 751 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 75 resets, run finished after 860 ms. (steps per millisecond=11 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 75407 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{13=1, 14=1}
Probabilistic random walk after 75407 steps, saw 47521 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :2
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 13 properties.
// Phase 1: matrix 6193 rows 5372 cols
[2022-06-02 15:02:35] [INFO ] Computed 22 place invariants in 360 ms
[2022-06-02 15:02:38] [INFO ] After 3323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-02 15:02:40] [INFO ] [Nat]Absence check using 22 positive place invariants in 69 ms returned sat
[2022-06-02 15:02:49] [INFO ] After 8230ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :7
[2022-06-02 15:02:57] [INFO ] Deduced a trap composed of 2069 places in 6815 ms of which 15 ms to minimize.
[2022-06-02 15:03:03] [INFO ] Deduced a trap composed of 2028 places in 5860 ms of which 6 ms to minimize.
[2022-06-02 15:03:12] [INFO ] Deduced a trap composed of 196 places in 8656 ms of which 6 ms to minimize.
[2022-06-02 15:03:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 15:03:12] [INFO ] After 33679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 7 different solutions.
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 8567 ms.
Support contains 81 out of 5372 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 5152 edges and 5372 vertex of which 104 / 5372 are part of one of the 17 SCC in 28 ms
Free SCC test removed 87 places
Drop transitions removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Drop transitions removed 1264 transitions
Trivial Post-agglo rules discarded 1264 transitions
Performed 1264 trivial Post agglomeration. Transition count delta: 1264
Iterating post reduction 0 with 1264 rules applied. Total rules applied 1265 place count 5285 transition count 4824
Reduce places removed 1264 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 1 with 1293 rules applied. Total rules applied 2558 place count 4021 transition count 4795
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 2587 place count 3992 transition count 4795
Performed 351 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 351 Pre rules applied. Total rules applied 2587 place count 3992 transition count 4444
Deduced a syphon composed of 351 places in 6 ms
Reduce places removed 351 places and 0 transitions.
Iterating global reduction 3 with 702 rules applied. Total rules applied 3289 place count 3641 transition count 4444
Discarding 2150 places :
Symmetric choice reduction at 3 with 2150 rule applications. Total rules 5439 place count 1491 transition count 2294
Iterating global reduction 3 with 2150 rules applied. Total rules applied 7589 place count 1491 transition count 2294
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 7589 place count 1491 transition count 2283
Deduced a syphon composed of 11 places in 7 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 7611 place count 1480 transition count 2283
Discarding 334 places :
Symmetric choice reduction at 3 with 334 rule applications. Total rules 7945 place count 1146 transition count 1949
Iterating global reduction 3 with 334 rules applied. Total rules applied 8279 place count 1146 transition count 1949
Ensure Unique test removed 316 transitions
Reduce isomorphic transitions removed 316 transitions.
Iterating post reduction 3 with 316 rules applied. Total rules applied 8595 place count 1146 transition count 1633
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 1 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 4 with 232 rules applied. Total rules applied 8827 place count 1030 transition count 1517
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 8863 place count 1030 transition count 1481
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 8883 place count 1010 transition count 1461
Iterating global reduction 5 with 20 rules applied. Total rules applied 8903 place count 1010 transition count 1461
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 5 with 2 rules applied. Total rules applied 8905 place count 1009 transition count 1461
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 8907 place count 1009 transition count 1459
Free-agglomeration rule applied 768 times.
Iterating global reduction 5 with 768 rules applied. Total rules applied 9675 place count 1009 transition count 691
Reduce places removed 768 places and 0 transitions.
Drop transitions removed 223 transitions
Reduce isomorphic transitions removed 223 transitions.
Iterating post reduction 5 with 991 rules applied. Total rules applied 10666 place count 241 transition count 468
Drop transitions removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 6 with 80 rules applied. Total rules applied 10746 place count 241 transition count 388
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 10747 place count 241 transition count 388
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 10748 place count 240 transition count 387
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 96 edges and 239 vertex of which 30 / 239 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 10750 place count 224 transition count 387
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 10780 place count 224 transition count 357
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 19 Pre rules applied. Total rules applied 10780 place count 224 transition count 338
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 10818 place count 205 transition count 338
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 10836 place count 205 transition count 320
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 9 with 52 rules applied. Total rules applied 10888 place count 179 transition count 294
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 10890 place count 179 transition count 292
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 10891 place count 179 transition count 291
Free-agglomeration rule applied 16 times.
Iterating global reduction 10 with 16 rules applied. Total rules applied 10907 place count 179 transition count 275
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 30 rules applied. Total rules applied 10937 place count 163 transition count 261
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 10938 place count 163 transition count 260
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 10939 place count 163 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 10940 place count 162 transition count 259
Applied a total of 10940 rules in 3462 ms. Remains 162 /5372 variables (removed 5210) and now considering 259/6193 (removed 5934) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/5372 places, 259/6193 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 19700 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 264392 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=52 ) properties seen 0
Interrupted Best-First random walk after 811077 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen 1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 350400 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=70 ) properties seen 0
Interrupted Best-First random walk after 501101 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen 0
Running SMT prover for 3 properties.
[2022-06-02 15:04:04] [INFO ] Flow matrix only has 245 transitions (discarded 14 similar events)
// Phase 1: matrix 245 rows 162 cols
[2022-06-02 15:04:04] [INFO ] Computed 21 place invariants in 1 ms
[2022-06-02 15:04:04] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 15:04:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2022-06-02 15:04:04] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-02 15:04:04] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-06-02 15:04:04] [INFO ] After 82ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-02 15:04:04] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2022-06-02 15:04:04] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2022-06-02 15:04:04] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2022-06-02 15:04:04] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2022-06-02 15:04:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 348 ms
[2022-06-02 15:04:04] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2022-06-02 15:04:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-06-02 15:04:04] [INFO ] After 600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-06-02 15:04:05] [INFO ] After 895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 137 ms.
Support contains 30 out of 162 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 162/162 places, 259/259 transitions.
Graph (trivial) has 96 edges and 162 vertex of which 5 / 162 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 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 159 transition count 238
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 143 transition count 238
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 33 place count 143 transition count 236
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 141 transition count 236
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 141 transition count 235
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 61 place count 118 transition count 212
Iterating global reduction 3 with 23 rules applied. Total rules applied 84 place count 118 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 118 transition count 211
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 117 transition count 210
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 117 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 88 place count 117 transition count 209
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 128 place count 97 transition count 188
Drop transitions removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 5 with 45 rules applied. Total rules applied 173 place count 97 transition count 143
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 179 place count 97 transition count 137
Free-agglomeration rule applied 31 times.
Iterating global reduction 6 with 31 rules applied. Total rules applied 210 place count 97 transition count 106
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Graph (complete) has 153 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 59 rules applied. Total rules applied 269 place count 64 transition count 80
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 270 place count 64 transition count 79
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 270 place count 64 transition count 78
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 272 place count 63 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 273 place count 62 transition count 77
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 277 place count 58 transition count 77
Applied a total of 277 rules in 50 ms. Remains 58 /162 variables (removed 104) and now considering 77/259 (removed 182) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/162 places, 77/259 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1244 ms. (steps per millisecond=803 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1961 ms. (steps per millisecond=509 ) properties (out of 1) seen :0
Finished probabilistic random walk after 360416 steps, run visited all 1 properties in 480 ms. (steps per millisecond=750 )
Probabilistic random walk after 360416 steps, saw 136797 distinct states, run finished after 481 ms. (steps per millisecond=749 ) properties seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 99241 ms.

BK_STOP 1654182249081

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ReachabilityCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-20b, 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 r096-smll-165260575800142"
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 [ "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 ;