Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r158-smll-171636266200110.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Echo-PT-d03r03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266200110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 04:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 04:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 114K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-00
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-01
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-02
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2023-03
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-04
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-05
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-06
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-07
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-08
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-09
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-10
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-11
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-12
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-13
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-14
FORMULA_NAME Echo-PT-d03r03-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716468065034

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d03r03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-23 12:41:07] [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]
[2024-05-23 12:41:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 12:41:07] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2024-05-23 12:41:08] [INFO ] Transformed 265 places.
[2024-05-23 12:41:08] [INFO ] Transformed 206 transitions.
[2024-05-23 12:41:08] [INFO ] Found NUPN structural information;
[2024-05-23 12:41:08] [INFO ] Parsed PT model containing 265 places and 206 transitions and 1252 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 52 ms.
Working with output stream class java.io.PrintStream
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 12:41:09] [INFO ] Flatten gal took : 199 ms
RANDOM walk for 40000 steps (724 resets) in 2682 ms. (14 steps per ms) remains 1/6 properties
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d03r03-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 12:41:09] [INFO ] Flatten gal took : 162 ms
BEST_FIRST walk for 40004 steps (60 resets) in 498 ms. (80 steps per ms) remains 1/1 properties
[2024-05-23 12:41:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15571201206611606269.gal : 33 ms
[2024-05-23 12:41:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9021133399411223861.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15571201206611606269.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9021133399411223861.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
// Phase 1: matrix 206 rows 265 cols
Loading property file /tmp/ReachabilityCardinality9021133399411223861.prop.
[2024-05-23 12:41:09] [INFO ] Computed 135 invariants in 53 ms
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 299
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :299 after 550
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :550 after 1901
At refinement iteration 2 (OVERLAPS) 18/20 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1901 after 2275
At refinement iteration 5 (OVERLAPS) 143/163 variables, 44/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 143/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/189 variables, 17/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 26/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 75/264 variables, 67/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 75/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/265 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2275 after 4151
At refinement iteration 17 (OVERLAPS) 206/471 variables, 265/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/471 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/471 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 665 constraints, problems are : Problem set: 0 solved, 1 unsolved in 754 ms.
Refiners :[Domain max(s): 265/265 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 18/20 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 143/163 variables, 44/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 143/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/189 variables, 17/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 26/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 75/264 variables, 67/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 75/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/265 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/265 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 12:41:10] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 11 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4151 after 12944
[2024-05-23 12:41:10] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-23 12:41:10] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-23 12:41:11] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-23 12:41:11] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-23 12:41:11] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-23 12:41:11] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-23 12:41:11] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-23 12:41:11] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-23 12:41:11] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-23 12:41:11] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-23 12:41:11] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 4 ms to minimize.
[2024-05-23 12:41:11] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 13 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :12944 after 44444
[2024-05-23 12:41:12] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-23 12:41:12] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-23 12:41:12] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-23 12:41:12] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-23 12:41:12] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-23 12:41:12] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-23 12:41:12] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 12:41:12] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-23 12:41:12] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-23 12:41:12] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-23 12:41:12] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-23 12:41:13] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-23 12:41:13] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-23 12:41:13] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-23 12:41:13] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-23 12:41:13] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-23 12:41:13] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-23 12:41:13] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-23 12:41:13] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-23 12:41:13] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-23 12:41:13] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 8 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :44444 after 210199
[2024-05-23 12:41:14] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-23 12:41:14] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-23 12:41:14] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-23 12:41:14] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-23 12:41:14] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 3 ms to minimize.
[2024-05-23 12:41:14] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 12:41:14] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-23 12:41:14] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-05-23 12:41:14] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-23 12:41:14] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-05-23 12:41:15] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-23 12:41:15] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 14 ms to minimize.
[2024-05-23 12:41:15] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-05-23 12:41:15] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 265/471 variables, and 448 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5016 ms.
Refiners :[Domain max(s): 265/265 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 111/111 constraints, State Equation: 0/265 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 48/48 constraints]
After SMT, in 5925ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 206/206 transitions.
Graph (complete) has 938 edges and 265 vertex of which 240 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.5 ms
Discarding 25 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 240 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 239 transition count 205
Applied a total of 8 rules in 179 ms. Remains 239 /265 variables (removed 26) and now considering 205/206 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 239/265 places, 205/206 transitions.
RANDOM walk for 40000 steps (816 resets) in 1465 ms. (27 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (63 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :210199 after 275383
Interrupted probabilistic random walk after 887110 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :0 out of 1
Probabilistic random walk after 887110 steps, saw 118992 distinct states, run finished after 3007 ms. (steps per millisecond=295 ) properties seen :0
// Phase 1: matrix 205 rows 239 cols
[2024-05-23 12:41:19] [INFO ] Computed 110 invariants in 60 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 32/34 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 188/222 variables, 82/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 188/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 17/239 variables, 17/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 17/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 205/444 variables, 239/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/444 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 436 ms.
Refiners :[Domain max(s): 239/239 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 99/99 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 32/34 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 188/222 variables, 82/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 188/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 17/239 variables, 17/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 17/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 205/444 variables, 239/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/444 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/444 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 589 constraints, problems are : Problem set: 0 solved, 1 unsolved in 466 ms.
Refiners :[Domain max(s): 239/239 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 99/99 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1002ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 205/205 transitions.
Applied a total of 0 rules in 13 ms. Remains 239 /239 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 239/239 places, 205/205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 205/205 transitions.
Applied a total of 0 rules in 13 ms. Remains 239 /239 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-05-23 12:41:20] [INFO ] Invariant cache hit.
[2024-05-23 12:41:20] [INFO ] Implicit Places using invariants in 749 ms returned [16, 164, 184, 206, 214, 225, 233]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 761 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 232/239 places, 205/205 transitions.
Applied a total of 0 rules in 24 ms. Remains 232 /232 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 798 ms. Remains : 232/239 places, 205/205 transitions.
RANDOM walk for 40000 steps (815 resets) in 296 ms. (134 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (63 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1059758 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :0 out of 1
Probabilistic random walk after 1059758 steps, saw 140602 distinct states, run finished after 3001 ms. (steps per millisecond=353 ) properties seen :0
// Phase 1: matrix 205 rows 232 cols
[2024-05-23 12:41:24] [INFO ] Computed 103 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 28/30 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/225 variables, 87/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 195/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/232 variables, 7/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 7/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 205/437 variables, 232/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/437 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 567 constraints, problems are : Problem set: 0 solved, 1 unsolved in 400 ms.
Refiners :[Domain max(s): 232/232 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 28/30 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/225 variables, 87/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 195/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/232 variables, 7/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 7/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 205/437 variables, 232/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/437 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 568 constraints, problems are : Problem set: 0 solved, 1 unsolved in 892 ms.
Refiners :[Domain max(s): 232/232 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1318ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 205/205 transitions.
Applied a total of 0 rules in 18 ms. Remains 232 /232 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 232/232 places, 205/205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 205/205 transitions.
Applied a total of 0 rules in 18 ms. Remains 232 /232 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2024-05-23 12:41:25] [INFO ] Invariant cache hit.
[2024-05-23 12:41:26] [INFO ] Implicit Places using invariants in 863 ms returned []
[2024-05-23 12:41:26] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :275383 after 1.58607e+06
[2024-05-23 12:41:27] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 1545 ms to find 0 implicit places.
[2024-05-23 12:41:27] [INFO ] Redundant transitions in 9 ms returned []
Running 199 sub problems to find dead transitions.
[2024-05-23 12:41:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 43/273 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 2/232 variables, 9/282 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 51/335 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 199 unsolved
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.58607e+06 after 2.68713e+06
At refinement iteration 7 (OVERLAPS) 205/437 variables, 232/567 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/437 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 567 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30051 ms.
Refiners :[Domain max(s): 232/232 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 43/273 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 2/232 variables, 9/282 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 51/335 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 205/437 variables, 232/567 constraints. Problems are: Problem set: 0 solved, 199 unsolved
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.68713e+06 after 9.37823e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 199/766 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/437 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 766 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30021 ms.
Refiners :[Domain max(s): 232/232 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints]
After SMT, in 60227ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61818 ms. Remains : 232/232 places, 205/205 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 12:42:27] [INFO ] Flatten gal took : 42 ms
[2024-05-23 12:42:27] [INFO ] Applying decomposition
[2024-05-23 12:42:27] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12304298217210109674.txt' '-o' '/tmp/graph12304298217210109674.bin' '-w' '/tmp/graph12304298217210109674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12304298217210109674.bin' '-l' '-1' '-v' '-w' '/tmp/graph12304298217210109674.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:42:27] [INFO ] Decomposing Gal with order
[2024-05-23 12:42:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:42:27] [INFO ] Removed a total of 215 redundant transitions.
[2024-05-23 12:42:27] [INFO ] Flatten gal took : 142 ms
[2024-05-23 12:42:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 19 ms.
[2024-05-23 12:42:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10006398501566153163.gal : 12 ms
[2024-05-23 12:42:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5097953168690736997.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10006398501566153163.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5097953168690736997.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5097953168690736997.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 896097
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :896097 after 3.80462e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.80462e+09 after 5.06185e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.06185e+09 after 8.40353e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.40353e+09 after 1.97169e+11
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.39499e+13 after 2.66664e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.66664e+13 after 3.48262e+13
Detected timeout of ITS tools.
[2024-05-23 13:12:28] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13503220355421887128
[2024-05-23 13:12:28] [INFO ] Applying decomposition
[2024-05-23 13:12:28] [INFO ] Computing symmetric may disable matrix : 205 transitions.
[2024-05-23 13:12:28] [INFO ] Flatten gal took : 24 ms
[2024-05-23 13:12:28] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 13:12:28] [INFO ] Computing symmetric may enable matrix : 205 transitions.
[2024-05-23 13:12:28] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 13:12:28] [INFO ] Computing Do-Not-Accords matrix : 205 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15318577981794014605.txt' '-o' '/tmp/graph15318577981794014605.bin' '-w' '/tmp/graph15318577981794014605.weights'
[2024-05-23 13:12:28] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15318577981794014605.bin' '-l' '-1' '-v' '-w' '/tmp/graph15318577981794014605.weights' '-q' '0' '-e' '0.001'
[2024-05-23 13:12:28] [INFO ] Decomposing Gal with order
[2024-05-23 13:12:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 13:12:28] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13503220355421887128
Running compilation step : cd /tmp/ltsmin13503220355421887128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 13:12:28] [INFO ] Removed a total of 260 redundant transitions.
[2024-05-23 13:12:28] [INFO ] Flatten gal took : 53 ms
[2024-05-23 13:12:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-23 13:12:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12051304794534498290.gal : 8 ms
[2024-05-23 13:12:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11361925975365684380.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12051304794534498290.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11361925975365684380.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11361925975365684380.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :11 after 244
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :244 after 4904
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4904 after 2.12168e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.12168e+06 after 3.01971e+06
Compilation finished in 1247 ms.
Running link step : cd /tmp/ltsmin13503220355421887128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13503220355421887128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EchoPTd03r03ReachabilityCardinality202303==true'
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.01971e+06 after 2.59305e+08
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.046: Initializing POR dependencies: labels 206, guards 205
pins2lts-mc-linux64( 4/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.590: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 5/ 8), 0.601: "EchoPTd03r03ReachabilityCardinality202303==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.602: "EchoPTd03r03ReachabilityCardinality202303==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.604: "EchoPTd03r03ReachabilityCardinality202303==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.602: "EchoPTd03r03ReachabilityCardinality202303==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.602: "EchoPTd03r03ReachabilityCardinality202303==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.604: "EchoPTd03r03ReachabilityCardinality202303==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.604: "EchoPTd03r03ReachabilityCardinality202303==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.605: There are 206 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.605: State length is 232, there are 205 groups
pins2lts-mc-linux64( 0/ 8), 0.605: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.605: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.605: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.605: Visible groups: 0 / 205, labels: 1 / 206
pins2lts-mc-linux64( 0/ 8), 0.605: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.605: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.603: "EchoPTd03r03ReachabilityCardinality202303==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.969: ~2 levels ~960 states ~12600 transitions
pins2lts-mc-linux64( 4/ 8), 1.184: ~2 levels ~1920 states ~26528 transitions
pins2lts-mc-linux64( 2/ 8), 1.461: ~3 levels ~3840 states ~58656 transitions
pins2lts-mc-linux64( 2/ 8), 1.966: ~4 levels ~7680 states ~122808 transitions
pins2lts-mc-linux64( 0/ 8), 2.885: ~7 levels ~15360 states ~238344 transitions
pins2lts-mc-linux64( 0/ 8), 4.566: ~7 levels ~30720 states ~499296 transitions
pins2lts-mc-linux64( 2/ 8), 7.580: ~5 levels ~61440 states ~1038120 transitions
pins2lts-mc-linux64( 4/ 8), 12.774: ~5 levels ~122880 states ~2025768 transitions
pins2lts-mc-linux64( 4/ 8), 22.556: ~5 levels ~245760 states ~4145432 transitions
pins2lts-mc-linux64( 4/ 8), 41.601: ~6 levels ~491520 states ~8526456 transitions
pins2lts-mc-linux64( 4/ 8), 81.499: ~6 levels ~983040 states ~17630472 transitions
pins2lts-mc-linux64( 1/ 8), 164.143: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 164.840:
pins2lts-mc-linux64( 0/ 8), 164.840: mean standard work distribution: 2.9% (states) 0.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 164.840:
pins2lts-mc-linux64( 0/ 8), 164.840: Explored 1861717 states 35427141 transitions, fanout: 19.029
pins2lts-mc-linux64( 0/ 8), 164.840: Total exploration time 164.240 sec (163.560 sec minimum, 163.849 sec on average)
pins2lts-mc-linux64( 0/ 8), 164.840: States per second: 11335, Transitions per second: 215703
pins2lts-mc-linux64( 0/ 8), 164.840: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 164.840:
pins2lts-mc-linux64( 0/ 8), 164.840: Queue width: 8B, total height: 7820016, memory: 59.66MB
pins2lts-mc-linux64( 0/ 8), 164.840: Tree memory: 329.9MB, 35.7 B/state, compr.: 3.8%
pins2lts-mc-linux64( 0/ 8), 164.840: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 164.840: Stored 206 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 164.840: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 164.840: Est. total memory use: 389.5MB (~1083.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13503220355421887128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EchoPTd03r03ReachabilityCardinality202303==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13503220355421887128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EchoPTd03r03ReachabilityCardinality202303==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.24739e+12 after 5.27387e+12
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.27387e+12 after 6.27074e+12
ITS-tools command line returned an error code 137
[2024-05-23 13:35:26] [INFO ] Applying decomposition
[2024-05-23 13:35:26] [INFO ] Flatten gal took : 22 ms
[2024-05-23 13:35:26] [INFO ] Decomposing Gal with order
[2024-05-23 13:35:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 13:35:26] [INFO ] Removed a total of 624 redundant transitions.
[2024-05-23 13:35:26] [INFO ] Flatten gal took : 54 ms
[2024-05-23 13:35:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-23 13:35:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9859306145585716427.gal : 5 ms
[2024-05-23 13:35:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4783919158344551829.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9859306145585716427.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4783919158344551829.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4783919158344551829.prop.

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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="Echo-PT-d03r03"
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-5568"
echo " Executing tool itstools"
echo " Input is Echo-PT-d03r03, 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 r158-smll-171636266200110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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