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.r167-tall-167838853200486.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 lolaxred
Input is FlexibleBarrier-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853200486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 12:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:28 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.9K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:29 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 241K 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-08b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678485832033

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=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 22:03:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 22:03:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:03:53] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-10 22:03:53] [INFO ] Transformed 920 places.
[2023-03-10 22:03:53] [INFO ] Transformed 1057 transitions.
[2023-03-10 22:03:53] [INFO ] Found NUPN structural information;
[2023-03-10 22:03:53] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 158 resets, run finished after 552 ms. (steps per millisecond=18 ) properties (out of 14) seen :2
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :1
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1057 rows 920 cols
[2023-03-10 22:03:54] [INFO ] Computed 10 place invariants in 30 ms
[2023-03-10 22:03:55] [INFO ] After 530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-10 22:03:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-10 22:03:56] [INFO ] After 803ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-10 22:03:57] [INFO ] Deduced a trap composed of 52 places in 304 ms of which 8 ms to minimize.
[2023-03-10 22:03:57] [INFO ] Deduced a trap composed of 165 places in 220 ms of which 1 ms to minimize.
[2023-03-10 22:03:57] [INFO ] Deduced a trap composed of 290 places in 195 ms of which 1 ms to minimize.
[2023-03-10 22:03:57] [INFO ] Deduced a trap composed of 313 places in 208 ms of which 1 ms to minimize.
[2023-03-10 22:03:58] [INFO ] Deduced a trap composed of 311 places in 182 ms of which 1 ms to minimize.
[2023-03-10 22:03:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1385 ms
[2023-03-10 22:03:58] [INFO ] Deduced a trap composed of 286 places in 201 ms of which 1 ms to minimize.
[2023-03-10 22:03:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-10 22:03:58] [INFO ] Deduced a trap composed of 309 places in 194 ms of which 0 ms to minimize.
[2023-03-10 22:03:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-10 22:03:59] [INFO ] Deduced a trap composed of 277 places in 178 ms of which 1 ms to minimize.
[2023-03-10 22:03:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-10 22:03:59] [INFO ] Deduced a trap composed of 314 places in 203 ms of which 0 ms to minimize.
[2023-03-10 22:03:59] [INFO ] Deduced a trap composed of 318 places in 186 ms of which 0 ms to minimize.
[2023-03-10 22:03:59] [INFO ] Deduced a trap composed of 283 places in 164 ms of which 1 ms to minimize.
[2023-03-10 22:03:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 735 ms
[2023-03-10 22:04:00] [INFO ] Deduced a trap composed of 285 places in 182 ms of which 1 ms to minimize.
[2023-03-10 22:04:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2023-03-10 22:04:00] [INFO ] After 4565ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 467 ms.
[2023-03-10 22:04:00] [INFO ] After 5527ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 9 different solutions.
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 71 ms.
Support contains 116 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Graph (trivial) has 691 edges and 920 vertex of which 26 / 920 are part of one of the 4 SCC in 6 ms
Free SCC test removed 22 places
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 168 place count 898 transition count 863
Reduce places removed 167 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 191 rules applied. Total rules applied 359 place count 731 transition count 839
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 383 place count 707 transition count 839
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 383 place count 707 transition count 793
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 475 place count 661 transition count 793
Discarding 249 places :
Symmetric choice reduction at 3 with 249 rule applications. Total rules 724 place count 412 transition count 544
Iterating global reduction 3 with 249 rules applied. Total rules applied 973 place count 412 transition count 544
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 973 place count 412 transition count 543
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 975 place count 411 transition count 543
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 998 place count 388 transition count 520
Iterating global reduction 3 with 23 rules applied. Total rules applied 1021 place count 388 transition count 520
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 1035 place count 388 transition count 506
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1131 place count 340 transition count 458
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1135 place count 340 transition count 454
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1143 place count 336 transition count 489
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1146 place count 336 transition count 486
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 1148 place count 335 transition count 499
Free-agglomeration rule applied 104 times.
Iterating global reduction 5 with 104 rules applied. Total rules applied 1252 place count 335 transition count 395
Reduce places removed 104 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 109 rules applied. Total rules applied 1361 place count 231 transition count 390
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 1368 place count 231 transition count 383
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1369 place count 231 transition count 382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1370 place count 230 transition count 382
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1373 place count 230 transition count 382
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1376 place count 230 transition count 382
Applied a total of 1376 rules in 250 ms. Remains 230 /920 variables (removed 690) and now considering 382/1057 (removed 675) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 230/920 places, 382/1057 transitions.
Incomplete random walk after 10000 steps, including 236 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 8) seen :3
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :1
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-10 22:04:01] [INFO ] Flow matrix only has 371 transitions (discarded 11 similar events)
// Phase 1: matrix 371 rows 230 cols
[2023-03-10 22:04:01] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-10 22:04:01] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 22:04:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-10 22:04:02] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 22:04:02] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-10 22:04:02] [INFO ] After 103ms SMT Verify possible using 96 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 22:04:02] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 0 ms to minimize.
[2023-03-10 22:04:02] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2023-03-10 22:04:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-03-10 22:04:02] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2023-03-10 22:04:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-10 22:04:02] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2023-03-10 22:04:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-10 22:04:02] [INFO ] After 547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-10 22:04:02] [INFO ] After 880ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 73 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 382/382 transitions.
Graph (trivial) has 73 edges and 230 vertex of which 5 / 230 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 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 227 transition count 366
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 216 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 215 transition count 365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 215 transition count 364
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 214 transition count 364
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 40 place count 201 transition count 350
Iterating global reduction 3 with 13 rules applied. Total rules applied 53 place count 201 transition count 350
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 200 transition count 348
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 200 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 200 transition count 347
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 84 place count 186 transition count 333
Drop transitions removed 11 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 96 place count 186 transition count 321
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 100 place count 182 transition count 316
Iterating global reduction 5 with 4 rules applied. Total rules applied 104 place count 182 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 105 place count 182 transition count 315
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 107 place count 181 transition count 315
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 6 with 30 rules applied. Total rules applied 137 place count 181 transition count 285
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 138 place count 180 transition count 284
Iterating global reduction 6 with 1 rules applied. Total rules applied 139 place count 180 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 140 place count 180 transition count 283
Free-agglomeration rule applied 22 times.
Iterating global reduction 7 with 22 rules applied. Total rules applied 162 place count 180 transition count 261
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 189 place count 158 transition count 256
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 193 place count 158 transition count 252
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 194 place count 158 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 195 place count 157 transition count 251
Applied a total of 195 rules in 76 ms. Remains 157 /230 variables (removed 73) and now considering 251/382 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 157/230 places, 251/382 transitions.
Incomplete random walk after 10000 steps, including 231 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :1
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 22:04:03] [INFO ] Flow matrix only has 245 transitions (discarded 6 similar events)
// Phase 1: matrix 245 rows 157 cols
[2023-03-10 22:04:03] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-10 22:04:03] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 22:04:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-10 22:04:03] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 22:04:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-10 22:04:03] [INFO ] After 64ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 22:04:03] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2023-03-10 22:04:03] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2023-03-10 22:04:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-03-10 22:04:03] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-10 22:04:03] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
Support contains 65 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 251/251 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 157 transition count 248
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 154 transition count 248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 153 transition count 247
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 153 transition count 247
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 148 transition count 242
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 22 place count 148 transition count 238
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 3 with 2 rules applied. Total rules applied 24 place count 147 transition count 238
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 147 transition count 236
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 147 transition count 235
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 146 transition count 234
Applied a total of 29 rules in 23 ms. Remains 146 /157 variables (removed 11) and now considering 234/251 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 146/157 places, 234/251 transitions.
Incomplete random walk after 10000 steps, including 218 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1052390 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :{}
Probabilistic random walk after 1052390 steps, saw 222125 distinct states, run finished after 3002 ms. (steps per millisecond=350 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 22:04:06] [INFO ] Flow matrix only has 227 transitions (discarded 7 similar events)
// Phase 1: matrix 227 rows 146 cols
[2023-03-10 22:04:06] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-10 22:04:06] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 22:04:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-10 22:04:07] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 22:04:07] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-10 22:04:07] [INFO ] After 51ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 22:04:07] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2023-03-10 22:04:07] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 0 ms to minimize.
[2023-03-10 22:04:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2023-03-10 22:04:07] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2023-03-10 22:04:07] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2023-03-10 22:04:07] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2023-03-10 22:04:07] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2023-03-10 22:04:07] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-10 22:04:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 304 ms
[2023-03-10 22:04:07] [INFO ] After 534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-10 22:04:07] [INFO ] After 721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 65 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 234/234 transitions.
Applied a total of 0 rules in 12 ms. Remains 146 /146 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 146/146 places, 234/234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 234/234 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-10 22:04:07] [INFO ] Flow matrix only has 227 transitions (discarded 7 similar events)
[2023-03-10 22:04:07] [INFO ] Invariant cache hit.
[2023-03-10 22:04:07] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-10 22:04:07] [INFO ] Flow matrix only has 227 transitions (discarded 7 similar events)
[2023-03-10 22:04:07] [INFO ] Invariant cache hit.
[2023-03-10 22:04:07] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-10 22:04:07] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-10 22:04:07] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-10 22:04:07] [INFO ] Flow matrix only has 227 transitions (discarded 7 similar events)
[2023-03-10 22:04:07] [INFO ] Invariant cache hit.
[2023-03-10 22:04:07] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 146/146 places, 234/234 transitions.
Graph (trivial) has 57 edges and 146 vertex of which 14 / 146 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions removed 18 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 139 transition count 206
Reduce places removed 7 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 13 rules applied. Total rules applied 21 place count 132 transition count 200
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 30 place count 126 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 125 transition count 197
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 31 place count 125 transition count 195
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 35 place count 123 transition count 195
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 122 transition count 193
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 122 transition count 193
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 49 place count 116 transition count 187
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 53 place count 114 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 54 place count 114 transition count 187
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 72 place count 114 transition count 169
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 75 place count 114 transition count 166
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 78 place count 111 transition count 166
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 79 place count 111 transition count 166
Applied a total of 79 rules in 24 ms. Remains 111 /146 variables (removed 35) and now considering 166/234 (removed 68) transitions.
Running SMT prover for 2 properties.
[2023-03-10 22:04:07] [INFO ] Flow matrix only has 162 transitions (discarded 4 similar events)
// Phase 1: matrix 162 rows 111 cols
[2023-03-10 22:04:07] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-10 22:04:07] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 22:04:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-10 22:04:08] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 22:04:08] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-10 22:04:08] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-10 22:04:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-10 22:04:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 146 places, 234 transitions and 858 arcs took 1 ms.
[2023-03-10 22:04:08] [INFO ] Flatten gal took : 44 ms
Total runtime 14866 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FlexibleBarrier-PT-08b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/366
ReachabilityCardinality

FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678485849706

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/366/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/366/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/366/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 10 (type EXCL) for 0 FlexibleBarrier-PT-08b-ReachabilityCardinality-06
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 0 FlexibleBarrier-PT-08b-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 0 FlexibleBarrier-PT-08b-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 9 (type SRCH) for 0 FlexibleBarrier-PT-08b-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 9 (type SRCH) for FlexibleBarrier-PT-08b-ReachabilityCardinality-06
lola: result : true
lola: markings : 9
lola: fired transitions : 8
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 6 (type FNDP) for FlexibleBarrier-PT-08b-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 7 (type EQUN) for FlexibleBarrier-PT-08b-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 10 (type EXCL) for FlexibleBarrier-PT-08b-ReachabilityCardinality-06 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 17 (type EXCL) for 3 FlexibleBarrier-PT-08b-ReachabilityCardinality-14
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 3 FlexibleBarrier-PT-08b-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 3 FlexibleBarrier-PT-08b-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: LAUNCH task # 16 (type SRCH) for 3 FlexibleBarrier-PT-08b-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 6 (type FNDP) for FlexibleBarrier-PT-08b-ReachabilityCardinality-06
lola: result : true
lola: fired transitions : 7
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/366/ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/366/ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 13 (type FNDP) for FlexibleBarrier-PT-08b-ReachabilityCardinality-14
lola: result : true
lola: fired transitions : 38318
lola: tried executions : 1009
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 14 (type EQUN) for FlexibleBarrier-PT-08b-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 16 (type SRCH) for FlexibleBarrier-PT-08b-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 17 (type EXCL) for FlexibleBarrier-PT-08b-ReachabilityCardinality-14 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FlexibleBarrier-PT-08b-ReachabilityCardinality-06: EF true tandem / insertion
FlexibleBarrier-PT-08b-ReachabilityCardinality-14: AG false findpath


Time elapsed: 0 secs. Pages in use: 2

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-08b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is FlexibleBarrier-PT-08b, 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 r167-tall-167838853200486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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