About the Execution of ITS-Tools for ShieldPPPs-PT-010B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15740.740 | 1416513.00 | 4011059.00 | 3355.00 | FFFTFTTTFTTTTTTT | 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.r210-tajo-159033475800487.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 ShieldPPPs-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475800487
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 3.7K May 14 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 18:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 18:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 13:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 172K May 12 20:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1590595475011
[2020-05-27 16:04:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 16:04:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 16:04:38] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2020-05-27 16:04:38] [INFO ] Transformed 683 places.
[2020-05-27 16:04:38] [INFO ] Transformed 633 transitions.
[2020-05-27 16:04:38] [INFO ] Found NUPN structural information;
[2020-05-27 16:04:38] [INFO ] Parsed PT model containing 683 places and 633 transitions in 249 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 83 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 108 ms. (steps per millisecond=92 ) properties seen :[1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1]
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 633 rows 683 cols
[2020-05-27 16:04:39] [INFO ] Computed 111 place invariants in 47 ms
[2020-05-27 16:04:39] [INFO ] [Real]Absence check using 111 positive place invariants in 82 ms returned unsat
[2020-05-27 16:04:40] [INFO ] [Real]Absence check using 111 positive place invariants in 253 ms returned sat
[2020-05-27 16:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:04:42] [INFO ] [Real]Absence check using state equation in 2031 ms returned sat
[2020-05-27 16:04:43] [INFO ] Deduced a trap composed of 24 places in 1280 ms
[2020-05-27 16:04:44] [INFO ] Deduced a trap composed of 21 places in 386 ms
[2020-05-27 16:04:44] [INFO ] Deduced a trap composed of 20 places in 337 ms
[2020-05-27 16:04:46] [INFO ] Deduced a trap composed of 18 places in 1746 ms
[2020-05-27 16:04:46] [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 (> (+ s0 s616 s617 s634 s635 s636 s637 s638 s640 s641 s642 s643 s644 s645 s672 s680 s681 s682) 0)") while checking expression at index 1
[2020-05-27 16:04:46] [INFO ] [Real]Absence check using 111 positive place invariants in 162 ms returned sat
[2020-05-27 16:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:04:49] [INFO ] [Real]Absence check using state equation in 2350 ms returned sat
[2020-05-27 16:04:51] [INFO ] Deduced a trap composed of 20 places in 2834 ms
[2020-05-27 16:04:51] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s147 s148 s149 s150 s151 s152 s153 s154 s158 s190 s191 s192) 0)") while checking expression at index 2
[2020-05-27 16:04:52] [INFO ] [Real]Absence check using 111 positive place invariants in 99 ms returned sat
[2020-05-27 16:04:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:04:53] [INFO ] [Real]Absence check using state equation in 1779 ms returned sat
[2020-05-27 16:04:55] [INFO ] Deduced a trap composed of 15 places in 1971 ms
[2020-05-27 16:04:56] [INFO ] Deduced a trap composed of 21 places in 365 ms
[2020-05-27 16:04:57] [INFO ] Deduced a trap composed of 22 places in 701 ms
[2020-05-27 16:04:57] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s12 s21 s22 s23 s33 s36 s71 s72 s73 s74 s75) 0)") while checking expression at index 3
[2020-05-27 16:04:57] [INFO ] [Real]Absence check using 111 positive place invariants in 158 ms returned sat
[2020-05-27 16:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:05:00] [INFO ] [Real]Absence check using state equation in 3149 ms returned sat
[2020-05-27 16:05:01] [INFO ] Deduced a trap composed of 17 places in 504 ms
[2020-05-27 16:05:05] [INFO ] Deduced a trap composed of 23 places in 3888 ms
[2020-05-27 16:05:05] [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 (> (+ s0 s1 s515 s516 s517 s518 s519 s520 s521 s522 s549 s550 s567 s568 s573 s605 s606 s607 s608 s612 s613 s614 s615) 0)") while checking expression at index 4
[2020-05-27 16:05:05] [INFO ] [Real]Absence check using 111 positive place invariants in 104 ms returned sat
[2020-05-27 16:05:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:05:07] [INFO ] [Real]Absence check using state equation in 1838 ms returned sat
[2020-05-27 16:05:07] [INFO ] Deduced a trap composed of 22 places in 534 ms
[2020-05-27 16:05:09] [INFO ] Deduced a trap composed of 18 places in 1477 ms
[2020-05-27 16:05:09] [INFO ] Deduced a trap composed of 19 places in 328 ms
[2020-05-27 16:05:17] [INFO ] Deduced a trap composed of 31 places in 7376 ms
[2020-05-27 16:05:17] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s105 s106 s107 s110 s111 s174 s177 s195 s196 s198 s199 s214 s215 s216 s217 s218 s219 s239 s241 s244 s262 s263 s265 s266) 0)") while checking expression at index 5
[2020-05-27 16:05:17] [INFO ] [Real]Absence check using 111 positive place invariants in 638 ms returned sat
[2020-05-27 16:05:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:05:20] [INFO ] [Real]Absence check using state equation in 2305 ms returned sat
[2020-05-27 16:05:20] [INFO ] Deduced a trap composed of 17 places in 392 ms
[2020-05-27 16:05:21] [INFO ] Deduced a trap composed of 17 places in 936 ms
[2020-05-27 16:05:23] [INFO ] Deduced a trap composed of 36 places in 1748 ms
[2020-05-27 16:05:23] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s24 s25 s26 s27 s28 s46 s47 s51 s52 s53 s80 s81 s82 s83 s84 s91 s92 s93 s94 s95 s98 s99 s102 s112 s119 s120 s121) 0)") while checking expression at index 6
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 39 out of 683 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 683/683 places, 633/633 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 683 transition count 564
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 614 transition count 564
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 138 place count 614 transition count 515
Deduced a syphon composed of 49 places in 19 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 236 place count 565 transition count 515
Symmetric choice reduction at 2 with 62 rule applications. Total rules 298 place count 565 transition count 515
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 62 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 422 place count 503 transition count 453
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 422 place count 503 transition count 430
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 468 place count 480 transition count 430
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 1 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 752 place count 338 transition count 288
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 830 place count 338 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 831 place count 337 transition count 287
Applied a total of 831 rules in 298 ms. Remains 337 /683 variables (removed 346) and now considering 287/633 (removed 346) transitions.
Finished structural reductions, in 1 iterations. Remains : 337/683 places, 287/633 transitions.
Incomplete random walk after 1000000 steps, including 599 resets, run finished after 4197 ms. (steps per millisecond=238 ) properties seen :[1, 1, 0, 0, 1, 0]
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 64 resets, run finished after 1809 ms. (steps per millisecond=552 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 64 resets, run finished after 1693 ms. (steps per millisecond=590 ) properties seen :[0, 1, 0]
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 55 resets, run finished after 1944 ms. (steps per millisecond=514 ) properties seen :[0, 0]
// Phase 1: matrix 287 rows 337 cols
[2020-05-27 16:05:33] [INFO ] Computed 111 place invariants in 25 ms
[2020-05-27 16:05:33] [INFO ] [Real]Absence check using 107 positive place invariants in 55 ms returned sat
[2020-05-27 16:05:33] [INFO ] [Real]Absence check using 107 positive and 4 generalized place invariants in 12 ms returned sat
[2020-05-27 16:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:05:33] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2020-05-27 16:05:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 16:05:34] [INFO ] [Nat]Absence check using 107 positive place invariants in 52 ms returned sat
[2020-05-27 16:05:34] [INFO ] [Nat]Absence check using 107 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-27 16:05:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 16:05:34] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2020-05-27 16:05:34] [INFO ] Deduced a trap composed of 4 places in 279 ms
[2020-05-27 16:05:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 324 ms
[2020-05-27 16:05:35] [INFO ] [Real]Absence check using 107 positive place invariants in 301 ms returned sat
[2020-05-27 16:05:35] [INFO ] [Real]Absence check using 107 positive and 4 generalized place invariants in 23 ms returned sat
[2020-05-27 16:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:05:35] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2020-05-27 16:05:36] [INFO ] Deduced a trap composed of 6 places in 813 ms
[2020-05-27 16:05:38] [INFO ] Deduced a trap composed of 9 places in 1807 ms
[2020-05-27 16:05:39] [INFO ] Deduced a trap composed of 7 places in 797 ms
[2020-05-27 16:05:39] [INFO ] Deduced a trap composed of 7 places in 148 ms
[2020-05-27 16:05:39] [INFO ] Deduced a trap composed of 8 places in 113 ms
[2020-05-27 16:05:39] [INFO ] Deduced a trap composed of 7 places in 125 ms
[2020-05-27 16:05:39] [INFO ] Deduced a trap composed of 10 places in 88 ms
[2020-05-27 16:05:39] [INFO ] Deduced a trap composed of 17 places in 85 ms
[2020-05-27 16:05:40] [INFO ] Deduced a trap composed of 16 places in 169 ms
[2020-05-27 16:05:40] [INFO ] Deduced a trap composed of 17 places in 63 ms
[2020-05-27 16:05:42] [INFO ] Deduced a trap composed of 5 places in 1999 ms
[2020-05-27 16:05:42] [INFO ] Deduced a trap composed of 5 places in 258 ms
[2020-05-27 16:05:42] [INFO ] Deduced a trap composed of 9 places in 80 ms
[2020-05-27 16:05:42] [INFO ] Deduced a trap composed of 7 places in 86 ms
[2020-05-27 16:05:42] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6926 ms
[2020-05-27 16:05:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 16:05:42] [INFO ] [Nat]Absence check using 107 positive place invariants in 53 ms returned sat
[2020-05-27 16:05:42] [INFO ] [Nat]Absence check using 107 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-27 16:05:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 16:05:43] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2020-05-27 16:05:43] [INFO ] Deduced a trap composed of 6 places in 154 ms
[2020-05-27 16:05:43] [INFO ] Deduced a trap composed of 9 places in 89 ms
[2020-05-27 16:05:43] [INFO ] Deduced a trap composed of 7 places in 78 ms
[2020-05-27 16:05:43] [INFO ] Deduced a trap composed of 7 places in 67 ms
[2020-05-27 16:05:43] [INFO ] Deduced a trap composed of 7 places in 78 ms
[2020-05-27 16:05:43] [INFO ] Deduced a trap composed of 7 places in 73 ms
[2020-05-27 16:05:43] [INFO ] Deduced a trap composed of 5 places in 85 ms
[2020-05-27 16:05:43] [INFO ] Deduced a trap composed of 10 places in 101 ms
[2020-05-27 16:05:44] [INFO ] Deduced a trap composed of 16 places in 273 ms
[2020-05-27 16:05:44] [INFO ] Deduced a trap composed of 18 places in 366 ms
[2020-05-27 16:05:45] [INFO ] Deduced a trap composed of 26 places in 472 ms
[2020-05-27 16:05:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2010 ms
[2020-05-27 16:05:45] [INFO ] Computed and/alt/rep : 279/825/279 causal constraints in 31 ms.
[2020-05-27 16:05:54] [INFO ] Added : 263 causal constraints over 56 iterations in 8935 ms. Result :unknown
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 23200 steps, including 545 resets, run finished after 141 ms. (steps per millisecond=164 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 337 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 337/337 places, 287/287 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 337 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 335 transition count 285
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 335 transition count 281
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 331 transition count 281
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 44 place count 315 transition count 265
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 314 transition count 264
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 314 transition count 264
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 314 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 313 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 312 transition count 262
Applied a total of 55 rules in 141 ms. Remains 312 /337 variables (removed 25) and now considering 262/287 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 312/337 places, 262/287 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2870 ms. (steps per millisecond=348 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 1600 ms. (steps per millisecond=625 ) properties seen :[0]
Interrupted probabilistic random walk after 7888820 steps, run timeout after 30001 ms. (steps per millisecond=262 ) properties seen :[0]
Probabilistic random walk after 7888820 steps, saw 1302795 distinct states, run finished after 30002 ms. (steps per millisecond=262 ) properties seen :[0]
// Phase 1: matrix 262 rows 312 cols
[2020-05-27 16:06:28] [INFO ] Computed 111 place invariants in 8 ms
[2020-05-27 16:06:28] [INFO ] [Real]Absence check using 108 positive place invariants in 50 ms returned sat
[2020-05-27 16:06:28] [INFO ] [Real]Absence check using 108 positive and 3 generalized place invariants in 15 ms returned sat
[2020-05-27 16:06:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:06:29] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2020-05-27 16:06:29] [INFO ] Deduced a trap composed of 6 places in 153 ms
[2020-05-27 16:06:29] [INFO ] Deduced a trap composed of 5 places in 149 ms
[2020-05-27 16:06:29] [INFO ] Deduced a trap composed of 9 places in 134 ms
[2020-05-27 16:06:29] [INFO ] Deduced a trap composed of 5 places in 47 ms
[2020-05-27 16:06:30] [INFO ] Deduced a trap composed of 5 places in 133 ms
[2020-05-27 16:06:31] [INFO ] Deduced a trap composed of 14 places in 1640 ms
[2020-05-27 16:06:32] [INFO ] Deduced a trap composed of 9 places in 850 ms
[2020-05-27 16:06:32] [INFO ] Deduced a trap composed of 7 places in 380 ms
[2020-05-27 16:06:33] [INFO ] Deduced a trap composed of 7 places in 89 ms
[2020-05-27 16:06:33] [INFO ] Deduced a trap composed of 9 places in 67 ms
[2020-05-27 16:06:34] [INFO ] Deduced a trap composed of 20 places in 914 ms
[2020-05-27 16:06:34] [INFO ] Deduced a trap composed of 19 places in 496 ms
[2020-05-27 16:06:34] [INFO ] Deduced a trap composed of 16 places in 59 ms
[2020-05-27 16:06:34] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5401 ms
[2020-05-27 16:06:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 16:06:34] [INFO ] [Nat]Absence check using 108 positive place invariants in 52 ms returned sat
[2020-05-27 16:06:34] [INFO ] [Nat]Absence check using 108 positive and 3 generalized place invariants in 2 ms returned sat
[2020-05-27 16:06:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 16:06:35] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2020-05-27 16:06:35] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2020-05-27 16:06:36] [INFO ] Deduced a trap composed of 5 places in 1219 ms
[2020-05-27 16:06:36] [INFO ] Deduced a trap composed of 5 places in 80 ms
[2020-05-27 16:06:36] [INFO ] Deduced a trap composed of 7 places in 90 ms
[2020-05-27 16:06:36] [INFO ] Deduced a trap composed of 7 places in 94 ms
[2020-05-27 16:06:37] [INFO ] Deduced a trap composed of 9 places in 423 ms
[2020-05-27 16:06:37] [INFO ] Deduced a trap composed of 9 places in 411 ms
[2020-05-27 16:06:37] [INFO ] Deduced a trap composed of 9 places in 109 ms
[2020-05-27 16:06:38] [INFO ] Deduced a trap composed of 9 places in 436 ms
[2020-05-27 16:06:38] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-05-27 16:06:38] [INFO ] Deduced a trap composed of 13 places in 145 ms
[2020-05-27 16:06:39] [INFO ] Deduced a trap composed of 16 places in 575 ms
[2020-05-27 16:06:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3992 ms
[2020-05-27 16:06:39] [INFO ] Computed and/alt/rep : 259/775/259 causal constraints in 21 ms.
[2020-05-27 16:06:46] [INFO ] Added : 239 causal constraints over 54 iterations in 7587 ms. Result :unknown
Incomplete Parikh walk after 11700 steps, including 448 resets, run finished after 87 ms. (steps per millisecond=134 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 37 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 262/262 transitions.
Starting structural reductions, iteration 0 : 312/312 places, 262/262 transitions.
Applied a total of 0 rules in 32 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 312 cols
[2020-05-27 16:06:46] [INFO ] Computed 111 place invariants in 23 ms
[2020-05-27 16:06:47] [INFO ] Implicit Places using invariants in 937 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2020-05-27 16:06:47] [INFO ] Computed 111 place invariants in 5 ms
[2020-05-27 16:06:49] [INFO ] Implicit Places using invariants and state equation in 1957 ms returned []
Implicit Place search using SMT with State Equation took 2912 ms to find 0 implicit places.
[2020-05-27 16:06:49] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 262 rows 312 cols
[2020-05-27 16:06:49] [INFO ] Computed 111 place invariants in 3 ms
[2020-05-27 16:06:50] [INFO ] Dead Transitions using invariants and state equation in 460 ms returned []
Finished structural reductions, in 1 iterations. Remains : 312/312 places, 262/262 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 395 ms. (steps per millisecond=253 ) properties seen :[0]
// Phase 1: matrix 262 rows 312 cols
[2020-05-27 16:06:50] [INFO ] Computed 111 place invariants in 3 ms
[2020-05-27 16:06:50] [INFO ] [Real]Absence check using 108 positive place invariants in 51 ms returned sat
[2020-05-27 16:06:50] [INFO ] [Real]Absence check using 108 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-27 16:06:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:06:51] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2020-05-27 16:06:51] [INFO ] Deduced a trap composed of 6 places in 113 ms
[2020-05-27 16:06:51] [INFO ] Deduced a trap composed of 5 places in 83 ms
[2020-05-27 16:06:51] [INFO ] Deduced a trap composed of 9 places in 71 ms
[2020-05-27 16:06:51] [INFO ] Deduced a trap composed of 5 places in 70 ms
[2020-05-27 16:06:51] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2020-05-27 16:06:51] [INFO ] Deduced a trap composed of 14 places in 68 ms
[2020-05-27 16:06:51] [INFO ] Deduced a trap composed of 9 places in 66 ms
[2020-05-27 16:06:51] [INFO ] Deduced a trap composed of 7 places in 65 ms
[2020-05-27 16:06:51] [INFO ] Deduced a trap composed of 7 places in 64 ms
[2020-05-27 16:06:52] [INFO ] Deduced a trap composed of 9 places in 49 ms
[2020-05-27 16:06:52] [INFO ] Deduced a trap composed of 20 places in 60 ms
[2020-05-27 16:06:52] [INFO ] Deduced a trap composed of 19 places in 63 ms
[2020-05-27 16:06:52] [INFO ] Deduced a trap composed of 16 places in 55 ms
[2020-05-27 16:06:52] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1082 ms
[2020-05-27 16:06:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 16:06:52] [INFO ] [Nat]Absence check using 108 positive place invariants in 46 ms returned sat
[2020-05-27 16:06:52] [INFO ] [Nat]Absence check using 108 positive and 3 generalized place invariants in 1 ms returned sat
[2020-05-27 16:06:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 16:06:52] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2020-05-27 16:06:52] [INFO ] Deduced a trap composed of 6 places in 121 ms
[2020-05-27 16:06:52] [INFO ] Deduced a trap composed of 5 places in 88 ms
[2020-05-27 16:06:52] [INFO ] Deduced a trap composed of 5 places in 63 ms
[2020-05-27 16:06:53] [INFO ] Deduced a trap composed of 7 places in 65 ms
[2020-05-27 16:06:53] [INFO ] Deduced a trap composed of 7 places in 71 ms
[2020-05-27 16:06:53] [INFO ] Deduced a trap composed of 9 places in 127 ms
[2020-05-27 16:06:53] [INFO ] Deduced a trap composed of 9 places in 79 ms
[2020-05-27 16:06:53] [INFO ] Deduced a trap composed of 9 places in 50 ms
[2020-05-27 16:06:53] [INFO ] Deduced a trap composed of 9 places in 477 ms
[2020-05-27 16:06:54] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-05-27 16:06:54] [INFO ] Deduced a trap composed of 13 places in 70 ms
[2020-05-27 16:06:54] [INFO ] Deduced a trap composed of 16 places in 41 ms
[2020-05-27 16:06:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1546 ms
[2020-05-27 16:06:54] [INFO ] Computed and/alt/rep : 259/775/259 causal constraints in 19 ms.
[2020-05-27 16:07:02] [INFO ] Added : 239 causal constraints over 54 iterations in 8254 ms. Result :unknown
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 262
Applied a total of 2 rules in 45 ms. Remains 312 /312 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 312 cols
[2020-05-27 16:07:02] [INFO ] Computed 111 place invariants in 5 ms
[2020-05-27 16:07:02] [INFO ] [Real]Absence check using 109 positive place invariants in 76 ms returned sat
[2020-05-27 16:07:02] [INFO ] [Real]Absence check using 109 positive and 2 generalized place invariants in 1 ms returned sat
[2020-05-27 16:07:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 16:07:03] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2020-05-27 16:07:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-27 16:07:03] [INFO ] [Real]Added 2 Read/Feed constraints in 4 ms returned sat
[2020-05-27 16:07:03] [INFO ] Deduced a trap composed of 9 places in 93 ms
[2020-05-27 16:07:03] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-05-27 16:07:03] [INFO ] Deduced a trap composed of 9 places in 73 ms
[2020-05-27 16:07:03] [INFO ] Deduced a trap composed of 5 places in 68 ms
[2020-05-27 16:07:04] [INFO ] Deduced a trap composed of 5 places in 571 ms
[2020-05-27 16:07:04] [INFO ] Deduced a trap composed of 13 places in 155 ms
[2020-05-27 16:07:05] [INFO ] Deduced a trap composed of 16 places in 558 ms
[2020-05-27 16:07:06] [INFO ] Deduced a trap composed of 20 places in 1154 ms
[2020-05-27 16:07:07] [INFO ] Deduced a trap composed of 7 places in 798 ms
[2020-05-27 16:07:07] [INFO ] Deduced a trap composed of 7 places in 84 ms
[2020-05-27 16:07:07] [INFO ] Deduced a trap composed of 19 places in 78 ms
[2020-05-27 16:07:07] [INFO ] Deduced a trap composed of 18 places in 47 ms
[2020-05-27 16:07:07] [INFO ] Deduced a trap composed of 9 places in 40 ms
[2020-05-27 16:07:07] [INFO ] Deduced a trap composed of 14 places in 36 ms
[2020-05-27 16:07:07] [INFO ] Deduced a trap composed of 20 places in 33 ms
[2020-05-27 16:07:07] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4174 ms
[2020-05-27 16:07:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 16:07:07] [INFO ] [Nat]Absence check using 109 positive place invariants in 50 ms returned sat
[2020-05-27 16:07:07] [INFO ] [Nat]Absence check using 109 positive and 2 generalized place invariants in 2 ms returned sat
[2020-05-27 16:07:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 16:07:07] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2020-05-27 16:07:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 45 ms returned sat
[2020-05-27 16:07:07] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-05-27 16:07:08] [INFO ] Deduced a trap composed of 6 places in 86 ms
[2020-05-27 16:07:08] [INFO ] Deduced a trap composed of 7 places in 106 ms
[2020-05-27 16:07:08] [INFO ] Deduced a trap composed of 4 places in 161 ms
[2020-05-27 16:07:08] [INFO ] Deduced a trap composed of 5 places in 130 ms
[2020-05-27 16:07:08] [INFO ] Deduced a trap composed of 13 places in 100 ms
[2020-05-27 16:07:08] [INFO ] Deduced a trap composed of 5 places in 38 ms
[2020-05-27 16:07:08] [INFO ] Deduced a trap composed of 7 places in 30 ms
[2020-05-27 16:07:08] [INFO ] Deduced a trap composed of 16 places in 29 ms
[2020-05-27 16:07:08] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 914 ms
[2020-05-27 16:07:08] [INFO ] Computed and/alt/rep : 259/784/259 causal constraints in 22 ms.
[2020-05-27 16:07:16] [INFO ] Added : 236 causal constraints over 51 iterations in 7337 ms. Result :unknown
[2020-05-27 16:07:16] [INFO ] Flatten gal took : 130 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 16:07:16] [INFO ] Applying decomposition
[2020-05-27 16:07:16] [INFO ] Flatten gal took : 62 ms
[2020-05-27 16:07:16] [INFO ] Flatten gal took : 51 ms
[2020-05-27 16:07:16] [INFO ] Input system was already deterministic with 262 transitions.
[2020-05-27 16:07:16] [INFO ] Input system was already deterministic with 262 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/graph5509964519025635484.txt, -o, /tmp/graph5509964519025635484.bin, -w, /tmp/graph5509964519025635484.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/graph5509964519025635484.bin, -l, -1, -v, -w, /tmp/graph5509964519025635484.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 16:07:17] [INFO ] Decomposing Gal with order
[2020-05-27 16:07:17] [INFO ] Ran tautology test, simplified 0 / 1 in 335 ms.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 262 rows 312 cols
[2020-05-27 16:07:17] [INFO ] Computed 111 place invariants in 2 ms
inv : p672 + p675 + p677 + p679 = 1
inv : p91 + p96 + p97 = 1
inv : p165 + p170 + p171 = 1
inv : p155 + p157 = 1
inv : p122 + p124 = 1
inv : p260 + p262 + p264 + p266 = 1
inv : p203 + p206 + p208 + p210 = 1
inv : p98 + p103 + p104 = 1
inv : p644 + p645 = 1
inv : p172 + p177 + p178 = 1
inv : p232 + p237 + p238 = 1
inv : p484 + p490 + p492 = 1
inv : p605 + p608 + p610 + p612 = 1
inv : p306 + p311 + p312 = 1
inv : p461 + p463 + p465 + p467 = 1
inv : p313 + p315 + p317 + p319 = 1
inv : p457 + p459 = 1
inv : -p503 - p504 + p505 + p506 = 0
inv : p225 + p230 + p231 = 1
inv : p24 + p29 + p30 = 1
inv : p652 + p654 + p655 = 1
inv : p484 + p500 + p503 + p504 = 1
inv : p373 + p378 + p379 = 1
inv : p38 + p41 + p42 = 1
inv : p484 + p524 + p526 = 1
inv : p222 + p224 = 1
inv : p404 + p407 + p409 + p411 = 1
inv : p105 + p110 + p111 = 1
inv : p484 + p493 + p496 + p497 = 1
inv : p423 + p425 = 1
inv : p10 + p12 = 1
inv : p567 + p572 + p573 = 1
inv : p634 + p639 + p640 = 1
inv : p627 + p630 + p631 = 1
inv : p440 + p445 + p446 = 1
inv : p359 + p362 + p363 = 1
inv : p433 + p436 + p437 = 1
inv : p105 + p108 + p109 = 1
inv : p31 + p34 + p35 = 1
inv : p38 + p43 + p44 = 1
inv : p193 + p195 + p197 + p199 = 1
inv : p560 + p565 + p566 = 1
inv : p55 + p57 = 1
inv : p101 + p102 - p103 - p104 = 0
inv : p366 + p371 + p372 = 1
inv : p172 + p175 + p176 = 1
inv : p292 + p295 + p296 = 1
inv : p337 + p340 + p342 + p344 = 1
inv : p246 + p248 + p250 + p252 = 1
inv : p538 + p541 + p543 + p545 = 1
inv : p158 + p163 + p164 = 1
inv : p299 + p304 + p305 = 1
inv : p557 + p559 = 1
inv : p69 + p72 + p74 + p76 = 1
inv : p232 + p235 + p236 = 1
inv : p126 + p128 + p130 + p132 = 1
inv : p646 + p647 = 1
inv : p658 + p660 = 1
inv : p158 + p161 + p162 = 1
inv : p306 + p309 + p310 = 1
inv : p239 + p242 + p243 = 1
inv : p447 + p449 + p451 + p453 = 1
inv : p574 + p577 + p578 = 1
inv : p299 + p302 + p303 = 1
inv : p356 + p358 = 1
inv : p325 + p326 = 1
inv : p225 + p228 + p229 = 1
inv : p165 + p168 + p169 = 1
inv : p366 + p369 + p370 = 1
inv : p256 + p258 = 1
inv : p560 + p563 + p564 = 1
inv : p270 + p273 + p275 + p277 = 1
inv : p591 + p593 = 1
inv : p433 + p438 + p439 = 1
inv : p329 + p331 + p333 + p335 = 1
inv : p179 + p181 + p183 + p185 = 1
inv : p21 + p23 = 1
inv : p484 + p507 + p512 + p513 = 1
inv : p390 + p392 = 1
inv : p426 + p429 + p430 = 1
inv : p359 + p364 + p365 = 1
inv : p59 + p61 + p63 + p65 = 1
inv : p45 + p47 + p49 + p51 = 1
inv : p292 + p297 + p298 = 1
inv : p634 + p637 + p638 = 1
inv : p136 + p139 + p141 + p143 = 1
inv : p380 + p382 + p384 + p386 = 1
inv : p662 + p664 + p666 + p668 = 1
inv : p484 + p528 + p530 + p532 + p534 + p536 = 1
inv : p484 + p507 + p510 + p511 = 1
inv : p440 + p443 + p444 = 1
inv : p581 + p583 + p585 + p587 = 1
inv : p567 + p570 + p571 = 1
inv : p426 + p431 + p432 = 1
inv : p91 + p94 + p95 = 1
inv : p484 + p493 + p498 + p499 = 1
inv : p88 + p90 = 1
inv : p31 + p36 + p37 = 1
inv : p24 + p27 + p28 = 1
inv : p289 + p291 = 1
inv : -p630 - p631 + p632 + p633 = 0
inv : p373 + p376 + p377 = 1
inv : p474 + p476 + p478 + p480 = 1
inv : p484 + p514 + p516 + p518 + p520 = 1
inv : p112 + p114 + p116 + p118 = 1
inv : p624 + p626 = 1
inv : p574 + p579 + p580 = 1
inv : p239 + p244 + p245 = 1
inv : p595 + p597 + p599 + p601 = 1
inv : p189 + p191 = 1
inv : p394 + p396 + p398 + p400 = 1
Total of 111 invariants.
[2020-05-27 16:07:17] [INFO ] Computed 111 place invariants in 4 ms
[2020-05-27 16:07:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 16:07:17] [INFO ] BMC solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(UNSAT) depth K=0 took 20 ms
[2020-05-27 16:07:17] [INFO ] BMC solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(UNSAT) depth K=1 took 8 ms
[2020-05-27 16:07:17] [INFO ] Removed a total of 148 redundant transitions.
[2020-05-27 16:07:17] [INFO ] BMC solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(UNSAT) depth K=2 took 127 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 262 rows 312 cols
[2020-05-27 16:07:17] [INFO ] Computed 111 place invariants in 2 ms
inv : p672 + p675 + p677 + p679 = 1
inv : p91 + p96 + p97 = 1
inv : p165 + p170 + p171 = 1
inv : p155 + p157 = 1
inv : p122 + p124 = 1
inv : p260 + p262 + p264 + p266 = 1
inv : p203 + p206 + p208 + p210 = 1
inv : p98 + p103 + p104 = 1
inv : p644 + p645 = 1
inv : p172 + p177 + p178 = 1
inv : p232 + p237 + p238 = 1
inv : p484 + p490 + p492 = 1
inv : p605 + p608 + p610 + p612 = 1
inv : p306 + p311 + p312 = 1
inv : p461 + p463 + p465 + p467 = 1
inv : p313 + p315 + p317 + p319 = 1
inv : p457 + p459 = 1
inv : -p503 - p504 + p505 + p506 = 0
inv : p225 + p230 + p231 = 1
inv : p24 + p29 + p30 = 1
inv : p652 + p654 + p655 = 1
inv : p484 + p500 + p503 + p504 = 1
inv : p373 + p378 + p379 = 1
inv : p38 + p41 + p42 = 1
inv : p484 + p524 + p526 = 1
inv : p222 + p224 = 1
inv : p404 + p407 + p409 + p411 = 1
inv : p105 + p110 + p111 = 1
inv : p484 + p493 + p496 + p497 = 1
inv : p423 + p425 = 1
inv : p10 + p12 = 1
inv : p567 + p572 + p573 = 1
inv : p634 + p639 + p640 = 1
inv : p627 + p630 + p631 = 1
inv : p440 + p445 + p446 = 1
inv : p359 + p362 + p363 = 1
inv : p433 + p436 + p437 = 1
inv : p105 + p108 + p109 = 1
inv : p31 + p34 + p35 = 1
inv : p38 + p43 + p44 = 1
inv : p193 + p195 + p197 + p199 = 1
inv : p560 + p565 + p566 = 1
inv : p55 + p57 = 1
inv : p101 + p102 - p103 - p104 = 0
inv : p366 + p371 + p372 = 1
inv : p172 + p175 + p176 = 1
inv : p292 + p295 + p296 = 1
inv : p337 + p340 + p342 + p344 = 1
inv : p246 + p248 + p250 + p252 = 1
inv : p538 + p541 + p543 + p545 = 1
inv : p158 + p163 + p164 = 1
inv : p299 + p304 + p305 = 1
inv : p557 + p559 = 1
inv : p69 + p72 + p74 + p76 = 1
inv : p232 + p235 + p236 = 1
inv : p126 + p128 + p130 + p132 = 1
inv : p646 + p647 = 1
inv : p658 + p660 = 1
inv : p158 + p161 + p162 = 1
inv : p306 + p309 + p310 = 1
inv : p239 + p242 + p243 = 1
inv : p447 + p449 + p451 + p453 = 1
inv : p574 + p577 + p578 = 1
inv : p299 + p302 + p303 = 1
inv : p356 + p358 = 1
inv : p325 + p326 = 1
inv : p225 + p228 + p229 = 1
inv : p165 + p168 + p169 = 1
inv : p366 + p369 + p370 = 1
inv : p256 + p258 = 1
inv : p560 + p563 + p564 = 1
inv : p270 + p273 + p275 + p277 = 1
inv : p591 + p593 = 1
inv : p433 + p438 + p439 = 1
inv : p329 + p331 + p333 + p335 = 1
inv : p179 + p181 + p183 + p185 = 1
inv : p21 + p23 = 1
inv : p484 + p507 + p512 + p513 = 1
inv : p390 + p392 = 1
inv : p426 + p429 + p430 = 1
inv : p359 + p364 + p365 = 1
inv : p59 + p61 + p63 + p65 = 1
inv : p45 + p47 + p49 + p51 = 1
inv : p292 + p297 + p298 = 1
inv : p634 + p637 + p638 = 1
inv : p136 + p139 + p141 + p143 = 1
inv : p380 + p382 + p384 + p386 = 1
inv : p662 + p664 + p666 + p668 = 1
inv : p484 + p528 + p530 + p532 + p534 + p536 = 1
inv : p484 + p507 + p510 + p511 = 1
inv : p440 + p443 + p444 = 1
inv : p581 + p583 + p585 + p587 = 1
inv : p567 + p570 + p571 = 1
inv : p426 + p431 + p432 = 1
inv : p91 + p94 + p95 = 1
inv : p484 + p493 + p498 + p499 = 1
inv : p88 + p90 = 1
inv : p31 + p36 + p37 = 1
inv : p24 + p27 + p28 = 1
inv : p289 + p291 = 1
inv : -p630 - p631 + p632 + p633 = 0
inv : p373 + p376 + p377 = 1
inv : p474 + p476 + p478 + p480 = 1
inv : p484 + p514 + p516 + p518 + p520 = 1
inv : p112 + p114 + p116 + p118 = 1
inv : p624 + p626 = 1
inv : p574 + p579 + p580 = 1
inv : p239 + p244 + p245 = 1
inv : p595 + p597 + p599 + p601 = 1
inv : p189 + p191 = 1
inv : p394 + p396 + p398 + p400 = 1
Total of 111 invariants.
[2020-05-27 16:07:17] [INFO ] Computed 111 place invariants in 6 ms
[2020-05-27 16:07:17] [INFO ] Flatten gal took : 153 ms
[2020-05-27 16:07:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 275 labels/synchronizations in 18 ms.
[2020-05-27 16:07:17] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 7 ms
[2020-05-27 16:07:17] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.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/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.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/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [invariant] property : ShieldPPPs-PT-010B-ReachabilityFireability-13 with value :(((i7.i1.u40.p296!=1)||(i5.i1.u41.p298!=1))||(i11.i1.u79.p528!=1))
built 31 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 8 ordering constraints for composite.
built 13 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 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
[2020-05-27 16:07:17] [INFO ] BMC solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(UNSAT) depth K=3 took 181 ms
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
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
[2020-05-27 16:07:18] [INFO ] Proved 312 variables to be positive in 885 ms
[2020-05-27 16:07:18] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2020-05-27 16:07:18] [INFO ] Computation of disable matrix completed :0/262 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 16:07:18] [INFO ] Computation of Complete disable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 16:07:18] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2020-05-27 16:07:18] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 16:07:18] [INFO ] Computing symmetric co enabling matrix : 262 transitions.
[2020-05-27 16:07:18] [INFO ] Proved 312 variables to be positive in 1037 ms
[2020-05-27 16:07:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-010B-ReachabilityFireability-13
[2020-05-27 16:07:18] [INFO ] KInduction solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(SAT) depth K=0 took 16 ms
[2020-05-27 16:07:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-010B-ReachabilityFireability-13
[2020-05-27 16:07:18] [INFO ] KInduction solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(SAT) depth K=1 took 29 ms
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
[2020-05-27 16:07:21] [INFO ] Computation of co-enabling matrix(159/262) took 2967 ms. Total solver calls (SAT/UNSAT): 1085(103/982)
[2020-05-27 16:07:21] [INFO ] BMC solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(UNSAT) depth K=4 took 3836 ms
[2020-05-27 16:07:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-010B-ReachabilityFireability-13
[2020-05-27 16:07:22] [INFO ] KInduction solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(SAT) depth K=2 took 3801 ms
[2020-05-27 16:07:22] [INFO ] Computation of Finished co-enabling matrix. took 4411 ms. Total solver calls (SAT/UNSAT): 1227(113/1114)
[2020-05-27 16:07:22] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2020-05-27 16:07:22] [INFO ] Computation of Completed DNA matrix. took 48 ms. Total solver calls (SAT/UNSAT): 19(0/19)
[2020-05-27 16:07:22] [INFO ] Built C files in 5844ms 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]
Compilation finished in 3709 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 56 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldPPPsPT010BReachabilityFireability13==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldPPPsPT010BReachabilityFireability13==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldPPPsPT010BReachabilityFireability13==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
[2020-05-27 16:08:01] [INFO ] BMC solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(UNSAT) depth K=5 took 40232 ms
[2020-05-27 16:08:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-010B-ReachabilityFireability-13
[2020-05-27 16:08:10] [INFO ] KInduction solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(SAT) depth K=3 took 48674 ms
[2020-05-27 16:08:42] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-010B-ReachabilityFireability-13
[2020-05-27 16:08:42] [INFO ] KInduction solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(SAT) depth K=4 took 31639 ms
[2020-05-27 16:09:13] [INFO ] BMC solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(UNSAT) depth K=6 took 72256 ms
SDD proceeding with computation, new max is 65536
[2020-05-27 16:10:45] [INFO ] BMC solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(UNSAT) depth K=7 took 92011 ms
[2020-05-27 16:11:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-010B-ReachabilityFireability-13
[2020-05-27 16:11:17] [INFO ] KInduction solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(SAT) depth K=5 took 155021 ms
[2020-05-27 16:16:16] [INFO ] BMC solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(UNSAT) depth K=8 took 330214 ms
SDD proceeding with computation, new max is 131072
[2020-05-27 16:19:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-010B-ReachabilityFireability-13
[2020-05-27 16:19:32] [INFO ] KInduction solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(SAT) depth K=6 took 494693 ms
[2020-05-27 16:23:25] [INFO ] BMC solution for property ShieldPPPs-PT-010B-ReachabilityFireability-13(UNSAT) depth K=9 took 429612 ms
Detected timeout of ITS tools.
[2020-05-27 16:28:09] [INFO ] Applying decomposition
[2020-05-27 16:28:09] [INFO ] Flatten gal took : 38 ms
[2020-05-27 16:28:09] [INFO ] Decomposing Gal with order
[2020-05-27 16:28:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 16:28:09] [INFO ] Removed a total of 214 redundant transitions.
[2020-05-27 16:28:09] [INFO ] Flatten gal took : 59 ms
[2020-05-27 16:28:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 325 labels/synchronizations in 51 ms.
[2020-05-27 16:28:09] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 27 ms
[2020-05-27 16:28:09] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.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/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.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/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [invariant] property : ShieldPPPs-PT-010B-ReachabilityFireability-13 with value :(((i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u104.p296!=1)||(i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u105.p298!=1))||(i0.i0.i1.i0.u177.p528!=1))
built 1 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 22 ordering constraints for composite.
built 21 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 19 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 13 ordering constraints for composite.
built 14 ordering constraints for composite.
built 20 ordering constraints for composite.
built 19 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 16 ordering constraints for composite.
built 17 ordering constraints for composite.
built 23 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 20 ordering constraints for composite.
built 19 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 14 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 23 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 22 ordering constraints for composite.
built 21 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 24 ordering constraints for composite.
built 29 ordering constraints for composite.
built 27 ordering constraints for composite.
built 19 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 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
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
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,56238,1.3061,44968,1082,17,83926,49,564,235978,52,95,0
Total reachable state count : 56238
Verifying 1 reachability properties.
Invariant property ShieldPPPs-PT-010B-ReachabilityFireability-13 is true.
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPs-PT-010B-ReachabilityFireability-13,0,1.30716,44968,1,0,83926,49,596,235978,55,95,35
[2020-05-27 16:28:11] [WARNING] Interrupting SMT solver.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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)
[2020-05-27 16:28:11] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldPPPs-PT-010B-ReachabilityFireability-13 SMT depth 10
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
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 "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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-27 16:28:11] [INFO ] During BMC, SMT solver timed out at depth 10
[2020-05-27 16:28:11] [INFO ] BMC solving timed out (3600000 secs) at depth 10
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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)
[2020-05-27 16:28:11] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldPPPs-PT-010B-ReachabilityFireability-13 K-induction depth 7
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
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 "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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-27 16:28:11] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
BK_STOP 1590596891524
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-010B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-010B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-tajo-159033475800487"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-010B.tgz
mv ShieldPPPs-PT-010B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;