About the Execution of ITS-Tools for DES-PT-20b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15743.240 | 133628.00 | 179812.00 | 345.70 | FTFFTFFFFTTFFTTF | normal |
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.r051-ebro-158902545900270.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 DES-PT-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902545900270
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 3.9K Mar 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 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 91K 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 DES-PT-20b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-20b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1589542836720
[2020-05-15 11:40:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-15 11:40:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 11:40:40] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2020-05-15 11:40:40] [INFO ] Transformed 360 places.
[2020-05-15 11:40:40] [INFO ] Transformed 311 transitions.
[2020-05-15 11:40:40] [INFO ] Found NUPN structural information;
[2020-05-15 11:40:40] [INFO ] Parsed PT model containing 360 places and 311 transitions in 234 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 56 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-20b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 84 resets, run finished after 112 ms. (steps per millisecond=89 ) properties seen :[1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1]
FORMULA DES-PT-20b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 311 rows 360 cols
[2020-05-15 11:40:41] [INFO ] Computed 65 place invariants in 54 ms
[2020-05-15 11:40:41] [INFO ] [Real]Absence check using 39 positive place invariants in 68 ms returned sat
[2020-05-15 11:40:41] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2020-05-15 11:40:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:40:42] [INFO ] [Real]Absence check using state equation in 845 ms returned sat
[2020-05-15 11:40:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:40:42] [INFO ] [Nat]Absence check using 39 positive place invariants in 82 ms returned sat
[2020-05-15 11:40:42] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 39 ms returned sat
[2020-05-15 11:40:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:40:43] [INFO ] [Nat]Absence check using state equation in 853 ms returned sat
[2020-05-15 11:40:43] [INFO ] Deduced a trap composed of 17 places in 250 ms
[2020-05-15 11:40:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2020-05-15 11:40:43] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 42 ms.
[2020-05-15 11:40:47] [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 (=> (> t282 0) (and (or (and (> t58 0) (< o58 o282)) (and (> t59 0) (< o59 o282))) (and (> t47 0) (< o47 o282))))") while checking expression at index 0
[2020-05-15 11:40:47] [INFO ] [Real]Absence check using 39 positive place invariants in 45 ms returned sat
[2020-05-15 11:40:47] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 51 ms returned sat
[2020-05-15 11:40:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:40:48] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2020-05-15 11:40:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:40:48] [INFO ] [Nat]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-05-15 11:40:48] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 52 ms returned sat
[2020-05-15 11:40:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:40:49] [INFO ] [Nat]Absence check using state equation in 952 ms returned sat
[2020-05-15 11:40:49] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 40 ms.
[2020-05-15 11:40:53] [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 (=> (> t310 0) (and (or (and (> t154 0) (< o154 o310)) (and (> t162 0) (< o162 o310)) (and (> t164 0) (< o164 o310)) (and (> t166 0) (< o166 o310))) (or (and (> t154 0) (< o154 o310)) (and (> t156 0) (< o156 o310)) (and (> t158 0) (< o158 o310)) (and (> t160 0) (< o160 o310))) (or (and (> t139 0) (< o139 o310)) (and (> t144 0) (< o144 o310)) (and (> t146 0) (< o146 o310)) (and (> t149 0) (< o149 o310)) (and (> t151 0) (< o151 o310)) (and (> t153 0) (< o153 o310))) (or (and (> t131 0) (< o131 o310)) (and (> t133 0) (< o133 o310)) (and (> t135 0) (< o135 o310)) (and (> t137 0) (< o137 o310))) (or (and (> t124 0) (< o124 o310)) (and (> t126 0) (< o126 o310)) (and (> t128 0) (< o128 o310)) (and (> t130 0) (< o130 o310))) (or (and (> t121 0) (< o121 o310)) (and (> t123 0) (< o123 o310)))))") while checking expression at index 1
[2020-05-15 11:40:53] [INFO ] [Real]Absence check using 39 positive place invariants in 45 ms returned sat
[2020-05-15 11:40:53] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 33 ms returned sat
[2020-05-15 11:40:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:40:54] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2020-05-15 11:40:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:40:54] [INFO ] [Nat]Absence check using 39 positive place invariants in 53 ms returned sat
[2020-05-15 11:40:54] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 44 ms returned sat
[2020-05-15 11:40:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:40:55] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2020-05-15 11:40:55] [INFO ] Deduced a trap composed of 10 places in 213 ms
[2020-05-15 11:40:55] [INFO ] Deduced a trap composed of 49 places in 172 ms
[2020-05-15 11:40:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 514 ms
[2020-05-15 11:40:55] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 66 ms.
[2020-05-15 11:40:59] [INFO ] Added : 265 causal constraints over 53 iterations in 3544 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-15 11:40:59] [INFO ] [Real]Absence check using 39 positive place invariants in 42 ms returned sat
[2020-05-15 11:40:59] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 45 ms returned sat
[2020-05-15 11:40:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:41:00] [INFO ] [Real]Absence check using state equation in 736 ms returned sat
[2020-05-15 11:41:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:41:00] [INFO ] [Nat]Absence check using 39 positive place invariants in 92 ms returned sat
[2020-05-15 11:41:00] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 82 ms returned sat
[2020-05-15 11:41:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:41:01] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2020-05-15 11:41:01] [INFO ] Deduced a trap composed of 8 places in 228 ms
[2020-05-15 11:41:02] [INFO ] Deduced a trap composed of 20 places in 214 ms
[2020-05-15 11:41:02] [INFO ] Deduced a trap composed of 37 places in 200 ms
[2020-05-15 11:41:02] [INFO ] Deduced a trap composed of 16 places in 195 ms
[2020-05-15 11:41:02] [INFO ] Deduced a trap composed of 42 places in 206 ms
[2020-05-15 11:41:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1294 ms
[2020-05-15 11:41:02] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 41 ms.
[2020-05-15 11:41:05] [INFO ] Added : 195 causal constraints over 39 iterations in 2570 ms. Result :unknown
[2020-05-15 11:41:05] [INFO ] [Real]Absence check using 39 positive place invariants in 84 ms returned sat
[2020-05-15 11:41:05] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 102 ms returned sat
[2020-05-15 11:41:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:41:07] [INFO ] [Real]Absence check using state equation in 1083 ms returned sat
[2020-05-15 11:41:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:41:07] [INFO ] [Nat]Absence check using 39 positive place invariants in 77 ms returned sat
[2020-05-15 11:41:07] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 45 ms returned sat
[2020-05-15 11:41:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:41:08] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2020-05-15 11:41:08] [INFO ] Deduced a trap composed of 22 places in 310 ms
[2020-05-15 11:41:08] [INFO ] Deduced a trap composed of 57 places in 176 ms
[2020-05-15 11:41:08] [INFO ] Deduced a trap composed of 62 places in 199 ms
[2020-05-15 11:41:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 882 ms
[2020-05-15 11:41:09] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 32 ms.
[2020-05-15 11:41:12] [INFO ] Added : 250 causal constraints over 50 iterations in 3113 ms. Result :(error "Failed to check-sat")
Incomplete Parikh walk after 78600 steps, including 1351 resets, run finished after 394 ms. (steps per millisecond=199 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 19 out of 360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 360/360 places, 311/311 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 741 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.13 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 349 transition count 287
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 332 transition count 287
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 37 place count 332 transition count 281
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 49 place count 326 transition count 281
Symmetric choice reduction at 2 with 16 rule applications. Total rules 65 place count 326 transition count 281
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 16 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 97 place count 310 transition count 265
Symmetric choice reduction at 2 with 14 rule applications. Total rules 111 place count 310 transition count 265
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 139 place count 296 transition count 251
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 152 place count 296 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 295 transition count 238
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 153 place count 295 transition count 236
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 157 place count 293 transition count 236
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 301 place count 221 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 302 place count 221 transition count 163
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 306 place count 219 transition count 168
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 307 place count 219 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 308 place count 218 transition count 167
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 310 place count 218 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 311 place count 217 transition count 166
Applied a total of 311 rules in 259 ms. Remains 217 /360 variables (removed 143) and now considering 166/311 (removed 145) transitions.
Finished structural reductions, in 1 iterations. Remains : 217/360 places, 166/311 transitions.
Incomplete random walk after 1000000 steps, including 27300 resets, run finished after 4250 ms. (steps per millisecond=235 ) properties seen :[0, 0, 1, 0, 0]
FORMULA DES-PT-20b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5285 resets, run finished after 2124 ms. (steps per millisecond=470 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5335 resets, run finished after 2401 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5044 resets, run finished after 2120 ms. (steps per millisecond=471 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 5475 resets, run finished after 1962 ms. (steps per millisecond=509 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 166 rows 217 cols
[2020-05-15 11:41:25] [INFO ] Computed 61 place invariants in 8 ms
[2020-05-15 11:41:25] [INFO ] [Real]Absence check using 37 positive place invariants in 38 ms returned sat
[2020-05-15 11:41:25] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 32 ms returned sat
[2020-05-15 11:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:41:26] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2020-05-15 11:41:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:41:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 38 ms returned sat
[2020-05-15 11:41:26] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 70 ms returned sat
[2020-05-15 11:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:41:26] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2020-05-15 11:41:26] [INFO ] State equation strengthened by 9 read => feed constraints.
[2020-05-15 11:41:26] [INFO ] [Nat]Added 9 Read/Feed constraints in 49 ms returned sat
[2020-05-15 11:41:26] [INFO ] Computed and/alt/rep : 162/746/162 causal constraints in 34 ms.
[2020-05-15 11:41:28] [INFO ] Added : 149 causal constraints over 30 iterations in 1716 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-05-15 11:41:28] [INFO ] [Real]Absence check using 37 positive place invariants in 38 ms returned sat
[2020-05-15 11:41:28] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 29 ms returned sat
[2020-05-15 11:41:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:41:29] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2020-05-15 11:41:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:41:29] [INFO ] [Nat]Absence check using 37 positive place invariants in 33 ms returned sat
[2020-05-15 11:41:29] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 88 ms returned sat
[2020-05-15 11:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:41:29] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2020-05-15 11:41:29] [INFO ] [Nat]Added 9 Read/Feed constraints in 38 ms returned sat
[2020-05-15 11:41:29] [INFO ] Computed and/alt/rep : 162/746/162 causal constraints in 37 ms.
[2020-05-15 11:41:31] [INFO ] Added : 143 causal constraints over 30 iterations in 1502 ms. Result :sat
[2020-05-15 11:41:31] [INFO ] Deduced a trap composed of 18 places in 282 ms
[2020-05-15 11:41:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-05-15 11:41:31] [INFO ] [Real]Absence check using 37 positive place invariants in 28 ms returned sat
[2020-05-15 11:41:31] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 30 ms returned sat
[2020-05-15 11:41:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:41:32] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2020-05-15 11:41:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:41:32] [INFO ] [Nat]Absence check using 37 positive place invariants in 30 ms returned sat
[2020-05-15 11:41:32] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 56 ms returned sat
[2020-05-15 11:41:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:41:32] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2020-05-15 11:41:32] [INFO ] [Nat]Added 9 Read/Feed constraints in 33 ms returned sat
[2020-05-15 11:41:32] [INFO ] Deduced a trap composed of 5 places in 74 ms
[2020-05-15 11:41:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2020-05-15 11:41:32] [INFO ] Computed and/alt/rep : 162/746/162 causal constraints in 22 ms.
[2020-05-15 11:41:33] [INFO ] Added : 40 causal constraints over 8 iterations in 278 ms. Result :unsat
[2020-05-15 11:41:33] [INFO ] [Real]Absence check using 37 positive place invariants in 26 ms returned sat
[2020-05-15 11:41:33] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 19 ms returned sat
[2020-05-15 11:41:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:41:33] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2020-05-15 11:41:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:41:33] [INFO ] [Nat]Absence check using 37 positive place invariants in 39 ms returned sat
[2020-05-15 11:41:33] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 70 ms returned sat
[2020-05-15 11:41:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:41:34] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2020-05-15 11:41:34] [INFO ] [Nat]Added 9 Read/Feed constraints in 8 ms returned sat
[2020-05-15 11:41:34] [INFO ] Computed and/alt/rep : 162/746/162 causal constraints in 24 ms.
[2020-05-15 11:41:35] [INFO ] Added : 136 causal constraints over 28 iterations in 1193 ms. Result :sat
[2020-05-15 11:41:35] [INFO ] Deduced a trap composed of 20 places in 118 ms
[2020-05-15 11:41:35] [INFO ] Deduced a trap composed of 24 places in 81 ms
[2020-05-15 11:41:35] [INFO ] Deduced a trap composed of 24 places in 81 ms
[2020-05-15 11:41:35] [INFO ] Deduced a trap composed of 23 places in 85 ms
[2020-05-15 11:41:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 549 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
FORMULA DES-PT-20b-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 97900 steps, including 3263 resets, run finished after 459 ms. (steps per millisecond=213 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 40400 steps, including 1359 resets, run finished after 198 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 129100 steps, including 4282 resets, run finished after 625 ms. (steps per millisecond=206 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 9 out of 217 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 217/217 places, 166/166 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 217 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 216 transition count 165
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 216 transition count 163
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 214 transition count 163
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 214 transition count 163
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 213 transition count 162
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 211 transition count 160
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 211 transition count 160
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 210 transition count 159
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 210 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 209 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 208 transition count 155
Applied a total of 23 rules in 98 ms. Remains 208 /217 variables (removed 9) and now considering 155/166 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/217 places, 155/166 transitions.
Incomplete random walk after 1000000 steps, including 34547 resets, run finished after 4280 ms. (steps per millisecond=233 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6745 resets, run finished after 2098 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7163 resets, run finished after 2059 ms. (steps per millisecond=485 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7140 resets, run finished after 1963 ms. (steps per millisecond=509 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 8515860 steps, run timeout after 30001 ms. (steps per millisecond=283 ) properties seen :[0, 0, 0]
Probabilistic random walk after 8515860 steps, saw 1025581 distinct states, run finished after 30001 ms. (steps per millisecond=283 ) properties seen :[0, 0, 0]
// Phase 1: matrix 155 rows 208 cols
[2020-05-15 11:42:17] [INFO ] Computed 61 place invariants in 15 ms
[2020-05-15 11:42:17] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-05-15 11:42:17] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 26 ms returned sat
[2020-05-15 11:42:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:18] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2020-05-15 11:42:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:42:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-05-15 11:42:18] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 65 ms returned sat
[2020-05-15 11:42:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:18] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2020-05-15 11:42:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-05-15 11:42:18] [INFO ] [Nat]Added 6 Read/Feed constraints in 17 ms returned sat
[2020-05-15 11:42:18] [INFO ] Computed and/alt/rep : 151/794/151 causal constraints in 24 ms.
[2020-05-15 11:42:19] [INFO ] Added : 104 causal constraints over 21 iterations in 1163 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-05-15 11:42:20] [INFO ] [Real]Absence check using 36 positive place invariants in 27 ms returned sat
[2020-05-15 11:42:20] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 24 ms returned sat
[2020-05-15 11:42:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:20] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2020-05-15 11:42:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:42:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 26 ms returned sat
[2020-05-15 11:42:20] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 89 ms returned sat
[2020-05-15 11:42:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:20] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2020-05-15 11:42:21] [INFO ] [Nat]Added 6 Read/Feed constraints in 50 ms returned sat
[2020-05-15 11:42:21] [INFO ] Deduced a trap composed of 3 places in 39 ms
[2020-05-15 11:42:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2020-05-15 11:42:21] [INFO ] Computed and/alt/rep : 151/794/151 causal constraints in 25 ms.
[2020-05-15 11:42:22] [INFO ] Added : 101 causal constraints over 21 iterations in 1122 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 47 ms.
[2020-05-15 11:42:22] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-05-15 11:42:22] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 76 ms returned sat
[2020-05-15 11:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:22] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2020-05-15 11:42:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:42:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 25 ms returned sat
[2020-05-15 11:42:22] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 64 ms returned sat
[2020-05-15 11:42:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:23] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2020-05-15 11:42:23] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2020-05-15 11:42:23] [INFO ] Computed and/alt/rep : 151/794/151 causal constraints in 27 ms.
[2020-05-15 11:42:24] [INFO ] Added : 126 causal constraints over 26 iterations in 1234 ms. Result :sat
[2020-05-15 11:42:24] [INFO ] Deduced a trap composed of 48 places in 130 ms
[2020-05-15 11:42:25] [INFO ] Deduced a trap composed of 19 places in 166 ms
[2020-05-15 11:42:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 436 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
Incomplete Parikh walk after 79300 steps, including 3331 resets, run finished after 409 ms. (steps per millisecond=193 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 48300 steps, including 1952 resets, run finished after 236 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 52700 steps, including 2121 resets, run finished after 252 ms. (steps per millisecond=209 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 9 out of 208 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 208/208 places, 155/155 transitions.
Applied a total of 0 rules in 22 ms. Remains 208 /208 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 155/155 transitions.
Starting structural reductions, iteration 0 : 208/208 places, 155/155 transitions.
Applied a total of 0 rules in 21 ms. Remains 208 /208 variables (removed 0) and now considering 155/155 (removed 0) transitions.
// Phase 1: matrix 155 rows 208 cols
[2020-05-15 11:42:26] [INFO ] Computed 61 place invariants in 8 ms
[2020-05-15 11:42:26] [INFO ] Implicit Places using invariants in 588 ms returned []
// Phase 1: matrix 155 rows 208 cols
[2020-05-15 11:42:26] [INFO ] Computed 61 place invariants in 8 ms
[2020-05-15 11:42:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-05-15 11:42:28] [INFO ] Implicit Places using invariants and state equation in 1726 ms returned []
Implicit Place search using SMT with State Equation took 2318 ms to find 0 implicit places.
[2020-05-15 11:42:28] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 155 rows 208 cols
[2020-05-15 11:42:28] [INFO ] Computed 61 place invariants in 5 ms
[2020-05-15 11:42:28] [INFO ] Dead Transitions using invariants and state equation in 485 ms returned []
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 155/155 transitions.
Incomplete random walk after 100000 steps, including 3423 resets, run finished after 471 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0]
// Phase 1: matrix 155 rows 208 cols
[2020-05-15 11:42:29] [INFO ] Computed 61 place invariants in 4 ms
[2020-05-15 11:42:29] [INFO ] [Real]Absence check using 36 positive place invariants in 25 ms returned sat
[2020-05-15 11:42:29] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 31 ms returned sat
[2020-05-15 11:42:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:29] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2020-05-15 11:42:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:42:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 27 ms returned sat
[2020-05-15 11:42:30] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 57 ms returned sat
[2020-05-15 11:42:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:30] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2020-05-15 11:42:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-05-15 11:42:30] [INFO ] [Nat]Added 6 Read/Feed constraints in 16 ms returned sat
[2020-05-15 11:42:30] [INFO ] Computed and/alt/rep : 151/794/151 causal constraints in 23 ms.
[2020-05-15 11:42:31] [INFO ] Added : 104 causal constraints over 21 iterations in 993 ms. Result :sat
[2020-05-15 11:42:31] [INFO ] [Real]Absence check using 36 positive place invariants in 55 ms returned sat
[2020-05-15 11:42:31] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 43 ms returned sat
[2020-05-15 11:42:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:32] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2020-05-15 11:42:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:42:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 26 ms returned sat
[2020-05-15 11:42:32] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 89 ms returned sat
[2020-05-15 11:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:32] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2020-05-15 11:42:32] [INFO ] [Nat]Added 6 Read/Feed constraints in 49 ms returned sat
[2020-05-15 11:42:32] [INFO ] Deduced a trap composed of 3 places in 24 ms
[2020-05-15 11:42:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2020-05-15 11:42:32] [INFO ] Computed and/alt/rep : 151/794/151 causal constraints in 22 ms.
[2020-05-15 11:42:33] [INFO ] Added : 101 causal constraints over 21 iterations in 1037 ms. Result :sat
[2020-05-15 11:42:34] [INFO ] [Real]Absence check using 36 positive place invariants in 24 ms returned sat
[2020-05-15 11:42:34] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 21 ms returned sat
[2020-05-15 11:42:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:34] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2020-05-15 11:42:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:42:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 60 ms returned sat
[2020-05-15 11:42:34] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 130 ms returned sat
[2020-05-15 11:42:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:35] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2020-05-15 11:42:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2020-05-15 11:42:35] [INFO ] Computed and/alt/rep : 151/794/151 causal constraints in 22 ms.
[2020-05-15 11:42:36] [INFO ] Added : 126 causal constraints over 26 iterations in 1139 ms. Result :sat
[2020-05-15 11:42:36] [INFO ] Deduced a trap composed of 48 places in 132 ms
[2020-05-15 11:42:37] [INFO ] Deduced a trap composed of 19 places in 169 ms
[2020-05-15 11:42:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 449 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 208 transition count 155
Applied a total of 1 rules in 35 ms. Remains 208 /208 variables (removed 0) and now considering 155/155 (removed 0) transitions.
// Phase 1: matrix 155 rows 208 cols
[2020-05-15 11:42:37] [INFO ] Computed 61 place invariants in 5 ms
[2020-05-15 11:42:37] [INFO ] [Real]Absence check using 36 positive place invariants in 72 ms returned sat
[2020-05-15 11:42:37] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 23 ms returned sat
[2020-05-15 11:42:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:37] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2020-05-15 11:42:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:42:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-05-15 11:42:37] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 67 ms returned sat
[2020-05-15 11:42:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:38] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2020-05-15 11:42:38] [INFO ] Computed and/alt/rep : 151/774/151 causal constraints in 24 ms.
[2020-05-15 11:42:39] [INFO ] Added : 136 causal constraints over 28 iterations in 1231 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-05-15 11:42:39] [INFO ] [Real]Absence check using 36 positive place invariants in 25 ms returned sat
[2020-05-15 11:42:39] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 25 ms returned sat
[2020-05-15 11:42:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:39] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2020-05-15 11:42:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:42:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-05-15 11:42:40] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 102 ms returned sat
[2020-05-15 11:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:40] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2020-05-15 11:42:40] [INFO ] Deduced a trap composed of 3 places in 51 ms
[2020-05-15 11:42:40] [INFO ] Deduced a trap composed of 5 places in 40 ms
[2020-05-15 11:42:40] [INFO ] Deduced a trap composed of 5 places in 37 ms
[2020-05-15 11:42:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 207 ms
[2020-05-15 11:42:40] [INFO ] Computed and/alt/rep : 151/774/151 causal constraints in 21 ms.
[2020-05-15 11:42:41] [INFO ] Added : 102 causal constraints over 21 iterations in 953 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-05-15 11:42:41] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-05-15 11:42:41] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 27 ms returned sat
[2020-05-15 11:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:42] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2020-05-15 11:42:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:42:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 30 ms returned sat
[2020-05-15 11:42:42] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 66 ms returned sat
[2020-05-15 11:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:42:42] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2020-05-15 11:42:42] [INFO ] Computed and/alt/rep : 151/774/151 causal constraints in 25 ms.
[2020-05-15 11:42:44] [INFO ] Added : 128 causal constraints over 26 iterations in 1488 ms. Result :sat
[2020-05-15 11:42:44] [INFO ] Deduced a trap composed of 19 places in 79 ms
[2020-05-15 11:42:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-05-15 11:42:45] [INFO ] Flatten gal took : 139 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 11:42:45] [INFO ] Flatten gal took : 54 ms
[2020-05-15 11:42:45] [INFO ] Applying decomposition
[2020-05-15 11:42:45] [INFO ] Flatten gal took : 47 ms
[2020-05-15 11:42:45] [INFO ] Input system was already deterministic with 155 transitions.
[2020-05-15 11:42:45] [INFO ] Input system was already deterministic with 155 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph1727208213896647512.txt, -o, /tmp/graph1727208213896647512.bin, -w, /tmp/graph1727208213896647512.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph1727208213896647512.bin, -l, -1, -v, -w, /tmp/graph1727208213896647512.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 11:42:45] [INFO ] Ran tautology test, simplified 0 / 3 in 357 ms.
[2020-05-15 11:42:45] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 155 rows 208 cols
[2020-05-15 11:42:45] [INFO ] BMC solution for property DES-PT-20b-ReachabilityCardinality-04(UNSAT) depth K=0 took 37 ms
[2020-05-15 11:42:45] [INFO ] Computed 61 place invariants in 5 ms
[2020-05-15 11:42:45] [INFO ] BMC solution for property DES-PT-20b-ReachabilityCardinality-05(UNSAT) depth K=0 took 8 ms
inv : p212 + p213 = 1
inv : p188 + p197 + p200 + p201 = 1
inv : p175 + p180 + p181 + p182 + p183 = 1
inv : -40*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 + 40*p26 + 2*p28 + 4*p29 + 6*p30 + 8*p31 + 10*p32 + 12*p33 + 14*p34 + 16*p35 + 18*p36 + 20*p37 + 22*p38 + 24*p39 + 26*p40 + 28*p41 + 30*p42 + 32*p43 + 34*p44 + 36*p45 + 38*p46 + p213 + p215 + p221 + p225 + p320 + p333 + p337 - p339 - p342 - p345 - p348 - 2*p352 - p357 - p359 = -3
inv : p315 + p317 = 1
inv : p91 + p92 + p110 + p112 + p125 = 1
inv : p257 + p267 + p269 = 1
inv : p175 + p180 + p181 + p184 + p185 = 1
inv : p155 + p156 + p157 + p165 = 1
inv : p239 - p253 + p263 - p284 - p296 + p310 = 0
inv : -20*p5 - p7 - 2*p8 - 3*p9 - 4*p10 - 5*p11 - 6*p12 - 7*p13 - 8*p14 - 9*p15 - 10*p16 - 11*p17 - 12*p18 - 13*p19 - 14*p20 - 15*p21 - 16*p22 - 17*p23 - 18*p24 - 19*p25 + 20*p26 + p28 + 2*p29 + 3*p30 + 4*p31 + 5*p32 + 6*p33 + 7*p34 + 8*p35 + 9*p36 + 10*p37 + 11*p38 + 12*p39 + 13*p40 + 14*p41 + 15*p42 + 16*p43 + 17*p44 + 18*p45 + 19*p46 + p134 - p142 + p213 - p318 - p334 - p338 - p342 - p345 - p348 - p352 - p359 = -2
inv : p276 + p278 = 1
inv : p297 + p298 + p313 + p314 = 1
inv : p91 + p92 + p103 + p106 = 1
inv : p257 + p270 + p272 = 1
inv : p307 + p308 + p313 + p314 = 1
inv : 40*p5 + 2*p7 + 4*p8 + 6*p9 + 8*p10 + 10*p11 + 12*p12 + 14*p13 + 16*p14 + 18*p15 + 20*p16 + 22*p17 + 24*p18 + 26*p19 + 28*p20 + 30*p21 + 32*p22 + 34*p23 + 36*p24 + 38*p25 - 40*p26 - 2*p28 - 4*p29 - 6*p30 - 8*p31 - 10*p32 - 12*p33 - 14*p34 - 16*p35 - 18*p36 - 20*p37 - 22*p38 - 24*p39 - 26*p40 - 28*p41 - 30*p42 - 32*p43 - 34*p44 - 36*p45 - 38*p46 - p213 - p215 - p221 - p225 + p318 + p321 + p324 + p327 + p334 + p338 + p339 + p342 + p345 + p348 + 2*p352 + p357 + p359 = 4
inv : p352 + p358 + p359 = 1
inv : p214 + p215 = 1
inv : p252 + p253 = 1
inv : p339 + p341 + p342 + p344 + p345 + p348 = 1
inv : p257 + p273 + p274 + p275 = 1
inv : p244 + p253 - p272 + p284 + p302 - p310 = 1
inv : -40*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 + 40*p26 + 2*p28 + 4*p29 + 6*p30 + 8*p31 + 10*p32 + 12*p33 + 14*p34 + 16*p35 + 18*p36 + 20*p37 + 22*p38 + 24*p39 + 26*p40 + 28*p41 + 30*p42 + 32*p43 + 34*p44 + 36*p45 + 38*p46 + p213 + p215 + p221 + p225 + p320 + p331 + p332 - p334 + p337 - p339 - p342 - p345 - p348 - 2*p352 - p357 - p359 = -3
inv : p248 + p253 - p278 + p284 + p306 - p310 = 1
inv : p91 + p92 + p96 + p99 = 1
inv : p303 + p304 + p313 + p314 = 1
inv : p221 + p224 + p225 = 1
inv : p240 + p253 - p266 + p284 + p298 - p310 = 1
inv : p301 + p302 + p313 + p314 = 1
inv : p241 - p253 + p266 - p284 - p298 + p310 = 0
inv : p279 + p281 = 1
inv : -20*p5 - p7 - 2*p8 - 3*p9 - 4*p10 - 5*p11 - 6*p12 - 7*p13 - 8*p14 - 9*p15 - 10*p16 - 11*p17 - 12*p18 - 13*p19 - 14*p20 - 15*p21 - 16*p22 - 17*p23 - 18*p24 - 19*p25 + 20*p26 + p28 + 2*p29 + 3*p30 + 4*p31 + 5*p32 + 6*p33 + 7*p34 + 8*p35 + 9*p36 + 10*p37 + 11*p38 + 12*p39 + 13*p40 + 14*p41 + 15*p42 + 16*p43 + 17*p44 + 18*p45 + 19*p46 + p213 + p221 + p223 + p253 + p284 - p310 - p313 + p317 + p320 + p331 + p335 - p352 - p357 = -2
inv : p178 + p179 - p180 - p181 = 0
inv : p249 - p253 + p278 - p284 - p306 + p310 = 0
inv : p335 + p336 - p337 - p338 = 0
inv : p299 + p300 + p313 + p314 = 1
inv : p242 + p253 - p269 + p284 + p300 - p310 = 1
inv : p250 + p253 - p281 + p284 + p308 - p310 = 1
inv : p247 - p253 + p275 - p284 - p304 + p310 = 0
inv : 20*p5 + p7 + 2*p8 + 3*p9 + 4*p10 + 5*p11 + 6*p12 + 7*p13 + 8*p14 + 9*p15 + 10*p16 + 11*p17 + 12*p18 + 13*p19 + 14*p20 + 15*p21 + 16*p22 + 17*p23 + 18*p24 + 19*p25 - 20*p26 - p28 - 2*p29 - 3*p30 - 4*p31 - 5*p32 - 6*p33 - 7*p34 - 8*p35 - 9*p36 - 10*p37 - 11*p38 - 12*p39 - 13*p40 - 14*p41 - 15*p42 - 16*p43 - 17*p44 - 18*p45 - 19*p46 + p91 + p92 + p127 + p142 - p213 + p318 + p334 + p338 + p342 + p345 + p348 + p352 + p359 = 3
inv : p257 + p261 + p263 = 1
inv : p282 + p284 = 1
inv : p311 + p312 - p313 - p314 = 0
inv : p238 + p253 - p263 + p284 + p296 - p310 = 1
inv : p245 - p253 + p272 - p284 - p302 + p310 = 0
[2020-05-15 11:42:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 11:42:45] [INFO ] BMC solution for property DES-PT-20b-ReachabilityCardinality-11(UNSAT) depth K=0 took 11 ms
inv : 20*p5 + p7 + 2*p8 + 3*p9 + 4*p10 + 5*p11 + 6*p12 + 7*p13 + 8*p14 + 9*p15 + 10*p16 + 11*p17 + 12*p18 + 13*p19 + 14*p20 + 15*p21 + 16*p22 + 17*p23 + 18*p24 + 19*p25 - 20*p26 - p28 - 2*p29 - 3*p30 - 4*p31 - 5*p32 - 6*p33 - 7*p34 - 8*p35 - 9*p36 - 10*p37 - 11*p38 - 12*p39 - 13*p40 - 14*p41 - 15*p42 - 16*p43 - 17*p44 - 18*p45 - 19*p46 - p213 + p222 - p253 - p284 + p310 + p313 - p317 - p320 - p331 - p335 + p352 + p357 = 3
inv : p150 + p152 = 1
inv : p309 + p310 + p313 + p314 = 1
inv : p188 + p197 + p202 + p203 = 1
inv : p295 + p296 + p313 + p314 = 1
inv : p352 + p356 + p357 = 1
inv : p257 + p264 + p266 = 1
inv : p243 - p253 + p269 - p284 - p300 + p310 = 0
inv : p91 + p144 + p145 + p146 = 1
inv : p91 + p92 + p135 + p142 = 1
inv : p204 + p206 = 1
inv : -40*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 + 20*p26 + p28 + 2*p29 + 3*p30 + 4*p31 + 5*p32 + 6*p33 + 7*p34 + 8*p35 + 9*p36 + 10*p37 + 11*p38 + 12*p39 + 13*p40 + 14*p41 + 15*p42 + 16*p43 + 17*p44 + 18*p45 + 19*p46 + 20*p68 + p70 + 2*p71 + 3*p72 + 4*p73 + 5*p74 + 6*p75 + 7*p76 + 8*p77 + 9*p78 + 10*p79 + 11*p80 + 12*p81 + 13*p82 + 14*p83 + 15*p84 + 16*p85 + 17*p86 + 18*p87 + 19*p88 + p125 + p142 - p152 - p180 - p183 - p188 - p197 - p203 + p213 + p215 + p221 + p225 - p312 + p314 + p317 + p320 + p331 + p335 - p339 - p352 - p357 = -2
inv : p251 - p253 + p281 - p284 - p308 + p310 = 0
inv : p305 + p306 + p313 + p314 = 1
inv : p246 + p253 - p275 + p284 + p304 - p310 = 1
Total of 61 invariants.
[2020-05-15 11:42:45] [INFO ] Computed 61 place invariants in 29 ms
[2020-05-15 11:42:45] [INFO ] BMC solution for property DES-PT-20b-ReachabilityCardinality-04(UNSAT) depth K=1 took 11 ms
[2020-05-15 11:42:45] [INFO ] BMC solution for property DES-PT-20b-ReachabilityCardinality-05(UNSAT) depth K=1 took 5 ms
[2020-05-15 11:42:45] [INFO ] BMC solution for property DES-PT-20b-ReachabilityCardinality-11(UNSAT) depth K=1 took 4 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 155 rows 208 cols
[2020-05-15 11:42:45] [INFO ] Computed 61 place invariants in 16 ms
inv : p212 + p213 = 1
inv : p188 + p197 + p200 + p201 = 1
inv : p175 + p180 + p181 + p182 + p183 = 1
inv : -40*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 + 40*p26 + 2*p28 + 4*p29 + 6*p30 + 8*p31 + 10*p32 + 12*p33 + 14*p34 + 16*p35 + 18*p36 + 20*p37 + 22*p38 + 24*p39 + 26*p40 + 28*p41 + 30*p42 + 32*p43 + 34*p44 + 36*p45 + 38*p46 + p213 + p215 + p221 + p225 + p320 + p333 + p337 - p339 - p342 - p345 - p348 - 2*p352 - p357 - p359 = -3
inv : p315 + p317 = 1
inv : p91 + p92 + p110 + p112 + p125 = 1
inv : p257 + p267 + p269 = 1
inv : p175 + p180 + p181 + p184 + p185 = 1
inv : p155 + p156 + p157 + p165 = 1
inv : p239 - p253 + p263 - p284 - p296 + p310 = 0
inv : -20*p5 - p7 - 2*p8 - 3*p9 - 4*p10 - 5*p11 - 6*p12 - 7*p13 - 8*p14 - 9*p15 - 10*p16 - 11*p17 - 12*p18 - 13*p19 - 14*p20 - 15*p21 - 16*p22 - 17*p23 - 18*p24 - 19*p25 + 20*p26 + p28 + 2*p29 + 3*p30 + 4*p31 + 5*p32 + 6*p33 + 7*p34 + 8*p35 + 9*p36 + 10*p37 + 11*p38 + 12*p39 + 13*p40 + 14*p41 + 15*p42 + 16*p43 + 17*p44 + 18*p45 + 19*p46 + p134 - p142 + p213 - p318 - p334 - p338 - p342 - p345 - p348 - p352 - p359 = -2
inv : p276 + p278 = 1
inv : p297 + p298 + p313 + p314 = 1
inv : p91 + p92 + p103 + p106 = 1
inv : p257 + p270 + p272 = 1
inv : p307 + p308 + p313 + p314 = 1
inv : 40*p5 + 2*p7 + 4*p8 + 6*p9 + 8*p10 + 10*p11 + 12*p12 + 14*p13 + 16*p14 + 18*p15 + 20*p16 + 22*p17 + 24*p18 + 26*p19 + 28*p20 + 30*p21 + 32*p22 + 34*p23 + 36*p24 + 38*p25 - 40*p26 - 2*p28 - 4*p29 - 6*p30 - 8*p31 - 10*p32 - 12*p33 - 14*p34 - 16*p35 - 18*p36 - 20*p37 - 22*p38 - 24*p39 - 26*p40 - 28*p41 - 30*p42 - 32*p43 - 34*p44 - 36*p45 - 38*p46 - p213 - p215 - p221 - p225 + p318 + p321 + p324 + p327 + p334 + p338 + p339 + p342 + p345 + p348 + 2*p352 + p357 + p359 = 4
inv : p352 + p358 + p359 = 1
inv : p214 + p215 = 1
inv : p252 + p253 = 1
inv : p339 + p341 + p342 + p344 + p345 + p348 = 1
inv : p257 + p273 + p274 + p275 = 1
inv : p244 + p253 - p272 + p284 + p302 - p310 = 1
inv : -40*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 + 40*p26 + 2*p28 + 4*p29 + 6*p30 + 8*p31 + 10*p32 + 12*p33 + 14*p34 + 16*p35 + 18*p36 + 20*p37 + 22*p38 + 24*p39 + 26*p40 + 28*p41 + 30*p42 + 32*p43 + 34*p44 + 36*p45 + 38*p46 + p213 + p215 + p221 + p225 + p320 + p331 + p332 - p334 + p337 - p339 - p342 - p345 - p348 - 2*p352 - p357 - p359 = -3
inv : p248 + p253 - p278 + p284 + p306 - p310 = 1
inv : p91 + p92 + p96 + p99 = 1
inv : p303 + p304 + p313 + p314 = 1
inv : p221 + p224 + p225 = 1
inv : p240 + p253 - p266 + p284 + p298 - p310 = 1
inv : p301 + p302 + p313 + p314 = 1
inv : p241 - p253 + p266 - p284 - p298 + p310 = 0
inv : p279 + p281 = 1
inv : -20*p5 - p7 - 2*p8 - 3*p9 - 4*p10 - 5*p11 - 6*p12 - 7*p13 - 8*p14 - 9*p15 - 10*p16 - 11*p17 - 12*p18 - 13*p19 - 14*p20 - 15*p21 - 16*p22 - 17*p23 - 18*p24 - 19*p25 + 20*p26 + p28 + 2*p29 + 3*p30 + 4*p31 + 5*p32 + 6*p33 + 7*p34 + 8*p35 + 9*p36 + 10*p37 + 11*p38 + 12*p39 + 13*p40 + 14*p41 + 15*p42 + 16*p43 + 17*p44 + 18*p45 + 19*p46 + p213 + p221 + p223 + p253 + p284 - p310 - p313 + p317 + p320 + p331 + p335 - p352 - p357 = -2
inv : p178 + p179 - p180 - p181 = 0
inv : p249 - p253 + p278 - p284 - p306 + p310 = 0
inv : p335 + p336 - p337 - p338 = 0
inv : p299 + p300 + p313 + p314 = 1
inv : p242 + p253 - p269 + p284 + p300 - p310 = 1
inv : p250 + p253 - p281 + p284 + p308 - p310 = 1
inv : p247 - p253 + p275 - p284 - p304 + p310 = 0
inv : 20*p5 + p7 + 2*p8 + 3*p9 + 4*p10 + 5*p11 + 6*p12 + 7*p13 + 8*p14 + 9*p15 + 10*p16 + 11*p17 + 12*p18 + 13*p19 + 14*p20 + 15*p21 + 16*p22 + 17*p23 + 18*p24 + 19*p25 - 20*p26 - p28 - 2*p29 - 3*p30 - 4*p31 - 5*p32 - 6*p33 - 7*p34 - 8*p35 - 9*p36 - 10*p37 - 11*p38 - 12*p39 - 13*p40 - 14*p41 - 15*p42 - 16*p43 - 17*p44 - 18*p45 - 19*p46 + p91 + p92 + p127 + p142 - p213 + p318 + p334 + p338 + p342 + p345 + p348 + p352 + p359 = 3
inv : p257 + p261 + p263 = 1
inv : p282 + p284 = 1
inv : p311 + p312 - p313 - p314 = 0
inv : p238 + p253 - p263 + p284 + p296 - p310 = 1
inv : p245 - p253 + p272 - p284 - p302 + p310 = 0
inv : 20*p5 + p7 + 2*p8 + 3*p9 + 4*p10 + 5*p11 + 6*p12 + 7*p13 + 8*p14 + 9*p15 + 10*p16 + 11*p17 + 12*p18 + 13*p19 + 14*p20 + 15*p21 + 16*p22 + 17*p23 + 18*p24 + 19*p25 - 20*p26 - p28 - 2*p29 - 3*p30 - 4*p31 - 5*p32 - 6*p33 - 7*p34 - 8*p35 - 9*p36 - 10*p37 - 11*p38 - 12*p39 - 13*p40 - 14*p41 - 15*p42 - 16*p43 - 17*p44 - 18*p45 - 19*p46 - p213 + p222 - p253 - p284 + p310 + p313 - p317 - p320 - p331 - p335 + p352 + p357 = 3
inv : p150 + p152 = 1
inv : p309 + p310 + p313 + p314 = 1
inv : p188 + p197 + p202 + p203 = 1
inv : p295 + p296 + p313 + p314 = 1
inv : p352 + p356 + p357 = 1
inv : p257 + p264 + p266 = 1
inv : p243 - p253 + p269 - p284 - p300 + p310 = 0
inv : p91 + p144 + p145 + p146 = 1
inv : p91 + p92 + p135 + p142 = 1
inv : p204 + p206 = 1
inv : -40*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 + 20*p26 + p28 + 2*p29 + 3*p30 + 4*p31 + 5*p32 + 6*p33 + 7*p34 + 8*p35 + 9*p36 + 10*p37 + 11*p38 + 12*p39 + 13*p40 + 14*p41 + 15*p42 + 16*p43 + 17*p44 + 18*p45 + 19*p46 + 20*p68 + p70 + 2*p71 + 3*p72 + 4*p73 + 5*p74 + 6*p75 + 7*p76 + 8*p77 + 9*p78 + 10*p79 + 11*p80 + 12*p81 + 13*p82 + 14*p83 + 15*p84 + 16*p85 + 17*p86 + 18*p87 + 19*p88 + p125 + p142 - p152 - p180 - p183 - p188 - p197 - p203 + p213 + p215 + p221 + p225 - p312 + p314 + p317 + p320 + p331 + p335 - p339 - p352 - p357 = -2
inv : p251 - p253 + p281 - p284 - p308 + p310 = 0
inv : p305 + p306 + p313 + p314 = 1
inv : p246 + p253 - p275 + p284 + p304 - p310 = 1
Total of 61 invariants.
[2020-05-15 11:42:45] [INFO ] Computed 61 place invariants in 24 ms
[2020-05-15 11:42:45] [INFO ] BMC solution for property DES-PT-20b-ReachabilityCardinality-04(UNSAT) depth K=2 took 121 ms
[2020-05-15 11:42:45] [INFO ] Removed a total of 67 redundant transitions.
[2020-05-15 11:42:46] [INFO ] BMC solution for property DES-PT-20b-ReachabilityCardinality-05(UNSAT) depth K=2 took 71 ms
[2020-05-15 11:42:46] [INFO ] Flatten gal took : 136 ms
[2020-05-15 11:42:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 24 ms.
[2020-05-15 11:42:46] [INFO ] BMC solution for property DES-PT-20b-ReachabilityCardinality-11(UNSAT) depth K=2 took 81 ms
[2020-05-15 11:42:46] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 20 ms
[2020-05-15 11:42:46] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : DES-PT-20b-ReachabilityCardinality-04 with value :(((i5.i1.u27.p273!=1)&&(u11.p59!=0))&&(i0.i0.u0.p92!=1))
Read [invariant] property : DES-PT-20b-ReachabilityCardinality-05 with value :(((u11.p60==0)||(i9.i0.u14.p223==1))||((i0.i2.u9.p175!=0)&&(i0.i0.u6.p144!=1)))
Read [invariant] property : DES-PT-20b-ReachabilityCardinality-11 with value :((u3.p80==0)||(i0.i1.u10.p197==1))
built 8 ordering constraints for composite.
built 16 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 3 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
[2020-05-15 11:42:46] [INFO ] BMC solution for property DES-PT-20b-ReachabilityCardinality-04(UNSAT) depth K=3 took 439 ms
SDD proceeding with computation, new max is 1024
[2020-05-15 11:42:46] [INFO ] Proved 208 variables to be positive in 1068 ms
[2020-05-15 11:42:47] [INFO ] Proved 208 variables to be positive in 1336 ms
[2020-05-15 11:42:47] [INFO ] Computing symmetric may disable matrix : 155 transitions.
[2020-05-15 11:42:47] [INFO ] Computation of disable matrix completed :0/155 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 11:42:47] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 11:42:47] [INFO ] Computing symmetric may enable matrix : 155 transitions.
Invariant property DES-PT-20b-ReachabilityCardinality-05 does not hold.
FORMULA DES-PT-20b-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-20b-ReachabilityCardinality-04 is true.
FORMULA DES-PT-20b-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 2048
[2020-05-15 11:42:47] [INFO ] Computation of Complete enable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 11:42:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-20b-ReachabilityCardinality-04
[2020-05-15 11:42:47] [INFO ] KInduction solution for property DES-PT-20b-ReachabilityCardinality-04(SAT) depth K=0 took 155 ms
[2020-05-15 11:42:47] [INFO ] BMC solution for property DES-PT-20b-ReachabilityCardinality-05(UNSAT) depth K=3 took 590 ms
[2020-05-15 11:42:47] [INFO ] Computing symmetric co enabling matrix : 155 transitions.
[2020-05-15 11:42:47] [INFO ] BMC solution for property DES-PT-20b-ReachabilityCardinality-11(UNSAT) depth K=3 took 482 ms
[2020-05-15 11:42:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-20b-ReachabilityCardinality-11
[2020-05-15 11:42:47] [INFO ] KInduction solution for property DES-PT-20b-ReachabilityCardinality-11(SAT) depth K=0 took 792 ms
[2020-05-15 11:42:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-20b-ReachabilityCardinality-11
[2020-05-15 11:42:48] [INFO ] KInduction solution for property DES-PT-20b-ReachabilityCardinality-11(SAT) depth K=1 took 68 ms
SDD proceeding with computation, new max is 4096
Invariant property DES-PT-20b-ReachabilityCardinality-11 does not hold.
FORMULA DES-PT-20b-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.73113e+13,3.46237,58212,3260,1060,107611,4431,376,240131,246,20694,0
Total reachable state count : 47311324046012
Verifying 3 reachability properties.
Reachability property DES-PT-20b-ReachabilityCardinality-04 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityCardinality-04,774144,3.47196,58476,71,105,107611,4431,391,240131,253,20694,123
Invariant property DES-PT-20b-ReachabilityCardinality-05 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityCardinality-05,9.82645e+08,3.49726,58476,441,214,107611,4431,412,240131,259,20694,1163
Invariant property DES-PT-20b-ReachabilityCardinality-11 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityCardinality-11,2.87451e+09,3.50996,58476,141,196,107611,4431,420,240131,263,20694,1791
[2020-05-15 11:42:49] [WARNING] Interrupting SMT solver.
[2020-05-15 11:42:49] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2020-05-15 11:42:49] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
SMT solver raised 'unknown', retrying with same input.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:492)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 11:42:49] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-20b-ReachabilityCardinality-11 SMT depth 4
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-15 11:42:49] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-20b-ReachabilityCardinality-11 K-induction depth 2
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:343)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 more
[2020-05-15 11:42:49] [INFO ] During BMC, SMT solver timed out at depth 4
[2020-05-15 11:42:49] [INFO ] BMC solving timed out (3600000 secs) at depth 4
[2020-05-15 11:42:49] [INFO ] SMT solved 0/ 3 properties. Interrupting SMT analysis.
[2020-05-15 11:42:50] [INFO ] Built C files in 4666ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1589542970348
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="DES-PT-20b"
export BK_EXAMINATION="ReachabilityCardinality"
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 DES-PT-20b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r051-ebro-158902545900270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;