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.r166-smll-158987787100015.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 ASLink-PT-01a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787100015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 4.0K Mar 25 09:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 25 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 09:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 09:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 25 09:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 25 09:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 09:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 25 09:04 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 201K 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 ASLink-PT-01a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-01a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591132397531

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 21:13:19] [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-02 21:13:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 21:13:19] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2020-06-02 21:13:19] [INFO ] Transformed 431 places.
[2020-06-02 21:13:19] [INFO ] Transformed 735 transitions.
[2020-06-02 21:13:19] [INFO ] Found NUPN structural information;
[2020-06-02 21:13:19] [INFO ] Parsed PT model containing 431 places and 735 transitions in 212 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 189 resets, run finished after 116 ms. (steps per millisecond=86 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0]
FORMULA ASLink-PT-01a-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 60 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 728 rows 431 cols
[2020-06-02 21:13:20] [INFO ] Computed 80 place invariants in 70 ms
[2020-06-02 21:13:20] [INFO ] [Real]Absence check using 19 positive place invariants in 41 ms returned sat
[2020-06-02 21:13:20] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 39 ms returned sat
[2020-06-02 21:13:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:21] [INFO ] [Real]Absence check using state equation in 1038 ms returned sat
[2020-06-02 21:13:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:13:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 64 ms returned sat
[2020-06-02 21:13:22] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 42 ms returned sat
[2020-06-02 21:13:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:23] [INFO ] [Nat]Absence check using state equation in 804 ms returned unsat
[2020-06-02 21:13:23] [INFO ] [Real]Absence check using 19 positive place invariants in 30 ms returned sat
[2020-06-02 21:13:23] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 48 ms returned sat
[2020-06-02 21:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:24] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2020-06-02 21:13:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:13:24] [INFO ] [Nat]Absence check using 19 positive place invariants in 47 ms returned sat
[2020-06-02 21:13:24] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 47 ms returned sat
[2020-06-02 21:13:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:25] [INFO ] [Nat]Absence check using state equation in 677 ms returned unsat
[2020-06-02 21:13:25] [INFO ] [Real]Absence check using 19 positive place invariants in 27 ms returned sat
[2020-06-02 21:13:25] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 50 ms returned sat
[2020-06-02 21:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:26] [INFO ] [Real]Absence check using state equation in 980 ms returned sat
[2020-06-02 21:13:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:13:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 47 ms returned sat
[2020-06-02 21:13:26] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 58 ms returned sat
[2020-06-02 21:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:27] [INFO ] [Nat]Absence check using state equation in 640 ms returned unsat
[2020-06-02 21:13:27] [INFO ] [Real]Absence check using 19 positive place invariants in 25 ms returned sat
[2020-06-02 21:13:27] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 7 ms returned unsat
[2020-06-02 21:13:27] [INFO ] [Real]Absence check using 19 positive place invariants in 29 ms returned sat
[2020-06-02 21:13:27] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 49 ms returned sat
[2020-06-02 21:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:28] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2020-06-02 21:13:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:13:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 57 ms returned sat
[2020-06-02 21:13:28] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 46 ms returned sat
[2020-06-02 21:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:29] [INFO ] [Nat]Absence check using state equation in 852 ms returned unsat
[2020-06-02 21:13:29] [INFO ] [Real]Absence check using 19 positive place invariants in 27 ms returned sat
[2020-06-02 21:13:29] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 44 ms returned sat
[2020-06-02 21:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:30] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2020-06-02 21:13:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:13:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 47 ms returned sat
[2020-06-02 21:13:30] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 38 ms returned sat
[2020-06-02 21:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:13:35] [INFO ] [Nat]Absence check using state equation in 4833 ms returned unknown
[2020-06-02 21:13:35] [INFO ] [Real]Absence check using 19 positive place invariants in 25 ms returned sat
[2020-06-02 21:13:35] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 44 ms returned sat
[2020-06-02 21:13:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:36] [INFO ] [Real]Absence check using state equation in 965 ms returned sat
[2020-06-02 21:13:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:13:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 47 ms returned sat
[2020-06-02 21:13:37] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 44 ms returned sat
[2020-06-02 21:13:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:37] [INFO ] [Nat]Absence check using state equation in 265 ms returned unsat
[2020-06-02 21:13:37] [INFO ] [Real]Absence check using 19 positive place invariants in 26 ms returned sat
[2020-06-02 21:13:37] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 2 ms returned unsat
[2020-06-02 21:13:37] [INFO ] [Real]Absence check using 19 positive place invariants in 40 ms returned sat
[2020-06-02 21:13:37] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 17 ms returned unsat
[2020-06-02 21:13:37] [INFO ] [Real]Absence check using 19 positive place invariants in 27 ms returned sat
[2020-06-02 21:13:37] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 46 ms returned sat
[2020-06-02 21:13:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:38] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2020-06-02 21:13:38] [INFO ] Computed and/alt/rep : 727/10383/727 causal constraints in 102 ms.
[2020-06-02 21:13:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:13:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 45 ms returned sat
[2020-06-02 21:13:39] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 43 ms returned sat
[2020-06-02 21:13:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:41] [INFO ] [Nat]Absence check using state equation in 2326 ms returned sat
[2020-06-02 21:13:41] [INFO ] Deduced a trap composed of 90 places in 315 ms
[2020-06-02 21:13:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 458 ms
[2020-06-02 21:13:42] [INFO ] Computed and/alt/rep : 727/10383/727 causal constraints in 100 ms.
[2020-06-02 21:13:44] [INFO ] Added : 135 causal constraints over 27 iterations in 2031 ms. Result :(error "Solver has unexpectedly terminated")
FORMULA ASLink-PT-01a-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01a-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 10 out of 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 425 transition count 696
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 70 place count 393 transition count 696
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 70 place count 393 transition count 667
Deduced a syphon composed of 29 places in 7 ms
Ensure Unique test removed 11 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 139 place count 353 transition count 667
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 353 transition count 666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 141 place count 352 transition count 666
Symmetric choice reduction at 4 with 4 rule applications. Total rules 145 place count 352 transition count 666
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 17 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 153 place count 348 transition count 649
Ensure Unique test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 7 rules applied. Total rules applied 160 place count 346 transition count 644
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 163 place count 343 transition count 644
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 343 transition count 644
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 166 place count 342 transition count 636
Symmetric choice reduction at 6 with 1 rule applications. Total rules 167 place count 342 transition count 636
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 169 place count 341 transition count 628
Symmetric choice reduction at 6 with 1 rule applications. Total rules 170 place count 341 transition count 628
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 172 place count 340 transition count 620
Symmetric choice reduction at 6 with 1 rule applications. Total rules 173 place count 340 transition count 620
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 175 place count 339 transition count 612
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 189 place count 332 transition count 605
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 191 place count 332 transition count 605
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 192 place count 332 transition count 605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 193 place count 331 transition count 604
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 195 place count 329 transition count 604
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 195 place count 329 transition count 601
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 7 rules applied. Total rules applied 202 place count 325 transition count 601
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 204 place count 323 transition count 601
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 204 place count 323 transition count 600
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 206 place count 322 transition count 600
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 212 place count 319 transition count 597
Symmetric choice reduction at 8 with 1 rule applications. Total rules 213 place count 319 transition count 597
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 215 place count 318 transition count 596
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 216 place count 318 transition count 595
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 217 place count 317 transition count 595
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 218 place count 317 transition count 595
Applied a total of 218 rules in 339 ms. Remains 317 /431 variables (removed 114) and now considering 595/728 (removed 133) transitions.
Finished structural reductions, in 1 iterations. Remains : 317/431 places, 595/728 transitions.
Incomplete random walk after 1000000 steps, including 21241 resets, run finished after 2928 ms. (steps per millisecond=341 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9398 resets, run finished after 1516 ms. (steps per millisecond=659 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9222 resets, run finished after 1635 ms. (steps per millisecond=611 ) properties seen :[0, 1]
FORMULA ASLink-PT-01a-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 595 rows 317 cols
[2020-06-02 21:13:50] [INFO ] Computed 56 place invariants in 22 ms
[2020-06-02 21:13:50] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2020-06-02 21:13:50] [INFO ] [Real]Absence check using 15 positive and 41 generalized place invariants in 20 ms returned sat
[2020-06-02 21:13:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:51] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2020-06-02 21:13:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:13:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 25 ms returned sat
[2020-06-02 21:13:51] [INFO ] [Nat]Absence check using 15 positive and 41 generalized place invariants in 22 ms returned sat
[2020-06-02 21:13:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:13:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:14:00] [INFO ] [Nat]Absence check using state equation in 9343 ms returned unknown
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 317/317 places, 595/595 transitions.
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 317 transition count 595
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 316 transition count 587
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 316 transition count 587
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 315 transition count 579
Applied a total of 6 rules in 34 ms. Remains 315 /317 variables (removed 2) and now considering 579/595 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 315/317 places, 579/595 transitions.
Incomplete random walk after 1000000 steps, including 21392 resets, run finished after 2754 ms. (steps per millisecond=363 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 9399 resets, run finished after 1443 ms. (steps per millisecond=693 ) properties seen :[0]
Interrupted probabilistic random walk after 7542733 steps, run timeout after 30001 ms. (steps per millisecond=251 ) properties seen :[0]
Probabilistic random walk after 7542733 steps, saw 1859370 distinct states, run finished after 30001 ms. (steps per millisecond=251 ) properties seen :[0]
// Phase 1: matrix 579 rows 315 cols
[2020-06-02 21:14:34] [INFO ] Computed 56 place invariants in 15 ms
[2020-06-02 21:14:34] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2020-06-02 21:14:34] [INFO ] [Real]Absence check using 15 positive and 41 generalized place invariants in 19 ms returned sat
[2020-06-02 21:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:14:35] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2020-06-02 21:14:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:14:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 28 ms returned sat
[2020-06-02 21:14:35] [INFO ] [Nat]Absence check using 15 positive and 41 generalized place invariants in 22 ms returned sat
[2020-06-02 21:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:14:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 21:14:44] [INFO ] [Nat]Absence check using state equation in 9314 ms returned unknown
Support contains 2 out of 315 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 315/315 places, 579/579 transitions.
Applied a total of 0 rules in 16 ms. Remains 315 /315 variables (removed 0) and now considering 579/579 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 315/315 places, 579/579 transitions.
Starting structural reductions, iteration 0 : 315/315 places, 579/579 transitions.
Applied a total of 0 rules in 15 ms. Remains 315 /315 variables (removed 0) and now considering 579/579 (removed 0) transitions.
// Phase 1: matrix 579 rows 315 cols
[2020-06-02 21:14:45] [INFO ] Computed 56 place invariants in 7 ms
[2020-06-02 21:14:45] [INFO ] Implicit Places using invariants in 715 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 140, 151, 152, 153, 181, 183, 186, 204, 205, 206, 207, 219, 225, 231, 237, 243, 249, 255, 261, 267, 273, 279]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 718 ms to find 30 implicit places.
[2020-06-02 21:14:45] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 579 rows 285 cols
[2020-06-02 21:14:45] [INFO ] Computed 26 place invariants in 7 ms
[2020-06-02 21:14:46] [INFO ] Dead Transitions using invariants and state equation in 974 ms returned []
Starting structural reductions, iteration 1 : 285/315 places, 579/579 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 285 transition count 532
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 238 transition count 532
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 94 place count 238 transition count 521
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 117 place count 226 transition count 521
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 129 place count 222 transition count 513
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 137 place count 214 transition count 513
Symmetric choice reduction at 4 with 15 rule applications. Total rules 152 place count 214 transition count 513
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 182 place count 199 transition count 498
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 185 place count 199 transition count 495
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 185 place count 199 transition count 494
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 198 transition count 494
Symmetric choice reduction at 5 with 3 rule applications. Total rules 190 place count 198 transition count 494
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 196 place count 195 transition count 491
Symmetric choice reduction at 5 with 1 rule applications. Total rules 197 place count 195 transition count 491
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 199 place count 194 transition count 490
Symmetric choice reduction at 5 with 1 rule applications. Total rules 200 place count 194 transition count 490
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 202 place count 193 transition count 489
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 238 place count 175 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 239 place count 175 transition count 470
Symmetric choice reduction at 6 with 1 rule applications. Total rules 240 place count 175 transition count 470
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 242 place count 174 transition count 469
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 243 place count 174 transition count 468
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 245 place count 174 transition count 466
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 248 place count 171 transition count 466
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 251 place count 171 transition count 466
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 252 place count 171 transition count 466
Applied a total of 252 rules in 78 ms. Remains 171 /285 variables (removed 114) and now considering 466/579 (removed 113) transitions.
// Phase 1: matrix 466 rows 171 cols
[2020-06-02 21:14:46] [INFO ] Computed 20 place invariants in 4 ms
[2020-06-02 21:14:47] [INFO ] Implicit Places using invariants in 307 ms returned [72, 89, 95, 98, 100]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 309 ms to find 5 implicit places.
Starting structural reductions, iteration 2 : 166/315 places, 466/579 transitions.
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 166 transition count 466
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 163 transition count 463
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 163 transition count 463
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 162 transition count 462
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 160 transition count 460
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 160 transition count 457
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 22 place count 157 transition count 457
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 157 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 156 transition count 456
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 156 transition count 456
Applied a total of 25 rules in 43 ms. Remains 156 /166 variables (removed 10) and now considering 456/466 (removed 10) transitions.
// Phase 1: matrix 456 rows 156 cols
[2020-06-02 21:14:47] [INFO ] Computed 15 place invariants in 10 ms
[2020-06-02 21:14:47] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 456 rows 156 cols
[2020-06-02 21:14:47] [INFO ] Computed 15 place invariants in 5 ms
[2020-06-02 21:14:48] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 156/315 places, 456/579 transitions.
Incomplete random walk after 1000000 steps, including 29216 resets, run finished after 2295 ms. (steps per millisecond=435 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 15370 resets, run finished after 1338 ms. (steps per millisecond=747 ) properties seen :[0]
Interrupted probabilistic random walk after 8576161 steps, run timeout after 30001 ms. (steps per millisecond=285 ) properties seen :[0]
Probabilistic random walk after 8576161 steps, saw 3007204 distinct states, run finished after 30001 ms. (steps per millisecond=285 ) properties seen :[0]
// Phase 1: matrix 456 rows 156 cols
[2020-06-02 21:15:22] [INFO ] Computed 15 place invariants in 4 ms
[2020-06-02 21:15:22] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2020-06-02 21:15:22] [INFO ] [Real]Absence check using 7 positive and 8 generalized place invariants in 4 ms returned sat
[2020-06-02 21:15:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 21:15:22] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2020-06-02 21:15:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 21:15:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2020-06-02 21:15:22] [INFO ] [Nat]Absence check using 7 positive and 8 generalized place invariants in 3 ms returned sat
[2020-06-02 21:15:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 21:15:22] [INFO ] [Nat]Absence check using state equation in 269 ms returned unsat
FORMULA ASLink-PT-01a-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
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="ASLink-PT-01a"
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 ASLink-PT-01a, 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 r166-smll-158987787100015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01a.tgz
mv ASLink-PT-01a 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 ;