fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r136-tall-171631133000575
Last Updated
July 7, 2024

About the Execution of ITS-Tools for DoubleExponent-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11813.672 3600000.00 9861791.00 3989.40 ??FF??F?F??????? normal

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.r136-tall-171631133000575.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 DoubleExponent-PT-100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631133000575
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M 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 DoubleExponent-PT-100-ReachabilityFireability-2024-00
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-01
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-02
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-03
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-04
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2023-05
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2023-06
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-07
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-08
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2023-09
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-10
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-11
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-12
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-13
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2024-14
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716400238255

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-22 17:50:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 17:50:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:50:39] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2024-05-22 17:50:39] [INFO ] Transformed 5304 places.
[2024-05-22 17:50:39] [INFO ] Transformed 4998 transitions.
[2024-05-22 17:50:39] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1313 resets) in 1753 ms. (22 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (113 resets) in 176 ms. (22 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (116 resets) in 112 ms. (35 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (107 resets) in 169 ms. (23 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (111 resets) in 146 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 103 ms. (38 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (109 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (106 resets) in 63 ms. (62 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (118 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (115 resets) in 99 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (104 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (112 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (106 resets) in 74 ms. (53 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (113 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (112 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (107 resets) in 67 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (116 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
[2024-05-22 17:50:41] [INFO ] Flatten gal took : 663 ms
[2024-05-22 17:50:41] [INFO ] Flatten gal took : 209 ms
[2024-05-22 17:50:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9576191897496242746.gal : 88 ms
[2024-05-22 17:50:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1225933090359683672.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/ReachabilityCardinality9576191897496242746.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1225933090359683672.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 ...328
Loading property file /tmp/ReachabilityCardinality1225933090359683672.prop.
Interrupted probabilistic random walk after 57741 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 16
Probabilistic random walk after 57741 steps, saw 28878 distinct states, run finished after 3005 ms. (steps per millisecond=19 ) properties seen :0
// Phase 1: matrix 4998 rows 5304 cols
[2024-05-22 17:50:44] [INFO ] Invariants computation overflowed in 217 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 652/906 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/906 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2348/3254 variables, 997/1251 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3254 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 3364/6618 variables, 1725/2976 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6618 variables, 0/2976 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 2483/9101 variables, 1502/4478 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9101/10302 variables, and 4478 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5033 ms.
Refiners :[State Equation: 4478/5304 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 652/906 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/906 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2348/3254 variables, 997/1251 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3254 variables, 16/1267 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3254 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 3364/6618 variables, 1725/2992 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6618 variables, 0/2992 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 9101/10302 variables, and 4494 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5016 ms.
Refiners :[State Equation: 4478/5304 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 10437ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 254 out of 5304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Graph (complete) has 9096 edges and 5304 vertex of which 5298 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 960 transitions
Trivial Post-agglo rules discarded 960 transitions
Performed 960 trivial Post agglomeration. Transition count delta: 960
Iterating post reduction 0 with 963 rules applied. Total rules applied 964 place count 5297 transition count 4036
Reduce places removed 960 places and 0 transitions.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Iterating post reduction 1 with 1038 rules applied. Total rules applied 2002 place count 4337 transition count 3958
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 2080 place count 4259 transition count 3958
Performed 215 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 215 Pre rules applied. Total rules applied 2080 place count 4259 transition count 3743
Deduced a syphon composed of 215 places in 202 ms
Reduce places removed 215 places and 0 transitions.
Iterating global reduction 3 with 430 rules applied. Total rules applied 2510 place count 4044 transition count 3743
Performed 768 Post agglomeration using F-continuation condition.Transition count delta: 768
Deduced a syphon composed of 768 places in 82 ms
Reduce places removed 768 places and 0 transitions.
Iterating global reduction 3 with 1536 rules applied. Total rules applied 4046 place count 3276 transition count 2975
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 142 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4248 place count 3175 transition count 2975
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 66 places in 69 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 4380 place count 3109 transition count 2975
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 4386 place count 3109 transition count 2969
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 4392 place count 3103 transition count 2969
Free-agglomeration rule (complex) applied 411 times.
Iterating global reduction 4 with 411 rules applied. Total rules applied 4803 place count 3103 transition count 2558
Reduce places removed 411 places and 0 transitions.
Iterating post reduction 4 with 411 rules applied. Total rules applied 5214 place count 2692 transition count 2558
Partial Free-agglomeration rule applied 400 times.
Drop transitions (Partial Free agglomeration) removed 400 transitions
Iterating global reduction 5 with 400 rules applied. Total rules applied 5614 place count 2692 transition count 2558
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 5615 place count 2692 transition count 2558
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5616 place count 2691 transition count 2557
Applied a total of 5616 rules in 3198 ms. Remains 2691 /5304 variables (removed 2613) and now considering 2557/4998 (removed 2441) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3217 ms. Remains : 2691/5304 places, 2557/4998 transitions.
RANDOM walk for 40000 steps (3505 resets) in 559 ms. (71 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (253 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (257 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (263 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (252 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (272 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (241 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (252 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (243 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (266 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (258 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (256 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (272 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (258 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (258 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (257 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (267 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :9 after 11
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :11 after 20
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :20 after 31
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :31 after 63
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :63 after 115
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :115 after 310
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :310 after 2444
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :2444 after 21116
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :21116 after 202385
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :202385 after 876441
Interrupted probabilistic random walk after 91147 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 16
Probabilistic random walk after 91147 steps, saw 45589 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 2557 rows 2691 cols
[2024-05-22 17:51:02] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-22 17:51:02] [INFO ] State equation strengthened by 326 read => feed constraints.
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :876441 after 2.3132e+06
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 849/1103 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1103 variables, 23/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1103 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :2.3132e+06 after 1.25458e+08
At refinement iteration 4 (OVERLAPS) 2658/3761 variables, 1296/1573 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 131072
SDD size :1.25458e+08 after 8.23755e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/3761 variables, 153/1726 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 262144
SDD size :8.23755e+08 after 3.23753e+09
At refinement iteration 6 (INCLUDED_ONLY) 0/3761 variables, 0/1726 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 524288
SDD size :3.23753e+09 after 1.08416e+10
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5185/5248 variables, and 2813 constraints, problems are : Problem set: 0 solved, 16 unsolved in 45028 ms.
Refiners :[State Equation: 2637/2691 constraints, ReadFeed: 176/326 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 849/1103 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1103 variables, 23/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1103 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2658/3761 variables, 1296/1573 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3761 variables, 153/1726 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 1048576
SDD size :1.08416e+10 after 4.5947e+10
At refinement iteration 6 (INCLUDED_ONLY) 0/3761 variables, 14/1740 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 17:52:26] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 24 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3761 variables, 1/1741 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3761/5248 variables, and 1741 constraints, problems are : Problem set: 0 solved, 16 unsolved in 45022 ms.
Refiners :[State Equation: 1550/2691 constraints, ReadFeed: 176/326 constraints, PredecessorRefiner: 14/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 90179ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 254 out of 2691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2691/2691 places, 2557/2557 transitions.
Applied a total of 0 rules in 128 ms. Remains 2691 /2691 variables (removed 0) and now considering 2557/2557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 2691/2691 places, 2557/2557 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2691/2691 places, 2557/2557 transitions.
Applied a total of 0 rules in 118 ms. Remains 2691 /2691 variables (removed 0) and now considering 2557/2557 (removed 0) transitions.
// Phase 1: matrix 2557 rows 2691 cols
[2024-05-22 17:52:32] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 17:52:33] [INFO ] Implicit Places using invariants in 1499 ms returned []
// Phase 1: matrix 2557 rows 2691 cols
[2024-05-22 17:52:33] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 17:52:35] [INFO ] State equation strengthened by 326 read => feed constraints.
[2024-05-22 17:53:05] [INFO ] Performed 91/2691 implicitness test of which 5 returned IMPLICIT in 30 seconds.
SDD proceeding with computation,16 properties remain. new max is 2097152
SDD size :4.5947e+10 after 1.64473e+11
[2024-05-22 17:53:35] [INFO ] Performed 381/2691 implicitness test of which 23 returned IMPLICIT in 60 seconds.
[2024-05-22 17:54:20] [INFO ] Performed 437/2691 implicitness test of which 25 returned IMPLICIT in 105 seconds.
[2024-05-22 17:54:50] [INFO ] Performed 573/2691 implicitness test of which 33 returned IMPLICIT in 135 seconds.
[2024-05-22 17:55:13] [INFO ] Implicit Places using invariants and state equation in 160088 ms returned [26, 49, 56, 80, 86, 107, 139, 169, 175, 196, 198, 202, 225, 231, 266, 286, 292, 313, 321, 344, 352, 376, 381, 405, 411, 467, 474, 494, 502, 527, 533, 556, 563, 618, 625]
[2024-05-22 17:55:13] [INFO ] Actually due to overlaps returned [625, 292, 26, 175, 474, 139, 169, 198, 286, 467, 556, 563, 266, 618]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 161597 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2677/2691 places, 2557/2557 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2677 transition count 2555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 2675 transition count 2555
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 12 place count 2675 transition count 2555
Applied a total of 12 rules in 375 ms. Remains 2675 /2677 variables (removed 2) and now considering 2555/2557 (removed 2) transitions.
// Phase 1: matrix 2555 rows 2675 cols
[2024-05-22 17:55:14] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-22 17:55:15] [INFO ] Implicit Places using invariants in 1406 ms returned []
// Phase 1: matrix 2555 rows 2675 cols
[2024-05-22 17:55:15] [INFO ] Invariants computation overflowed in 65 ms
[2024-05-22 17:55:17] [INFO ] State equation strengthened by 326 read => feed constraints.
[2024-05-22 17:55:58] [INFO ] Performed 5/2675 implicitness test of which 0 returned IMPLICIT in 41 seconds.
SDD proceeding with computation,16 properties remain. new max is 4194304
SDD size :1.64473e+11 after 3.31085e+11
[2024-05-22 17:57:55] [INFO ] Performed 6/2675 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2024-05-22 17:57:55] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2024-05-22 17:57:55] [INFO ] Implicit Places using invariants and state equation in 160128 ms returned []
Implicit Place search using SMT with State Equation took 161535 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2675/2691 places, 2555/2557 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 323627 ms. Remains : 2675/2691 places, 2555/2557 transitions.
RANDOM walk for 40000 steps (3518 resets) in 413 ms. (96 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (265 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (254 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (250 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (256 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (267 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (248 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (262 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (250 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (265 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (237 resets) in 59 ms. (66 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (245 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (242 resets) in 45 ms. (86 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (259 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (252 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (268 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (269 resets) in 45 ms. (86 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 70018 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 16
Probabilistic random walk after 70018 steps, saw 35028 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
// Phase 1: matrix 2555 rows 2675 cols
[2024-05-22 17:57:59] [INFO ] Invariants computation overflowed in 58 ms
[2024-05-22 17:57:59] [INFO ] State equation strengthened by 326 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 849/1103 variables, 254/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1103 variables, 23/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1103 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2643/3746 variables, 1285/1562 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3746 variables, 153/1715 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3746 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem DoubleExponent-PT-100-ReachabilityFireability-2023-06 is UNSAT
FORMULA DoubleExponent-PT-100-ReachabilityFireability-2023-06 FALSE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5167/5230 variables, and 2797 constraints, problems are : Problem set: 1 solved, 15 unsolved in 75044 ms.
Refiners :[State Equation: 2621/2675 constraints, ReadFeed: 176/326 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 763/989 variables, 226/226 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/989 variables, 22/248 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/989 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2570/3559 variables, 1199/1447 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3559 variables, 144/1591 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3559 variables, 13/1604 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-22 17:59:19] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 3 ms to minimize.
[2024-05-22 17:59:20] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 3 ms to minimize.
[2024-05-22 17:59:20] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 3 ms to minimize.
[2024-05-22 17:59:21] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3559 variables, 4/1608 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3559 variables, 0/1608 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5144/5230 variables, and 2782 constraints, problems are : Problem set: 1 solved, 15 unsolved in 75036 ms.
Refiners :[State Equation: 2599/2675 constraints, ReadFeed: 166/326 constraints, PredecessorRefiner: 13/16 constraints, Known Traps: 4/4 constraints]
After SMT, in 150200ms problems are : Problem set: 1 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 226 out of 2675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2675/2675 places, 2555/2555 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 2675 transition count 2549
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 2669 transition count 2547
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 2667 transition count 2547
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 2667 transition count 2546
Deduced a syphon composed of 1 places in 43 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 2666 transition count 2546
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 43 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 46 place count 2652 transition count 2532
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 43 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 56 place count 2647 transition count 2532
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 70 place count 2647 transition count 2518
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 84 place count 2633 transition count 2518
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 88 place count 2633 transition count 2518
Applied a total of 88 rules in 614 ms. Remains 2633 /2675 variables (removed 42) and now considering 2518/2555 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 615 ms. Remains : 2633/2675 places, 2518/2555 transitions.
RANDOM walk for 40000 steps (3555 resets) in 388 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (268 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (261 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (246 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (265 resets) in 62 ms. (63 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (256 resets) in 22 ms. (173 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (263 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (261 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (265 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (258 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (250 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (267 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (243 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (255 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (257 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (256 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 68246 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 15
Probabilistic random walk after 68246 steps, saw 34138 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
// Phase 1: matrix 2518 rows 2633 cols
[2024-05-22 18:00:33] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 18:00:33] [INFO ] State equation strengthened by 339 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 772/998 variables, 226/226 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/998 variables, 22/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/998 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2563/3561 variables, 1206/1454 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3561 variables, 156/1610 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3561 variables, 0/1610 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5076/5151 variables, and 2746 constraints, problems are : Problem set: 0 solved, 15 unsolved in 90019 ms.
Refiners :[State Equation: 2568/2633 constraints, ReadFeed: 178/339 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 772/998 variables, 226/226 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/998 variables, 22/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/998 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2563/3561 variables, 1206/1454 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3561 variables, 156/1610 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3561 variables, 13/1623 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-22 18:02:31] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3561 variables, 1/1624 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3561 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5076/5151 variables, and 2760 constraints, problems are : Problem set: 0 solved, 15 unsolved in 90024 ms.
Refiners :[State Equation: 2568/2633 constraints, ReadFeed: 178/339 constraints, PredecessorRefiner: 13/15 constraints, Known Traps: 1/1 constraints]
After SMT, in 180136ms problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 226 out of 2633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2633/2633 places, 2518/2518 transitions.
Applied a total of 0 rules in 105 ms. Remains 2633 /2633 variables (removed 0) and now considering 2518/2518 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2633/2633 places, 2518/2518 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2633/2633 places, 2518/2518 transitions.
Applied a total of 0 rules in 107 ms. Remains 2633 /2633 variables (removed 0) and now considering 2518/2518 (removed 0) transitions.
// Phase 1: matrix 2518 rows 2633 cols
[2024-05-22 18:03:34] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 18:03:35] [INFO ] Implicit Places using invariants in 1393 ms returned []
// Phase 1: matrix 2518 rows 2633 cols
[2024-05-22 18:03:35] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 18:03:36] [INFO ] State equation strengthened by 339 read => feed constraints.
[2024-05-22 18:04:06] [INFO ] Performed 48/2633 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2024-05-22 18:04:52] [INFO ] Performed 314/2633 implicitness test of which 13 returned IMPLICIT in 75 seconds.
[2024-05-22 18:05:28] [INFO ] Performed 316/2633 implicitness test of which 13 returned IMPLICIT in 111 seconds.
[2024-05-22 18:06:15] [INFO ] Performed 318/2633 implicitness test of which 13 returned IMPLICIT in 158 seconds.
[2024-05-22 18:06:15] [INFO ] Implicit Places using invariants and state equation in 160084 ms returned [48, 55, 79, 85, 106, 192, 197, 220, 226, 250, 255, 300, 308]
[2024-05-22 18:06:15] [INFO ] Actually due to overlaps returned [197, 55, 192, 48]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 161481 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2629/2633 places, 2518/2518 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2629 transition count 2516
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 2627 transition count 2516
Applied a total of 4 rules in 223 ms. Remains 2627 /2629 variables (removed 2) and now considering 2516/2518 (removed 2) transitions.
// Phase 1: matrix 2516 rows 2627 cols
[2024-05-22 18:06:16] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-22 18:06:17] [INFO ] Implicit Places using invariants in 1413 ms returned []
// Phase 1: matrix 2516 rows 2627 cols
[2024-05-22 18:06:17] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-22 18:06:18] [INFO ] State equation strengthened by 339 read => feed constraints.
SDD proceeding with computation,16 properties remain. new max is 8388608
SDD size :3.31085e+11 after 7.34743e+11
[2024-05-22 18:06:55] [INFO ] Performed 3/2627 implicitness test of which 0 returned IMPLICIT in 36 seconds.
[2024-05-22 18:07:25] [INFO ] Performed 161/2627 implicitness test of which 3 returned IMPLICIT in 66 seconds.
[2024-05-22 18:07:55] [INFO ] Performed 415/2627 implicitness test of which 15 returned IMPLICIT in 96 seconds.
[2024-05-22 18:08:28] [INFO ] Performed 567/2627 implicitness test of which 20 returned IMPLICIT in 129 seconds.
[2024-05-22 18:08:57] [INFO ] Implicit Places using invariants and state equation in 160085 ms returned [76, 82, 103, 214, 220, 244, 249, 294, 302, 325, 333, 357, 362, 383, 389, 469, 477, 502, 508, 567, 619, 626, 649, 655, 677, 685, 708, 713, 737, 744]
[2024-05-22 18:08:57] [INFO ] Actually due to overlaps returned [567, 220, 82, 477, 76, 214, 469]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 161504 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2620/2633 places, 2516/2518 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2620 transition count 2513
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 2617 transition count 2513
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 2617 transition count 2513
Applied a total of 7 rules in 313 ms. Remains 2617 /2620 variables (removed 3) and now considering 2513/2516 (removed 3) transitions.
// Phase 1: matrix 2513 rows 2617 cols
[2024-05-22 18:08:57] [INFO ] Invariants computation overflowed in 78 ms
[2024-05-22 18:08:59] [INFO ] Implicit Places using invariants in 1424 ms returned []
// Phase 1: matrix 2513 rows 2617 cols
[2024-05-22 18:08:59] [INFO ] Invariants computation overflowed in 62 ms
[2024-05-22 18:09:00] [INFO ] State equation strengthened by 339 read => feed constraints.
[2024-05-22 18:09:41] [INFO ] Performed 3/2617 implicitness test of which 0 returned IMPLICIT in 40 seconds.
[2024-05-22 18:10:11] [INFO ] Performed 171/2617 implicitness test of which 1 returned IMPLICIT in 71 seconds.
[2024-05-22 18:10:53] [INFO ] Performed 364/2617 implicitness test of which 9 returned IMPLICIT in 112 seconds.
[2024-05-22 18:11:39] [INFO ] Performed 366/2617 implicitness test of which 9 returned IMPLICIT in 158 seconds.
[2024-05-22 18:11:39] [INFO ] Implicit Places using invariants and state equation in 160108 ms returned [100, 238, 243, 288, 296, 319, 327, 351, 356]
[2024-05-22 18:11:39] [INFO ] Actually due to overlaps returned [243, 100, 238]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 161536 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2614/2633 places, 2513/2518 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2614 transition count 2513
Applied a total of 2 rules in 205 ms. Remains 2614 /2614 variables (removed 0) and now considering 2513/2513 (removed 0) transitions.
// Phase 1: matrix 2513 rows 2614 cols
[2024-05-22 18:11:39] [INFO ] Invariants computation overflowed in 79 ms
[2024-05-22 18:11:40] [INFO ] Implicit Places using invariants in 1434 ms returned []
// Phase 1: matrix 2513 rows 2614 cols
[2024-05-22 18:11:41] [INFO ] Invariants computation overflowed in 69 ms
[2024-05-22 18:11:42] [INFO ] State equation strengthened by 339 read => feed constraints.
[2024-05-22 18:12:12] [INFO ] Performed 3/2614 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 18:12:54] [INFO ] Performed 144/2614 implicitness test of which 0 returned IMPLICIT in 72 seconds.
[2024-05-22 18:14:17] [INFO ] Performed 146/2614 implicitness test of which 0 returned IMPLICIT in 155 seconds.
[2024-05-22 18:14:17] [INFO ] Timeout of Implicit test with SMT after 155 seconds.
[2024-05-22 18:14:17] [INFO ] Implicit Places using invariants and state equation in 156376 ms returned []
Implicit Place search using SMT with State Equation took 157812 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 2614/2633 places, 2513/2518 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 643181 ms. Remains : 2614/2633 places, 2513/2518 transitions.
RANDOM walk for 40000 steps (3522 resets) in 369 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (268 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (256 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (253 resets) in 49 ms. (80 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (263 resets) in 60 ms. (65 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (246 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (265 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (264 resets) in 96 ms. (41 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (275 resets) in 103 ms. (38 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (254 resets) in 49 ms. (80 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (261 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (257 resets) in 60 ms. (65 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (264 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (259 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (256 resets) in 57 ms. (69 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (258 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 58149 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 15
Probabilistic random walk after 58149 steps, saw 29088 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
// Phase 1: matrix 2513 rows 2614 cols
[2024-05-22 18:14:21] [INFO ] Invariants computation overflowed in 67 ms
[2024-05-22 18:14:21] [INFO ] State equation strengthened by 339 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 773/999 variables, 226/226 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 22/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2550/3549 variables, 1197/1445 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3549 variables, 156/1601 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3549 variables, 0/1601 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5051/5127 variables, and 2726 constraints, problems are : Problem set: 0 solved, 15 unsolved in 105027 ms.
Refiners :[State Equation: 2548/2614 constraints, ReadFeed: 178/339 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 773/999 variables, 226/226 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 22/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2550/3549 variables, 1197/1445 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3549 variables, 156/1601 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3549 variables, 13/1614 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-22 18:16:32] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-05-22 18:16:32] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3549 variables, 2/1616 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3549 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 1502/5051 variables, 1125/2741 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SMT process timed out in 210176ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 226 out of 2614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2614/2614 places, 2513/2513 transitions.
Applied a total of 0 rules in 107 ms. Remains 2614 /2614 variables (removed 0) and now considering 2513/2513 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 2614/2614 places, 2513/2513 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2614/2614 places, 2513/2513 transitions.
Applied a total of 0 rules in 104 ms. Remains 2614 /2614 variables (removed 0) and now considering 2513/2513 (removed 0) transitions.
// Phase 1: matrix 2513 rows 2614 cols
[2024-05-22 18:17:51] [INFO ] Invariants computation overflowed in 72 ms
[2024-05-22 18:17:52] [INFO ] Implicit Places using invariants in 1435 ms returned []
// Phase 1: matrix 2513 rows 2614 cols
[2024-05-22 18:17:52] [INFO ] Invariants computation overflowed in 68 ms
[2024-05-22 18:17:54] [INFO ] State equation strengthened by 339 read => feed constraints.
[2024-05-22 18:18:24] [INFO ] Performed 3/2614 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 18:19:07] [INFO ] Performed 144/2614 implicitness test of which 0 returned IMPLICIT in 72 seconds.
[2024-05-22 18:20:28] [INFO ] Performed 146/2614 implicitness test of which 0 returned IMPLICIT in 154 seconds.
[2024-05-22 18:20:28] [INFO ] Timeout of Implicit test with SMT after 154 seconds.
[2024-05-22 18:20:28] [INFO ] Implicit Places using invariants and state equation in 156104 ms returned []
Implicit Place search using SMT with State Equation took 157541 ms to find 0 implicit places.
[2024-05-22 18:20:29] [INFO ] Redundant transitions in 123 ms returned []
Running 2512 sub problems to find dead transitions.
// Phase 1: matrix 2513 rows 2614 cols
[2024-05-22 18:20:29] [INFO ] Invariants computation overflowed in 72 ms
[2024-05-22 18:20:29] [INFO ] State equation strengthened by 339 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-22 18:20:42] [INFO ] Flatten gal took : 148 ms
[2024-05-22 18:20:42] [INFO ] Applying decomposition
[2024-05-22 18:20:42] [INFO ] Flatten gal took : 144 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/graph4615015565862978088.txt' '-o' '/tmp/graph4615015565862978088.bin' '-w' '/tmp/graph4615015565862978088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4615015565862978088.bin' '-l' '-1' '-v' '-w' '/tmp/graph4615015565862978088.weights' '-q' '0' '-e' '0.001'
[2024-05-22 18:20:43] [INFO ] Decomposing Gal with order
[2024-05-22 18:20:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 18:20:45] [INFO ] Removed a total of 1406 redundant transitions.
[2024-05-22 18:20:45] [INFO ] Flatten gal took : 340 ms
[2024-05-22 18:20:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 139 ms.
[2024-05-22 18:20:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13494234896431602817.gal : 72 ms
[2024-05-22 18:20:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15160048211382392761.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/ReachabilityCardinality13494234896431602817.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15160048211382392761.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/ReachabilityCardinality15160048211382392761.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :1 after 12
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :12 after 32
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :32 after 195
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :195 after 518
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2613/5127 variables, and 0 constraints, problems are : Problem set: 0 solved, 2512 unsolved in 30050 ms.
Refiners :[State Equation: 0/2614 constraints, ReadFeed: 0/339 constraints, PredecessorRefiner: 2512/2512 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2512 unsolved
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :518 after 3848
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2613/5127 variables, and 0 constraints, problems are : Problem set: 0 solved, 2512 unsolved in 30037 ms.
Refiners :[State Equation: 0/2614 constraints, ReadFeed: 0/339 constraints, PredecessorRefiner: 0/2512 constraints, Known Traps: 0/0 constraints]
After SMT, in 61690ms problems are : Problem set: 0 solved, 2512 unsolved
Search for dead transitions found 0 dead transitions in 61716ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219523 ms. Remains : 2614/2614 places, 2513/2513 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 2614 transition count 2499
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 2600 transition count 2499
Performed 142 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 142 Pre rules applied. Total rules applied 28 place count 2600 transition count 2357
Deduced a syphon composed of 142 places in 40 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 312 place count 2458 transition count 2357
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 320 place count 2450 transition count 2349
Iterating global reduction 2 with 8 rules applied. Total rules applied 328 place count 2450 transition count 2349
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 332 place count 2450 transition count 2345
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 336 place count 2446 transition count 2345
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 337 place count 2446 transition count 2344
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 338 place count 2445 transition count 2344
Applied a total of 338 rules in 612 ms. Remains 2445 /2614 variables (removed 169) and now considering 2344/2513 (removed 169) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 2344 rows 2445 cols
[2024-05-22 18:21:31] [INFO ] Invariants computation overflowed in 58 ms
[2024-05-22 18:21:32] [INFO ] After 1020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-22 18:24:17] [INFO ] After 163607ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :10
[2024-05-22 18:24:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 18:25:38] [INFO ] After 81025ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :3 sat :10
TRAPS : Iteration 0
[2024-05-22 18:26:07] [INFO ] Deduced a trap composed of 23 places in 1374 ms of which 22 ms to minimize.
[2024-05-22 18:26:09] [INFO ] Deduced a trap composed of 49 places in 1401 ms of which 13 ms to minimize.
[2024-05-22 18:26:10] [INFO ] Deduced a trap composed of 58 places in 1355 ms of which 14 ms to minimize.
[2024-05-22 18:26:12] [INFO ] Deduced a trap composed of 70 places in 1289 ms of which 13 ms to minimize.
[2024-05-22 18:26:13] [INFO ] Deduced a trap composed of 78 places in 1345 ms of which 14 ms to minimize.
[2024-05-22 18:26:15] [INFO ] Deduced a trap composed of 85 places in 1349 ms of which 13 ms to minimize.
[2024-05-22 18:26:16] [INFO ] Deduced a trap composed of 27 places in 1304 ms of which 14 ms to minimize.
[2024-05-22 18:26:17] [INFO ] Deduced a trap composed of 72 places in 1269 ms of which 12 ms to minimize.
[2024-05-22 18:26:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 11948 ms
[2024-05-22 18:26:23] [INFO ] Deduced a trap composed of 24 places in 1481 ms of which 14 ms to minimize.
[2024-05-22 18:26:25] [INFO ] Deduced a trap composed of 29 places in 1447 ms of which 14 ms to minimize.
[2024-05-22 18:26:26] [INFO ] Deduced a trap composed of 44 places in 1449 ms of which 14 ms to minimize.
[2024-05-22 18:26:28] [INFO ] Deduced a trap composed of 45 places in 1446 ms of which 13 ms to minimize.
[2024-05-22 18:26:29] [INFO ] Deduced a trap composed of 33 places in 1441 ms of which 14 ms to minimize.
[2024-05-22 18:26:31] [INFO ] Deduced a trap composed of 51 places in 1434 ms of which 15 ms to minimize.
[2024-05-22 18:26:33] [INFO ] Deduced a trap composed of 53 places in 1438 ms of which 14 ms to minimize.
[2024-05-22 18:26:34] [INFO ] Deduced a trap composed of 54 places in 1463 ms of which 14 ms to minimize.
[2024-05-22 18:26:36] [INFO ] Deduced a trap composed of 71 places in 1408 ms of which 13 ms to minimize.
[2024-05-22 18:26:37] [INFO ] Deduced a trap composed of 71 places in 1439 ms of which 13 ms to minimize.
[2024-05-22 18:26:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 15688 ms
[2024-05-22 18:26:39] [INFO ] Deduced a trap composed of 50 places in 1404 ms of which 14 ms to minimize.
[2024-05-22 18:26:41] [INFO ] Deduced a trap composed of 644 places in 1392 ms of which 14 ms to minimize.
[2024-05-22 18:26:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3787 ms
[2024-05-22 18:27:38] [INFO ] Deduced a trap composed of 51 places in 889 ms of which 11 ms to minimize.
[2024-05-22 18:27:39] [INFO ] Deduced a trap composed of 89 places in 836 ms of which 10 ms to minimize.
[2024-05-22 18:27:40] [INFO ] Deduced a trap composed of 230 places in 621 ms of which 7 ms to minimize.
[2024-05-22 18:27:40] [INFO ] Deduced a trap composed of 231 places in 623 ms of which 6 ms to minimize.
[2024-05-22 18:27:41] [INFO ] Deduced a trap composed of 238 places in 621 ms of which 7 ms to minimize.
[2024-05-22 18:27:42] [INFO ] Deduced a trap composed of 275 places in 602 ms of which 9 ms to minimize.
[2024-05-22 18:27:42] [INFO ] Deduced a trap composed of 278 places in 559 ms of which 5 ms to minimize.
[2024-05-22 18:27:43] [INFO ] Deduced a trap composed of 343 places in 508 ms of which 4 ms to minimize.
[2024-05-22 18:27:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6434 ms
[2024-05-22 18:28:46] [INFO ] Deduced a trap composed of 115 places in 1196 ms of which 11 ms to minimize.
[2024-05-22 18:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1683 ms
[2024-05-22 18:28:48] [INFO ] Deduced a trap composed of 64 places in 1293 ms of which 13 ms to minimize.
[2024-05-22 18:28:50] [INFO ] Deduced a trap composed of 707 places in 1296 ms of which 15 ms to minimize.
[2024-05-22 18:28:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3076 ms
TRAPS : Iteration 1
SMT process timed out, exceeded limit of 225
[2024-05-22 18:29:02] [INFO ] After 285193ms SMT Verify possible using After timeout in natural domain returned unsat :3 sat :4
[2024-05-22 18:29:02] [INFO ] After 450043ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
FORMULA DoubleExponent-PT-100-ReachabilityFireability-2024-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA DoubleExponent-PT-100-ReachabilityFireability-2024-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
FORMULA DoubleExponent-PT-100-ReachabilityFireability-2024-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -3 properties in 451854 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 18:29:03] [INFO ] Flatten gal took : 118 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15723926414427652661
[2024-05-22 18:29:03] [INFO ] Too many transitions (2513) to apply POR reductions. Disabling POR matrices.
[2024-05-22 18:29:03] [INFO ] Applying decomposition
[2024-05-22 18:29:03] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15723926414427652661
Running compilation step : cd /tmp/ltsmin15723926414427652661;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '60' '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-22 18:29:03] [INFO ] Flatten gal took : 124 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/graph3336338358842313811.txt' '-o' '/tmp/graph3336338358842313811.bin' '-w' '/tmp/graph3336338358842313811.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3336338358842313811.bin' '-l' '-1' '-v' '-w' '/tmp/graph3336338358842313811.weights' '-q' '0' '-e' '0.001'
[2024-05-22 18:29:03] [INFO ] Decomposing Gal with order
[2024-05-22 18:29:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 18:29:03] [INFO ] Removed a total of 1190 redundant transitions.
[2024-05-22 18:29:03] [INFO ] Flatten gal took : 211 ms
[2024-05-22 18:29:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 710 labels/synchronizations in 44 ms.
[2024-05-22 18:29:04] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9284214264347535199.gal : 35 ms
[2024-05-22 18:29:04] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16784741147307995999.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/ReachabilityFireability9284214264347535199.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16784741147307995999.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/ReachabilityFireability16784741147307995999.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :1 after 12
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :12 after 21
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :21 after 57
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :57 after 111
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :111 after 1639
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :1639 after 121860
Compilation finished in 8953 ms.
Running link step : cd /tmp/ltsmin15723926414427652661;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202400==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202401==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202401==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202404==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202404==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202305==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202305==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202407==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202407==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202309==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202309==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202410==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202410==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202411==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202411==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202412==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202412==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202413==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202413==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202414==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202414==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202315==true'
WARNING : LTSmin timed out (>25 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202315==true'
Retrying LTSmin with larger timeout 2400 s
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202400==true'
WARNING : LTSmin timed out (>200 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202401==true'
WARNING : LTSmin timed out (>200 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202401==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202404==true'
WARNING : LTSmin timed out (>200 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202404==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202305==true'
WARNING : LTSmin timed out (>200 s) on command cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202305==true'
Running LTSmin : cd /tmp/ltsmin15723926414427652661;'/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' 'DoubleExponentPT100ReachabilityFireability202407==true'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-100"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-100, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631133000575"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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