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

About the Execution of ITS-Tools for EisenbergMcGuire-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16222.523 3600000.00 9089697.00 300157.70 FFTF?TTTTTTFTTFF 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.r517-tall-167987243700278.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 EisenbergMcGuire-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243700278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 31 16:48 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 EisenbergMcGuire-PT-10-ReachabilityCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680838739516

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=EisenbergMcGuire-PT-10
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202304061127
[2023-04-07 03:39:02] [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-04-07 03:39:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:39:02] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2023-04-07 03:39:02] [INFO ] Transformed 1090 places.
[2023-04-07 03:39:02] [INFO ] Transformed 5200 transitions.
[2023-04-07 03:39:02] [INFO ] Found NUPN structural information;
[2023-04-07 03:39:02] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 318 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-07 03:39:03] [INFO ] Flatten gal took : 436 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 747 ms. (steps per millisecond=13 ) properties (out of 14) seen :4
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
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 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
[2023-04-07 03:39:03] [INFO ] Flatten gal took : 225 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
[2023-04-07 03:39:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13358667298431785903.gal : 109 ms
[2023-04-07 03:39:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6502622521847462333.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13358667298431785903.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6502622521847462333.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) 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.
[2023-04-07 03:39:04] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2023-04-07 03:39:04] [INFO ] Computed 31 invariants in 27 ms
Loading property file /tmp/ReachabilityCardinality6502622521847462333.prop.
[2023-04-07 03:39:04] [INFO ] After 530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-04-07 03:39:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 39 ms returned sat
[2023-04-07 03:39:05] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 03:39:06] [INFO ] After 1366ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-04-07 03:39:06] [INFO ] State equation strengthened by 1246 read => feed constraints.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :8 after 10
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :10 after 12
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :12 after 14
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :14 after 15
[2023-04-07 03:39:08] [INFO ] After 1322ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :1 sat :9
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :15 after 77
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :77 after 155
[2023-04-07 03:39:08] [INFO ] Deduced a trap composed of 3 places in 596 ms of which 13 ms to minimize.
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :155 after 280
[2023-04-07 03:39:09] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 1 ms to minimize.
[2023-04-07 03:39:09] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 0 ms to minimize.
[2023-04-07 03:39:09] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 0 ms to minimize.
[2023-04-07 03:39:10] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 0 ms to minimize.
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :280 after 1831
[2023-04-07 03:39:10] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 0 ms to minimize.
[2023-04-07 03:39:10] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2023-04-07 03:39:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2298 ms
[2023-04-07 03:39:10] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
[2023-04-07 03:39:10] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2023-04-07 03:39:11] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 1 ms to minimize.
[2023-04-07 03:39:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 607 ms
[2023-04-07 03:39:11] [INFO ] Deduced a trap composed of 189 places in 511 ms of which 0 ms to minimize.
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :1831 after 4300
[2023-04-07 03:39:12] [INFO ] Deduced a trap composed of 187 places in 501 ms of which 1 ms to minimize.
[2023-04-07 03:39:13] [INFO ] Deduced a trap composed of 20 places in 520 ms of which 1 ms to minimize.
[2023-04-07 03:39:13] [INFO ] Deduced a trap composed of 169 places in 462 ms of which 0 ms to minimize.
[2023-04-07 03:39:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2400 ms
[2023-04-07 03:39:14] [INFO ] Deduced a trap composed of 34 places in 324 ms of which 0 ms to minimize.
[2023-04-07 03:39:14] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 1 ms to minimize.
[2023-04-07 03:39:14] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2023-04-07 03:39:14] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 1 ms to minimize.
[2023-04-07 03:39:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1209 ms
[2023-04-07 03:39:15] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2023-04-07 03:39:15] [INFO ] Deduced a trap composed of 108 places in 109 ms of which 1 ms to minimize.
[2023-04-07 03:39:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 443 ms
[2023-04-07 03:39:16] [INFO ] Deduced a trap composed of 18 places in 525 ms of which 1 ms to minimize.
[2023-04-07 03:39:17] [INFO ] Deduced a trap composed of 3 places in 534 ms of which 1 ms to minimize.
[2023-04-07 03:39:17] [INFO ] Deduced a trap composed of 20 places in 541 ms of which 1 ms to minimize.
[2023-04-07 03:39:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 1849 ms
[2023-04-07 03:39:17] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2023-04-07 03:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-04-07 03:39:18] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 0 ms to minimize.
[2023-04-07 03:39:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2023-04-07 03:39:18] [INFO ] After 11786ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 999 ms.
[2023-04-07 03:39:19] [INFO ] After 14684ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :4300 after 39492
Parikh walk visited 0 properties in 393 ms.
Support contains 82 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1090 transition count 5192
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 1082 transition count 5191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 1081 transition count 5191
Performed 261 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 261 Pre rules applied. Total rules applied 18 place count 1081 transition count 4930
Deduced a syphon composed of 261 places in 6 ms
Reduce places removed 261 places and 0 transitions.
Iterating global reduction 3 with 522 rules applied. Total rules applied 540 place count 820 transition count 4930
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 623 place count 737 transition count 4100
Iterating global reduction 3 with 83 rules applied. Total rules applied 706 place count 737 transition count 4100
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 9 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 864 place count 658 transition count 4021
Applied a total of 864 rules in 1039 ms. Remains 658 /1090 variables (removed 432) and now considering 4021/5200 (removed 1179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1040 ms. Remains : 658/1090 places, 4021/5200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 175571 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{0=1, 1=1, 2=1, 4=1, 5=1, 7=1}
Probabilistic random walk after 175571 steps, saw 130861 distinct states, run finished after 3002 ms. (steps per millisecond=58 ) properties seen :6
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-04-07 03:39:24] [INFO ] Flow matrix only has 1151 transitions (discarded 2870 similar events)
// Phase 1: matrix 1151 rows 658 cols
[2023-04-07 03:39:24] [INFO ] Computed 31 invariants in 7 ms
[2023-04-07 03:39:24] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:39:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-07 03:39:24] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 03:39:25] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 03:39:25] [INFO ] State equation strengthened by 499 read => feed constraints.
[2023-04-07 03:39:25] [INFO ] After 261ms SMT Verify possible using 499 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 03:39:25] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 1 ms to minimize.
[2023-04-07 03:39:25] [INFO ] Deduced a trap composed of 3 places in 293 ms of which 0 ms to minimize.
[2023-04-07 03:39:26] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 1 ms to minimize.
[2023-04-07 03:39:26] [INFO ] Deduced a trap composed of 37 places in 248 ms of which 1 ms to minimize.
[2023-04-07 03:39:26] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-04-07 03:39:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1338 ms
[2023-04-07 03:39:26] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-04-07 03:39:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-07 03:39:26] [INFO ] After 1869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 158 ms.
[2023-04-07 03:39:27] [INFO ] After 2510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 24 out of 658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 4021/4021 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 658 transition count 4020
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 657 transition count 4020
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 2 place count 657 transition count 3986
Deduced a syphon composed of 34 places in 3 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 70 place count 623 transition count 3986
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 618 transition count 3936
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 618 transition count 3936
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 place count 612 transition count 3930
Applied a total of 92 rules in 262 ms. Remains 612 /658 variables (removed 46) and now considering 3930/4021 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 612/658 places, 3930/4021 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :39492 after 80899
Interrupted probabilistic random walk after 194392 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194392 steps, saw 137089 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-07 03:39:30] [INFO ] Flow matrix only has 1060 transitions (discarded 2870 similar events)
// Phase 1: matrix 1060 rows 612 cols
[2023-04-07 03:39:30] [INFO ] Computed 31 invariants in 15 ms
[2023-04-07 03:39:30] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:39:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 03:39:30] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 03:39:31] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 03:39:31] [INFO ] State equation strengthened by 454 read => feed constraints.
[2023-04-07 03:39:31] [INFO ] After 199ms SMT Verify possible using 454 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 03:39:31] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 1 ms to minimize.
[2023-04-07 03:39:31] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 4 ms to minimize.
[2023-04-07 03:39:31] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2023-04-07 03:39:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 523 ms
[2023-04-07 03:39:32] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-07 03:39:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-04-07 03:39:32] [INFO ] After 943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-04-07 03:39:32] [INFO ] After 1509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 24 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 3930/3930 transitions.
Applied a total of 0 rules in 171 ms. Remains 612 /612 variables (removed 0) and now considering 3930/3930 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 612/612 places, 3930/3930 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 3930/3930 transitions.
Applied a total of 0 rules in 242 ms. Remains 612 /612 variables (removed 0) and now considering 3930/3930 (removed 0) transitions.
[2023-04-07 03:39:32] [INFO ] Flow matrix only has 1060 transitions (discarded 2870 similar events)
[2023-04-07 03:39:32] [INFO ] Invariant cache hit.
[2023-04-07 03:39:33] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-04-07 03:39:33] [INFO ] Flow matrix only has 1060 transitions (discarded 2870 similar events)
[2023-04-07 03:39:33] [INFO ] Invariant cache hit.
[2023-04-07 03:39:33] [INFO ] State equation strengthened by 454 read => feed constraints.
[2023-04-07 03:39:37] [INFO ] Implicit Places using invariants and state equation in 3840 ms returned []
Implicit Place search using SMT with State Equation took 4418 ms to find 0 implicit places.
[2023-04-07 03:39:37] [INFO ] Redundant transitions in 269 ms returned []
[2023-04-07 03:39:37] [INFO ] Flow matrix only has 1060 transitions (discarded 2870 similar events)
[2023-04-07 03:39:37] [INFO ] Invariant cache hit.
[2023-04-07 03:39:38] [INFO ] Dead Transitions using invariants and state equation in 1239 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6178 ms. Remains : 612/612 places, 3930/3930 transitions.
Graph (trivial) has 3598 edges and 612 vertex of which 95 / 612 are part of one of the 10 SCC in 5 ms
Free SCC test removed 85 places
Drop transitions removed 320 transitions
Ensure Unique test removed 2819 transitions
Reduce isomorphic transitions removed 3139 transitions.
Drop transitions removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 527 transition count 675
Reduce places removed 116 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 121 rules applied. Total rules applied 238 place count 411 transition count 670
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 243 place count 406 transition count 670
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 243 place count 406 transition count 658
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 269 place count 392 transition count 658
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 3 with 342 rules applied. Total rules applied 611 place count 221 transition count 487
Ensure Unique test removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 3 with 83 rules applied. Total rules applied 694 place count 221 transition count 404
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 700 place count 218 transition count 422
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 701 place count 218 transition count 421
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 713 place count 218 transition count 409
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 719 place count 215 transition count 412
Free-agglomeration rule applied 61 times.
Iterating global reduction 5 with 61 rules applied. Total rules applied 780 place count 215 transition count 351
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 5 with 61 rules applied. Total rules applied 841 place count 154 transition count 351
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 849 place count 154 transition count 351
Applied a total of 849 rules in 70 ms. Remains 154 /612 variables (removed 458) and now considering 351/3930 (removed 3579) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 351 rows 154 cols
[2023-04-07 03:39:38] [INFO ] Computed 29 invariants in 7 ms
[2023-04-07 03:39:38] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 03:39:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-07 03:39:38] [INFO ] [Nat]Absence check using 21 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 03:39:38] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 03:39:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-04-07 03:39:38] [INFO ] After 32ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 03:39:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-04-07 03:39:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-04-07 03:39:38] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-07 03:39:39] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-04-07 03:39:39] [INFO ] Flatten gal took : 14 ms
[2023-04-07 03:39:39] [INFO ] Flatten gal took : 12 ms
[2023-04-07 03:39:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3312001376081586007.gal : 2 ms
[2023-04-07 03:39:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4298322079838506274.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3312001376081586007.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4298322079838506274.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4298322079838506274.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 18
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :18 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 200
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :200 after 6000
Reachability property EisenbergMcGuire-PT-10-ReachabilityCardinality-04 is true.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6000 after 53420
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :53420 after 60760
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :60760 after 81690
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :81690 after 133000
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :133000 after 559629
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :559629 after 3.42922e+07
Invariant property EisenbergMcGuire-PT-10-ReachabilityCardinality-11 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.22234e+10,0.277747,9180,2,2919,18,27495,6,0,970,16519,0
Total reachable state count : 12223406412

Verifying 2 reachability properties.
ITS tools runner thread asked to quit. 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-04-07 03:39:54] [INFO ] Flatten gal took : 173 ms
[2023-04-07 03:39:54] [INFO ] Applying decomposition
[2023-04-07 03:39:54] [INFO ] Flatten gal took : 155 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4106924060762827337.txt' '-o' '/tmp/graph4106924060762827337.bin' '-w' '/tmp/graph4106924060762827337.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4106924060762827337.bin' '-l' '-1' '-v' '-w' '/tmp/graph4106924060762827337.weights' '-q' '0' '-e' '0.001'
[2023-04-07 03:39:55] [INFO ] Decomposing Gal with order
[2023-04-07 03:39:55] [INFO ] Rewriting arrays to variables to allow decomposition.
SDD proceeding with computation,14 properties remain. new max is 65536
SDD size :80899 after 220751
[2023-04-07 03:39:56] [INFO ] Removed a total of 10880 redundant transitions.
[2023-04-07 03:39:56] [INFO ] Flatten gal took : 966 ms
[2023-04-07 03:39:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 459 labels/synchronizations in 187 ms.
[2023-04-07 03:39:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality340550722491045855.gal : 44 ms
[2023-04-07 03:39:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13224978636550768508.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality340550722491045855.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13224978636550768508.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality13224978636550768508.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2 after 16
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :16 after 6480
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :6480 after 390039
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :390039 after 500607
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :500607 after 692527
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :692527 after 4.01147e+06
Reachability property EisenbergMcGuire-PT-10-ReachabilityCardinality-13 is true.
SDD proceeding with computation,13 properties remain. new max is 65536
SDD size :220751 after 1.87863e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4.01147e+06 after 8.75672e+07
SDD proceeding with computation,13 properties remain. new max is 131072
SDD size :1.87863e+06 after 2.67656e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :8.75672e+07 after 4.86201e+08
SDD proceeding with computation,13 properties remain. new max is 262144
SDD size :2.67656e+06 after 4.00418e+06
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :4.86201e+08 after 6.19058e+08
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :6.19058e+08 after 7.88318e+08
SDD proceeding with computation,13 properties remain. new max is 524288
SDD size :4.00418e+06 after 7.32932e+06
ITS-tools command line returned an error code 137
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :7.88318e+08 after 1.02471e+09
Detected timeout of ITS tools.
[2023-04-07 04:09:58] [INFO ] Flatten gal took : 263 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12746515597123387288
[2023-04-07 04:09:59] [INFO ] Too many transitions (3930) to apply POR reductions. Disabling POR matrices.
[2023-04-07 04:09:59] [INFO ] Applying decomposition
[2023-04-07 04:10:00] [INFO ] Built C files in 607ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12746515597123387288
Running compilation step : cd /tmp/ltsmin12746515597123387288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-04-07 04:10:02] [INFO ] Flatten gal took : 2649 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1951515251124942909.txt' '-o' '/tmp/graph1951515251124942909.bin' '-w' '/tmp/graph1951515251124942909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1951515251124942909.bin' '-l' '-1' '-v' '-w' '/tmp/graph1951515251124942909.weights' '-q' '0' '-e' '0.001'
[2023-04-07 04:10:03] [INFO ] Decomposing Gal with order
[2023-04-07 04:10:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 04:10:03] [INFO ] Removed a total of 8701 redundant transitions.
[2023-04-07 04:10:03] [INFO ] Flatten gal took : 381 ms
[2023-04-07 04:10:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 929 labels/synchronizations in 102 ms.
[2023-04-07 04:10:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1381584338181308648.gal : 19 ms
[2023-04-07 04:10:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12852799796812077335.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1381584338181308648.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12852799796812077335.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12852799796812077335.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 129576
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :129576 after 135696
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :135696 after 151947
Invariant property EisenbergMcGuire-PT-10-ReachabilityCardinality-11 does not hold.
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :151947 after 809440
Compilation finished in 12543 ms.
Running link step : cd /tmp/ltsmin12746515597123387288;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 1409 ms.
Running LTSmin : cd /tmp/ltsmin12746515597123387288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality04==true'
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :809440 after 1.54248e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.54248e+06 after 2.46278e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.46278e+06 after 9.04174e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9.04174e+06 after 1.76213e+07
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 1974552 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15252520 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:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="EisenbergMcGuire-PT-10"
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 EisenbergMcGuire-PT-10, 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 r517-tall-167987243700278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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