Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033475600391.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 itstools
Input is ShieldIIPt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475600391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 3.0K May 14 01:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 01:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 18:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 18:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 08:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 08:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 1.7M May 12 20:42 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 ShieldIIPt-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590588881420

[2020-05-27 14:14:42] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 14:14:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 14:14:43] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2020-05-27 14:14:43] [INFO ] Transformed 7003 places.
[2020-05-27 14:14:43] [INFO ] Transformed 6503 transitions.
[2020-05-27 14:14:43] [INFO ] Found NUPN structural information;
[2020-05-27 14:14:43] [INFO ] Parsed PT model containing 7003 places and 6503 transitions in 504 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 531 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 240 ms. (steps per millisecond=41 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1]
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 62 ms. (steps per millisecond=161 ) properties seen :[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 50 ms. (steps per millisecond=200 ) properties seen :[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 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[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 29 ms. (steps per millisecond=344 ) properties seen :[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 25 ms. (steps per millisecond=400 ) properties seen :[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 32 ms. (steps per millisecond=312 ) properties seen :[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 25 ms. (steps per millisecond=400 ) properties seen :[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 24 ms. (steps per millisecond=416 ) properties seen :[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 23 ms. (steps per millisecond=434 ) properties seen :[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 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 6503 rows 7003 cols
[2020-05-27 14:14:44] [INFO ] Computed 901 place invariants in 150 ms
[2020-05-27 14:14:48] [INFO ] [Real]Absence check using 901 positive place invariants in 3045 ms returned sat
[2020-05-27 14:14:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:14:49] [INFO ] [Real]Absence check using state equation in 952 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 14:14:53] [INFO ] [Real]Absence check using 901 positive place invariants in 3054 ms returned sat
[2020-05-27 14:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:14:54] [INFO ] [Real]Absence check using state equation in 1034 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 14:14:58] [INFO ] [Real]Absence check using 901 positive place invariants in 2870 ms returned sat
[2020-05-27 14:14:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:14:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 14:14:59] [INFO ] [Real]Absence check using state equation in 1186 ms returned (error "Failed to check-sat")
[2020-05-27 14:15:03] [INFO ] [Real]Absence check using 901 positive place invariants in 2757 ms returned sat
[2020-05-27 14:15:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:15:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 14:15:04] [INFO ] [Real]Absence check using state equation in 1238 ms returned (error "Failed to check-sat")
[2020-05-27 14:15:08] [INFO ] [Real]Absence check using 901 positive place invariants in 2705 ms returned sat
[2020-05-27 14:15:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:15:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 14:15:09] [INFO ] [Real]Absence check using state equation in 1353 ms returned (error "Failed to check-sat")
[2020-05-27 14:15:13] [INFO ] [Real]Absence check using 901 positive place invariants in 3161 ms returned sat
[2020-05-27 14:15:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:15:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 14:15:14] [INFO ] [Real]Absence check using state equation in 925 ms returned (error "Failed to check-sat")
[2020-05-27 14:15:19] [INFO ] [Real]Absence check using 901 positive place invariants in 3365 ms returned sat
[2020-05-27 14:15:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:15:19] [INFO ] [Real]Absence check using state equation in 770 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 14:15:24] [INFO ] [Real]Absence check using 901 positive place invariants in 3826 ms returned sat
[2020-05-27 14:15:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:15:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (>= t661 0)") while checking expression at index 7
[2020-05-27 14:15:29] [INFO ] [Real]Absence check using 901 positive place invariants in 3238 ms returned sat
[2020-05-27 14:15:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:15:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 14:15:29] [INFO ] [Real]Absence check using state equation in 714 ms returned (error "Failed to check-sat")
[2020-05-27 14:15:33] [INFO ] [Real]Absence check using 901 positive place invariants in 3075 ms returned sat
[2020-05-27 14:15:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:15:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 14:15:34] [INFO ] [Real]Absence check using state equation in 1058 ms returned (error "Failed to check-sat")
[2020-05-27 14:15:38] [INFO ] [Real]Absence check using 901 positive place invariants in 3256 ms returned sat
[2020-05-27 14:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:15:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 14:15:39] [INFO ] [Real]Absence check using state equation in 949 ms returned (error "Failed to check-sat")
Support contains 66 out of 7003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Performed 1675 Post agglomeration using F-continuation condition.Transition count delta: 1675
Iterating post reduction 0 with 1675 rules applied. Total rules applied 1675 place count 7003 transition count 4828
Reduce places removed 1675 places and 0 transitions.
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 1 with 1677 rules applied. Total rules applied 3352 place count 5328 transition count 4826
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3353 place count 5327 transition count 4826
Performed 408 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 408 Pre rules applied. Total rules applied 3353 place count 5327 transition count 4418
Deduced a syphon composed of 408 places in 25 ms
Reduce places removed 408 places and 0 transitions.
Iterating global reduction 3 with 816 rules applied. Total rules applied 4169 place count 4919 transition count 4418
Symmetric choice reduction at 3 with 683 rule applications. Total rules 4852 place count 4919 transition count 4418
Deduced a syphon composed of 683 places in 84 ms
Reduce places removed 683 places and 683 transitions.
Iterating global reduction 3 with 1366 rules applied. Total rules applied 6218 place count 4236 transition count 3735
Performed 284 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 284 Pre rules applied. Total rules applied 6218 place count 4236 transition count 3451
Deduced a syphon composed of 284 places in 18 ms
Reduce places removed 284 places and 0 transitions.
Iterating global reduction 3 with 568 rules applied. Total rules applied 6786 place count 3952 transition count 3451
Performed 1662 Post agglomeration using F-continuation condition.Transition count delta: 1662
Deduced a syphon composed of 1662 places in 11 ms
Reduce places removed 1662 places and 0 transitions.
Iterating global reduction 3 with 3324 rules applied. Total rules applied 10110 place count 2290 transition count 1789
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10312 place count 2189 transition count 1850
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10514 place count 2088 transition count 1915
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 87 places in 6 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 10688 place count 2001 transition count 1968
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10689 place count 2001 transition count 1967
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 10692 place count 2001 transition count 1964
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 10695 place count 1998 transition count 1964
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 5 with 99 rules applied. Total rules applied 10794 place count 1998 transition count 1964
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10795 place count 1997 transition count 1963
Applied a total of 10795 rules in 3431 ms. Remains 1997 /7003 variables (removed 5006) and now considering 1963/6503 (removed 4540) transitions.
Finished structural reductions, in 1 iterations. Remains : 1997/7003 places, 1963/6503 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 12979 ms. (steps per millisecond=77 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 485546 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 430734 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=86 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 417322 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=83 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 484361 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 488793 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 534197 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=106 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 521950 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 502570 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 484971 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1963 rows 1997 cols
[2020-05-27 14:16:41] [INFO ] Computed 901 place invariants in 5 ms
[2020-05-27 14:16:42] [INFO ] [Real]Absence check using 901 positive place invariants in 895 ms returned sat
[2020-05-27 14:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:16:50] [INFO ] [Real]Absence check using state equation in 7707 ms returned sat
[2020-05-27 14:16:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:16:51] [INFO ] [Nat]Absence check using 901 positive place invariants in 797 ms returned sat
[2020-05-27 14:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:16:59] [INFO ] [Nat]Absence check using state equation in 7711 ms returned sat
[2020-05-27 14:16:59] [INFO ] State equation strengthened by 77 read => feed constraints.
[2020-05-27 14:16:59] [INFO ] [Nat]Added 77 Read/Feed constraints in 93 ms returned sat
[2020-05-27 14:16:59] [INFO ] Deduced a trap composed of 5 places in 126 ms
[2020-05-27 14:16:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2020-05-27 14:16:59] [INFO ] Computed and/alt/rep : 1936/4040/1936 causal constraints in 106 ms.
[2020-05-27 14:17:19] [INFO ] Added : 695 causal constraints over 139 iterations in 20136 ms.(timeout) Result :sat
[2020-05-27 14:17:19] [INFO ] Deduced a trap composed of 8 places in 126 ms
[2020-05-27 14:17:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 424 ms
Attempting to minimize the solution found.
Minimization took 93 ms.
[2020-05-27 14:17:21] [INFO ] [Real]Absence check using 901 positive place invariants in 1015 ms returned sat
[2020-05-27 14:17:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:17:29] [INFO ] [Real]Absence check using state equation in 8016 ms returned sat
[2020-05-27 14:17:29] [INFO ] [Real]Added 77 Read/Feed constraints in 32 ms returned sat
[2020-05-27 14:17:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:17:30] [INFO ] [Nat]Absence check using 901 positive place invariants in 782 ms returned sat
[2020-05-27 14:17:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:17:38] [INFO ] [Nat]Absence check using state equation in 8134 ms returned sat
[2020-05-27 14:17:38] [INFO ] [Nat]Added 77 Read/Feed constraints in 28 ms returned sat
[2020-05-27 14:17:39] [INFO ] Computed and/alt/rep : 1936/4040/1936 causal constraints in 100 ms.
[2020-05-27 14:17:59] [INFO ] Added : 585 causal constraints over 117 iterations in 20066 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 95 ms.
[2020-05-27 14:18:00] [INFO ] [Real]Absence check using 901 positive place invariants in 1028 ms returned sat
[2020-05-27 14:18:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:18:08] [INFO ] [Real]Absence check using state equation in 7974 ms returned sat
[2020-05-27 14:18:08] [INFO ] [Real]Added 77 Read/Feed constraints in 44 ms returned sat
[2020-05-27 14:18:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:18:09] [INFO ] [Nat]Absence check using 901 positive place invariants in 772 ms returned sat
[2020-05-27 14:18:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:18:17] [INFO ] [Nat]Absence check using state equation in 7924 ms returned sat
[2020-05-27 14:18:17] [INFO ] [Nat]Added 77 Read/Feed constraints in 41 ms returned sat
[2020-05-27 14:18:18] [INFO ] Computed and/alt/rep : 1936/4040/1936 causal constraints in 91 ms.
[2020-05-27 14:18:38] [INFO ] Added : 625 causal constraints over 125 iterations in 20185 ms.(timeout) Result :sat
[2020-05-27 14:18:38] [INFO ] Deduced a trap composed of 6 places in 122 ms
[2020-05-27 14:18:38] [INFO ] Deduced a trap composed of 5 places in 137 ms
[2020-05-27 14:18:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 692 ms
Attempting to minimize the solution found.
Minimization took 92 ms.
[2020-05-27 14:18:40] [INFO ] [Real]Absence check using 901 positive place invariants in 926 ms returned sat
[2020-05-27 14:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:18:48] [INFO ] [Real]Absence check using state equation in 7760 ms returned sat
[2020-05-27 14:18:48] [INFO ] [Real]Added 77 Read/Feed constraints in 57 ms returned sat
[2020-05-27 14:18:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:18:49] [INFO ] [Nat]Absence check using 901 positive place invariants in 915 ms returned sat
[2020-05-27 14:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:18:57] [INFO ] [Nat]Absence check using state equation in 8124 ms returned sat
[2020-05-27 14:18:57] [INFO ] [Nat]Added 77 Read/Feed constraints in 24 ms returned sat
[2020-05-27 14:18:57] [INFO ] Deduced a trap composed of 5 places in 147 ms
[2020-05-27 14:18:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2020-05-27 14:18:57] [INFO ] Computed and/alt/rep : 1936/4040/1936 causal constraints in 126 ms.
[2020-05-27 14:19:17] [INFO ] Added : 575 causal constraints over 115 iterations in 20087 ms.(timeout) Result :sat
[2020-05-27 14:19:18] [INFO ] Deduced a trap composed of 8 places in 147 ms
[2020-05-27 14:19:18] [INFO ] Deduced a trap composed of 5 places in 130 ms
[2020-05-27 14:19:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 689 ms
Attempting to minimize the solution found.
Minimization took 80 ms.
[2020-05-27 14:19:20] [INFO ] [Real]Absence check using 901 positive place invariants in 1055 ms returned sat
[2020-05-27 14:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:19:28] [INFO ] [Real]Absence check using state equation in 8084 ms returned sat
[2020-05-27 14:19:28] [INFO ] [Real]Added 77 Read/Feed constraints in 55 ms returned sat
[2020-05-27 14:19:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:19:29] [INFO ] [Nat]Absence check using 901 positive place invariants in 754 ms returned sat
[2020-05-27 14:19:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:19:37] [INFO ] [Nat]Absence check using state equation in 7711 ms returned sat
[2020-05-27 14:19:37] [INFO ] [Nat]Added 77 Read/Feed constraints in 35 ms returned sat
[2020-05-27 14:19:37] [INFO ] Computed and/alt/rep : 1936/4040/1936 causal constraints in 85 ms.
[2020-05-27 14:19:57] [INFO ] Added : 595 causal constraints over 119 iterations in 20223 ms.(timeout) Result :sat
[2020-05-27 14:19:57] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-05-27 14:19:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 343 ms
Attempting to minimize the solution found.
Minimization took 82 ms.
[2020-05-27 14:19:59] [INFO ] [Real]Absence check using 901 positive place invariants in 918 ms returned sat
[2020-05-27 14:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:20:06] [INFO ] [Real]Absence check using state equation in 7459 ms returned sat
[2020-05-27 14:20:06] [INFO ] [Real]Added 77 Read/Feed constraints in 55 ms returned sat
[2020-05-27 14:20:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:20:08] [INFO ] [Nat]Absence check using 901 positive place invariants in 939 ms returned sat
[2020-05-27 14:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:20:15] [INFO ] [Nat]Absence check using state equation in 7760 ms returned sat
[2020-05-27 14:20:15] [INFO ] [Nat]Added 77 Read/Feed constraints in 31 ms returned sat
[2020-05-27 14:20:16] [INFO ] Deduced a trap composed of 4 places in 172 ms
[2020-05-27 14:20:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2020-05-27 14:20:16] [INFO ] Computed and/alt/rep : 1936/4040/1936 causal constraints in 116 ms.
[2020-05-27 14:20:36] [INFO ] Added : 670 causal constraints over 134 iterations in 20087 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 81 ms.
[2020-05-27 14:20:37] [INFO ] [Real]Absence check using 901 positive place invariants in 955 ms returned sat
[2020-05-27 14:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:20:45] [INFO ] [Real]Absence check using state equation in 7779 ms returned sat
[2020-05-27 14:20:45] [INFO ] [Real]Added 77 Read/Feed constraints in 60 ms returned sat
[2020-05-27 14:20:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:20:47] [INFO ] [Nat]Absence check using 901 positive place invariants in 864 ms returned sat
[2020-05-27 14:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:20:55] [INFO ] [Nat]Absence check using state equation in 8413 ms returned sat
[2020-05-27 14:20:55] [INFO ] [Nat]Added 77 Read/Feed constraints in 40 ms returned sat
[2020-05-27 14:20:55] [INFO ] Computed and/alt/rep : 1936/4040/1936 causal constraints in 116 ms.
[2020-05-27 14:21:15] [INFO ] Added : 585 causal constraints over 117 iterations in 20061 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 63 ms.
[2020-05-27 14:21:17] [INFO ] [Real]Absence check using 901 positive place invariants in 944 ms returned sat
[2020-05-27 14:21:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:21:24] [INFO ] [Real]Absence check using state equation in 7797 ms returned sat
[2020-05-27 14:21:25] [INFO ] [Real]Added 77 Read/Feed constraints in 54 ms returned sat
[2020-05-27 14:21:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:21:26] [INFO ] [Nat]Absence check using 901 positive place invariants in 802 ms returned sat
[2020-05-27 14:21:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:21:33] [INFO ] [Nat]Absence check using state equation in 7767 ms returned sat
[2020-05-27 14:21:33] [INFO ] [Nat]Added 77 Read/Feed constraints in 39 ms returned sat
[2020-05-27 14:21:34] [INFO ] Computed and/alt/rep : 1936/4040/1936 causal constraints in 127 ms.
[2020-05-27 14:21:54] [INFO ] Added : 680 causal constraints over 136 iterations in 20246 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 70 ms.
Incomplete Parikh walk after 317900 steps, including 1000 resets, run finished after 4678 ms. (steps per millisecond=67 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 0] could not realise parikh vector
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 300200 steps, including 671 resets, run finished after 4435 ms. (steps per millisecond=67 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 303500 steps, including 953 resets, run finished after 4865 ms. (steps per millisecond=62 ) properties seen :[0, 0, 0, 1, 1, 0] could not realise parikh vector
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 296300 steps, including 641 resets, run finished after 4290 ms. (steps per millisecond=69 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 304500 steps, including 1000 resets, run finished after 4062 ms. (steps per millisecond=74 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 329500 steps, including 1000 resets, run finished after 4597 ms. (steps per millisecond=71 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 294400 steps, including 729 resets, run finished after 4311 ms. (steps per millisecond=68 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 298300 steps, including 1000 resets, run finished after 4215 ms. (steps per millisecond=70 ) properties seen :[0, 0, 0, 1] could not realise parikh vector
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 20 out of 1997 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1997/1997 places, 1963/1963 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1997 transition count 1955
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 1989 transition count 1955
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 16 place count 1989 transition count 1944
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 38 place count 1978 transition count 1944
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 88 place count 1953 transition count 1919
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 108 place count 1943 transition count 1929
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 1942 transition count 1928
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 1941 transition count 1927
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 1940 transition count 1926
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 1939 transition count 1925
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 1938 transition count 1924
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 1937 transition count 1923
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 1936 transition count 1922
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 1935 transition count 1921
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 1934 transition count 1920
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 1933 transition count 1919
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 1932 transition count 1918
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 1931 transition count 1917
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 1930 transition count 1916
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 1929 transition count 1915
Applied a total of 122 rules in 1037 ms. Remains 1929 /1997 variables (removed 68) and now considering 1915/1963 (removed 48) transitions.
Finished structural reductions, in 1 iterations. Remains : 1929/1997 places, 1915/1963 transitions.
Incomplete random walk after 1000000 steps, including 1 resets, run finished after 14234 ms. (steps per millisecond=70 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 464270 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 486313 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 499830 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 987929 steps, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen :[0, 0, 0]
Probabilistic random walk after 987929 steps, saw 161127 distinct states, run finished after 30001 ms. (steps per millisecond=32 ) properties seen :[0, 0, 0]
// Phase 1: matrix 1915 rows 1929 cols
[2020-05-27 14:23:30] [INFO ] Computed 901 place invariants in 6 ms
[2020-05-27 14:23:31] [INFO ] [Real]Absence check using 901 positive place invariants in 887 ms returned sat
[2020-05-27 14:23:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:23:38] [INFO ] [Real]Absence check using state equation in 6940 ms returned sat
[2020-05-27 14:23:38] [INFO ] State equation strengthened by 39 read => feed constraints.
[2020-05-27 14:23:38] [INFO ] [Real]Added 39 Read/Feed constraints in 31 ms returned sat
[2020-05-27 14:23:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:23:39] [INFO ] [Nat]Absence check using 901 positive place invariants in 800 ms returned sat
[2020-05-27 14:23:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:23:47] [INFO ] [Nat]Absence check using state equation in 7596 ms returned sat
[2020-05-27 14:23:47] [INFO ] [Nat]Added 39 Read/Feed constraints in 23 ms returned sat
[2020-05-27 14:23:47] [INFO ] Computed and/alt/rep : 1905/3676/1905 causal constraints in 108 ms.
[2020-05-27 14:24:07] [INFO ] Added : 755 causal constraints over 151 iterations in 20098 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 56 ms.
[2020-05-27 14:24:08] [INFO ] [Real]Absence check using 901 positive place invariants in 820 ms returned sat
[2020-05-27 14:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:24:15] [INFO ] [Real]Absence check using state equation in 7131 ms returned sat
[2020-05-27 14:24:15] [INFO ] [Real]Added 39 Read/Feed constraints in 51 ms returned sat
[2020-05-27 14:24:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:24:16] [INFO ] [Nat]Absence check using 901 positive place invariants in 777 ms returned sat
[2020-05-27 14:24:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:24:24] [INFO ] [Nat]Absence check using state equation in 7813 ms returned sat
[2020-05-27 14:24:24] [INFO ] [Nat]Added 39 Read/Feed constraints in 44 ms returned sat
[2020-05-27 14:24:24] [INFO ] Computed and/alt/rep : 1905/3676/1905 causal constraints in 111 ms.
[2020-05-27 14:24:44] [INFO ] Added : 660 causal constraints over 132 iterations in 20193 ms.(timeout) Result :sat
[2020-05-27 14:24:45] [INFO ] Deduced a trap composed of 6 places in 101 ms
[2020-05-27 14:24:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
Attempting to minimize the solution found.
Minimization took 96 ms.
[2020-05-27 14:24:46] [INFO ] [Real]Absence check using 901 positive place invariants in 745 ms returned sat
[2020-05-27 14:24:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:24:53] [INFO ] [Real]Absence check using state equation in 7412 ms returned sat
[2020-05-27 14:24:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:24:54] [INFO ] [Nat]Absence check using 901 positive place invariants in 686 ms returned sat
[2020-05-27 14:24:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:25:02] [INFO ] [Nat]Absence check using state equation in 7427 ms returned sat
[2020-05-27 14:25:02] [INFO ] [Nat]Added 39 Read/Feed constraints in 52 ms returned sat
[2020-05-27 14:25:02] [INFO ] Computed and/alt/rep : 1905/3676/1905 causal constraints in 102 ms.
[2020-05-27 14:25:22] [INFO ] Added : 620 causal constraints over 124 iterations in 20119 ms.(timeout) Result :sat
[2020-05-27 14:25:22] [INFO ] Deduced a trap composed of 6 places in 133 ms
[2020-05-27 14:25:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 446 ms
Attempting to minimize the solution found.
Minimization took 81 ms.
Incomplete Parikh walk after 273800 steps, including 1000 resets, run finished after 3595 ms. (steps per millisecond=76 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 316300 steps, including 1000 resets, run finished after 3803 ms. (steps per millisecond=83 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 255300 steps, including 1000 resets, run finished after 3849 ms. (steps per millisecond=66 ) properties seen :[1, 0] could not realise parikh vector
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 1929 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1929/1929 places, 1915/1915 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1929 transition count 1913
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1927 transition count 1913
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1927 transition count 1912
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1926 transition count 1912
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 1920 transition count 1906
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 1916 transition count 1908
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 1916 transition count 1907
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 1915 transition count 1907
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 1915 transition count 1907
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 1914 transition count 1906
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 1912 transition count 1906
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 32 place count 1912 transition count 1905
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 34 place count 1911 transition count 1905
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 1910 transition count 1904
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 36 place count 1909 transition count 1903
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 1908 transition count 1902
Applied a total of 37 rules in 640 ms. Remains 1908 /1929 variables (removed 21) and now considering 1902/1915 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 1908/1929 places, 1902/1915 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 13496 ms. (steps per millisecond=74 ) properties seen :[0]
Interrupted Best-First random walk after 482090 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen :[0]
Interrupted probabilistic random walk after 917274 steps, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen :[0]
Probabilistic random walk after 917274 steps, saw 148776 distinct states, run finished after 30001 ms. (steps per millisecond=30 ) properties seen :[0]
// Phase 1: matrix 1902 rows 1908 cols
[2020-05-27 14:26:23] [INFO ] Computed 899 place invariants in 5 ms
[2020-05-27 14:26:24] [INFO ] [Real]Absence check using 899 positive place invariants in 902 ms returned sat
[2020-05-27 14:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:26:31] [INFO ] [Real]Absence check using state equation in 7233 ms returned sat
[2020-05-27 14:26:32] [INFO ] State equation strengthened by 19 read => feed constraints.
[2020-05-27 14:26:32] [INFO ] [Real]Added 19 Read/Feed constraints in 23 ms returned sat
[2020-05-27 14:26:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:26:33] [INFO ] [Nat]Absence check using 899 positive place invariants in 833 ms returned sat
[2020-05-27 14:26:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:26:40] [INFO ] [Nat]Absence check using state equation in 7302 ms returned sat
[2020-05-27 14:26:40] [INFO ] [Nat]Added 19 Read/Feed constraints in 18 ms returned sat
[2020-05-27 14:26:40] [INFO ] Deduced a trap composed of 6 places in 155 ms
[2020-05-27 14:26:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2020-05-27 14:26:40] [INFO ] Computed and/alt/rep : 1893/3528/1893 causal constraints in 59 ms.
[2020-05-27 14:27:00] [INFO ] Added : 680 causal constraints over 136 iterations in 20098 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
Incomplete Parikh walk after 263000 steps, including 1000 resets, run finished after 4088 ms. (steps per millisecond=64 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 1908 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1908/1908 places, 1902/1902 transitions.
Applied a total of 0 rules in 46 ms. Remains 1908 /1908 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1908/1908 places, 1902/1902 transitions.
Starting structural reductions, iteration 0 : 1908/1908 places, 1902/1902 transitions.
Applied a total of 0 rules in 44 ms. Remains 1908 /1908 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
// Phase 1: matrix 1902 rows 1908 cols
[2020-05-27 14:27:05] [INFO ] Computed 899 place invariants in 11 ms
[2020-05-27 14:27:13] [INFO ] Implicit Places using invariants in 8540 ms returned [1897]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 8544 ms to find 1 implicit places.
[2020-05-27 14:27:14] [INFO ] Redundant transitions in 220 ms returned []
// Phase 1: matrix 1902 rows 1907 cols
[2020-05-27 14:27:14] [INFO ] Computed 898 place invariants in 6 ms
[2020-05-27 14:27:21] [INFO ] Dead Transitions using invariants and state equation in 7867 ms returned []
Starting structural reductions, iteration 1 : 1907/1908 places, 1902/1902 transitions.
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1907 transition count 1902
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 1906 transition count 1901
Applied a total of 3 rules in 99 ms. Remains 1906 /1907 variables (removed 1) and now considering 1901/1902 (removed 1) transitions.
// Phase 1: matrix 1901 rows 1906 cols
[2020-05-27 14:27:22] [INFO ] Computed 898 place invariants in 6 ms
[2020-05-27 14:27:30] [INFO ] Implicit Places using invariants in 8578 ms returned []
// Phase 1: matrix 1901 rows 1906 cols
[2020-05-27 14:27:30] [INFO ] Computed 898 place invariants in 12 ms
[2020-05-27 14:27:38] [INFO ] State equation strengthened by 18 read => feed constraints.
[2020-05-27 14:28:08] [INFO ] Performed 1850/1906 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-05-27 14:28:09] [INFO ] Implicit Places using invariants and state equation in 38975 ms returned []
Implicit Place search using SMT with State Equation took 47558 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1906/1908 places, 1901/1902 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 11692 ms. (steps per millisecond=85 ) properties seen :[0]
Interrupted Best-First random walk after 521819 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen :[0]
Interrupted probabilistic random walk after 1028589 steps, run timeout after 30001 ms. (steps per millisecond=34 ) properties seen :[0]
Probabilistic random walk after 1028589 steps, saw 166277 distinct states, run finished after 30002 ms. (steps per millisecond=34 ) properties seen :[0]
// Phase 1: matrix 1901 rows 1906 cols
[2020-05-27 14:28:56] [INFO ] Computed 898 place invariants in 5 ms
[2020-05-27 14:28:57] [INFO ] [Real]Absence check using 898 positive place invariants in 674 ms returned sat
[2020-05-27 14:28:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:29:03] [INFO ] [Real]Absence check using state equation in 6566 ms returned sat
[2020-05-27 14:29:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2020-05-27 14:29:03] [INFO ] [Real]Added 18 Read/Feed constraints in 46 ms returned sat
[2020-05-27 14:29:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:29:05] [INFO ] [Nat]Absence check using 898 positive place invariants in 889 ms returned sat
[2020-05-27 14:29:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:29:12] [INFO ] [Nat]Absence check using state equation in 7291 ms returned sat
[2020-05-27 14:29:12] [INFO ] [Nat]Added 18 Read/Feed constraints in 22 ms returned sat
[2020-05-27 14:29:12] [INFO ] Computed and/alt/rep : 1892/3522/1892 causal constraints in 127 ms.
[2020-05-27 14:29:32] [INFO ] Added : 895 causal constraints over 179 iterations in 20255 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 66 ms.
Incomplete Parikh walk after 272600 steps, including 1000 resets, run finished after 3466 ms. (steps per millisecond=78 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 1906 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1906/1906 places, 1901/1901 transitions.
Applied a total of 0 rules in 41 ms. Remains 1906 /1906 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1906/1906 places, 1901/1901 transitions.
Starting structural reductions, iteration 0 : 1906/1906 places, 1901/1901 transitions.
Applied a total of 0 rules in 36 ms. Remains 1906 /1906 variables (removed 0) and now considering 1901/1901 (removed 0) transitions.
// Phase 1: matrix 1901 rows 1906 cols
[2020-05-27 14:29:36] [INFO ] Computed 898 place invariants in 4 ms
[2020-05-27 14:29:45] [INFO ] Implicit Places using invariants in 8581 ms returned []
// Phase 1: matrix 1901 rows 1906 cols
[2020-05-27 14:29:45] [INFO ] Computed 898 place invariants in 10 ms
[2020-05-27 14:29:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2020-05-27 14:30:23] [INFO ] Performed 1774/1906 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-05-27 14:30:25] [INFO ] Implicit Places using invariants and state equation in 40391 ms returned []
Implicit Place search using SMT with State Equation took 48975 ms to find 0 implicit places.
[2020-05-27 14:30:25] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 1901 rows 1906 cols
[2020-05-27 14:30:25] [INFO ] Computed 898 place invariants in 5 ms
[2020-05-27 14:30:33] [INFO ] Dead Transitions using invariants and state equation in 7740 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1906/1906 places, 1901/1901 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1821 ms. (steps per millisecond=54 ) properties seen :[0]
// Phase 1: matrix 1901 rows 1906 cols
[2020-05-27 14:30:35] [INFO ] Computed 898 place invariants in 11 ms
[2020-05-27 14:30:36] [INFO ] [Real]Absence check using 898 positive place invariants in 1012 ms returned sat
[2020-05-27 14:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:30:43] [INFO ] [Real]Absence check using state equation in 7054 ms returned sat
[2020-05-27 14:30:43] [INFO ] State equation strengthened by 18 read => feed constraints.
[2020-05-27 14:30:43] [INFO ] [Real]Added 18 Read/Feed constraints in 42 ms returned sat
[2020-05-27 14:30:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:30:44] [INFO ] [Nat]Absence check using 898 positive place invariants in 759 ms returned sat
[2020-05-27 14:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:30:52] [INFO ] [Nat]Absence check using state equation in 7608 ms returned sat
[2020-05-27 14:30:52] [INFO ] [Nat]Added 18 Read/Feed constraints in 18 ms returned sat
[2020-05-27 14:30:52] [INFO ] Computed and/alt/rep : 1892/3522/1892 causal constraints in 99 ms.
[2020-05-27 14:31:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t515 0) (or (and (> t1542 0) (< o1542 o515)) (and (> t1544 0) (< o1544 o515)) (and (> t1546 0) (< o1546 o515)) (and (> t1548 0) (< o1548 o515))))") while checking expression at index 0
Partial Free-agglomeration rule applied 209 times.
Drop transitions removed 209 transitions
Iterating global reduction 0 with 209 rules applied. Total rules applied 209 place count 1906 transition count 1901
Partial Post-agglomeration rule applied 282 times.
Drop transitions removed 282 transitions
Iterating global reduction 0 with 282 rules applied. Total rules applied 491 place count 1906 transition count 1901
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 493 place count 1906 transition count 1899
Applied a total of 493 rules in 232 ms. Remains 1906 /1906 variables (removed 0) and now considering 1899/1901 (removed 2) transitions.
// Phase 1: matrix 1899 rows 1906 cols
[2020-05-27 14:31:03] [INFO ] Computed 898 place invariants in 11 ms
[2020-05-27 14:31:05] [INFO ] [Real]Absence check using 898 positive place invariants in 799 ms returned sat
[2020-05-27 14:31:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 14:31:11] [INFO ] [Real]Absence check using state equation in 6869 ms returned sat
[2020-05-27 14:31:12] [INFO ] State equation strengthened by 203 read => feed constraints.
[2020-05-27 14:31:12] [INFO ] [Real]Added 203 Read/Feed constraints in 54 ms returned sat
[2020-05-27 14:31:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 14:31:13] [INFO ] [Nat]Absence check using 898 positive place invariants in 879 ms returned sat
[2020-05-27 14:31:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 14:31:21] [INFO ] [Nat]Absence check using state equation in 7873 ms returned sat
[2020-05-27 14:31:21] [INFO ] [Nat]Added 203 Read/Feed constraints in 59 ms returned sat
[2020-05-27 14:31:21] [INFO ] Deduced a trap composed of 8 places in 28 ms
[2020-05-27 14:31:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2020-05-27 14:31:21] [INFO ] Computed and/alt/rep : 1890/4755/1890 causal constraints in 132 ms.
[2020-05-27 14:31:41] [INFO ] Added : 600 causal constraints over 120 iterations in 20120 ms.(timeout) Result :sat
[2020-05-27 14:31:41] [INFO ] Deduced a trap composed of 6 places in 40 ms
[2020-05-27 14:31:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
Attempting to minimize the solution found.
Minimization took 56 ms.
[2020-05-27 14:31:42] [INFO ] Flatten gal took : 288 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 14:31:43] [INFO ] Applying decomposition
[2020-05-27 14:31:43] [INFO ] Flatten gal took : 311 ms
[2020-05-27 14:31:43] [INFO ] Flatten gal took : 193 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ShieldIIPt-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPt-PT-100B, 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 r210-tajo-159033475600391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100B.tgz
mv ShieldIIPt-PT-100B 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 ;