fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r389-oct2-167903713100063
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ShieldIIPs-PT-004B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5490.579 3600000.00 10695121.00 84.00 FTFF??TTTFF?TTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713100063.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldIIPs-PT-004B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713100063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 16:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 66K Mar 5 18:23 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 ShieldIIPs-PT-004B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-004B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679165083933

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-004B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-18 18:44:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 18:44:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:44:46] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-18 18:44:46] [INFO ] Transformed 243 places.
[2023-03-18 18:44:46] [INFO ] Transformed 239 transitions.
[2023-03-18 18:44:46] [INFO ] Found NUPN structural information;
[2023-03-18 18:44:46] [INFO ] Parsed PT model containing 243 places and 239 transitions and 718 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 16) seen :11
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-18 18:44:46] [INFO ] Flatten gal took : 90 ms
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
[2023-03-18 18:44:46] [INFO ] Flatten gal took : 32 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
[2023-03-18 18:44:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7360021693260985510.gal : 15 ms
[2023-03-18 18:44:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4637508205966687183.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7360021693260985510.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4637508205966687183.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4637508205966687183.prop.
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 13
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :13 after 112
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :112 after 1137
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1137 after 641848
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :641848 after 3.26956e+10
SDD proceeding with computation,5 properties remain. new max is 512
Running SMT prover for 5 properties.
SDD size :1.29511e+11 after 2.07631e+11
// Phase 1: matrix 239 rows 243 cols
[2023-03-18 18:44:47] [INFO ] Computed 37 place invariants in 9 ms
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2.07631e+11 after 2.07631e+11
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :2.07631e+11 after 2.07633e+11
[2023-03-18 18:44:47] [INFO ] After 350ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 18:44:47] [INFO ] [Nat]Absence check using 37 positive place invariants in 119 ms returned sat
[2023-03-18 18:44:48] [INFO ] After 464ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-18 18:44:48] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 7 ms to minimize.
[2023-03-18 18:44:48] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2023-03-18 18:44:48] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-03-18 18:44:48] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2023-03-18 18:44:48] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2023-03-18 18:44:49] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 0 ms to minimize.
[2023-03-18 18:44:49] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2023-03-18 18:44:49] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2023-03-18 18:44:49] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-18 18:44:49] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 12 ms to minimize.
[2023-03-18 18:44:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1090 ms
[2023-03-18 18:44:49] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2023-03-18 18:44:49] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
[2023-03-18 18:44:49] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2023-03-18 18:44:49] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2023-03-18 18:44:49] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2023-03-18 18:44:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 464 ms
[2023-03-18 18:44:50] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2023-03-18 18:44:50] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 1 ms to minimize.
[2023-03-18 18:44:50] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-18 18:44:50] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2023-03-18 18:44:50] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2023-03-18 18:44:50] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2023-03-18 18:44:50] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 14 ms to minimize.
[2023-03-18 18:44:50] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2023-03-18 18:44:50] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2023-03-18 18:44:51] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2023-03-18 18:44:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1017 ms
[2023-03-18 18:44:51] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2023-03-18 18:44:51] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2023-03-18 18:44:51] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-03-18 18:44:51] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2023-03-18 18:44:51] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2023-03-18 18:44:51] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2023-03-18 18:44:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 390 ms
[2023-03-18 18:44:51] [INFO ] After 3664ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 310 ms.
[2023-03-18 18:44:51] [INFO ] After 4345ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 112 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 239/239 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 243 transition count 233
Reduce places removed 6 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 11 rules applied. Total rules applied 17 place count 237 transition count 228
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 22 place count 232 transition count 228
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 22 place count 232 transition count 222
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 34 place count 226 transition count 222
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 42 place count 218 transition count 214
Iterating global reduction 3 with 8 rules applied. Total rules applied 50 place count 218 transition count 214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 50 place count 218 transition count 213
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 217 transition count 213
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 108 place count 189 transition count 185
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 189 transition count 185
Applied a total of 113 rules in 83 ms. Remains 189 /243 variables (removed 54) and now considering 185/239 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 189/243 places, 185/239 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :1
FORMULA ShieldIIPs-PT-004B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 185 rows 189 cols
[2023-03-18 18:44:52] [INFO ] Computed 37 place invariants in 5 ms
[2023-03-18 18:44:52] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 18:44:52] [INFO ] [Nat]Absence check using 37 positive place invariants in 18 ms returned sat
[2023-03-18 18:44:52] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 18:44:53] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2023-03-18 18:44:53] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-18 18:44:53] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 0 ms to minimize.
[2023-03-18 18:44:53] [INFO ] Deduced a trap composed of 21 places in 323 ms of which 0 ms to minimize.
[2023-03-18 18:44:53] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-18 18:44:53] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2023-03-18 18:44:53] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2023-03-18 18:44:53] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2023-03-18 18:44:54] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 0 ms to minimize.
[2023-03-18 18:44:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1354 ms
[2023-03-18 18:44:54] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2023-03-18 18:44:54] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2023-03-18 18:44:54] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2023-03-18 18:44:54] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 13 ms to minimize.
[2023-03-18 18:44:54] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2023-03-18 18:44:54] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 4 ms to minimize.
[2023-03-18 18:44:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 338 ms
[2023-03-18 18:44:54] [INFO ] After 2215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 184 ms.
[2023-03-18 18:44:54] [INFO ] After 2520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 67 ms.
Support contains 104 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 185/185 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 188 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 188 transition count 184
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 184 transition count 180
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 184 transition count 180
Applied a total of 11 rules in 24 ms. Remains 184 /189 variables (removed 5) and now considering 180/185 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 184/189 places, 180/185 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 809696 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :{}
Probabilistic random walk after 809696 steps, saw 137639 distinct states, run finished after 3002 ms. (steps per millisecond=269 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 180 rows 184 cols
[2023-03-18 18:44:58] [INFO ] Computed 37 place invariants in 5 ms
[2023-03-18 18:44:58] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 18:44:58] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-18 18:44:58] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 18:44:58] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2023-03-18 18:44:58] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2023-03-18 18:44:58] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2023-03-18 18:44:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 272 ms
[2023-03-18 18:44:58] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2023-03-18 18:44:59] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2023-03-18 18:44:59] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-18 18:44:59] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2023-03-18 18:44:59] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2023-03-18 18:44:59] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2023-03-18 18:44:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 384 ms
[2023-03-18 18:44:59] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2023-03-18 18:44:59] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2023-03-18 18:44:59] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2023-03-18 18:44:59] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-03-18 18:44:59] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2023-03-18 18:44:59] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-03-18 18:44:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 412 ms
[2023-03-18 18:44:59] [INFO ] After 1617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-18 18:45:00] [INFO ] After 1868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 23 ms.
Support contains 104 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 184/184 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-18 18:45:00] [INFO ] Invariant cache hit.
[2023-03-18 18:45:00] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-18 18:45:00] [INFO ] Invariant cache hit.
[2023-03-18 18:45:00] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-18 18:45:00] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-18 18:45:00] [INFO ] Invariant cache hit.
[2023-03-18 18:45:00] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 437 ms. Remains : 184/184 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-18 18:45:00] [INFO ] Invariant cache hit.
[2023-03-18 18:45:00] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 18:45:00] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-18 18:45:00] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 18:45:00] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2023-03-18 18:45:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-18 18:45:01] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2023-03-18 18:45:01] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2023-03-18 18:45:01] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2023-03-18 18:45:01] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2023-03-18 18:45:01] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2023-03-18 18:45:01] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2023-03-18 18:45:01] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2023-03-18 18:45:01] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2023-03-18 18:45:01] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-18 18:45:01] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2023-03-18 18:45:02] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 0 ms to minimize.
[2023-03-18 18:45:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1001 ms
[2023-03-18 18:45:02] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2023-03-18 18:45:02] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-03-18 18:45:02] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-18 18:45:02] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2023-03-18 18:45:02] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 0 ms to minimize.
[2023-03-18 18:45:02] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2023-03-18 18:45:02] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2023-03-18 18:45:02] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2023-03-18 18:45:02] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2023-03-18 18:45:02] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2023-03-18 18:45:02] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2023-03-18 18:45:03] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2023-03-18 18:45:03] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2023-03-18 18:45:03] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 913 ms
[2023-03-18 18:45:03] [INFO ] After 2364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 190 ms.
[2023-03-18 18:45:03] [INFO ] After 2618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-18 18:45:03] [INFO ] Flatten gal took : 50 ms
[2023-03-18 18:45:03] [INFO ] Flatten gal took : 11 ms
[2023-03-18 18:45:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4933708858905682863.gal : 16 ms
[2023-03-18 18:45:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3428161035852849220.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4933708858905682863.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3428161035852849220.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3428161035852849220.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :6 after 32
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :32 after 583
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :583 after 2323
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :2323 after 719799
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :719799 after 1.04698e+06
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.01884e+08 after 1.41815e+08
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.41815e+08 after 1.41835e+08
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.41835e+08 after 1.42741e+08
Detected timeout of ITS tools.
[2023-03-18 18:45:18] [INFO ] Flatten gal took : 44 ms
[2023-03-18 18:45:18] [INFO ] Applying decomposition
[2023-03-18 18:45:18] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8380901002649638434.txt' '-o' '/tmp/graph8380901002649638434.bin' '-w' '/tmp/graph8380901002649638434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8380901002649638434.bin' '-l' '-1' '-v' '-w' '/tmp/graph8380901002649638434.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:45:18] [INFO ] Decomposing Gal with order
[2023-03-18 18:45:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:45:18] [INFO ] Removed a total of 90 redundant transitions.
[2023-03-18 18:45:18] [INFO ] Flatten gal took : 48 ms
[2023-03-18 18:45:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 9 ms.
[2023-03-18 18:45:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16067733428077576677.gal : 5 ms
[2023-03-18 18:45:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17170399804215978283.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16067733428077576677.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17170399804215978283.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality17170399804215978283.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 77
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :77 after 392549
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.46053e+08 after 2.12013e+08
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :6.99642e+08 after 2.99622e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin294359969259701763
[2023-03-18 18:45:33] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin294359969259701763
Running compilation step : cd /tmp/ltsmin294359969259701763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 450 ms.
Running link step : cd /tmp/ltsmin294359969259701763;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin294359969259701763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldIIPsPT004BReachabilityFireability04==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 18:45:49] [INFO ] Flatten gal took : 12 ms
[2023-03-18 18:45:49] [INFO ] Applying decomposition
[2023-03-18 18:45:49] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16284842548271549576.txt' '-o' '/tmp/graph16284842548271549576.bin' '-w' '/tmp/graph16284842548271549576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16284842548271549576.bin' '-l' '-1' '-v' '-w' '/tmp/graph16284842548271549576.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:45:49] [INFO ] Decomposing Gal with order
[2023-03-18 18:45:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:45:49] [INFO ] Removed a total of 92 redundant transitions.
[2023-03-18 18:45:49] [INFO ] Flatten gal took : 19 ms
[2023-03-18 18:45:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-18 18:45:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4248723081337936039.gal : 3 ms
[2023-03-18 18:45:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14177961952409718130.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4248723081337936039.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14177961952409718130.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14177961952409718130.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 103
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :103 after 1.92555e+06
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :6.90241e+09 after 1.98717e+11
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.98717e+11 after 4.53271e+13
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-18 19:15:49] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16972676183267145935
[2023-03-18 19:15:49] [INFO ] Computing symmetric may disable matrix : 180 transitions.
[2023-03-18 19:15:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:15:49] [INFO ] Computing symmetric may enable matrix : 180 transitions.
[2023-03-18 19:15:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:15:49] [INFO ] Applying decomposition
[2023-03-18 19:15:49] [INFO ] Flatten gal took : 19 ms
[2023-03-18 19:15:49] [INFO ] Computing Do-Not-Accords matrix : 180 transitions.
[2023-03-18 19:15:49] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 19:15:49] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16972676183267145935
Running compilation step : cd /tmp/ltsmin16972676183267145935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1506139370069344072.txt' '-o' '/tmp/graph1506139370069344072.bin' '-w' '/tmp/graph1506139370069344072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1506139370069344072.bin' '-l' '-1' '-v' '-w' '/tmp/graph1506139370069344072.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:15:49] [INFO ] Decomposing Gal with order
[2023-03-18 19:15:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:15:49] [INFO ] Removed a total of 91 redundant transitions.
[2023-03-18 19:15:49] [INFO ] Flatten gal took : 16 ms
[2023-03-18 19:15:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 5 ms.
[2023-03-18 19:15:49] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17768801167005478477.gal : 3 ms
[2023-03-18 19:15:49] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6372287550957542408.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability17768801167005478477.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6372287550957542408.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability6372287550957542408.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 87
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :87 after 392619
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.46053e+08 after 3.24833e+08
Compilation finished in 395 ms.
Running link step : cd /tmp/ltsmin16972676183267145935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin16972676183267145935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT004BReachabilityFireability04==true'
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3.24833e+08 after 2.37188e+12
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin16972676183267145935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT004BReachabilityFireability04==true'
Running LTSmin : cd /tmp/ltsmin16972676183267145935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT004BReachabilityFireability05==true'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 10903228 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16074304 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldIIPs-PT-004B"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5348"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-004B, 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 r389-oct2-167903713100063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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