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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 3.5K Apr 4 19:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 19:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 4 07:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 4 07:48 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.5K 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.3K Apr 3 21:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 3 21:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 3 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 3 13:34 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 945K 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-16b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591389529091

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 20:38:52] [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 20:38:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 20:38:52] [INFO ] Load time of PNML (sax parser for PT used): 460 ms
[2020-06-05 20:38:52] [INFO ] Transformed 3472 places.
[2020-06-05 20:38:52] [INFO ] Transformed 4001 transitions.
[2020-06-05 20:38:52] [INFO ] Found NUPN structural information;
[2020-06-05 20:38:52] [INFO ] Parsed PT model containing 3472 places and 4001 transitions in 577 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 138 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 90 resets, run finished after 146 ms. (steps per millisecond=68 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 7 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, 0]
Incomplete Best-First random walk after 10001 steps, including 8 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, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 4001 rows 3472 cols
[2020-06-05 20:38:53] [INFO ] Computed 18 place invariants in 324 ms
[2020-06-05 20:38:55] [INFO ] [Real]Absence check using 18 positive place invariants in 268 ms returned sat
[2020-06-05 20:38:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 20:38:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 20:38:58] [INFO ] [Real]Absence check using state equation in 3809 ms returned (error "Failed to check-sat")
[2020-06-05 20:39:00] [INFO ] [Real]Absence check using 18 positive place invariants in 344 ms returned sat
[2020-06-05 20:39:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 20:39:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 20:39:03] [INFO ] [Real]Absence check using state equation in 3818 ms returned (error "Failed to check-sat")
[2020-06-05 20:39:05] [INFO ] [Real]Absence check using 18 positive place invariants in 367 ms returned sat
[2020-06-05 20:39:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 20:39:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 20:39:08] [INFO ] [Real]Absence check using state equation in 3717 ms returned (error "Failed to check-sat")
[2020-06-05 20:39:10] [INFO ] [Real]Absence check using 18 positive place invariants in 331 ms returned sat
[2020-06-05 20:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 20:39:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 20:39:13] [INFO ] [Real]Absence check using state equation in 3852 ms returned (error "Failed to check-sat")
[2020-06-05 20:39:15] [INFO ] [Real]Absence check using 18 positive place invariants in 332 ms returned unsat
[2020-06-05 20:39:16] [INFO ] [Real]Absence check using 18 positive place invariants in 388 ms returned sat
[2020-06-05 20:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 20:39:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 20:39:20] [INFO ] [Real]Absence check using state equation in 3620 ms returned (error "Failed to check-sat")
[2020-06-05 20:39:21] [INFO ] [Real]Absence check using 18 positive place invariants in 379 ms returned sat
[2020-06-05 20:39:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 20:39:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 20:39:25] [INFO ] [Real]Absence check using state equation in 3683 ms returned (error "Failed to check-sat")
[2020-06-05 20:39:26] [INFO ] [Real]Absence check using 18 positive place invariants in 327 ms returned unsat
[2020-06-05 20:39:27] [INFO ] [Real]Absence check using 18 positive place invariants in 331 ms returned unsat
[2020-06-05 20:39:29] [INFO ] [Real]Absence check using 18 positive place invariants in 378 ms returned sat
[2020-06-05 20:39:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 20:39:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 20:39:32] [INFO ] [Real]Absence check using state equation in 3645 ms returned (error "Failed to check-sat")
[2020-06-05 20:39:33] [INFO ] [Real]Absence check using 18 positive place invariants in 347 ms returned sat
[2020-06-05 20:39:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 20:39:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 20:39:37] [INFO ] [Real]Absence check using state equation in 3857 ms returned (error "Failed to check-sat")
[2020-06-05 20:39:39] [INFO ] [Real]Absence check using 18 positive place invariants in 374 ms returned sat
[2020-06-05 20:39:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 20:39:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 20:39:42] [INFO ] [Real]Absence check using state equation in 3723 ms returned (error "Failed to check-sat")
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 50 out of 3472 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Graph (trivial) has 2813 edges and 3472 vertex of which 72 / 3472 are part of one of the 12 SCC in 33 ms
Free SCC test removed 60 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Performed 625 Post agglomeration using F-continuation condition.Transition count delta: 625
Iterating post reduction 0 with 697 rules applied. Total rules applied 698 place count 3412 transition count 3304
Reduce places removed 625 places and 0 transitions.
Iterating post reduction 1 with 625 rules applied. Total rules applied 1323 place count 2787 transition count 3304
Performed 452 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 452 Pre rules applied. Total rules applied 1323 place count 2787 transition count 2852
Deduced a syphon composed of 452 places in 3 ms
Reduce places removed 452 places and 0 transitions.
Iterating global reduction 2 with 904 rules applied. Total rules applied 2227 place count 2335 transition count 2852
Symmetric choice reduction at 2 with 1363 rule applications. Total rules 3590 place count 2335 transition count 2852
Deduced a syphon composed of 1363 places in 17 ms
Reduce places removed 1363 places and 1363 transitions.
Iterating global reduction 2 with 2726 rules applied. Total rules applied 6316 place count 972 transition count 1489
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 6318 place count 972 transition count 1487
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6319 place count 971 transition count 1487
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 6319 place count 971 transition count 1478
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 6337 place count 962 transition count 1478
Symmetric choice reduction at 4 with 211 rule applications. Total rules 6548 place count 962 transition count 1478
Deduced a syphon composed of 211 places in 4 ms
Reduce places removed 211 places and 211 transitions.
Iterating global reduction 4 with 422 rules applied. Total rules applied 6970 place count 751 transition count 1267
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 4 with 201 rules applied. Total rules applied 7171 place count 751 transition count 1066
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 5 with 184 rules applied. Total rules applied 7355 place count 659 transition count 974
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 5 with 8 rules applied. Total rules applied 7363 place count 655 transition count 974
Free-agglomeration rule applied 219 times.
Iterating global reduction 5 with 219 rules applied. Total rules applied 7582 place count 655 transition count 755
Reduce places removed 219 places and 0 transitions.
Iterating post reduction 5 with 219 rules applied. Total rules applied 7801 place count 436 transition count 755
Symmetric choice reduction at 6 with 27 rule applications. Total rules 7828 place count 436 transition count 755
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 27 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 7882 place count 409 transition count 728
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 7909 place count 409 transition count 701
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 7913 place count 409 transition count 701
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 7925 place count 409 transition count 689
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 7926 place count 408 transition count 688
Applied a total of 7926 rules in 1272 ms. Remains 408 /3472 variables (removed 3064) and now considering 688/4001 (removed 3313) transitions.
Finished structural reductions, in 1 iterations. Remains : 408/3472 places, 688/4001 transitions.
Incomplete random walk after 1000000 steps, including 8901 resets, run finished after 4670 ms. (steps per millisecond=214 ) properties seen :[0, 1, 1, 0, 0, 0, 1, 1, 1]
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 41 resets, run finished after 565 ms. (steps per millisecond=1769 ) properties seen :[1, 0, 0, 0]
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 967 resets, run finished after 1186 ms. (steps per millisecond=843 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 973 resets, run finished after 1219 ms. (steps per millisecond=820 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 43 resets, run finished after 703 ms. (steps per millisecond=1422 ) properties seen :[0, 0, 0]
[2020-06-05 20:39:52] [INFO ] Flow matrix only has 662 transitions (discarded 26 similar events)
// Phase 1: matrix 662 rows 408 cols
[2020-06-05 20:39:52] [INFO ] Computed 18 place invariants in 12 ms
[2020-06-05 20:39:52] [INFO ] [Real]Absence check using 18 positive place invariants in 25 ms returned sat
[2020-06-05 20:39:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 20:39:53] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2020-06-05 20:39:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-05 20:39:53] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-05 20:39:53] [INFO ] Deduced a trap composed of 215 places in 385 ms
[2020-06-05 20:39:54] [INFO ] Deduced a trap composed of 217 places in 342 ms
[2020-06-05 20:39:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 874 ms
[2020-06-05 20:39:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 20:39:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 53 ms returned sat
[2020-06-05 20:39:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 20:39:55] [INFO ] [Nat]Absence check using state equation in 968 ms returned sat
[2020-06-05 20:39:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-05 20:39:55] [INFO ] Deduced a trap composed of 217 places in 371 ms
[2020-06-05 20:39:56] [INFO ] Deduced a trap composed of 215 places in 390 ms
[2020-06-05 20:39:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 898 ms
[2020-06-05 20:39:56] [INFO ] Computed and/alt/rep : 676/1828/650 causal constraints in 99 ms.
[2020-06-05 20:39:58] [INFO ] Added : 190 causal constraints over 38 iterations in 2495 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-06-05 20:39:59] [INFO ] [Real]Absence check using 18 positive place invariants in 28 ms returned sat
[2020-06-05 20:39:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 20:40:00] [INFO ] [Real]Absence check using state equation in 1021 ms returned sat
[2020-06-05 20:40:00] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-05 20:40:00] [INFO ] Computed and/alt/rep : 676/1828/650 causal constraints in 87 ms.
[2020-06-05 20:40:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 20:40:00] [INFO ] [Nat]Absence check using 18 positive place invariants in 78 ms returned sat
[2020-06-05 20:40:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 20:40:01] [INFO ] [Nat]Absence check using state equation in 844 ms returned sat
[2020-06-05 20:40:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-06-05 20:40:01] [INFO ] Computed and/alt/rep : 676/1828/650 causal constraints in 35 ms.
[2020-06-05 20:40:03] [INFO ] Added : 187 causal constraints over 38 iterations in 1786 ms. Result :sat
[2020-06-05 20:40:03] [INFO ] Deduced a trap composed of 218 places in 390 ms
[2020-06-05 20:40:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 497 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
[2020-06-05 20:40:04] [INFO ] [Real]Absence check using 18 positive place invariants in 42 ms returned sat
[2020-06-05 20:40:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 20:40:05] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2020-06-05 20:40:05] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-05 20:40:05] [INFO ] Computed and/alt/rep : 676/1828/650 causal constraints in 76 ms.
[2020-06-05 20:40:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 20:40:05] [INFO ] [Nat]Absence check using 18 positive place invariants in 77 ms returned sat
[2020-06-05 20:40:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 20:40:06] [INFO ] [Nat]Absence check using state equation in 1005 ms returned sat
[2020-06-05 20:40:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-05 20:40:06] [INFO ] Computed and/alt/rep : 676/1828/650 causal constraints in 54 ms.
[2020-06-05 20:40:09] [INFO ] Added : 189 causal constraints over 38 iterations in 2389 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 42700 steps, including 574 resets, run finished after 478 ms. (steps per millisecond=89 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 43800 steps, including 552 resets, run finished after 376 ms. (steps per millisecond=116 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 44300 steps, including 564 resets, run finished after 279 ms. (steps per millisecond=158 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 25 out of 408 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 408/408 places, 688/688 transitions.
Graph (trivial) has 68 edges and 408 vertex of which 4 / 408 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 406 transition count 678
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 400 transition count 678
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 17 place count 400 transition count 676
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 398 transition count 676
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 37 place count 398 transition count 660
Symmetric choice reduction at 3 with 21 rule applications. Total rules 58 place count 398 transition count 660
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 100 place count 377 transition count 639
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 377 transition count 638
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 119 place count 368 transition count 629
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 368 transition count 628
Symmetric choice reduction at 5 with 6 rule applications. Total rules 126 place count 368 transition count 628
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 138 place count 362 transition count 622
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 143 place count 362 transition count 617
Free-agglomeration rule applied 36 times.
Iterating global reduction 6 with 36 rules applied. Total rules applied 179 place count 362 transition count 581
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t3464.t2995.t2996 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 78 edges and 324 vertex of which 26 / 324 are part of one of the 12 SCC in 1 ms
Free SCC test removed 14 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 184 place count 310 transition count 577
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 26 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 213 place count 309 transition count 549
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 15 Pre rules applied. Total rules applied 213 place count 309 transition count 534
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 243 place count 294 transition count 534
Symmetric choice reduction at 8 with 17 rule applications. Total rules 260 place count 294 transition count 534
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 294 place count 277 transition count 517
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 311 place count 277 transition count 500
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 349 place count 258 transition count 481
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 9 with 2 rules applied. Total rules applied 351 place count 257 transition count 481
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 353 place count 257 transition count 479
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 367 place count 257 transition count 465
Free-agglomeration rule applied 12 times.
Iterating global reduction 10 with 12 rules applied. Total rules applied 379 place count 257 transition count 453
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 10 with 37 rules applied. Total rules applied 416 place count 241 transition count 432
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 428 place count 235 transition count 426
Symmetric choice reduction at 12 with 44 rule applications. Total rules 472 place count 235 transition count 426
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 44 transitions.
Iterating global reduction 12 with 88 rules applied. Total rules applied 560 place count 191 transition count 382
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 12 with 44 rules applied. Total rules applied 604 place count 191 transition count 338
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 13 with 14 rules applied. Total rules applied 618 place count 191 transition count 324
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 619 place count 191 transition count 323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 620 place count 190 transition count 323
Applied a total of 620 rules in 438 ms. Remains 190 /408 variables (removed 218) and now considering 323/688 (removed 365) transitions.
Finished structural reductions, in 1 iterations. Remains : 190/408 places, 323/688 transitions.
Incomplete random walk after 1000000 steps, including 50601 resets, run finished after 3990 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2901 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2424 resets, run finished after 881 ms. (steps per millisecond=1135 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 468 resets, run finished after 592 ms. (steps per millisecond=1689 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 14174856 steps, run timeout after 30001 ms. (steps per millisecond=472 ) properties seen :[0, 1, 1]
Probabilistic random walk after 14174856 steps, saw 1489613 distinct states, run finished after 30001 ms. (steps per millisecond=472 ) properties seen :[0, 1, 1]
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 323 rows 190 cols
[2020-06-05 20:40:47] [INFO ] Computed 13 place invariants in 3 ms
[2020-06-05 20:40:47] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2020-06-05 20:40:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 20:40:47] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2020-06-05 20:40:47] [INFO ] Deduced a trap composed of 134 places in 91 ms
[2020-06-05 20:40:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2020-06-05 20:40:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 20:40:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2020-06-05 20:40:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 20:40:47] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2020-06-05 20:40:47] [INFO ] Deduced a trap composed of 134 places in 160 ms
[2020-06-05 20:40:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2020-06-05 20:40:47] [INFO ] Computed and/alt/rep : 316/729/316 causal constraints in 34 ms.
[2020-06-05 20:40:48] [INFO ] Added : 70 causal constraints over 14 iterations in 446 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
Incomplete Parikh walk after 14400 steps, including 946 resets, run finished after 122 ms. (steps per millisecond=118 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 190 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 190/190 places, 323/323 transitions.
Graph (trivial) has 167 edges and 190 vertex of which 8 / 190 are part of one of the 3 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 185 transition count 310
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 17 place count 182 transition count 310
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 182 transition count 310
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 179 transition count 307
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2186.t2107.t2592.t3814.t2539.t2540.t2247 and 1 places that fell out of Prefix Of Interest.
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 169 transition count 300
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1527.t2576.t3806.t2539.t2540.t1524.t1525 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 149 edges and 168 vertex of which 6 / 168 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 39 place count 163 transition count 295
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 49 place count 163 transition count 285
Symmetric choice reduction at 4 with 41 rule applications. Total rules 90 place count 163 transition count 285
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 41 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 172 place count 122 transition count 244
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 4 with 41 rules applied. Total rules applied 213 place count 122 transition count 203
Free-agglomeration rule applied 97 times with reduction of 1 identical transitions.
Iterating global reduction 5 with 97 rules applied. Total rules applied 310 place count 122 transition count 105
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 53 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 5 with 155 rules applied. Total rules applied 465 place count 24 transition count 48
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 466 place count 24 transition count 48
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 467 place count 24 transition count 47
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 486 place count 24 transition count 28
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 51 edges and 24 vertex of which 22 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Iterating post reduction 7 with 1 rules applied. Total rules applied 487 place count 22 transition count 28
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 489 place count 22 transition count 26
Applied a total of 489 rules in 46 ms. Remains 22 /190 variables (removed 168) and now considering 26/323 (removed 297) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/190 places, 26/323 transitions.
Finished random walk after 20940 steps, including 0 resets, run visited all 1 properties in 64 ms. (steps per millisecond=327 )
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-04 FALSE 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-16b"
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-16b, 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-158987815800367"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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