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-167903713900702.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 ShieldPPPt-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713900702
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 1.9M 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 ShieldPPPt-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679223878709

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-19 11:04:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 11:04:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 11:04:41] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2023-03-19 11:04:41] [INFO ] Transformed 7803 places.
[2023-03-19 11:04:41] [INFO ] Transformed 7103 transitions.
[2023-03-19 11:04:41] [INFO ] Found NUPN structural information;
[2023-03-19 11:04:41] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 758 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 13) seen :3
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
[2023-03-19 11:04:42] [INFO ] Flatten gal took : 490 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
[2023-03-19 11:04:43] [INFO ] Flatten gal took : 295 ms
[2023-03-19 11:04:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13367382703314509955.gal : 78 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 10) seen :0
[2023-03-19 11:04:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6792397393382246947.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/ReachabilityCardinality13367382703314509955.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6792397393382246947.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 ...329
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 7103 rows 7803 cols
[2023-03-19 11:04:43] [INFO ] Computed 1101 place invariants in 74 ms
Loading property file /tmp/ReachabilityCardinality6792397393382246947.prop.
[2023-03-19 11:04:46] [INFO ] After 2753ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 11:04:49] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1010 ms returned sat
[2023-03-19 11:05:05] [INFO ] After 13695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 11:05:11] [INFO ] After 19951ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 11:05:11] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 3690 ms.
Support contains 112 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1824 transitions
Trivial Post-agglo rules discarded 1824 transitions
Performed 1824 trivial Post agglomeration. Transition count delta: 1824
Iterating post reduction 0 with 1824 rules applied. Total rules applied 1824 place count 7803 transition count 5279
Reduce places removed 1824 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1826 rules applied. Total rules applied 3650 place count 5979 transition count 5277
Reduce places removed 1 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 2 with 34 rules applied. Total rules applied 3684 place count 5978 transition count 5244
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 3717 place count 5945 transition count 5244
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 402 Pre rules applied. Total rules applied 3717 place count 5945 transition count 4842
Deduced a syphon composed of 402 places in 27 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 4 with 804 rules applied. Total rules applied 4521 place count 5543 transition count 4842
Discarding 679 places :
Symmetric choice reduction at 4 with 679 rule applications. Total rules 5200 place count 4864 transition count 4163
Iterating global reduction 4 with 679 rules applied. Total rules applied 5879 place count 4864 transition count 4163
Performed 281 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 281 Pre rules applied. Total rules applied 5879 place count 4864 transition count 3882
Deduced a syphon composed of 281 places in 54 ms
Reduce places removed 281 places and 0 transitions.
Iterating global reduction 4 with 562 rules applied. Total rules applied 6441 place count 4583 transition count 3882
Performed 1644 Post agglomeration using F-continuation condition.Transition count delta: 1644
Deduced a syphon composed of 1644 places in 10 ms
Reduce places removed 1644 places and 0 transitions.
Iterating global reduction 4 with 3288 rules applied. Total rules applied 9729 place count 2939 transition count 2238
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9931 place count 2838 transition count 2238
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 10 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10133 place count 2737 transition count 2238
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 78 places in 5 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 10289 place count 2659 transition count 2238
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 10296 place count 2659 transition count 2231
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 10303 place count 2652 transition count 2231
Partial Free-agglomeration rule applied 290 times.
Drop transitions removed 290 transitions
Iterating global reduction 5 with 290 rules applied. Total rules applied 10593 place count 2652 transition count 2231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10594 place count 2651 transition count 2230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10595 place count 2650 transition count 2230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10595 place count 2650 transition count 2228
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 10599 place count 2648 transition count 2228
Applied a total of 10599 rules in 3625 ms. Remains 2648 /7803 variables (removed 5155) and now considering 2228/7103 (removed 4875) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3625 ms. Remains : 2648/7803 places, 2228/7103 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :69 after 118
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :118 after 5935
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :5935 after 9.17035e+07
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :9.17035e+07 after 4.01557e+14
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :4.01557e+14 after 4.83162e+30
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :4.83162e+30 after 6.79827e+72
Interrupted probabilistic random walk after 42159 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 42159 steps, saw 27245 distinct states, run finished after 3004 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2228 rows 2648 cols
[2023-03-19 11:05:23] [INFO ] Computed 1100 place invariants in 10 ms
[2023-03-19 11:05:23] [INFO ] After 694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 11:05:24] [INFO ] [Nat]Absence check using 1100 positive place invariants in 252 ms returned sat
[2023-03-19 11:05:28] [INFO ] After 3144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 11:05:28] [INFO ] State equation strengthened by 275 read => feed constraints.
[2023-03-19 11:05:30] [INFO ] After 2208ms SMT Verify possible using 275 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-19 11:05:31] [INFO ] Deduced a trap composed of 5 places in 339 ms of which 7 ms to minimize.
[2023-03-19 11:05:31] [INFO ] Deduced a trap composed of 7 places in 356 ms of which 1 ms to minimize.
[2023-03-19 11:05:31] [INFO ] Deduced a trap composed of 7 places in 310 ms of which 1 ms to minimize.
[2023-03-19 11:05:32] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 2 ms to minimize.
[2023-03-19 11:05:32] [INFO ] Deduced a trap composed of 3 places in 307 ms of which 1 ms to minimize.
[2023-03-19 11:05:33] [INFO ] Deduced a trap composed of 3 places in 388 ms of which 1 ms to minimize.
[2023-03-19 11:05:33] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 0 ms to minimize.
[2023-03-19 11:05:34] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2023-03-19 11:05:34] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 0 ms to minimize.
[2023-03-19 11:05:34] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 1 ms to minimize.
[2023-03-19 11:05:35] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 2 ms to minimize.
[2023-03-19 11:05:35] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 1 ms to minimize.
[2023-03-19 11:05:35] [INFO ] Deduced a trap composed of 9 places in 332 ms of which 1 ms to minimize.
[2023-03-19 11:05:36] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 1 ms to minimize.
[2023-03-19 11:05:36] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2023-03-19 11:05:36] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 0 ms to minimize.
[2023-03-19 11:05:37] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 1 ms to minimize.
[2023-03-19 11:05:37] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 1 ms to minimize.
[2023-03-19 11:05:38] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 1 ms to minimize.
[2023-03-19 11:05:38] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2023-03-19 11:05:38] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2023-03-19 11:05:39] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 13 ms to minimize.
[2023-03-19 11:05:39] [INFO ] Deduced a trap composed of 11 places in 584 ms of which 29 ms to minimize.
[2023-03-19 11:05:39] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 9206 ms
[2023-03-19 11:05:40] [INFO ] Deduced a trap composed of 10 places in 306 ms of which 0 ms to minimize.
[2023-03-19 11:05:41] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2023-03-19 11:05:41] [INFO ] Deduced a trap composed of 8 places in 301 ms of which 1 ms to minimize.
[2023-03-19 11:05:41] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 1 ms to minimize.
[2023-03-19 11:05:42] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 15 ms to minimize.
[2023-03-19 11:05:42] [INFO ] Deduced a trap composed of 10 places in 359 ms of which 0 ms to minimize.
[2023-03-19 11:05:43] [INFO ] Deduced a trap composed of 12 places in 292 ms of which 1 ms to minimize.
[2023-03-19 11:05:43] [INFO ] Deduced a trap composed of 9 places in 286 ms of which 1 ms to minimize.
[2023-03-19 11:05:43] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 0 ms to minimize.
[2023-03-19 11:05:44] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 1 ms to minimize.
[2023-03-19 11:05:44] [INFO ] Deduced a trap composed of 9 places in 299 ms of which 5 ms to minimize.
[2023-03-19 11:05:44] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4457 ms
[2023-03-19 11:05:45] [INFO ] Deduced a trap composed of 8 places in 362 ms of which 1 ms to minimize.
[2023-03-19 11:05:46] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2023-03-19 11:05:46] [INFO ] Deduced a trap composed of 8 places in 312 ms of which 1 ms to minimize.
[2023-03-19 11:05:47] [INFO ] Deduced a trap composed of 8 places in 396 ms of which 0 ms to minimize.
[2023-03-19 11:05:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1806 ms
[2023-03-19 11:05:48] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2023-03-19 11:05:48] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 1 ms to minimize.
[2023-03-19 11:05:49] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 11:05:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 11:05:49] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1652 ms.
Support contains 112 out of 2648 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2648/2648 places, 2228/2228 transitions.
Applied a total of 0 rules in 115 ms. Remains 2648 /2648 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 2648/2648 places, 2228/2228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2648/2648 places, 2228/2228 transitions.
Applied a total of 0 rules in 106 ms. Remains 2648 /2648 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-19 11:05:50] [INFO ] Invariant cache hit.
[2023-03-19 11:05:52] [INFO ] Implicit Places using invariants in 2067 ms returned [2629, 2633]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2087 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2646/2648 places, 2228/2228 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2644 transition count 2226
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2644 transition count 2226
Applied a total of 4 rules in 231 ms. Remains 2644 /2646 variables (removed 2) and now considering 2226/2228 (removed 2) transitions.
// Phase 1: matrix 2226 rows 2644 cols
[2023-03-19 11:05:53] [INFO ] Computed 1098 place invariants in 16 ms
[2023-03-19 11:05:54] [INFO ] Implicit Places using invariants in 1733 ms returned []
[2023-03-19 11:05:54] [INFO ] Invariant cache hit.
[2023-03-19 11:05:56] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-19 11:06:07] [INFO ] Implicit Places using invariants and state equation in 12384 ms returned []
Implicit Place search using SMT with State Equation took 14140 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2644/2648 places, 2226/2228 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16565 ms. Remains : 2644/2648 places, 2226/2228 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 42840 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 42840 steps, saw 27724 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-19 11:06:12] [INFO ] Invariant cache hit.
[2023-03-19 11:06:12] [INFO ] After 705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 11:06:14] [INFO ] [Nat]Absence check using 1098 positive place invariants in 476 ms returned sat
[2023-03-19 11:06:17] [INFO ] After 3104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 11:06:17] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-19 11:06:20] [INFO ] After 2375ms SMT Verify possible using 273 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-19 11:06:20] [INFO ] Deduced a trap composed of 4 places in 597 ms of which 2 ms to minimize.
[2023-03-19 11:06:21] [INFO ] Deduced a trap composed of 4 places in 624 ms of which 2 ms to minimize.
[2023-03-19 11:06:22] [INFO ] Deduced a trap composed of 5 places in 611 ms of which 2 ms to minimize.
[2023-03-19 11:06:23] [INFO ] Deduced a trap composed of 4 places in 646 ms of which 2 ms to minimize.
[2023-03-19 11:06:23] [INFO ] Deduced a trap composed of 5 places in 589 ms of which 1 ms to minimize.
[2023-03-19 11:06:24] [INFO ] Deduced a trap composed of 7 places in 473 ms of which 1 ms to minimize.
[2023-03-19 11:06:25] [INFO ] Deduced a trap composed of 7 places in 1273 ms of which 2 ms to minimize.
[2023-03-19 11:06:26] [INFO ] Deduced a trap composed of 5 places in 621 ms of which 1 ms to minimize.
[2023-03-19 11:06:27] [INFO ] Deduced a trap composed of 7 places in 401 ms of which 2 ms to minimize.
[2023-03-19 11:06:27] [INFO ] Deduced a trap composed of 3 places in 504 ms of which 1 ms to minimize.
[2023-03-19 11:06:28] [INFO ] Deduced a trap composed of 4 places in 462 ms of which 1 ms to minimize.
[2023-03-19 11:06:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 8236 ms
[2023-03-19 11:06:29] [INFO ] Deduced a trap composed of 5 places in 500 ms of which 1 ms to minimize.
[2023-03-19 11:06:30] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 1 ms to minimize.
[2023-03-19 11:06:30] [INFO ] Deduced a trap composed of 6 places in 438 ms of which 2 ms to minimize.
[2023-03-19 11:06:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1783 ms
[2023-03-19 11:06:31] [INFO ] Deduced a trap composed of 7 places in 803 ms of which 25 ms to minimize.
[2023-03-19 11:06:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1055 ms
[2023-03-19 11:06:33] [INFO ] Deduced a trap composed of 7 places in 1033 ms of which 14 ms to minimize.
[2023-03-19 11:06:34] [INFO ] Deduced a trap composed of 7 places in 929 ms of which 2 ms to minimize.
[2023-03-19 11:06:35] [INFO ] Deduced a trap composed of 5 places in 820 ms of which 1 ms to minimize.
[2023-03-19 11:06:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3238 ms
[2023-03-19 11:06:36] [INFO ] After 18501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1612 ms.
[2023-03-19 11:06:37] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 528 ms.
Support contains 112 out of 2644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2644/2644 places, 2226/2226 transitions.
Applied a total of 0 rules in 156 ms. Remains 2644 /2644 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 2644/2644 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2644/2644 places, 2226/2226 transitions.
Applied a total of 0 rules in 196 ms. Remains 2644 /2644 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2023-03-19 11:06:38] [INFO ] Invariant cache hit.
[2023-03-19 11:06:41] [INFO ] Implicit Places using invariants in 2447 ms returned []
[2023-03-19 11:06:41] [INFO ] Invariant cache hit.
[2023-03-19 11:06:43] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-19 11:06:53] [INFO ] Implicit Places using invariants and state equation in 11924 ms returned []
Implicit Place search using SMT with State Equation took 14386 ms to find 0 implicit places.
[2023-03-19 11:06:53] [INFO ] Redundant transitions in 216 ms returned []
[2023-03-19 11:06:53] [INFO ] Invariant cache hit.
[2023-03-19 11:06:55] [INFO ] Dead Transitions using invariants and state equation in 1816 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16626 ms. Remains : 2644/2644 places, 2226/2226 transitions.
Partial Free-agglomeration rule applied 564 times.
Drop transitions removed 564 transitions
Iterating global reduction 0 with 564 rules applied. Total rules applied 564 place count 2644 transition count 2226
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 565 place count 2644 transition count 2225
Applied a total of 565 rules in 366 ms. Remains 2644 /2644 variables (removed 0) and now considering 2225/2226 (removed 1) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 2225 rows 2644 cols
[2023-03-19 11:06:55] [INFO ] Computed 1098 place invariants in 15 ms
[2023-03-19 11:06:56] [INFO ] After 921ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 11:06:58] [INFO ] [Nat]Absence check using 1098 positive place invariants in 612 ms returned sat
[2023-03-19 11:07:01] [INFO ] After 2979ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 11:07:01] [INFO ] State equation strengthened by 525 read => feed constraints.
[2023-03-19 11:07:06] [INFO ] After 4857ms SMT Verify possible using 525 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-19 11:07:07] [INFO ] Deduced a trap composed of 6 places in 653 ms of which 2 ms to minimize.
[2023-03-19 11:07:08] [INFO ] Deduced a trap composed of 5 places in 787 ms of which 2 ms to minimize.
[2023-03-19 11:07:09] [INFO ] Deduced a trap composed of 5 places in 700 ms of which 2 ms to minimize.
[2023-03-19 11:07:10] [INFO ] Deduced a trap composed of 5 places in 975 ms of which 10 ms to minimize.
[2023-03-19 11:07:11] [INFO ] Deduced a trap composed of 6 places in 702 ms of which 29 ms to minimize.
[2023-03-19 11:07:12] [INFO ] Deduced a trap composed of 5 places in 874 ms of which 2 ms to minimize.
[2023-03-19 11:07:13] [INFO ] Deduced a trap composed of 5 places in 779 ms of which 10 ms to minimize.
[2023-03-19 11:07:13] [INFO ] Deduced a trap composed of 7 places in 791 ms of which 24 ms to minimize.
[2023-03-19 11:07:14] [INFO ] Deduced a trap composed of 7 places in 759 ms of which 31 ms to minimize.
[2023-03-19 11:07:15] [INFO ] Deduced a trap composed of 5 places in 836 ms of which 2 ms to minimize.
[2023-03-19 11:07:16] [INFO ] Deduced a trap composed of 4 places in 866 ms of which 2 ms to minimize.
[2023-03-19 11:07:18] [INFO ] Deduced a trap composed of 6 places in 1792 ms of which 27 ms to minimize.
[2023-03-19 11:07:19] [INFO ] Deduced a trap composed of 5 places in 913 ms of which 2 ms to minimize.
[2023-03-19 11:07:20] [INFO ] Deduced a trap composed of 13 places in 656 ms of which 2 ms to minimize.
[2023-03-19 11:07:21] [INFO ] Deduced a trap composed of 6 places in 881 ms of which 1 ms to minimize.
[2023-03-19 11:07:22] [INFO ] Deduced a trap composed of 7 places in 916 ms of which 2 ms to minimize.
[2023-03-19 11:07:23] [INFO ] Deduced a trap composed of 12 places in 806 ms of which 1 ms to minimize.
[2023-03-19 11:07:24] [INFO ] Deduced a trap composed of 8 places in 791 ms of which 2 ms to minimize.
[2023-03-19 11:07:25] [INFO ] Deduced a trap composed of 6 places in 1292 ms of which 1 ms to minimize.
[2023-03-19 11:07:26] [INFO ] Deduced a trap composed of 12 places in 693 ms of which 1 ms to minimize.
[2023-03-19 11:07:27] [INFO ] Deduced a trap composed of 10 places in 565 ms of which 1 ms to minimize.
[2023-03-19 11:07:28] [INFO ] Deduced a trap composed of 8 places in 1363 ms of which 2 ms to minimize.
[2023-03-19 11:07:29] [INFO ] Deduced a trap composed of 6 places in 687 ms of which 1 ms to minimize.
[2023-03-19 11:07:29] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 23389 ms
[2023-03-19 11:07:31] [INFO ] Deduced a trap composed of 6 places in 816 ms of which 2 ms to minimize.
[2023-03-19 11:07:32] [INFO ] Deduced a trap composed of 9 places in 599 ms of which 1 ms to minimize.
[2023-03-19 11:07:32] [INFO ] Deduced a trap composed of 10 places in 616 ms of which 1 ms to minimize.
[2023-03-19 11:07:33] [INFO ] Deduced a trap composed of 7 places in 865 ms of which 1 ms to minimize.
[2023-03-19 11:07:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3516 ms
[2023-03-19 11:07:35] [INFO ] Deduced a trap composed of 5 places in 640 ms of which 1 ms to minimize.
[2023-03-19 11:07:35] [INFO ] Deduced a trap composed of 8 places in 515 ms of which 1 ms to minimize.
[2023-03-19 11:07:36] [INFO ] Deduced a trap composed of 5 places in 549 ms of which 1 ms to minimize.
[2023-03-19 11:07:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2240 ms
[2023-03-19 11:07:37] [INFO ] Deduced a trap composed of 5 places in 572 ms of which 2 ms to minimize.
[2023-03-19 11:07:38] [INFO ] Deduced a trap composed of 4 places in 646 ms of which 2 ms to minimize.
[2023-03-19 11:07:39] [INFO ] Deduced a trap composed of 5 places in 645 ms of which 1 ms to minimize.
[2023-03-19 11:07:39] [INFO ] Deduced a trap composed of 7 places in 724 ms of which 2 ms to minimize.
[2023-03-19 11:07:40] [INFO ] Deduced a trap composed of 5 places in 551 ms of which 1 ms to minimize.
[2023-03-19 11:07:41] [INFO ] Deduced a trap composed of 6 places in 815 ms of which 2 ms to minimize.
[2023-03-19 11:07:42] [INFO ] Deduced a trap composed of 10 places in 684 ms of which 1 ms to minimize.
[2023-03-19 11:07:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5560 ms
[2023-03-19 11:07:46] [INFO ] Deduced a trap composed of 4 places in 593 ms of which 2 ms to minimize.
[2023-03-19 11:07:47] [INFO ] Deduced a trap composed of 6 places in 672 ms of which 1 ms to minimize.
[2023-03-19 11:07:48] [INFO ] Deduced a trap composed of 5 places in 723 ms of which 1 ms to minimize.
[2023-03-19 11:07:49] [INFO ] Deduced a trap composed of 5 places in 747 ms of which 1 ms to minimize.
[2023-03-19 11:07:50] [INFO ] Deduced a trap composed of 6 places in 1243 ms of which 1 ms to minimize.
[2023-03-19 11:07:51] [INFO ] Deduced a trap composed of 9 places in 841 ms of which 2 ms to minimize.
[2023-03-19 11:07:52] [INFO ] Deduced a trap composed of 9 places in 761 ms of which 2 ms to minimize.
[2023-03-19 11:07:53] [INFO ] Deduced a trap composed of 5 places in 764 ms of which 1 ms to minimize.
[2023-03-19 11:07:54] [INFO ] Deduced a trap composed of 7 places in 566 ms of which 1 ms to minimize.
[2023-03-19 11:07:55] [INFO ] Deduced a trap composed of 9 places in 1020 ms of which 1 ms to minimize.
[2023-03-19 11:07:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 9599 ms
[2023-03-19 11:07:56] [INFO ] After 54758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 8502 ms.
[2023-03-19 11:08:04] [INFO ] After 68178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
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-19 11:08:05] [INFO ] Flatten gal took : 292 ms
[2023-03-19 11:08:05] [INFO ] Applying decomposition
[2023-03-19 11:08:05] [INFO ] Flatten gal took : 214 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/graph11275968892250654790.txt' '-o' '/tmp/graph11275968892250654790.bin' '-w' '/tmp/graph11275968892250654790.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11275968892250654790.bin' '-l' '-1' '-v' '-w' '/tmp/graph11275968892250654790.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:08:06] [INFO ] Decomposing Gal with order
[2023-03-19 11:08:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:08:09] [INFO ] Removed a total of 600 redundant transitions.
[2023-03-19 11:08:10] [INFO ] Flatten gal took : 548 ms
[2023-03-19 11:08:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 46 ms.
[2023-03-19 11:08:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11543287870309207750.gal : 131 ms
[2023-03-19 11:08:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2576017520991126648.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/ReachabilityCardinality11543287870309207750.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2576017520991126648.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/ReachabilityCardinality2576017520991126648.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1 after 4050
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :6.50439e+12 after 6.28786e+38
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :6.28786e+38 after 5.23779e+41
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 11:38:18] [INFO ] Flatten gal took : 936 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5087726085798782852
[2023-03-19 11:38:19] [INFO ] Too many transitions (2226) to apply POR reductions. Disabling POR matrices.
[2023-03-19 11:38:19] [INFO ] Applying decomposition
[2023-03-19 11:38:25] [INFO ] Built C files in 6668ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5087726085798782852
Running compilation step : cd /tmp/ltsmin5087726085798782852;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '90' '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'
[2023-03-19 11:38:26] [INFO ] Flatten gal took : 6810 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/graph143504814736519820.txt' '-o' '/tmp/graph143504814736519820.bin' '-w' '/tmp/graph143504814736519820.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph143504814736519820.bin' '-l' '-1' '-v' '-w' '/tmp/graph143504814736519820.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:38:26] [INFO ] Decomposing Gal with order
[2023-03-19 11:38:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:38:27] [INFO ] Removed a total of 1369 redundant transitions.
[2023-03-19 11:38:27] [INFO ] Flatten gal took : 154 ms
[2023-03-19 11:38:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 578 labels/synchronizations in 113 ms.
[2023-03-19 11:38:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10823750972936146558.gal : 27 ms
[2023-03-19 11:38:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14743359665004641794.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/ReachabilityCardinality10823750972936146558.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14743359665004641794.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/ReachabilityCardinality14743359665004641794.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 21
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :21 after 51
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :51 after 51
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :51 after 663
Compilation finished in 5771 ms.
Running link step : cd /tmp/ltsmin5087726085798782852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 98 ms.
Running LTSmin : cd /tmp/ltsmin5087726085798782852;'/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' 'ShieldPPPtPT100BReachabilityCardinality01==true'
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :663 after 472407
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :472407 after 8.81598e+10
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin5087726085798782852;'/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' 'ShieldPPPtPT100BReachabilityCardinality01==true'
Running LTSmin : cd /tmp/ltsmin5087726085798782852;'/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' 'ShieldPPPtPT100BReachabilityCardinality02==true'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin5087726085798782852;'/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' 'ShieldPPPtPT100BReachabilityCardinality02==true'
Running LTSmin : cd /tmp/ltsmin5087726085798782852;'/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' 'ShieldPPPtPT100BReachabilityCardinality04==true'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin5087726085798782852;'/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' 'ShieldPPPtPT100BReachabilityCardinality04==true'
Running LTSmin : cd /tmp/ltsmin5087726085798782852;'/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' 'ShieldPPPtPT100BReachabilityCardinality07==true'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 136292 kB
After kill :
MemTotal: 16393220 kB
MemFree: 13011568 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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -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="ShieldPPPt-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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 ShieldPPPt-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713900702"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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