Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815700335.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is FlexibleBarrier-PT-12b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815700335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 3.7K Apr 4 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 4 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 4 07:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 4 07:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 3 21:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 3 21:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 3 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 3 13:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 536K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-12b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591368520392

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 14:48:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 14:48:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 14:48:43] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2020-06-05 14:48:43] [INFO ] Transformed 1988 places.
[2020-06-05 14:48:43] [INFO ] Transformed 2289 transitions.
[2020-06-05 14:48:43] [INFO ] Found NUPN structural information;
[2020-06-05 14:48:43] [INFO ] Parsed PT model containing 1988 places and 2289 transitions in 447 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 106 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 115 resets, run finished after 193 ms. (steps per millisecond=51 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1]
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2289 rows 1988 cols
[2020-06-05 14:48:44] [INFO ] Computed 14 place invariants in 140 ms
[2020-06-05 14:48:45] [INFO ] [Real]Absence check using 14 positive place invariants in 174 ms returned sat
[2020-06-05 14:48:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:48:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s782 (- t2129 t1186))") while checking expression at index 0
[2020-06-05 14:48:50] [INFO ] [Real]Absence check using 14 positive place invariants in 186 ms returned sat
[2020-06-05 14:48:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:48:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:48:54] [INFO ] [Real]Absence check using state equation in 4254 ms returned (error "Failed to check-sat")
[2020-06-05 14:48:55] [INFO ] [Real]Absence check using 14 positive place invariants in 113 ms returned sat
[2020-06-05 14:48:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:48:59] [INFO ] [Real]Absence check using state equation in 4453 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 14:49:00] [INFO ] [Real]Absence check using 14 positive place invariants in 145 ms returned sat
[2020-06-05 14:49:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:49:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:49:04] [INFO ] [Real]Absence check using state equation in 4287 ms returned (error "Failed to check-sat")
[2020-06-05 14:49:05] [INFO ] [Real]Absence check using 14 positive place invariants in 185 ms returned sat
[2020-06-05 14:49:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:49:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:49:09] [INFO ] [Real]Absence check using state equation in 4192 ms returned (error "Failed to check-sat")
[2020-06-05 14:49:10] [INFO ] [Real]Absence check using 14 positive place invariants in 177 ms returned sat
[2020-06-05 14:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:49:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:49:14] [INFO ] [Real]Absence check using state equation in 4312 ms returned (error "Failed to check-sat")
[2020-06-05 14:49:15] [INFO ] [Real]Absence check using 14 positive place invariants in 156 ms returned sat
[2020-06-05 14:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:49:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:49:19] [INFO ] [Real]Absence check using state equation in 4424 ms returned (error "Failed to check-sat")
[2020-06-05 14:49:20] [INFO ] [Real]Absence check using 14 positive place invariants in 112 ms returned sat
[2020-06-05 14:49:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:49:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:49:24] [INFO ] [Real]Absence check using state equation in 4472 ms returned (error "Failed to check-sat")
[2020-06-05 14:49:25] [INFO ] [Real]Absence check using 14 positive place invariants in 109 ms returned sat
[2020-06-05 14:49:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:49:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 14:49:29] [INFO ] [Real]Absence check using state equation in 4384 ms returned (error "Failed to check-sat")
Support contains 43 out of 1988 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1544 edges and 1988 vertex of which 48 / 1988 are part of one of the 8 SCC in 33 ms
Free SCC test removed 40 places
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Iterating post reduction 0 with 397 rules applied. Total rules applied 398 place count 1948 transition count 1892
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 747 place count 1599 transition count 1892
Performed 266 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 266 Pre rules applied. Total rules applied 747 place count 1599 transition count 1626
Deduced a syphon composed of 266 places in 3 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 2 with 532 rules applied. Total rules applied 1279 place count 1333 transition count 1626
Symmetric choice reduction at 2 with 735 rule applications. Total rules 2014 place count 1333 transition count 1626
Deduced a syphon composed of 735 places in 3 ms
Reduce places removed 735 places and 735 transitions.
Iterating global reduction 2 with 1470 rules applied. Total rules applied 3484 place count 598 transition count 891
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 3486 place count 598 transition count 889
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3487 place count 597 transition count 889
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 3487 place count 597 transition count 880
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 3505 place count 588 transition count 880
Symmetric choice reduction at 4 with 109 rule applications. Total rules 3614 place count 588 transition count 880
Deduced a syphon composed of 109 places in 2 ms
Reduce places removed 109 places and 109 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 3832 place count 479 transition count 771
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 3932 place count 479 transition count 671
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 4 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 4078 place count 406 transition count 598
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 4086 place count 402 transition count 598
Free-agglomeration rule applied 103 times.
Iterating global reduction 5 with 103 rules applied. Total rules applied 4189 place count 402 transition count 495
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 5 with 103 rules applied. Total rules applied 4292 place count 299 transition count 495
Symmetric choice reduction at 6 with 12 rule applications. Total rules 4304 place count 299 transition count 495
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 4328 place count 287 transition count 483
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 4340 place count 287 transition count 471
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 4343 place count 287 transition count 471
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 4351 place count 287 transition count 463
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 4352 place count 286 transition count 462
Applied a total of 4352 rules in 760 ms. Remains 286 /1988 variables (removed 1702) and now considering 462/2289 (removed 1827) transitions.
Finished structural reductions, in 1 iterations. Remains : 286/1988 places, 462/2289 transitions.
Incomplete random walk after 1000000 steps, including 18261 resets, run finished after 4303 ms. (steps per millisecond=232 ) properties seen :[1, 0, 1, 0, 1, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1908 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 165 resets, run finished after 770 ms. (steps per millisecond=1298 ) properties seen :[0, 0]
[2020-06-05 14:49:36] [INFO ] Flow matrix only has 445 transitions (discarded 17 similar events)
// Phase 1: matrix 445 rows 286 cols
[2020-06-05 14:49:36] [INFO ] Computed 14 place invariants in 4 ms
[2020-06-05 14:49:36] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2020-06-05 14:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:49:37] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2020-06-05 14:49:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-05 14:49:37] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-05 14:49:37] [INFO ] Computed and/alt/rep : 449/1088/432 causal constraints in 59 ms.
[2020-06-05 14:49:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 14:49:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 29 ms returned sat
[2020-06-05 14:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 14:49:38] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2020-06-05 14:49:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-05 14:49:38] [INFO ] Computed and/alt/rep : 449/1088/432 causal constraints in 59 ms.
[2020-06-05 14:49:39] [INFO ] Added : 212 causal constraints over 43 iterations in 1900 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-06-05 14:49:40] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2020-06-05 14:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 14:49:40] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2020-06-05 14:49:40] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-05 14:49:40] [INFO ] Deduced a trap composed of 123 places in 252 ms
[2020-06-05 14:49:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2020-06-05 14:49:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 14:49:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-06-05 14:49:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 14:49:41] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2020-06-05 14:49:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-05 14:49:41] [INFO ] Deduced a trap composed of 123 places in 212 ms
[2020-06-05 14:49:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2020-06-05 14:49:41] [INFO ] Computed and/alt/rep : 449/1088/432 causal constraints in 37 ms.
[2020-06-05 14:49:43] [INFO ] Added : 242 causal constraints over 49 iterations in 1604 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
Incomplete Parikh walk after 57400 steps, including 1000 resets, run finished after 313 ms. (steps per millisecond=183 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 49600 steps, including 877 resets, run finished after 217 ms. (steps per millisecond=228 ) properties seen :[0, 0] could not realise parikh vector
Support contains 18 out of 286 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 286/286 places, 462/462 transitions.
Graph (trivial) has 71 edges and 286 vertex of which 6 / 286 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 283 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 282 transition count 455
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 282 transition count 452
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 279 transition count 452
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 27 place count 279 transition count 440
Symmetric choice reduction at 3 with 19 rule applications. Total rules 46 place count 279 transition count 440
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 84 place count 260 transition count 421
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 100 place count 252 transition count 413
Symmetric choice reduction at 3 with 7 rule applications. Total rules 107 place count 252 transition count 413
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 121 place count 245 transition count 406
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 128 place count 245 transition count 399
Free-agglomeration rule applied 40 times.
Iterating global reduction 4 with 40 rules applied. Total rules applied 168 place count 245 transition count 359
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 63 edges and 204 vertex of which 25 / 204 are part of one of the 11 SCC in 1 ms
Free SCC test removed 14 places
Iterating post reduction 4 with 44 rules applied. Total rules applied 212 place count 190 transition count 357
Drop transitions removed 25 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 240 place count 190 transition count 329
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 240 place count 190 transition count 317
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 264 place count 178 transition count 317
Symmetric choice reduction at 6 with 12 rule applications. Total rules 276 place count 178 transition count 317
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 300 place count 166 transition count 305
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 312 place count 166 transition count 293
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 338 place count 153 transition count 280
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 7 with 2 rules applied. Total rules applied 340 place count 152 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 342 place count 152 transition count 278
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 354 place count 152 transition count 266
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 365 place count 152 transition count 255
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 8 with 41 rules applied. Total rules applied 406 place count 135 transition count 231
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 9 with 28 rules applied. Total rules applied 434 place count 121 transition count 217
Symmetric choice reduction at 10 with 34 rule applications. Total rules 468 place count 121 transition count 217
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 34 transitions.
Iterating global reduction 10 with 68 rules applied. Total rules applied 536 place count 87 transition count 183
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 10 with 34 rules applied. Total rules applied 570 place count 87 transition count 149
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 581 place count 87 transition count 138
Applied a total of 581 rules in 118 ms. Remains 87 /286 variables (removed 199) and now considering 138/462 (removed 324) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/286 places, 138/462 transitions.
Incomplete random walk after 1000000 steps, including 100461 resets, run finished after 2739 ms. (steps per millisecond=365 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5384 resets, run finished after 575 ms. (steps per millisecond=1739 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2536 resets, run finished after 676 ms. (steps per millisecond=1479 ) properties seen :[0, 0]
Finished probabilistic random walk after 1042492 steps, run visited all 2 properties in 1410 ms. (steps per millisecond=739 )
Probabilistic random walk after 1042492 steps, saw 159208 distinct states, run finished after 1411 ms. (steps per millisecond=738 ) properties seen :[1, 1]
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FlexibleBarrier-PT-12b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-12b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is FlexibleBarrier-PT-12b, 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 r170-smll-158987815700335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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