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-158987815800415.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-22b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815800415
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 3.8K Apr 4 20:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 4 20:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 4 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 4 09:09 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 25K 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 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 3 21:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 21:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 3 13:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 3 13:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 1.8M 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-22b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591426183792

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 06:49:46] [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-06 06:49:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 06:49:46] [INFO ] Load time of PNML (sax parser for PT used): 427 ms
[2020-06-06 06:49:46] [INFO ] Transformed 6478 places.
[2020-06-06 06:49:46] [INFO ] Transformed 7469 transitions.
[2020-06-06 06:49:46] [INFO ] Found NUPN structural information;
[2020-06-06 06:49:46] [INFO ] Parsed PT model containing 6478 places and 7469 transitions in 539 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 166 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 68 resets, run finished after 305 ms. (steps per millisecond=32 ) properties seen :[0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 7469 rows 6478 cols
[2020-06-06 06:49:48] [INFO ] Computed 24 place invariants in 788 ms
[2020-06-06 06:49:51] [INFO ] [Real]Absence check using 24 positive place invariants in 595 ms returned sat
[2020-06-06 06:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:49:53] [INFO ] [Real]Absence check using state equation in 2374 ms returned (error "Solver has unexpectedly terminated")
[2020-06-06 06:49:56] [INFO ] [Real]Absence check using 24 positive place invariants in 636 ms returned unsat
[2020-06-06 06:49:58] [INFO ] [Real]Absence check using 24 positive place invariants in 570 ms returned sat
[2020-06-06 06:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:50:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 06:50:01] [INFO ] [Real]Absence check using state equation in 2788 ms returned (error "Failed to check-sat")
[2020-06-06 06:50:03] [INFO ] [Real]Absence check using 24 positive place invariants in 587 ms returned sat
[2020-06-06 06:50:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:50:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 06:50:06] [INFO ] [Real]Absence check using state equation in 2701 ms returned (error "Failed to check-sat")
[2020-06-06 06:50:08] [INFO ] [Real]Absence check using 24 positive place invariants in 877 ms returned sat
[2020-06-06 06:50:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:50:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 06:50:11] [INFO ] [Real]Absence check using state equation in 2439 ms returned (error "Failed to check-sat")
[2020-06-06 06:50:13] [INFO ] [Real]Absence check using 24 positive place invariants in 621 ms returned sat
[2020-06-06 06:50:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:50:16] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 06:50:16] [INFO ] [Real]Absence check using state equation in 2886 ms returned (error "Failed to check-sat")
[2020-06-06 06:50:18] [INFO ] [Real]Absence check using 24 positive place invariants in 613 ms returned sat
[2020-06-06 06:50:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:50:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 06:50:21] [INFO ] [Real]Absence check using state equation in 2686 ms returned (error "Failed to check-sat")
[2020-06-06 06:50:23] [INFO ] [Real]Absence check using 24 positive place invariants in 736 ms returned sat
[2020-06-06 06:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:50:26] [INFO ] [Real]Absence check using state equation in 2763 ms returned (error "Solver has unexpectedly terminated")
[2020-06-06 06:50:28] [INFO ] [Real]Absence check using 24 positive place invariants in 748 ms returned sat
[2020-06-06 06:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:50:31] [INFO ] [Real]Absence check using state equation in 2747 ms returned (error "Failed to check-sat")
[2020-06-06 06:50:33] [INFO ] [Real]Absence check using 24 positive place invariants in 585 ms returned sat
[2020-06-06 06:50:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:50:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 06:50:36] [INFO ] [Real]Absence check using state equation in 3025 ms returned (error "Failed to check-sat")
[2020-06-06 06:50:38] [INFO ] [Real]Absence check using 24 positive place invariants in 596 ms returned sat
[2020-06-06 06:50:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:50:41] [INFO ] [Real]Absence check using state equation in 2567 ms returned (error "Solver has unexpectedly terminated")
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 61 out of 6478 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Graph (trivial) has 5294 edges and 6478 vertex of which 108 / 6478 are part of one of the 18 SCC in 32 ms
Free SCC test removed 90 places
Drop transitions removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Performed 1125 Post agglomeration using F-continuation condition.Transition count delta: 1125
Iterating post reduction 0 with 1233 rules applied. Total rules applied 1234 place count 6388 transition count 6236
Reduce places removed 1125 places and 0 transitions.
Iterating post reduction 1 with 1125 rules applied. Total rules applied 2359 place count 5263 transition count 6236
Performed 881 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 881 Pre rules applied. Total rules applied 2359 place count 5263 transition count 5355
Deduced a syphon composed of 881 places in 6 ms
Reduce places removed 881 places and 0 transitions.
Iterating global reduction 2 with 1762 rules applied. Total rules applied 4121 place count 4382 transition count 5355
Symmetric choice reduction at 2 with 2660 rule applications. Total rules 6781 place count 4382 transition count 5355
Deduced a syphon composed of 2660 places in 15 ms
Reduce places removed 2660 places and 2660 transitions.
Iterating global reduction 2 with 5320 rules applied. Total rules applied 12101 place count 1722 transition count 2695
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 12103 place count 1722 transition count 2693
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12104 place count 1721 transition count 2693
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 12104 place count 1721 transition count 2676
Deduced a syphon composed of 17 places in 8 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 12138 place count 1704 transition count 2676
Symmetric choice reduction at 4 with 424 rule applications. Total rules 12562 place count 1704 transition count 2676
Deduced a syphon composed of 424 places in 3 ms
Reduce places removed 424 places and 424 transitions.
Iterating global reduction 4 with 848 rules applied. Total rules applied 13410 place count 1280 transition count 2252
Ensure Unique test removed 407 transitions
Reduce isomorphic transitions removed 407 transitions.
Iterating post reduction 4 with 407 rules applied. Total rules applied 13817 place count 1280 transition count 1845
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 5 with 250 rules applied. Total rules applied 14067 place count 1155 transition count 1720
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 14089 place count 1155 transition count 1698
Symmetric choice reduction at 6 with 21 rule applications. Total rules 14110 place count 1155 transition count 1698
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 14152 place count 1134 transition count 1677
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 14160 place count 1130 transition count 1677
Free-agglomeration rule applied 435 times.
Iterating global reduction 6 with 435 rules applied. Total rules applied 14595 place count 1130 transition count 1242
Reduce places removed 435 places and 0 transitions.
Iterating post reduction 6 with 435 rules applied. Total rules applied 15030 place count 695 transition count 1242
Symmetric choice reduction at 7 with 78 rule applications. Total rules 15108 place count 695 transition count 1242
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 78 transitions.
Iterating global reduction 7 with 156 rules applied. Total rules applied 15264 place count 617 transition count 1164
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 7 with 78 rules applied. Total rules applied 15342 place count 617 transition count 1086
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 15345 place count 617 transition count 1086
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 15361 place count 617 transition count 1070
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 15362 place count 616 transition count 1069
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t6466.t6218.t6219 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 109 edges and 614 vertex of which 34 / 614 are part of one of the 17 SCC in 0 ms
Free SCC test removed 17 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 4 rules applied. Total rules applied 15366 place count 597 transition count 1066
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 9 with 35 rules applied. Total rules applied 15401 place count 596 transition count 1032
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 23 Pre rules applied. Total rules applied 15401 place count 596 transition count 1009
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 10 with 46 rules applied. Total rules applied 15447 place count 573 transition count 1009
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 48 rules applied. Total rules applied 15495 place count 549 transition count 985
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 15503 place count 545 transition count 985
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 15510 place count 545 transition count 978
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 15511 place count 545 transition count 978
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 11 with 18 rules applied. Total rules applied 15529 place count 545 transition count 960
Free-agglomeration rule applied 16 times.
Iterating global reduction 11 with 16 rules applied. Total rules applied 15545 place count 545 transition count 944
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 11 with 45 rules applied. Total rules applied 15590 place count 525 transition count 919
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 15602 place count 519 transition count 913
Symmetric choice reduction at 13 with 64 rule applications. Total rules 15666 place count 519 transition count 913
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 64 transitions.
Iterating global reduction 13 with 128 rules applied. Total rules applied 15794 place count 455 transition count 849
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 13 with 64 rules applied. Total rules applied 15858 place count 455 transition count 785
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 14 with 18 rules applied. Total rules applied 15876 place count 455 transition count 767
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 15877 place count 455 transition count 766
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15878 place count 454 transition count 766
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 15879 place count 454 transition count 766
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 15880 place count 454 transition count 765
Applied a total of 15880 rules in 3445 ms. Remains 454 /6478 variables (removed 6024) and now considering 765/7469 (removed 6704) transitions.
Finished structural reductions, in 1 iterations. Remains : 454/6478 places, 765/7469 transitions.
Incomplete random walk after 1000000 steps, including 45974 resets, run finished after 6259 ms. (steps per millisecond=159 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1372 resets, run finished after 870 ms. (steps per millisecond=1149 ) properties seen :[0]
// Phase 1: matrix 765 rows 454 cols
[2020-06-06 06:50:51] [INFO ] Computed 19 place invariants in 15 ms
[2020-06-06 06:50:52] [INFO ] [Real]Absence check using 19 positive place invariants in 29 ms returned sat
[2020-06-06 06:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:50:52] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2020-06-06 06:50:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2020-06-06 06:50:53] [INFO ] [Real]Added 18 Read/Feed constraints in 10 ms returned sat
[2020-06-06 06:50:53] [INFO ] Deduced a trap composed of 306 places in 374 ms
[2020-06-06 06:50:53] [INFO ] Deduced a trap composed of 307 places in 382 ms
[2020-06-06 06:50:54] [INFO ] Deduced a trap composed of 313 places in 454 ms
[2020-06-06 06:50:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1358 ms
[2020-06-06 06:50:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 06:50:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 34 ms returned sat
[2020-06-06 06:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 06:50:55] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2020-06-06 06:50:55] [INFO ] [Nat]Added 18 Read/Feed constraints in 18 ms returned sat
[2020-06-06 06:50:55] [INFO ] Deduced a trap composed of 307 places in 462 ms
[2020-06-06 06:50:56] [INFO ] Deduced a trap composed of 313 places in 460 ms
[2020-06-06 06:50:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1065 ms
[2020-06-06 06:50:56] [INFO ] Computed and/alt/rep : 751/3225/751 causal constraints in 130 ms.
[2020-06-06 06:50:59] [INFO ] Added : 250 causal constraints over 51 iterations in 3301 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
Incomplete Parikh walk after 40500 steps, including 1000 resets, run finished after 300 ms. (steps per millisecond=135 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 454 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 454/454 places, 765/765 transitions.
Graph (trivial) has 428 edges and 454 vertex of which 11 / 454 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 448 transition count 739
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 38 place count 437 transition count 739
Symmetric choice reduction at 2 with 21 rule applications. Total rules 59 place count 437 transition count 739
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 101 place count 416 transition count 718
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 416 transition count 716
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t6005.t6006.t6008.t6197.t6198.t6302.t7424 and 1 places that fell out of Prefix Of Interest.
Iterating global reduction 3 with 16 rules applied. Total rules applied 119 place count 394 transition count 700
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t5812.t5813.t5815.t6197.t6198.t6298.t7422.t6000.t6001 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 3 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 394 edges and 393 vertex of which 26 / 393 are part of one of the 1 SCC in 0 ms
Free SCC test removed 25 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 12 rules applied. Total rules applied 131 place count 368 transition count 689
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 182 place count 367 transition count 639
Symmetric choice reduction at 5 with 109 rule applications. Total rules 291 place count 367 transition count 639
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 109 transitions.
Iterating global reduction 5 with 218 rules applied. Total rules applied 509 place count 258 transition count 530
Ensure Unique test removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Iterating post reduction 5 with 109 rules applied. Total rules applied 618 place count 258 transition count 421
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 620 place count 257 transition count 421
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 622 place count 257 transition count 419
Free-agglomeration rule applied 229 times with reduction of 3 identical transitions.
Iterating global reduction 7 with 229 rules applied. Total rules applied 851 place count 257 transition count 187
Reduce places removed 234 places and 0 transitions.
Drop transitions removed 136 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 146 transitions.
Iterating post reduction 7 with 380 rules applied. Total rules applied 1231 place count 23 transition count 41
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1234 place count 23 transition count 41
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1237 place count 23 transition count 38
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 1247 place count 23 transition count 28
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 57 edges and 23 vertex of which 17 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Iterating post reduction 9 with 1 rules applied. Total rules applied 1248 place count 17 transition count 28
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1254 place count 17 transition count 22
Applied a total of 1254 rules in 76 ms. Remains 17 /454 variables (removed 437) and now considering 22/765 (removed 743) transitions.
Finished structural reductions, in 1 iterations. Remains : 17/454 places, 22/765 transitions.
Finished random walk after 590 steps, including 45 resets, run visited all 1 properties in 4 ms. (steps per millisecond=147 )
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_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-22b"
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-22b, 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-158987815800415"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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