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.r356-tall-171683762000838.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 ShieldRVs-PT-040A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762000838
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 256K May 18 16:43 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 ShieldRVs-PT-040A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-040A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717056542150

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-30 08:09:03] [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-30 08:09:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 08:09:03] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-05-30 08:09:03] [INFO ] Transformed 563 places.
[2024-05-30 08:09:03] [INFO ] Transformed 763 transitions.
[2024-05-30 08:09:03] [INFO ] Found NUPN structural information;
[2024-05-30 08:09:03] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (72 resets) in 1815 ms. (22 steps per ms) remains 1/12 properties
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040A-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 08:09:04] [INFO ] Flatten gal took : 302 ms
BEST_FIRST walk for 40001 steps (8 resets) in 628 ms. (63 steps per ms) remains 1/1 properties
// Phase 1: matrix 763 rows 563 cols
[2024-05-30 08:09:04] [INFO ] Flatten gal took : 85 ms
[2024-05-30 08:09:04] [INFO ] Computed 161 invariants in 28 ms
[2024-05-30 08:09:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1840128478310808743.gal : 50 ms
[2024-05-30 08:09:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4462559370099604982.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/ReachabilityCardinality1840128478310808743.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4462559370099604982.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
All remaining problems are real, not stopping.
Loading property file /tmp/ReachabilityCardinality4462559370099604982.prop.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 535/563 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 206
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :206 after 1274
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1274 after 57748
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 535/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :57748 after 628365
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :628365 after 6.55089e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.55089e+06 after 6.06166e+08
At refinement iteration 5 (OVERLAPS) 763/1326 variables, 563/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1326 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1326 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 1287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 698 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 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/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 535/563 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 535/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.06166e+08 after 5.72653e+10
[2024-05-30 08:09:05] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 22 ms to minimize.
[2024-05-30 08:09:05] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-05-30 08:09:05] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-30 08:09:05] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-30 08:09:06] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.72653e+10 after 5.56325e+12
[2024-05-30 08:09:06] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-05-30 08:09:06] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 7 ms to minimize.
[2024-05-30 08:09:06] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-30 08:09:06] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-30 08:09:06] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:09:06] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:09:06] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 08:09:06] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-30 08:09:06] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 14/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 763/1326 variables, 563/1301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1326 variables, 1/1302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 08:09:07] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:09:07] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-30 08:09:07] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:09:07] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-30 08:09:07] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-05-30 08:09:07] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-05-30 08:09:07] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.56325e+12 after 6.0254e+15
[2024-05-30 08:09:07] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 08:09:07] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-30 08:09:07] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1326 variables, 10/1312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1326 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1326 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 1312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2803 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 24/24 constraints]
After SMT, in 3652ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 506 ms.
Support contains 28 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 77 times.
Drop transitions (Partial Free agglomeration) removed 77 transitions
Iterating global reduction 0 with 77 rules applied. Total rules applied 79 place count 562 transition count 762
Applied a total of 79 rules in 156 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 562/563 places, 762/763 transitions.
RANDOM walk for 40000 steps (84 resets) in 977 ms. (40 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :6.0254e+15 after 4.83197e+19
Interrupted probabilistic random walk after 342663 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 342663 steps, saw 83304 distinct states, run finished after 3005 ms. (steps per millisecond=114 ) properties seen :0
// Phase 1: matrix 762 rows 562 cols
[2024-05-30 08:09:12] [INFO ] Computed 161 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 534/562 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 534/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 762/1324 variables, 562/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1324 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 1285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 342 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 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/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 534/562 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 534/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 08:09:12] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-05-30 08:09:12] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-05-30 08:09:12] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-30 08:09:13] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-30 08:09:13] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-30 08:09:13] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-30 08:09:13] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-30 08:09:13] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-05-30 08:09:13] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-30 08:09:13] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 5 ms to minimize.
[2024-05-30 08:09:13] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-30 08:09:13] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-30 08:09:13] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:09:13] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-30 08:09:13] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-30 08:09:13] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
[2024-05-30 08:09:14] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 08:09:14] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-30 08:09:14] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 19/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 762/1324 variables, 562/1304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 1/1305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 08:09:14] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-30 08:09:14] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2024-05-30 08:09:14] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-30 08:09:15] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-30 08:09:15] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-30 08:09:15] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-30 08:09:15] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-05-30 08:09:15] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-30 08:09:15] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-30 08:09:15] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:09:15] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:09:15] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2024-05-30 08:09:16] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 8 ms to minimize.
[2024-05-30 08:09:16] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:09:16] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2024-05-30 08:09:16] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:09:16] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:09:16] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:09:16] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1324 variables, 19/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1324 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 08:09:16] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/1324 variables, 1/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1324 variables, 0/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1324 variables, 0/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 1325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4503 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 39/39 constraints]
After SMT, in 4898ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 265 ms.
Support contains 28 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 41 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 562/562 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Applied a total of 0 rules in 34 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-05-30 08:09:17] [INFO ] Invariant cache hit.
[2024-05-30 08:09:17] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-30 08:09:17] [INFO ] Invariant cache hit.
[2024-05-30 08:09:18] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :4.83197e+19 after 3.74193e+26
[2024-05-30 08:09:18] [INFO ] Redundant transitions in 132 ms returned [163]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 760 sub problems to find dead transitions.
// Phase 1: matrix 761 rows 562 cols
[2024-05-30 08:09:18] [INFO ] Computed 161 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 760 unsolved
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :3.74193e+26 after 2.73959e+40
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:09:37] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 4 ms to minimize.
[2024-05-30 08:09:37] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-30 08:09:37] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 3 ms to minimize.
[2024-05-30 08:09:37] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 2 ms to minimize.
[2024-05-30 08:09:37] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 3 ms to minimize.
[2024-05-30 08:09:38] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-05-30 08:09:38] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 3 ms to minimize.
[2024-05-30 08:09:38] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
[2024-05-30 08:09:38] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 3 ms to minimize.
[2024-05-30 08:09:38] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-05-30 08:09:38] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 3 ms to minimize.
[2024-05-30 08:09:39] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 3 ms to minimize.
[2024-05-30 08:09:39] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 3 ms to minimize.
[2024-05-30 08:09:39] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 2 ms to minimize.
[2024-05-30 08:09:39] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 2 ms to minimize.
[2024-05-30 08:09:39] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 2 ms to minimize.
[2024-05-30 08:09:39] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 3 ms to minimize.
[2024-05-30 08:09:39] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-05-30 08:09:40] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 2 ms to minimize.
[2024-05-30 08:09:40] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/743 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:09:40] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 3 ms to minimize.
[2024-05-30 08:09:40] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-05-30 08:09:40] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 3 ms to minimize.
[2024-05-30 08:09:41] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 3 ms to minimize.
[2024-05-30 08:09:41] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 3 ms to minimize.
[2024-05-30 08:09:41] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2024-05-30 08:09:41] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2024-05-30 08:09:41] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 3 ms to minimize.
[2024-05-30 08:09:41] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 2 ms to minimize.
[2024-05-30 08:09:42] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-05-30 08:09:42] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-05-30 08:09:42] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 3 ms to minimize.
[2024-05-30 08:09:42] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 3 ms to minimize.
[2024-05-30 08:09:42] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 3 ms to minimize.
[2024-05-30 08:09:42] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 3 ms to minimize.
[2024-05-30 08:09:42] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 3 ms to minimize.
[2024-05-30 08:09:43] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-05-30 08:09:43] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 3 ms to minimize.
[2024-05-30 08:09:43] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-30 08:09:43] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/763 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:09:43] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-05-30 08:09:44] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 2 ms to minimize.
[2024-05-30 08:09:44] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 3 ms to minimize.
[2024-05-30 08:09:44] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:09:44] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 3 ms to minimize.
[2024-05-30 08:09:44] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-30 08:09:44] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 2 ms to minimize.
[2024-05-30 08:09:44] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-30 08:09:44] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-05-30 08:09:44] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:09:45] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 08:09:45] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-05-30 08:09:45] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-30 08:09:45] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:09:45] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-30 08:09:45] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-30 08:09:45] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:09:45] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:09:45] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:09:45] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)timeout

(s180 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/783 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/1323 variables, and 783 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30044 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 60/783 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:09:55] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-30 08:09:55] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 2 ms to minimize.
[2024-05-30 08:09:55] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 3 ms to minimize.
[2024-05-30 08:09:56] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 2 ms to minimize.
[2024-05-30 08:09:56] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-30 08:09:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-30 08:09:56] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-30 08:09:56] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-30 08:09:56] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-30 08:09:56] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 08:09:56] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 2 ms to minimize.
[2024-05-30 08:09:56] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 2 ms to minimize.
[2024-05-30 08:09:56] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 4 ms to minimize.
[2024-05-30 08:09:57] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 2 ms to minimize.
[2024-05-30 08:09:57] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 3 ms to minimize.
[2024-05-30 08:09:57] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 2 ms to minimize.
[2024-05-30 08:09:57] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2024-05-30 08:09:57] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 3 ms to minimize.
[2024-05-30 08:09:57] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-30 08:09:57] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/803 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:09:58] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 08:09:58] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-30 08:09:58] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-30 08:09:58] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 3 ms to minimize.
[2024-05-30 08:09:58] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-05-30 08:09:59] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 3 ms to minimize.
[2024-05-30 08:09:59] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-05-30 08:09:59] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 08:09:59] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-30 08:09:59] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 3 ms to minimize.
[2024-05-30 08:09:59] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-05-30 08:09:59] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-05-30 08:10:00] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-05-30 08:10:00] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
[2024-05-30 08:10:00] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-05-30 08:10:00] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-05-30 08:10:00] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-05-30 08:10:00] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-30 08:10:00] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 3 ms to minimize.
[2024-05-30 08:10:01] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/823 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:10:01] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:10:01] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:10:01] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-05-30 08:10:02] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-30 08:10:02] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:10:02] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:10:02] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-30 08:10:02] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-05-30 08:10:02] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:10:02] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:10:02] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-30 08:10:02] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2024-05-30 08:10:02] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:10:03] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 4 ms to minimize.
[2024-05-30 08:10:03] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2024-05-30 08:10:03] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 3 ms to minimize.
[2024-05-30 08:10:03] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 2 ms to minimize.
[2024-05-30 08:10:03] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 2 ms to minimize.
[2024-05-30 08:10:03] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 2 ms to minimize.
[2024-05-30 08:10:04] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 20/843 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:10:04] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 2 ms to minimize.
[2024-05-30 08:10:04] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
[2024-05-30 08:10:04] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 2 ms to minimize.
[2024-05-30 08:10:05] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 2 ms to minimize.
[2024-05-30 08:10:05] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:10:05] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2024-05-30 08:10:05] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 2 ms to minimize.
[2024-05-30 08:10:05] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-30 08:10:06] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-30 08:10:06] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:10:06] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:10:06] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:10:06] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-05-30 08:10:06] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2024-05-30 08:10:06] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-30 08:10:06] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-30 08:10:06] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 0 ms to minimize.
[2024-05-30 08:10:06] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-30 08:10:06] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-30 08:10:06] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 20/863 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:10:07] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-05-30 08:10:07] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:10:07] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-30 08:10:08] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-30 08:10:08] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2024-05-30 08:10:08] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:10:08] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-30 08:10:08] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-30 08:10:08] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-05-30 08:10:08] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-30 08:10:08] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:10:08] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 3 ms to minimize.
[2024-05-30 08:10:09] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-05-30 08:10:09] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-05-30 08:10:09] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
[2024-05-30 08:10:09] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:10:09] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2024-05-30 08:10:09] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-30 08:10:09] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-05-30 08:10:09] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 20/883 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:10:10] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 3 ms to minimize.
[2024-05-30 08:10:10] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 08:10:11] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 08:10:11] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-30 08:10:11] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:10:11] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-30 08:10:11] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-30 08:10:11] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-30 08:10:11] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 3 ms to minimize.
[2024-05-30 08:10:11] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2024-05-30 08:10:11] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-30 08:10:12] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-30 08:10:12] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-05-30 08:10:12] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2024-05-30 08:10:12] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2024-05-30 08:10:12] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 08:10:12] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2024-05-30 08:10:12] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-05-30 08:10:12] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-30 08:10:12] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 20/903 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:10:13] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2024-05-30 08:10:14] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-05-30 08:10:14] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-30 08:10:14] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-05-30 08:10:14] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-30 08:10:14] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 2 ms to minimize.
[2024-05-30 08:10:14] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-30 08:10:14] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-05-30 08:10:15] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-30 08:10:15] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-05-30 08:10:15] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2024-05-30 08:10:15] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 08:10:15] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 4 ms to minimize.
[2024-05-30 08:10:15] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
[2024-05-30 08:10:15] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-30 08:10:15] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2024-05-30 08:10:15] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-30 08:10:15] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-05-30 08:10:16] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2024-05-30 08:10:16] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/562 variables, 20/923 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:10:16] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 3 ms to minimize.
[2024-05-30 08:10:16] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 3 ms to minimize.
[2024-05-30 08:10:17] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-05-30 08:10:18] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:10:18] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:10:18] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-05-30 08:10:18] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:10:18] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-05-30 08:10:18] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-30 08:10:18] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 2 ms to minimize.
[2024-05-30 08:10:18] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
SMT process timed out in 60569ms, After SMT, problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 60584ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 562/562 places, 761/762 transitions.
Applied a total of 0 rules in 37 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61736 ms. Remains : 562/562 places, 761/762 transitions.
RANDOM walk for 40000 steps (82 resets) in 282 ms. (141 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 344937 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 344937 steps, saw 83762 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-30 08:10:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 534/562 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 534/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 761/1323 variables, 562/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1323 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1323 variables, 0/1285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 1285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 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/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 534/562 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 534/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 08:10:22] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-05-30 08:10:22] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-30 08:10:22] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:10:23] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:10:23] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:10:23] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:10:23] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:10:23] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-30 08:10:23] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 08:10:23] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 08:10:23] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-30 08:10:23] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 12/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 761/1323 variables, 562/1297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1323 variables, 1/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 08:10:23] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-30 08:10:23] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-30 08:10:24] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 08:10:24] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-30 08:10:24] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-30 08:10:24] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-30 08:10:24] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 08:10:24] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2024-05-30 08:10:24] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-30 08:10:24] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-30 08:10:24] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-30 08:10:24] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 8 ms to minimize.
[2024-05-30 08:10:24] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-05-30 08:10:24] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-30 08:10:25] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-30 08:10:25] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:10:25] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:10:25] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-30 08:10:25] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 08:10:25] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1323 variables, 20/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1323 variables, 0/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1323 variables, 0/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 1318 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2992 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 562/562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 32/32 constraints]
After SMT, in 3339ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 272 ms.
Support contains 28 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 50 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 562/562 places, 761/761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 761/761 transitions.
Applied a total of 0 rules in 17 ms. Remains 562 /562 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2024-05-30 08:10:25] [INFO ] Invariant cache hit.
[2024-05-30 08:10:26] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-30 08:10:26] [INFO ] Invariant cache hit.
[2024-05-30 08:10:26] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
[2024-05-30 08:10:26] [INFO ] Redundant transitions in 68 ms returned []
Running 760 sub problems to find dead transitions.
[2024-05-30 08:10:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:10:45] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 4 ms to minimize.
[2024-05-30 08:10:45] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 2 ms to minimize.
[2024-05-30 08:10:45] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
[2024-05-30 08:10:45] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
[2024-05-30 08:10:45] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 3 ms to minimize.
[2024-05-30 08:10:45] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 3 ms to minimize.
[2024-05-30 08:10:46] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 2 ms to minimize.
[2024-05-30 08:10:46] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 3 ms to minimize.
[2024-05-30 08:10:46] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 2 ms to minimize.
[2024-05-30 08:10:46] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 3 ms to minimize.
[2024-05-30 08:10:46] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 3 ms to minimize.
[2024-05-30 08:10:46] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 2 ms to minimize.
[2024-05-30 08:10:47] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 3 ms to minimize.
[2024-05-30 08:10:47] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 3 ms to minimize.
[2024-05-30 08:10:47] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
[2024-05-30 08:10:47] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 2 ms to minimize.
[2024-05-30 08:10:47] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-05-30 08:10:47] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 3 ms to minimize.
[2024-05-30 08:10:48] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-05-30 08:10:48] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 20/743 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:10:48] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-30 08:10:48] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-05-30 08:10:48] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2024-05-30 08:10:49] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-05-30 08:10:49] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2024-05-30 08:10:49] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 3 ms to minimize.
[2024-05-30 08:10:49] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-05-30 08:10:49] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 2 ms to minimize.
[2024-05-30 08:10:49] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2024-05-30 08:10:49] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 3 ms to minimize.
[2024-05-30 08:10:50] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-05-30 08:10:50] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2024-05-30 08:10:50] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-30 08:10:50] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-30 08:10:50] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-30 08:10:50] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-05-30 08:10:51] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
[2024-05-30 08:10:51] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2024-05-30 08:10:51] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 3 ms to minimize.
[2024-05-30 08:10:51] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/763 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:10:51] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-05-30 08:10:51] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 2 ms to minimize.
[2024-05-30 08:10:52] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-05-30 08:10:52] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-30 08:10:52] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-05-30 08:10:52] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-30 08:10:52] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-05-30 08:10:52] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-30 08:10:52] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
[2024-05-30 08:10:52] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-30 08:10:52] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 08:10:53] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2024-05-30 08:10:53] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-05-30 08:10:53] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:10:53] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-30 08:10:53] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-30 08:10:53] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2024-05-30 08:10:53] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 08:10:53] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-30 08:10:53] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/783 constraints. Problems are: Problem set: 0 solved, 760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 562/1323 variables, and 783 constraints, problems are : Problem set: 0 solved, 760 unsolved in 30028 ms.
Refiners :[Domain max(s): 562/562 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/562 constraints, PredecessorRefiner: 760/760 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 561/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/561 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 2 (OVERLAPS) 1/562 variables, 161/722 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/562 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 760 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 60/783 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:11:03] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 08:11:04] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 3 ms to minimize.
[2024-05-30 08:11:04] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 2 ms to minimize.
[2024-05-30 08:11:04] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 3 ms to minimize.
[2024-05-30 08:11:04] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-30 08:11:04] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-30 08:11:04] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-30 08:11:04] [INFO ] Deduced a trap composed of 147 places in 157 ms of which 3 ms to minimize.
[2024-05-30 08:11:05] [INFO ] Deduced a trap composed of 145 places in 171 ms of which 3 ms to minimize.
[2024-05-30 08:11:05] [INFO ] Deduced a trap composed of 149 places in 161 ms of which 3 ms to minimize.
[2024-05-30 08:11:05] [INFO ] Deduced a trap composed of 141 places in 160 ms of which 3 ms to minimize.
[2024-05-30 08:11:05] [INFO ] Deduced a trap composed of 146 places in 160 ms of which 2 ms to minimize.
[2024-05-30 08:11:05] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 2 ms to minimize.
[2024-05-30 08:11:06] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 3 ms to minimize.
[2024-05-30 08:11:06] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-30 08:11:06] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 3 ms to minimize.
[2024-05-30 08:11:06] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 3 ms to minimize.
[2024-05-30 08:11:06] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 2 ms to minimize.
[2024-05-30 08:11:06] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-30 08:11:06] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 20/803 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:11:07] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 2 ms to minimize.
[2024-05-30 08:11:07] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 2 ms to minimize.
[2024-05-30 08:11:07] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:11:08] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-30 08:11:08] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2024-05-30 08:11:08] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 3 ms to minimize.
[2024-05-30 08:11:08] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-05-30 08:11:08] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 3 ms to minimize.
[2024-05-30 08:11:08] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 3 ms to minimize.
[2024-05-30 08:11:08] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-30 08:11:09] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 2 ms to minimize.
[2024-05-30 08:11:09] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-05-30 08:11:09] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-30 08:11:09] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 3 ms to minimize.
[2024-05-30 08:11:09] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-05-30 08:11:09] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-05-30 08:11:09] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-05-30 08:11:10] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-30 08:11:10] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-05-30 08:11:10] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 20/823 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:11:10] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-30 08:11:10] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-30 08:11:11] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 2 ms to minimize.
[2024-05-30 08:11:11] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 08:11:11] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-30 08:11:11] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-30 08:11:11] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:11:11] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 08:11:11] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 3 ms to minimize.
[2024-05-30 08:11:11] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2024-05-30 08:11:11] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2024-05-30 08:11:11] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:11:12] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-30 08:11:12] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-30 08:11:12] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-30 08:11:12] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 2 ms to minimize.
[2024-05-30 08:11:12] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-05-30 08:11:12] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 2 ms to minimize.
[2024-05-30 08:11:12] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 2 ms to minimize.
[2024-05-30 08:11:13] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 20/843 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:11:13] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-30 08:11:13] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 08:11:14] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-05-30 08:11:14] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-05-30 08:11:14] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 2 ms to minimize.
[2024-05-30 08:11:14] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 2 ms to minimize.
[2024-05-30 08:11:14] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 2 ms to minimize.
[2024-05-30 08:11:14] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2024-05-30 08:11:15] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 3 ms to minimize.
[2024-05-30 08:11:15] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-05-30 08:11:15] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2024-05-30 08:11:15] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 2 ms to minimize.
[2024-05-30 08:11:15] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
[2024-05-30 08:11:15] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
[2024-05-30 08:11:16] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 2 ms to minimize.
[2024-05-30 08:11:16] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-05-30 08:11:16] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-05-30 08:11:16] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-05-30 08:11:16] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-05-30 08:11:16] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 20/863 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:11:17] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 2 ms to minimize.
[2024-05-30 08:11:18] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-05-30 08:11:18] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 2 ms to minimize.
[2024-05-30 08:11:18] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-05-30 08:11:18] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
[2024-05-30 08:11:18] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-05-30 08:11:18] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 2 ms to minimize.
[2024-05-30 08:11:18] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-30 08:11:19] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 2 ms to minimize.
[2024-05-30 08:11:19] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-05-30 08:11:19] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
[2024-05-30 08:11:19] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2024-05-30 08:11:19] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2024-05-30 08:11:19] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-30 08:11:20] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2024-05-30 08:11:20] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 3 ms to minimize.
[2024-05-30 08:11:20] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-05-30 08:11:20] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-05-30 08:11:20] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 2 ms to minimize.
[2024-05-30 08:11:20] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 20/883 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:11:21] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2024-05-30 08:11:21] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 08:11:21] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-30 08:11:22] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-05-30 08:11:22] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-05-30 08:11:22] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2024-05-30 08:11:22] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-30 08:11:22] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-05-30 08:11:22] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
[2024-05-30 08:11:22] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-30 08:11:22] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-30 08:11:22] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2024-05-30 08:11:23] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 20/903 constraints. Problems are: Problem set: 0 solved, 760 unsolved
[2024-05-30 08:11:24] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 3 ms to minimize.
[2024-05-30 08:11:24] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-05-30 08:11:24] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 08:11:24] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-30 08:11:24] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-30 08:11:24] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 08:11:25] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 08:11:25] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-05-30 08:11:25] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2024-05-30 08:11:26] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
[2024-05-30 08:11:27] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-30 08:11:27] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-30 08:11:27] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 60363ms, After SMT, problems are : Problem set: 0 solved, 760 unsolved
Search for dead transitions found 0 dead transitions in 60371ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61342 ms. Remains : 562/562 places, 761/761 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 08:11:27] [INFO ] Flatten gal took : 67 ms
[2024-05-30 08:11:27] [INFO ] Applying decomposition
[2024-05-30 08:11:27] [INFO ] Flatten gal took : 55 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/graph12908365543166195424.txt' '-o' '/tmp/graph12908365543166195424.bin' '-w' '/tmp/graph12908365543166195424.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12908365543166195424.bin' '-l' '-1' '-v' '-w' '/tmp/graph12908365543166195424.weights' '-q' '0' '-e' '0.001'
[2024-05-30 08:11:27] [INFO ] Decomposing Gal with order
[2024-05-30 08:11:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 08:11:28] [INFO ] Removed a total of 837 redundant transitions.
[2024-05-30 08:11:28] [INFO ] Flatten gal took : 119 ms
[2024-05-30 08:11:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 896 labels/synchronizations in 59 ms.
[2024-05-30 08:11:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality62750561412220406.gal : 15 ms
[2024-05-30 08:11:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6625512426831146404.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/ReachabilityCardinality62750561412220406.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6625512426831146404.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 ...305
Loading property file /tmp/ReachabilityCardinality6625512426831146404.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 23
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :23 after 601
ITS-tools command line returned an error code 137
[2024-05-30 08:23:48] [INFO ] Flatten gal took : 59 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8375673172044686310
[2024-05-30 08:23:48] [INFO ] Applying decomposition
[2024-05-30 08:23:48] [INFO ] Computing symmetric may disable matrix : 761 transitions.
[2024-05-30 08:23:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:23:48] [INFO ] Computing symmetric may enable matrix : 761 transitions.
[2024-05-30 08:23:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:23:48] [INFO ] Flatten gal took : 39 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/graph18364096150923147106.txt' '-o' '/tmp/graph18364096150923147106.bin' '-w' '/tmp/graph18364096150923147106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18364096150923147106.bin' '-l' '-1' '-v' '-w' '/tmp/graph18364096150923147106.weights' '-q' '0' '-e' '0.001'
[2024-05-30 08:23:48] [INFO ] Decomposing Gal with order
[2024-05-30 08:23:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 08:23:48] [INFO ] Computing Do-Not-Accords matrix : 761 transitions.
[2024-05-30 08:23:48] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 08:23:48] [INFO ] Removed a total of 873 redundant transitions.
[2024-05-30 08:23:48] [INFO ] Built C files in 254ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8375673172044686310
[2024-05-30 08:23:48] [INFO ] Flatten gal took : 62 ms
Running compilation step : cd /tmp/ltsmin8375673172044686310;'/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-30 08:23:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 925 labels/synchronizations in 32 ms.
[2024-05-30 08:23:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17632143654332977583.gal : 10 ms
[2024-05-30 08:23:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11525522573647177742.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/ReachabilityCardinality17632143654332977583.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11525522573647177742.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/ReachabilityCardinality11525522573647177742.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 31
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :31 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 32
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :32 after 17555
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :17555 after 4.65679e+35
Compilation finished in 2587 ms.
Running link step : cd /tmp/ltsmin8375673172044686310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin8375673172044686310;'/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' 'ShieldRVsPT040AReachabilityCardinality202405==true'
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( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.081: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.081: Initializing POR dependencies: labels 762, guards 761
pins2lts-mc-linux64( 5/ 8), 0.099: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.112: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.116: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.121: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.133: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.146: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 9.302: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 7/ 8), 9.740: "ShieldRVsPT040AReachabilityCardinality202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 9.742: "ShieldRVsPT040AReachabilityCardinality202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 9.741: "ShieldRVsPT040AReachabilityCardinality202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 9.741: "ShieldRVsPT040AReachabilityCardinality202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 9.744: "ShieldRVsPT040AReachabilityCardinality202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 9.743: "ShieldRVsPT040AReachabilityCardinality202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 9.744: "ShieldRVsPT040AReachabilityCardinality202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 9.746: There are 762 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 9.746: State length is 562, there are 761 groups
pins2lts-mc-linux64( 0/ 8), 9.746: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 9.746: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 9.746: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 9.746: Visible groups: 0 / 761, labels: 1 / 762
pins2lts-mc-linux64( 0/ 8), 9.746: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 9.746: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 9.745: "ShieldRVsPT040AReachabilityCardinality202405==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 9.813: ~10 levels ~960 states ~3704 transitions
pins2lts-mc-linux64( 0/ 8), 9.884: ~11 levels ~1920 states ~8120 transitions
pins2lts-mc-linux64( 0/ 8), 10.018: ~13 levels ~3840 states ~18384 transitions
pins2lts-mc-linux64( 0/ 8), 10.321: ~14 levels ~7680 states ~39464 transitions
pins2lts-mc-linux64( 1/ 8), 10.812: ~6 levels ~15360 states ~87440 transitions
pins2lts-mc-linux64( 0/ 8), 11.755: ~16 levels ~30720 states ~182288 transitions
pins2lts-mc-linux64( 5/ 8), 13.702: ~9 levels ~61440 states ~385968 transitions
pins2lts-mc-linux64( 1/ 8), 17.676: ~9 levels ~122880 states ~821824 transitions
pins2lts-mc-linux64( 1/ 8), 24.848: ~10 levels ~245760 states ~1694032 transitions
pins2lts-mc-linux64( 1/ 8), 40.171: ~11 levels ~491520 states ~3582376 transitions
pins2lts-mc-linux64( 1/ 8), 71.363: ~12 levels ~983040 states ~7418016 transitions
pins2lts-mc-linux64( 1/ 8), 136.896: ~13 levels ~1966080 states ~15530608 transitions
pins2lts-mc-linux64( 1/ 8), 272.165: ~14 levels ~3932160 states ~32140448 transitions
pins2lts-mc-linux64( 4/ 8), 491.170: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 491.286:
pins2lts-mc-linux64( 0/ 8), 491.286: mean standard work distribution: 5.7% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 491.286:
pins2lts-mc-linux64( 0/ 8), 491.286: Explored 6282405 states 57159432 transitions, fanout: 9.098
pins2lts-mc-linux64( 0/ 8), 491.286: Total exploration time 481.540 sec (481.470 sec minimum, 481.504 sec on average)
pins2lts-mc-linux64( 0/ 8), 491.286: States per second: 13046, Transitions per second: 118701
pins2lts-mc-linux64( 0/ 8), 491.286: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 491.286:
pins2lts-mc-linux64( 0/ 8), 491.286: Queue width: 8B, total height: 6618074, memory: 50.49MB
pins2lts-mc-linux64( 0/ 8), 491.286: Tree memory: 354.4MB, 28.8 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 491.286: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 491.286: Stored 874 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 491.286: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 491.286: Est. total memory use: 404.9MB (~1074.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8375673172044686310;'/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' 'ShieldRVsPT040AReachabilityCardinality202405==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8375673172044686310;'/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' 'ShieldRVsPT040AReachabilityCardinality202405==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)
ITS-tools command line returned an error code 137
[2024-05-30 08:39:46] [INFO ] Applying decomposition
[2024-05-30 08:39:46] [INFO ] Flatten gal took : 36 ms
[2024-05-30 08:39:46] [INFO ] Decomposing Gal with order
[2024-05-30 08:39:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 08:39:46] [INFO ] Removed a total of 912 redundant transitions.
[2024-05-30 08:39:46] [INFO ] Flatten gal took : 49 ms
[2024-05-30 08:39:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 593 labels/synchronizations in 16 ms.
[2024-05-30 08:39:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15117898934530425515.gal : 5 ms
[2024-05-30 08:39:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5346366163851359794.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/ReachabilityCardinality15117898934530425515.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5346366163851359794.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/ReachabilityCardinality5346366163851359794.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 1100
Detected timeout of ITS tools.
[2024-05-30 09:04:41] [INFO ] Flatten gal took : 32 ms
[2024-05-30 09:04:41] [INFO ] Input system was already deterministic with 761 transitions.
[2024-05-30 09:04:42] [INFO ] Transformed 562 places.
[2024-05-30 09:04:42] [INFO ] Transformed 761 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 09:04:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14756278749393675915.gal : 7 ms
[2024-05-30 09:04:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6274711395187810501.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/ReachabilityCardinality14756278749393675915.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6274711395187810501.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...374
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality6274711395187810501.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 40
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :40 after 84
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :84 after 170
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :170 after 305
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :305 after 7150
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7150 after 18737
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :18737 after 502548
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :502548 after 1.55705e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.55705e+07 after 1.11735e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.11735e+09 after 3.60003e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.60003e+11 after 5.61027e+13
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.61027e+13 after 5.16728e+16
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :5.16728e+16 after 3.84454e+21
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :3.84454e+21 after 2.34854e+33

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="ShieldRVs-PT-040A"
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 ShieldRVs-PT-040A, 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 r356-tall-171683762000838"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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