fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r210-tajo-159033476300871
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for ShieldRVs-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.320 1581710.00 4410903.00 2387.20 FTTTTTTFTTTTFFTT 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-159033476300871.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 ShieldRVs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476300871
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 4.1K May 14 02:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 02:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 19:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 19:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 09:09 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 370K 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 ShieldRVs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590624625624

[2020-05-28 00:10:27] [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-28 00:10:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 00:10:27] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2020-05-28 00:10:27] [INFO ] Transformed 1203 places.
[2020-05-28 00:10:27] [INFO ] Transformed 1353 transitions.
[2020-05-28 00:10:27] [INFO ] Found NUPN structural information;
[2020-05-28 00:10:27] [INFO ] Parsed PT model containing 1203 places and 1353 transitions in 169 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 100 ms. (steps per millisecond=100 ) properties seen :[1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1353 rows 1203 cols
[2020-05-28 00:10:27] [INFO ] Computed 121 place invariants in 35 ms
[2020-05-28 00:10:28] [INFO ] [Real]Absence check using 121 positive place invariants in 116 ms returned sat
[2020-05-28 00:10:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:10:30] [INFO ] [Real]Absence check using state equation in 2791 ms returned sat
[2020-05-28 00:10:31] [INFO ] Deduced a trap composed of 32 places in 600 ms
[2020-05-28 00:10:32] [INFO ] Deduced a trap composed of 42 places in 688 ms
[2020-05-28 00:10:32] [INFO ] Deduced a trap composed of 24 places in 602 ms
[2020-05-28 00:10:32] [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 s852 s853 s854 s855 s866 s868 s869 s871 s872 s873 s874 s875 s876 s877 s878) 0)") while checking expression at index 0
[2020-05-28 00:10:33] [INFO ] [Real]Absence check using 121 positive place invariants in 97 ms returned sat
[2020-05-28 00:10:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:10:35] [INFO ] [Real]Absence check using state equation in 2598 ms returned sat
[2020-05-28 00:10:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 00:10:36] [INFO ] [Nat]Absence check using 121 positive place invariants in 279 ms returned sat
[2020-05-28 00:10:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 00:10:39] [INFO ] [Nat]Absence check using state equation in 2949 ms returned sat
[2020-05-28 00:10:39] [INFO ] Deduced a trap composed of 22 places in 443 ms
[2020-05-28 00:10:40] [INFO ] Deduced a trap composed of 29 places in 604 ms
[2020-05-28 00:10:41] [INFO ] Deduced a trap composed of 15 places in 583 ms
[2020-05-28 00:10:41] [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 s1125 s1126 s1127 s1140 s1141 s1142 s1143 s1144 s1145 s1149 s1150 s1151 s1152) 0)") while checking expression at index 1
[2020-05-28 00:10:41] [INFO ] [Real]Absence check using 121 positive place invariants in 118 ms returned sat
[2020-05-28 00:10:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:10:43] [INFO ] [Real]Absence check using state equation in 2579 ms returned sat
[2020-05-28 00:10:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 00:10:44] [INFO ] [Nat]Absence check using 121 positive place invariants in 193 ms returned sat
[2020-05-28 00:10:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 00:10:47] [INFO ] [Nat]Absence check using state equation in 2632 ms returned sat
[2020-05-28 00:10:47] [INFO ] Deduced a trap composed of 25 places in 455 ms
[2020-05-28 00:10:48] [INFO ] Deduced a trap composed of 25 places in 442 ms
[2020-05-28 00:10:48] [INFO ] Deduced a trap composed of 24 places in 549 ms
[2020-05-28 00:10:49] [INFO ] Deduced a trap composed of 36 places in 545 ms
[2020-05-28 00:10:49] [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 s818 s819 s820 s821 s822 s823 s824 s825 s852 s853 s854 s855 s856 s857 s858 s860 s863 s864 s865 s1091 s1092 s1096 s1097 s1098 s1101 s1102 s1103) 0)") while checking expression at index 2
[2020-05-28 00:10:49] [INFO ] [Real]Absence check using 121 positive place invariants in 133 ms returned sat
[2020-05-28 00:10:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:10:52] [INFO ] [Real]Absence check using state equation in 2735 ms returned sat
[2020-05-28 00:10:52] [INFO ] Deduced a trap composed of 19 places in 565 ms
[2020-05-28 00:10:53] [INFO ] Deduced a trap composed of 33 places in 435 ms
[2020-05-28 00:10:53] [INFO ] Deduced a trap composed of 28 places in 404 ms
[2020-05-28 00:10:54] [INFO ] Deduced a trap composed of 26 places in 451 ms
[2020-05-28 00:10:54] [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 s969 s970 s971 s972 s973 s974 s975 s976 s979 s980 s981 s982 s984 s986 s998 s999 s1000 s1004 s1005 s1006) 0)") while checking expression at index 3
[2020-05-28 00:10:54] [INFO ] [Real]Absence check using 121 positive place invariants in 91 ms returned sat
[2020-05-28 00:10:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:10:57] [INFO ] [Real]Absence check using state equation in 2679 ms returned sat
[2020-05-28 00:10:58] [INFO ] Deduced a trap composed of 42 places in 653 ms
[2020-05-28 00:10:58] [INFO ] Deduced a trap composed of 35 places in 621 ms
[2020-05-28 00:10:59] [INFO ] Deduced a trap composed of 36 places in 462 ms
[2020-05-28 00:10:59] [INFO ] Deduced a trap composed of 21 places in 612 ms
[2020-05-28 00:10:59] [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 s969 s970 s971 s972 s983 s986 s998 s999 s1000 s1001 s1002 s1003 s1004 s1005 s1006) 0)") while checking expression at index 4
[2020-05-28 00:11:00] [INFO ] [Real]Absence check using 121 positive place invariants in 137 ms returned sat
[2020-05-28 00:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:11:02] [INFO ] [Real]Absence check using state equation in 2678 ms returned sat
[2020-05-28 00:11:03] [INFO ] Deduced a trap composed of 21 places in 518 ms
[2020-05-28 00:11:03] [INFO ] Deduced a trap composed of 39 places in 495 ms
[2020-05-28 00:11:04] [INFO ] Deduced a trap composed of 21 places in 462 ms
[2020-05-28 00:11:04] [INFO ] Deduced a trap composed of 37 places in 423 ms
[2020-05-28 00:11:04] [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 s1047 s1048 s1075 s1076 s1077 s1078 s1080 s1083 s1084 s1085 s1092 s1093 s1094 s1095 s1105 s1106 s1110 s1111 s1112 s1131 s1132 s1135 s1140 s1141 s1142 s1169 s1170 s1171 s1172 s1173 s1174 s1175 s1176) 0)") while checking expression at index 5
[2020-05-28 00:11:05] [INFO ] [Real]Absence check using 121 positive place invariants in 56 ms returned unsat
[2020-05-28 00:11:05] [INFO ] [Real]Absence check using 121 positive place invariants in 135 ms returned sat
[2020-05-28 00:11:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:11:08] [INFO ] [Real]Absence check using state equation in 2791 ms returned sat
[2020-05-28 00:11:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 00:11:08] [INFO ] [Nat]Absence check using 121 positive place invariants in 132 ms returned sat
[2020-05-28 00:11:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 00:11:11] [INFO ] [Nat]Absence check using state equation in 2999 ms returned sat
[2020-05-28 00:11:12] [INFO ] Deduced a trap composed of 27 places in 611 ms
[2020-05-28 00:11:12] [INFO ] Deduced a trap composed of 33 places in 475 ms
[2020-05-28 00:11:13] [INFO ] Deduced a trap composed of 22 places in 564 ms
[2020-05-28 00:11:13] [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 s930 s931 s932 s933 s944 s947 s959 s960 s961 s962 s963 s964 s965 s966 s967) 0)") while checking expression at index 7
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 37 out of 1203 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 1203 transition count 1237
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 232 place count 1087 transition count 1237
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 232 place count 1087 transition count 1085
Deduced a syphon composed of 152 places in 5 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 536 place count 935 transition count 1085
Symmetric choice reduction at 2 with 199 rule applications. Total rules 735 place count 935 transition count 1085
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 199 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 1133 place count 736 transition count 886
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 1133 place count 736 transition count 809
Deduced a syphon composed of 77 places in 3 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 1287 place count 659 transition count 809
Performed 209 Post agglomeration using F-continuation condition.Transition count delta: 209
Deduced a syphon composed of 209 places in 2 ms
Reduce places removed 209 places and 0 transitions.
Iterating global reduction 2 with 418 rules applied. Total rules applied 1705 place count 450 transition count 600
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 2 with 59 rules applied. Total rules applied 1764 place count 450 transition count 600
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1765 place count 449 transition count 599
Applied a total of 1765 rules in 331 ms. Remains 449 /1203 variables (removed 754) and now considering 599/1353 (removed 754) transitions.
Finished structural reductions, in 1 iterations. Remains : 449/1203 places, 599/1353 transitions.
Incomplete random walk after 1000000 steps, including 2521 resets, run finished after 3389 ms. (steps per millisecond=295 ) properties seen :[1, 1, 0, 1, 1, 0, 0]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 287 resets, run finished after 2170 ms. (steps per millisecond=460 ) properties seen :[1, 0, 0]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 274 resets, run finished after 1935 ms. (steps per millisecond=516 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 296 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties seen :[0, 1]
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 599 rows 449 cols
[2020-05-28 00:11:23] [INFO ] Computed 121 place invariants in 4 ms
[2020-05-28 00:11:23] [INFO ] [Real]Absence check using 121 positive place invariants in 64 ms returned sat
[2020-05-28 00:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:11:23] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2020-05-28 00:11:23] [INFO ] Computed and/alt/rep : 587/3230/587 causal constraints in 64 ms.
[2020-05-28 00:11:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 00:11:24] [INFO ] [Nat]Absence check using 121 positive place invariants in 50 ms returned sat
[2020-05-28 00:11:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 00:11:24] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2020-05-28 00:11:24] [INFO ] Deduced a trap composed of 11 places in 62 ms
[2020-05-28 00:11:24] [INFO ] Deduced a trap composed of 14 places in 46 ms
[2020-05-28 00:11:25] [INFO ] Deduced a trap composed of 9 places in 26 ms
[2020-05-28 00:11:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2020-05-28 00:11:25] [INFO ] Computed and/alt/rep : 587/3230/587 causal constraints in 49 ms.
[2020-05-28 00:11:48] [INFO ] Added : 585 causal constraints over 117 iterations in 23049 ms.(timeout) Result :unknown
Incomplete Parikh walk after 53400 steps, including 808 resets, run finished after 246 ms. (steps per millisecond=217 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 449 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 449/449 places, 599/599 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 449 transition count 596
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 446 transition count 596
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 446 transition count 590
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 440 transition count 590
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 36 place count 431 transition count 581
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 431 transition count 581
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 430 transition count 580
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 429 transition count 579
Applied a total of 40 rules in 65 ms. Remains 429 /449 variables (removed 20) and now considering 579/599 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 429/449 places, 579/599 transitions.
Incomplete random walk after 1000000 steps, including 2746 resets, run finished after 3230 ms. (steps per millisecond=309 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 314 resets, run finished after 1971 ms. (steps per millisecond=507 ) properties seen :[0]
Interrupted probabilistic random walk after 5021096 steps, run timeout after 30001 ms. (steps per millisecond=167 ) properties seen :[0]
Probabilistic random walk after 5021096 steps, saw 852131 distinct states, run finished after 30001 ms. (steps per millisecond=167 ) properties seen :[0]
// Phase 1: matrix 579 rows 429 cols
[2020-05-28 00:12:23] [INFO ] Computed 121 place invariants in 5 ms
[2020-05-28 00:12:23] [INFO ] [Real]Absence check using 121 positive place invariants in 66 ms returned sat
[2020-05-28 00:12:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:12:24] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2020-05-28 00:12:24] [INFO ] Deduced a trap composed of 8 places in 158 ms
[2020-05-28 00:12:24] [INFO ] Deduced a trap composed of 8 places in 127 ms
[2020-05-28 00:12:24] [INFO ] Deduced a trap composed of 10 places in 131 ms
[2020-05-28 00:12:24] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2020-05-28 00:12:25] [INFO ] Deduced a trap composed of 13 places in 64 ms
[2020-05-28 00:12:25] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2020-05-28 00:12:25] [INFO ] Deduced a trap composed of 8 places in 29 ms
[2020-05-28 00:12:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 778 ms
[2020-05-28 00:12:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 00:12:25] [INFO ] [Nat]Absence check using 121 positive place invariants in 71 ms returned sat
[2020-05-28 00:12:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 00:12:25] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2020-05-28 00:12:26] [INFO ] Deduced a trap composed of 8 places in 118 ms
[2020-05-28 00:12:26] [INFO ] Deduced a trap composed of 8 places in 84 ms
[2020-05-28 00:12:26] [INFO ] Deduced a trap composed of 21 places in 74 ms
[2020-05-28 00:12:26] [INFO ] Deduced a trap composed of 27 places in 62 ms
[2020-05-28 00:12:26] [INFO ] Deduced a trap composed of 19 places in 65 ms
[2020-05-28 00:12:26] [INFO ] Deduced a trap composed of 15 places in 62 ms
[2020-05-28 00:12:26] [INFO ] Deduced a trap composed of 25 places in 79 ms
[2020-05-28 00:12:26] [INFO ] Deduced a trap composed of 15 places in 59 ms
[2020-05-28 00:12:26] [INFO ] Deduced a trap composed of 13 places in 51 ms
[2020-05-28 00:12:26] [INFO ] Deduced a trap composed of 11 places in 51 ms
[2020-05-28 00:12:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 974 ms
[2020-05-28 00:12:26] [INFO ] Computed and/alt/rep : 575/3144/575 causal constraints in 44 ms.
[2020-05-28 00:12:47] [INFO ] Added : 560 causal constraints over 112 iterations in 21017 ms. Result :unknown
Incomplete Parikh walk after 47300 steps, including 905 resets, run finished after 287 ms. (steps per millisecond=164 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 429 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 429/429 places, 579/579 transitions.
Applied a total of 0 rules in 15 ms. Remains 429 /429 variables (removed 0) and now considering 579/579 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 429/429 places, 579/579 transitions.
Starting structural reductions, iteration 0 : 429/429 places, 579/579 transitions.
Applied a total of 0 rules in 14 ms. Remains 429 /429 variables (removed 0) and now considering 579/579 (removed 0) transitions.
// Phase 1: matrix 579 rows 429 cols
[2020-05-28 00:12:48] [INFO ] Computed 121 place invariants in 5 ms
[2020-05-28 00:12:48] [INFO ] Implicit Places using invariants in 591 ms returned []
// Phase 1: matrix 579 rows 429 cols
[2020-05-28 00:12:48] [INFO ] Computed 121 place invariants in 4 ms
[2020-05-28 00:12:50] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2417 ms to find 0 implicit places.
[2020-05-28 00:12:50] [INFO ] Redundant transitions in 266 ms returned []
// Phase 1: matrix 579 rows 429 cols
[2020-05-28 00:12:50] [INFO ] Computed 121 place invariants in 10 ms
[2020-05-28 00:12:51] [INFO ] Dead Transitions using invariants and state equation in 763 ms returned []
Finished structural reductions, in 1 iterations. Remains : 429/429 places, 579/579 transitions.
Incomplete random walk after 100000 steps, including 275 resets, run finished after 304 ms. (steps per millisecond=328 ) properties seen :[0]
// Phase 1: matrix 579 rows 429 cols
[2020-05-28 00:12:52] [INFO ] Computed 121 place invariants in 2 ms
[2020-05-28 00:12:52] [INFO ] [Real]Absence check using 121 positive place invariants in 64 ms returned sat
[2020-05-28 00:12:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:12:52] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2020-05-28 00:12:52] [INFO ] Deduced a trap composed of 8 places in 168 ms
[2020-05-28 00:12:53] [INFO ] Deduced a trap composed of 8 places in 122 ms
[2020-05-28 00:12:53] [INFO ] Deduced a trap composed of 10 places in 122 ms
[2020-05-28 00:12:53] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2020-05-28 00:12:53] [INFO ] Deduced a trap composed of 13 places in 69 ms
[2020-05-28 00:12:53] [INFO ] Deduced a trap composed of 11 places in 66 ms
[2020-05-28 00:12:53] [INFO ] Deduced a trap composed of 8 places in 60 ms
[2020-05-28 00:12:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 839 ms
[2020-05-28 00:12:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 00:12:53] [INFO ] [Nat]Absence check using 121 positive place invariants in 63 ms returned sat
[2020-05-28 00:12:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 00:12:54] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2020-05-28 00:12:54] [INFO ] Deduced a trap composed of 8 places in 87 ms
[2020-05-28 00:12:54] [INFO ] Deduced a trap composed of 8 places in 88 ms
[2020-05-28 00:12:54] [INFO ] Deduced a trap composed of 21 places in 81 ms
[2020-05-28 00:12:54] [INFO ] Deduced a trap composed of 27 places in 61 ms
[2020-05-28 00:12:54] [INFO ] Deduced a trap composed of 19 places in 64 ms
[2020-05-28 00:12:54] [INFO ] Deduced a trap composed of 15 places in 54 ms
[2020-05-28 00:12:55] [INFO ] Deduced a trap composed of 25 places in 66 ms
[2020-05-28 00:12:55] [INFO ] Deduced a trap composed of 15 places in 60 ms
[2020-05-28 00:12:55] [INFO ] Deduced a trap composed of 13 places in 57 ms
[2020-05-28 00:12:55] [INFO ] Deduced a trap composed of 11 places in 47 ms
[2020-05-28 00:12:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 935 ms
[2020-05-28 00:12:55] [INFO ] Computed and/alt/rep : 575/3144/575 causal constraints in 42 ms.
[2020-05-28 00:13:13] [INFO ] Added : 560 causal constraints over 112 iterations in 18314 ms. Result :unknown
Applied a total of 0 rules in 13 ms. Remains 429 /429 variables (removed 0) and now considering 579/579 (removed 0) transitions.
// Phase 1: matrix 579 rows 429 cols
[2020-05-28 00:13:13] [INFO ] Computed 121 place invariants in 2 ms
[2020-05-28 00:13:13] [INFO ] [Real]Absence check using 121 positive place invariants in 68 ms returned sat
[2020-05-28 00:13:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 00:13:14] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2020-05-28 00:13:14] [INFO ] Deduced a trap composed of 8 places in 164 ms
[2020-05-28 00:13:14] [INFO ] Deduced a trap composed of 8 places in 134 ms
[2020-05-28 00:13:14] [INFO ] Deduced a trap composed of 10 places in 128 ms
[2020-05-28 00:13:14] [INFO ] Deduced a trap composed of 6 places in 74 ms
[2020-05-28 00:13:15] [INFO ] Deduced a trap composed of 13 places in 72 ms
[2020-05-28 00:13:15] [INFO ] Deduced a trap composed of 11 places in 67 ms
[2020-05-28 00:13:15] [INFO ] Deduced a trap composed of 8 places in 34 ms
[2020-05-28 00:13:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 822 ms
[2020-05-28 00:13:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 00:13:15] [INFO ] [Nat]Absence check using 121 positive place invariants in 60 ms returned sat
[2020-05-28 00:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 00:13:15] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2020-05-28 00:13:15] [INFO ] Deduced a trap composed of 8 places in 95 ms
[2020-05-28 00:13:16] [INFO ] Deduced a trap composed of 8 places in 81 ms
[2020-05-28 00:13:16] [INFO ] Deduced a trap composed of 21 places in 58 ms
[2020-05-28 00:13:16] [INFO ] Deduced a trap composed of 27 places in 63 ms
[2020-05-28 00:13:16] [INFO ] Deduced a trap composed of 19 places in 47 ms
[2020-05-28 00:13:16] [INFO ] Deduced a trap composed of 15 places in 48 ms
[2020-05-28 00:13:16] [INFO ] Deduced a trap composed of 25 places in 63 ms
[2020-05-28 00:13:16] [INFO ] Deduced a trap composed of 15 places in 40 ms
[2020-05-28 00:13:16] [INFO ] Deduced a trap composed of 13 places in 40 ms
[2020-05-28 00:13:16] [INFO ] Deduced a trap composed of 11 places in 36 ms
[2020-05-28 00:13:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 799 ms
[2020-05-28 00:13:16] [INFO ] Computed and/alt/rep : 575/3144/575 causal constraints in 32 ms.
[2020-05-28 00:13:37] [INFO ] Added : 560 causal constraints over 112 iterations in 20828 ms. Result :unknown
[2020-05-28 00:13:37] [INFO ] Flatten gal took : 121 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 00:13:38] [INFO ] Applying decomposition
[2020-05-28 00:13:38] [INFO ] Flatten gal took : 106 ms
[2020-05-28 00:13:38] [INFO ] Flatten gal took : 81 ms
[2020-05-28 00:13:38] [INFO ] Input system was already deterministic with 579 transitions.
[2020-05-28 00:13:38] [INFO ] Input system was already deterministic with 579 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/graph17316257295427385009.txt, -o, /tmp/graph17316257295427385009.bin, -w, /tmp/graph17316257295427385009.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/graph17316257295427385009.bin, -l, -1, -v, -w, /tmp/graph17316257295427385009.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-28 00:13:38] [INFO ] Decomposing Gal with order
[2020-05-28 00:13:38] [INFO ] Ran tautology test, simplified 0 / 1 in 324 ms.
[2020-05-28 00:13:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 00:13:38] [INFO ] BMC solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(UNSAT) depth K=0 took 19 ms
[2020-05-28 00:13:38] [INFO ] BMC solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(UNSAT) depth K=1 took 15 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 579 rows 429 cols
[2020-05-28 00:13:38] [INFO ] Computed 121 place invariants in 21 ms
inv : p983 + p985 = 1
inv : p129 + p131 + p133 + p135 = 1
inv : p51 + p53 + p55 + p57 = 1
inv : p466 + p468 + p470 + p472 = 1
inv : p398 + p400 = 1
inv : p427 + p429 + p431 + p433 = 1
inv : p792 + p794 + p796 + p798 = 1
inv : p90 + p92 + p94 + p96 = 1
inv : p544 + p546 + p548 + p550 = 1
inv : p724 + p727 + p729 + p731 = 1
inv : p788 + p790 = 1
inv : p1090 + p1092 + p1094 + p1096 = 1
inv : p607 + p610 + p612 + p614 = 1
inv : p671 + p673 = 1
inv : p505 + p507 + p509 + p511 = 1
inv : p349 + p351 + p353 + p355 = 1
inv : p242 + p244 = 1
inv : p710 + p712 = 1
inv : p1012 + p1014 + p1016 + p1018 = 1
inv : p735 + p753 + p755 + p757 + p759 = 1
inv : p388 + p390 + p392 + p394 = 1
inv : p1051 + p1053 + p1055 + p1057 = 1
inv : p125 + p127 = 1
inv : p685 + p688 + p690 + p692 = 1
inv : p246 + p248 + p250 + p252 = 1
inv : p831 + p833 + p835 + p836 + p837 = 1
inv : p1026 + p1028 + p1030 + p1032 = 1
inv : p30 + p32 = 1
inv : p987 + p989 + p991 + p993 = 1
inv : p895 + p897 + p899 + p901 = 1
inv : p735 + p749 + p751 = 1
inv : p973 + p975 + p977 + p979 = 1
inv : p164 + p166 = 1
inv : p714 + p716 + p718 + p720 = 1
inv : p100 + p103 + p105 + p107 = 1
inv : p571 + p573 + p575 + p577 = 1
inv : p1178 + p1180 = 1
inv : p412 + p415 + p417 + p419 = 1
inv : p593 + p595 = 1
inv : p735 + p763 + p766 + p768 + p770 + p772 = 1
inv : p310 + p312 + p314 + p316 = 1
inv : p583 + p585 + p587 + p589 = 1
inv : p700 + p702 + p704 + p706 = 1
inv : p817 + p819 + p821 + p823 = 1
inv : p441 + p443 + p445 + p447 = 1
inv : p334 + p337 + p339 + p341 = 1
inv : p232 + p234 + p236 + p238 = 1
inv : p909 + p911 + p913 + p915 = 1
inv : p1104 + p1106 + p1108 + p1110 = 1
inv : p597 + p599 + p601 + p603 = 1
inv : p958 + p961 + p963 + p965 = 1
inv : p217 + p220 + p222 + p224 = 1
inv : p922 + p924 + p926 + p928 = 1
inv : p997 + p1000 + p1002 + p1004 = 1
inv : p47 + p49 = 1
inv : p519 + p521 + p523 + p525 = 1
inv : p192 + p193 + p195 + p197 + p199 + p201 = 1
inv : p256 + p259 + p261 + p263 = 1
inv : p515 + p517 = 1
inv : p37 + p39 + p41 + p43 = 1
inv : p558 + p560 + p562 + p564 = 1
inv : p115 + p117 + p119 + p121 = 1
inv : p1075 + p1078 + p1080 + p1082 = 1
inv : p295 + p298 + p300 + p302 = 1
inv : p320 + p322 = 1
inv : p841 + p844 + p846 + p848 = 1
inv : p735 + p739 + p741 + p743 + p745 = 1
inv : p1153 + p1156 + p1158 + p1160 = 1
inv : p1061 + p1063 = 1
inv : p281 + p283 = 1
inv : p866 + p868 = 1
inv : p1192 + p1195 + p1197 + p1199 = 1
inv : p1114 + p1117 + p1119 + p1121 = 1
inv : p363 + p365 + p367 + p369 = 1
inv : p618 + p632 + p634 = 1
inv : p324 + p326 + p328 + p330 = 1
inv : p139 + p142 + p144 + p146 = 1
inv : p451 + p454 + p456 + p458 = 1
inv : p476 + p478 = 1
inv : p76 + p78 + p80 + p82 = 1
inv : p883 + p885 + p887 + p889 = 1
inv : p905 + p907 = 1
inv : p178 + p181 + p183 + p185 = 1
inv : p554 + p556 = 1
inv : p827 + p829 = 1
inv : p1100 + p1102 = 1
inv : p86 + p88 = 1
inv : p1168 + p1172 + p1174 = 1
inv : p437 + p439 = 1
inv : p936 + p938 + p940 + p942 = 1
inv : p61 + p64 + p66 + p68 = 1
inv : p1182 + p1184 + p1186 + p1188 = 1
inv : p802 + p805 + p807 + p809 = 1
inv : p1139 + p1141 = 1
inv : p285 + p287 + p289 + p291 = 1
inv : p856 + p858 + p860 + p862 = 1
inv : p1065 + p1067 + p1069 + p1071 = 1
inv : p944 + p946 = 1
inv : p948 + p950 + p952 + p954 = 1
inv : p373 + p376 + p378 + p380 = 1
inv : p402 + p404 + p406 + p408 = 1
inv : p618 + p646 + p649 + p651 + p653 + p655 = 1
inv : p1143 + p1145 + p1147 + p1149 = 1
inv : p661 + p663 + p665 + p667 = 1
inv : p870 + p872 + p874 + p876 = 1
inv : p271 + p273 + p275 + p277 = 1
inv : p1129 + p1131 + p1133 + p1135 = 1
inv : p490 + p493 + p494 + p495 + p497 = 1
inv : p618 + p622 + p624 + p626 + p628 = 1
inv : p154 + p156 + p158 + p160 = 1
inv : p618 + p636 + p638 + p640 + p642 = 1
inv : p529 + p532 + p534 + p536 = 1
inv : p480 + p482 + p484 + p486 = 1
inv : p1022 + p1024 = 1
inv : p1036 + p1039 + p1041 + p1043 = 1
inv : p359 + p361 = 1
inv : p168 + p170 + p172 + p174 = 1
inv : p207 + p209 + p211 + p213 = 1
inv : p675 + p677 + p679 + p681 = 1
inv : p778 + p780 + p782 + p784 = 1
inv : p192 + p203 + p205 = 1
Total of 121 invariants.
[2020-05-28 00:13:38] [INFO ] Computed 121 place invariants in 23 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 579 rows 429 cols
[2020-05-28 00:13:38] [INFO ] Computed 121 place invariants in 2 ms
inv : p983 + p985 = 1
inv : p129 + p131 + p133 + p135 = 1
inv : p51 + p53 + p55 + p57 = 1
inv : p466 + p468 + p470 + p472 = 1
inv : p398 + p400 = 1
inv : p427 + p429 + p431 + p433 = 1
inv : p792 + p794 + p796 + p798 = 1
inv : p90 + p92 + p94 + p96 = 1
inv : p544 + p546 + p548 + p550 = 1
inv : p724 + p727 + p729 + p731 = 1
inv : p788 + p790 = 1
inv : p1090 + p1092 + p1094 + p1096 = 1
inv : p607 + p610 + p612 + p614 = 1
inv : p671 + p673 = 1
inv : p505 + p507 + p509 + p511 = 1
inv : p349 + p351 + p353 + p355 = 1
inv : p242 + p244 = 1
inv : p710 + p712 = 1
inv : p1012 + p1014 + p1016 + p1018 = 1
inv : p735 + p753 + p755 + p757 + p759 = 1
inv : p388 + p390 + p392 + p394 = 1
inv : p1051 + p1053 + p1055 + p1057 = 1
inv : p125 + p127 = 1
inv : p685 + p688 + p690 + p692 = 1
inv : p246 + p248 + p250 + p252 = 1
inv : p831 + p833 + p835 + p836 + p837 = 1
inv : p1026 + p1028 + p1030 + p1032 = 1
inv : p30 + p32 = 1
inv : p987 + p989 + p991 + p993 = 1
inv : p895 + p897 + p899 + p901 = 1
inv : p735 + p749 + p751 = 1
inv : p973 + p975 + p977 + p979 = 1
inv : p164 + p166 = 1
inv : p714 + p716 + p718 + p720 = 1
inv : p100 + p103 + p105 + p107 = 1
inv : p571 + p573 + p575 + p577 = 1
inv : p1178 + p1180 = 1
inv : p412 + p415 + p417 + p419 = 1
inv : p593 + p595 = 1
inv : p735 + p763 + p766 + p768 + p770 + p772 = 1
inv : p310 + p312 + p314 + p316 = 1
inv : p583 + p585 + p587 + p589 = 1
inv : p700 + p702 + p704 + p706 = 1
inv : p817 + p819 + p821 + p823 = 1
inv : p441 + p443 + p445 + p447 = 1
inv : p334 + p337 + p339 + p341 = 1
inv : p232 + p234 + p236 + p238 = 1
inv : p909 + p911 + p913 + p915 = 1
inv : p1104 + p1106 + p1108 + p1110 = 1
inv : p597 + p599 + p601 + p603 = 1
inv : p958 + p961 + p963 + p965 = 1
inv : p217 + p220 + p222 + p224 = 1
inv : p922 + p924 + p926 + p928 = 1
inv : p997 + p1000 + p1002 + p1004 = 1
inv : p47 + p49 = 1
inv : p519 + p521 + p523 + p525 = 1
inv : p192 + p193 + p195 + p197 + p199 + p201 = 1
inv : p256 + p259 + p261 + p263 = 1
inv : p515 + p517 = 1
inv : p37 + p39 + p41 + p43 = 1
inv : p558 + p560 + p562 + p564 = 1
inv : p115 + p117 + p119 + p121 = 1
inv : p1075 + p1078 + p1080 + p1082 = 1
inv : p295 + p298 + p300 + p302 = 1
inv : p320 + p322 = 1
inv : p841 + p844 + p846 + p848 = 1
inv : p735 + p739 + p741 + p743 + p745 = 1
inv : p1153 + p1156 + p1158 + p1160 = 1
inv : p1061 + p1063 = 1
inv : p281 + p283 = 1
inv : p866 + p868 = 1
inv : p1192 + p1195 + p1197 + p1199 = 1
inv : p1114 + p1117 + p1119 + p1121 = 1
inv : p363 + p365 + p367 + p369 = 1
inv : p618 + p632 + p634 = 1
inv : p324 + p326 + p328 + p330 = 1
inv : p139 + p142 + p144 + p146 = 1
inv : p451 + p454 + p456 + p458 = 1
inv : p476 + p478 = 1
inv : p76 + p78 + p80 + p82 = 1
inv : p883 + p885 + p887 + p889 = 1
inv : p905 + p907 = 1
inv : p178 + p181 + p183 + p185 = 1
inv : p554 + p556 = 1
inv : p827 + p829 = 1
inv : p1100 + p1102 = 1
inv : p86 + p88 = 1
inv : p1168 + p1172 + p1174 = 1
inv : p437 + p439 = 1
inv : p936 + p938 + p940 + p942 = 1
inv : p61 + p64 + p66 + p68 = 1
inv : p1182 + p1184 + p1186 + p1188 = 1
inv : p802 + p805 + p807 + p809 = 1
inv : p1139 + p1141 = 1
inv : p285 + p287 + p289 + p291 = 1
inv : p856 + p858 + p860 + p862 = 1
inv : p1065 + p1067 + p1069 + p1071 = 1
inv : p944 + p946 = 1
inv : p948 + p950 + p952 + p954 = 1
inv : p373 + p376 + p378 + p380 = 1
inv : p402 + p404 + p406 + p408 = 1
inv : p618 + p646 + p649 + p651 + p653 + p655 = 1
inv : p1143 + p1145 + p1147 + p1149 = 1
inv : p661 + p663 + p665 + p667 = 1
inv : p870 + p872 + p874 + p876 = 1
inv : p271 + p273 + p275 + p277 = 1
inv : p1129 + p1131 + p1133 + p1135 = 1
inv : p490 + p493 + p494 + p495 + p497 = 1
inv : p618 + p622 + p624 + p626 + p628 = 1
inv : p154 + p156 + p158 + p160 = 1
inv : p618 + p636 + p638 + p640 + p642 = 1
inv : p529 + p532 + p534 + p536 = 1
inv : p480 + p482 + p484 + p486 = 1
inv : p1022 + p1024 = 1
inv : p1036 + p1039 + p1041 + p1043 = 1
inv : p359 + p361 = 1
inv : p168 + p170 + p172 + p174 = 1
inv : p207 + p209 + p211 + p213 = 1
inv : p675 + p677 + p679 + p681 = 1
inv : p778 + p780 + p782 + p784 = 1
inv : p192 + p203 + p205 = 1
Total of 121 invariants.
[2020-05-28 00:13:38] [INFO ] Computed 121 place invariants in 13 ms
[2020-05-28 00:13:38] [INFO ] Removed a total of 664 redundant transitions.
[2020-05-28 00:13:38] [INFO ] BMC solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(UNSAT) depth K=2 took 267 ms
[2020-05-28 00:13:38] [INFO ] Flatten gal took : 201 ms
[2020-05-28 00:13:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 693 labels/synchronizations in 22 ms.
[2020-05-28 00:13:38] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 8 ms
[2020-05-28 00:13:38] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 0 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 : ShieldRVs-PT-030B-ReachabilityFireability-11 with value :((((((i0.i1.u4.p80!=1)||(i7.i2.u65.p763!=1))||(i4.i1.u41.p494==1))||((i6.i0.u50.p603!=1)&&(i8.i1.u72.p848!=1)))||((i6.i1.u55.p646==1)&&(i12.i1.u103.p1186==1)))||((i8.i1.u71.p836==1)&&(i1.i1.u15.p193==1)))
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 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 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 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 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 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 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
[2020-05-28 00:13:39] [INFO ] BMC solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(UNSAT) depth K=3 took 648 ms
SDD proceeding with computation, new max is 4096
[2020-05-28 00:13:39] [INFO ] Proved 429 variables to be positive in 997 ms
[2020-05-28 00:13:39] [INFO ] Computing symmetric may disable matrix : 579 transitions.
[2020-05-28 00:13:39] [INFO ] Computation of disable matrix completed :0/579 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 00:13:39] [INFO ] Computation of Complete disable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 00:13:39] [INFO ] Computing symmetric may enable matrix : 579 transitions.
[2020-05-28 00:13:39] [INFO ] Computation of Complete enable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 00:13:39] [INFO ] Proved 429 variables to be positive in 1123 ms
[2020-05-28 00:13:39] [INFO ] Computing symmetric co enabling matrix : 579 transitions.
[2020-05-28 00:13:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-030B-ReachabilityFireability-11
[2020-05-28 00:13:39] [INFO ] KInduction solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(SAT) depth K=0 took 20 ms
[2020-05-28 00:13:39] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-030B-ReachabilityFireability-11
[2020-05-28 00:13:39] [INFO ] KInduction solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(SAT) depth K=1 took 60 ms
SDD proceeding with computation, new max is 8192
[2020-05-28 00:13:43] [INFO ] Computation of co-enabling matrix(163/579) took 3145 ms. Total solver calls (SAT/UNSAT): 2206(279/1927)
SDD proceeding with computation, new max is 16384
[2020-05-28 00:13:46] [INFO ] Computation of co-enabling matrix(310/579) took 6149 ms. Total solver calls (SAT/UNSAT): 4504(547/3957)
[2020-05-28 00:13:49] [INFO ] Computation of co-enabling matrix(555/579) took 9153 ms. Total solver calls (SAT/UNSAT): 6619(720/5899)
[2020-05-28 00:13:49] [INFO ] Computation of Finished co-enabling matrix. took 9367 ms. Total solver calls (SAT/UNSAT): 6643(720/5923)
[2020-05-28 00:13:49] [INFO ] Computing Do-Not-Accords matrix : 579 transitions.
[2020-05-28 00:13:49] [INFO ] Computation of Completed DNA matrix. took 81 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 00:13:49] [INFO ] Built C files in 11434ms 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 6313 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 60 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldRVsPT030BReachabilityFireability11==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, ShieldRVsPT030BReachabilityFireability11==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, ShieldRVsPT030BReachabilityFireability11==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 32768
[2020-05-28 00:14:14] [INFO ] BMC solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(UNSAT) depth K=4 took 35032 ms
[2020-05-28 00:14:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-030B-ReachabilityFireability-11
[2020-05-28 00:14:29] [INFO ] KInduction solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(SAT) depth K=2 took 49486 ms
[2020-05-28 00:14:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-030B-ReachabilityFireability-11
[2020-05-28 00:14:58] [INFO ] KInduction solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(SAT) depth K=3 took 28737 ms
[2020-05-28 00:15:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-030B-ReachabilityFireability-11
[2020-05-28 00:15:24] [INFO ] KInduction solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(SAT) depth K=4 took 26442 ms
[2020-05-28 00:15:28] [INFO ] BMC solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(UNSAT) depth K=5 took 74271 ms
SDD proceeding with computation, new max is 65536
[2020-05-28 00:16:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-030B-ReachabilityFireability-11
[2020-05-28 00:16:09] [INFO ] KInduction solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(SAT) depth K=5 took 44695 ms
SDD proceeding with computation, new max is 131072
[2020-05-28 00:18:32] [INFO ] BMC solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(UNSAT) depth K=6 took 183452 ms
[2020-05-28 00:19:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-030B-ReachabilityFireability-11
[2020-05-28 00:19:05] [INFO ] KInduction solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(SAT) depth K=6 took 176310 ms
[2020-05-28 00:25:39] [INFO ] BMC solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(UNSAT) depth K=7 took 426831 ms
[2020-05-28 00:27:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldRVs-PT-030B-ReachabilityFireability-11
[2020-05-28 00:27:16] [INFO ] KInduction solution for property ShieldRVs-PT-030B-ReachabilityFireability-11(SAT) depth K=7 took 490727 ms
SDD proceeding with computation, new max is 262144
Detected timeout of ITS tools.
[2020-05-28 00:34:42] [INFO ] Applying decomposition
[2020-05-28 00:34:42] [INFO ] Flatten gal took : 64 ms
[2020-05-28 00:34:42] [INFO ] Decomposing Gal with order
[2020-05-28 00:34:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 00:34:42] [INFO ] Removed a total of 688 redundant transitions.
[2020-05-28 00:34:42] [INFO ] Flatten gal took : 122 ms
[2020-05-28 00:34:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 1050 labels/synchronizations in 43 ms.
[2020-05-28 00:34:42] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 9 ms
[2020-05-28 00:34:42] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 0 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 : ShieldRVs-PT-030B-ReachabilityFireability-11 with value :((((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u41.p80!=1)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u163.p763!=1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u114.p494==1))||((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u134.p603!=1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u177.p848!=1)))||((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u142.p646==1)&&(i1.i0.u239.p1186==1)))||((i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u176.p836==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u62.p193==1)))
built 1 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 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
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
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,6.87186e+19,124.01,1000660,2389,42,1.27473e+06,82,539,6.09891e+06,76,702,0
Total reachable state count : 68718567919764377396

Verifying 1 reachability properties.
Invariant property ShieldRVs-PT-030B-ReachabilityFireability-11 is true.
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-11 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
ShieldRVs-PT-030B-ReachabilityFireability-11,0,124.189,1000660,1,0,1.27473e+06,82,697,6.09891e+06,82,702,1696
[2020-05-28 00:36:46] [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-28 00:36:46] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldRVs-PT-030B-ReachabilityFireability-11 SMT depth 8
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-28 00:36:46] [INFO ] During BMC, SMT solver timed out at depth 8
[2020-05-28 00:36:46] [INFO ] BMC solving timed out (3600000 secs) at depth 8
[2020-05-28 00:36:46] [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.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-28 00:36:46] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldRVs-PT-030B-ReachabilityFireability-11 K-induction depth 8
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-28 00:36:46] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.

BK_STOP 1590626207334

--------------------
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="ShieldRVs-PT-030B"
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 ShieldRVs-PT-030B, 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-159033476300871"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-030B.tgz
mv ShieldRVs-PT-030B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;