Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447200471.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-PT-S05J60, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447200471
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 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 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 PolyORBNT-PT-S05J60-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716931428216

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 21:23:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 21:23:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:23:49] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2024-05-28 21:23:49] [INFO ] Transformed 909 places.
[2024-05-28 21:23:49] [INFO ] Transformed 1970 transitions.
[2024-05-28 21:23:49] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 21:23:49] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 21:23:49] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 21:23:49] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 21:23:49] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
[2024-05-28 21:23:50] [INFO ] Flatten gal took : 239 ms
RANDOM walk for 40000 steps (2719 resets) in 2526 ms. (15 steps per ms) remains 12/16 properties
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 21:23:50] [INFO ] Flatten gal took : 164 ms
[2024-05-28 21:23:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10368194762385548167.gal : 110 ms
[2024-05-28 21:23:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8603838274563650685.prop : 24 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/ReachabilityCardinality10368194762385548167.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8603838274563650685.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8603838274563650685.prop.
BEST_FIRST walk for 40002 steps (999 resets) in 3559 ms. (11 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (889 resets) in 2012 ms. (19 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (418 resets) in 263 ms. (151 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :16 after 32
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :32 after 64
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :64 after 99
BEST_FIRST walk for 40003 steps (55 resets) in 2344 ms. (17 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :99 after 103
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :103 after 111
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :111 after 126
BEST_FIRST walk for 40004 steps (580 resets) in 488 ms. (81 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :126 after 154
BEST_FIRST walk for 40001 steps (1093 resets) in 306 ms. (130 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (36 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (456 resets) in 156 ms. (254 steps per ms) remains 11/12 properties
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (55 resets) in 128 ms. (310 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (46 resets) in 234 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (111 resets) in 333 ms. (119 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (55 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
[2024-05-28 21:23:53] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-28 21:23:53] [INFO ] Computed 142 invariants in 103 ms
[2024-05-28 21:23:53] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/797 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/797 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/797 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 105/902 variables, 95/118 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-09 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-12 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-15 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/902 variables, 19/137 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 0/137 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-00 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-02 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-05 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-06 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-07 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-13 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-14 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 7/909 variables, 5/142 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/909 variables, 0/142 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1311/2220 variables, 909/1051 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2220 variables, 1/1052 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2220 variables, 0/1052 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2220 variables, 0/1052 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2220/2220 variables, and 1052 constraints, problems are : Problem set: 10 solved, 1 unsolved in 2634 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 399/400 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/2 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 456/856 variables, 111/113 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/856 variables, 0/113 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/908 variables, 29/142 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/908 variables, 0/142 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1311/2219 variables, 908/1050 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2219 variables, 1/1051 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2219 variables, 0/1051 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2220 variables, 1/1052 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2220 variables, 1/1053 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2220 variables, 0/1053 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2220 variables, 0/1053 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2220/2220 variables, and 1053 constraints, problems are : Problem set: 10 solved, 1 unsolved in 1397 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 7032ms problems are : Problem set: 10 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 12 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 553 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
Running 1175 sub problems to find dead transitions.
[2024-05-28 21:24:01] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2024-05-28 21:24:01] [INFO ] Computed 137 invariants in 31 ms
[2024-05-28 21:24:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1947 variables, and 132 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-05-28 21:24:26] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 23 ms to minimize.
[2024-05-28 21:24:36] [INFO ] Deduced a trap composed of 13 places in 382 ms of which 5 ms to minimize.
[2024-05-28 21:24:40] [INFO ] Deduced a trap composed of 195 places in 314 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 135 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 3/3 constraints]
After SMT, in 42788ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 42804ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43389 ms. Remains : 770/909 places, 1181/1315 transitions.
RANDOM walk for 40001 steps (2040 resets) in 865 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (153 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 151047 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 1
Probabilistic random walk after 151047 steps, saw 44436 distinct states, run finished after 3005 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-28 21:24:47] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 21:24:47] [INFO ] Invariant cache hit.
[2024-05-28 21:24:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1177/1946 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1946 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1946 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1947 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1947 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1947 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 843 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1177/1946 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1946 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1946 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1947 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1947 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1947 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1947 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 991 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1850ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 216 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 770/770 places, 1181/1181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 87 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
[2024-05-28 21:24:49] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 21:24:49] [INFO ] Invariant cache hit.
[2024-05-28 21:24:51] [INFO ] Implicit Places using invariants in 1442 ms returned []
[2024-05-28 21:24:51] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 21:24:51] [INFO ] Invariant cache hit.
[2024-05-28 21:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:25:04] [INFO ] Implicit Places using invariants and state equation in 12969 ms returned []
Implicit Place search using SMT with State Equation took 14417 ms to find 0 implicit places.
[2024-05-28 21:25:04] [INFO ] Redundant transitions in 68 ms returned []
Running 1175 sub problems to find dead transitions.
[2024-05-28 21:25:04] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 21:25:04] [INFO ] Invariant cache hit.
[2024-05-28 21:25:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/770 variables, 5/137 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/1947 variables, and 137 constraints, problems are : Problem set: 95 solved, 1080 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
[2024-05-28 21:25:41] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
[2024-05-28 21:26:00] [INFO ] Deduced a trap composed of 13 places in 341 ms of which 5 ms to minimize.
[2024-05-28 21:26:04] [INFO ] Deduced a trap composed of 226 places in 388 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 2/135 constraints. Problems are: Problem set: 95 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 135 constraints, problems are : Problem set: 95 solved, 1080 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 3/3 constraints]
After SMT, in 63218ms problems are : Problem set: 95 solved, 1080 unsolved
Search for dead transitions found 95 dead transitions in 63234ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 770/770 places, 1086/1181 transitions.
Applied a total of 0 rules in 52 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 21:26:07] [INFO ] Redundant transitions in 17 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77898 ms. Remains : 770/770 places, 1086/1181 transitions.
RANDOM walk for 40000 steps (2058 resets) in 588 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (143 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 190170 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 190170 steps, saw 56117 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-28 21:26:10] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-28 21:26:10] [INFO ] Computed 137 invariants in 60 ms
[2024-05-28 21:26:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1082/1851 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1851 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1851 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1852 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1852 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1852/1852 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:26:12] [INFO ] Deduced a trap composed of 211 places in 347 ms of which 6 ms to minimize.
[2024-05-28 21:26:12] [INFO ] Deduced a trap composed of 261 places in 314 ms of which 5 ms to minimize.
[2024-05-28 21:26:12] [INFO ] Deduced a trap composed of 255 places in 266 ms of which 4 ms to minimize.
[2024-05-28 21:26:13] [INFO ] Deduced a trap composed of 247 places in 256 ms of which 5 ms to minimize.
[2024-05-28 21:26:13] [INFO ] Deduced a trap composed of 245 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:26:13] [INFO ] Deduced a trap composed of 245 places in 241 ms of which 4 ms to minimize.
[2024-05-28 21:26:13] [INFO ] Deduced a trap composed of 250 places in 234 ms of which 3 ms to minimize.
[2024-05-28 21:26:14] [INFO ] Deduced a trap composed of 245 places in 233 ms of which 4 ms to minimize.
[2024-05-28 21:26:14] [INFO ] Deduced a trap composed of 223 places in 227 ms of which 3 ms to minimize.
[2024-05-28 21:26:14] [INFO ] Deduced a trap composed of 246 places in 237 ms of which 4 ms to minimize.
[2024-05-28 21:26:14] [INFO ] Deduced a trap composed of 236 places in 230 ms of which 3 ms to minimize.
[2024-05-28 21:26:15] [INFO ] Deduced a trap composed of 242 places in 295 ms of which 6 ms to minimize.
[2024-05-28 21:26:15] [INFO ] Deduced a trap composed of 257 places in 277 ms of which 5 ms to minimize.
[2024-05-28 21:26:15] [INFO ] Deduced a trap composed of 133 places in 314 ms of which 5 ms to minimize.
[2024-05-28 21:26:16] [INFO ] Deduced a trap composed of 242 places in 284 ms of which 5 ms to minimize.
[2024-05-28 21:26:16] [INFO ] Deduced a trap composed of 230 places in 279 ms of which 5 ms to minimize.
[2024-05-28 21:26:16] [INFO ] Deduced a trap composed of 242 places in 280 ms of which 4 ms to minimize.
[2024-05-28 21:26:16] [INFO ] Deduced a trap composed of 254 places in 251 ms of which 5 ms to minimize.
[2024-05-28 21:26:17] [INFO ] Deduced a trap composed of 263 places in 289 ms of which 4 ms to minimize.
[2024-05-28 21:26:17] [INFO ] Deduced a trap composed of 248 places in 255 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:26:17] [INFO ] Deduced a trap composed of 264 places in 281 ms of which 5 ms to minimize.
[2024-05-28 21:26:18] [INFO ] Deduced a trap composed of 239 places in 246 ms of which 4 ms to minimize.
[2024-05-28 21:26:18] [INFO ] Deduced a trap composed of 258 places in 262 ms of which 4 ms to minimize.
[2024-05-28 21:26:18] [INFO ] Deduced a trap composed of 234 places in 258 ms of which 5 ms to minimize.
[2024-05-28 21:26:18] [INFO ] Deduced a trap composed of 224 places in 285 ms of which 4 ms to minimize.
[2024-05-28 21:26:19] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 4 ms to minimize.
[2024-05-28 21:26:19] [INFO ] Deduced a trap composed of 242 places in 294 ms of which 4 ms to minimize.
[2024-05-28 21:26:19] [INFO ] Deduced a trap composed of 239 places in 255 ms of which 9 ms to minimize.
[2024-05-28 21:26:20] [INFO ] Deduced a trap composed of 242 places in 248 ms of which 5 ms to minimize.
[2024-05-28 21:26:20] [INFO ] Deduced a trap composed of 233 places in 284 ms of which 5 ms to minimize.
[2024-05-28 21:26:20] [INFO ] Deduced a trap composed of 233 places in 243 ms of which 4 ms to minimize.
[2024-05-28 21:26:21] [INFO ] Deduced a trap composed of 254 places in 279 ms of which 4 ms to minimize.
[2024-05-28 21:26:21] [INFO ] Deduced a trap composed of 242 places in 256 ms of which 4 ms to minimize.
[2024-05-28 21:26:21] [INFO ] Deduced a trap composed of 260 places in 281 ms of which 4 ms to minimize.
[2024-05-28 21:26:21] [INFO ] Deduced a trap composed of 242 places in 282 ms of which 4 ms to minimize.
[2024-05-28 21:26:22] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 4 ms to minimize.
[2024-05-28 21:26:22] [INFO ] Deduced a trap composed of 227 places in 319 ms of which 4 ms to minimize.
[2024-05-28 21:26:22] [INFO ] Deduced a trap composed of 242 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:26:23] [INFO ] Deduced a trap composed of 248 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:26:23] [INFO ] Deduced a trap composed of 245 places in 250 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:26:23] [INFO ] Deduced a trap composed of 224 places in 282 ms of which 4 ms to minimize.
[2024-05-28 21:26:24] [INFO ] Deduced a trap composed of 248 places in 262 ms of which 4 ms to minimize.
[2024-05-28 21:26:24] [INFO ] Deduced a trap composed of 239 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:26:24] [INFO ] Deduced a trap composed of 248 places in 258 ms of which 4 ms to minimize.
[2024-05-28 21:26:25] [INFO ] Deduced a trap composed of 245 places in 298 ms of which 5 ms to minimize.
[2024-05-28 21:26:25] [INFO ] Deduced a trap composed of 233 places in 279 ms of which 4 ms to minimize.
[2024-05-28 21:26:25] [INFO ] Deduced a trap composed of 245 places in 274 ms of which 4 ms to minimize.
[2024-05-28 21:26:25] [INFO ] Deduced a trap composed of 248 places in 265 ms of which 4 ms to minimize.
[2024-05-28 21:26:26] [INFO ] Deduced a trap composed of 257 places in 311 ms of which 4 ms to minimize.
[2024-05-28 21:26:26] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 14 ms to minimize.
[2024-05-28 21:26:27] [INFO ] Deduced a trap composed of 254 places in 305 ms of which 7 ms to minimize.
[2024-05-28 21:26:27] [INFO ] Deduced a trap composed of 239 places in 330 ms of which 4 ms to minimize.
[2024-05-28 21:26:27] [INFO ] Deduced a trap composed of 257 places in 275 ms of which 5 ms to minimize.
[2024-05-28 21:26:28] [INFO ] Deduced a trap composed of 242 places in 363 ms of which 6 ms to minimize.
[2024-05-28 21:26:28] [INFO ] Deduced a trap composed of 233 places in 321 ms of which 5 ms to minimize.
[2024-05-28 21:26:29] [INFO ] Deduced a trap composed of 251 places in 280 ms of which 5 ms to minimize.
[2024-05-28 21:26:29] [INFO ] Deduced a trap composed of 248 places in 335 ms of which 5 ms to minimize.
[2024-05-28 21:26:29] [INFO ] Deduced a trap composed of 258 places in 285 ms of which 5 ms to minimize.
[2024-05-28 21:26:30] [INFO ] Deduced a trap composed of 254 places in 338 ms of which 6 ms to minimize.
[2024-05-28 21:26:30] [INFO ] Deduced a trap composed of 254 places in 301 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:26:30] [INFO ] Deduced a trap composed of 255 places in 249 ms of which 4 ms to minimize.
[2024-05-28 21:26:30] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 4 ms to minimize.
[2024-05-28 21:26:31] [INFO ] Deduced a trap composed of 257 places in 244 ms of which 4 ms to minimize.
[2024-05-28 21:26:31] [INFO ] Deduced a trap composed of 248 places in 246 ms of which 4 ms to minimize.
[2024-05-28 21:26:31] [INFO ] Deduced a trap composed of 245 places in 242 ms of which 4 ms to minimize.
[2024-05-28 21:26:31] [INFO ] Deduced a trap composed of 248 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:26:32] [INFO ] Deduced a trap composed of 257 places in 326 ms of which 3 ms to minimize.
[2024-05-28 21:26:32] [INFO ] Deduced a trap composed of 245 places in 307 ms of which 5 ms to minimize.
[2024-05-28 21:26:33] [INFO ] Deduced a trap composed of 247 places in 310 ms of which 6 ms to minimize.
[2024-05-28 21:26:33] [INFO ] Deduced a trap composed of 255 places in 371 ms of which 5 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 2048
[2024-05-28 21:26:33] [INFO ] Deduced a trap composed of 223 places in 295 ms of which 5 ms to minimize.
[2024-05-28 21:26:34] [INFO ] Deduced a trap composed of 239 places in 286 ms of which 4 ms to minimize.
[2024-05-28 21:26:34] [INFO ] Deduced a trap composed of 239 places in 248 ms of which 4 ms to minimize.
SDD size :154 after 59421
[2024-05-28 21:26:34] [INFO ] Deduced a trap composed of 245 places in 344 ms of which 4 ms to minimize.
[2024-05-28 21:26:35] [INFO ] Deduced a trap composed of 239 places in 341 ms of which 5 ms to minimize.
[2024-05-28 21:26:35] [INFO ] Deduced a trap composed of 246 places in 342 ms of which 5 ms to minimize.
[2024-05-28 21:26:36] [INFO ] Deduced a trap composed of 239 places in 309 ms of which 5 ms to minimize.
[2024-05-28 21:26:36] [INFO ] Deduced a trap composed of 233 places in 289 ms of which 4 ms to minimize.
[2024-05-28 21:26:37] [INFO ] Deduced a trap composed of 240 places in 292 ms of which 4 ms to minimize.
[2024-05-28 21:26:37] [INFO ] Deduced a trap composed of 251 places in 244 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 20/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 21:26:37] [INFO ] Deduced a trap composed of 245 places in 245 ms of which 4 ms to minimize.
[2024-05-28 21:26:37] [INFO ] Deduced a trap composed of 263 places in 220 ms of which 4 ms to minimize.
[2024-05-28 21:26:38] [INFO ] Deduced a trap composed of 215 places in 211 ms of which 4 ms to minimize.
[2024-05-28 21:26:39] [INFO ] Deduced a trap composed of 234 places in 331 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1852 variables, and 221 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35420 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 84/84 constraints]
After SMT, in 36212ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 62 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 48 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 21:26:47] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:26:47] [INFO ] Invariant cache hit.
[2024-05-28 21:26:48] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2024-05-28 21:26:48] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:26:48] [INFO ] Invariant cache hit.
[2024-05-28 21:26:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:27:01] [INFO ] Implicit Places using invariants and state equation in 12925 ms returned []
Implicit Place search using SMT with State Equation took 14082 ms to find 0 implicit places.
[2024-05-28 21:27:01] [INFO ] Redundant transitions in 14 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:27:01] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 21:27:01] [INFO ] Invariant cache hit.
[2024-05-28 21:27:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:27:15] [INFO ] Deduced a trap composed of 281 places in 323 ms of which 4 ms to minimize.
[2024-05-28 21:27:15] [INFO ] Deduced a trap composed of 242 places in 410 ms of which 4 ms to minimize.
[2024-05-28 21:27:15] [INFO ] Deduced a trap composed of 209 places in 349 ms of which 4 ms to minimize.
[2024-05-28 21:27:16] [INFO ] Deduced a trap composed of 206 places in 418 ms of which 4 ms to minimize.
[2024-05-28 21:27:16] [INFO ] Deduced a trap composed of 209 places in 392 ms of which 4 ms to minimize.
[2024-05-28 21:27:17] [INFO ] Deduced a trap composed of 204 places in 351 ms of which 4 ms to minimize.
[2024-05-28 21:27:17] [INFO ] Deduced a trap composed of 203 places in 329 ms of which 4 ms to minimize.
[2024-05-28 21:27:17] [INFO ] Deduced a trap composed of 197 places in 319 ms of which 4 ms to minimize.
[2024-05-28 21:27:18] [INFO ] Deduced a trap composed of 209 places in 714 ms of which 4 ms to minimize.
[2024-05-28 21:27:19] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 3 ms to minimize.
[2024-05-28 21:27:20] [INFO ] Deduced a trap composed of 206 places in 324 ms of which 3 ms to minimize.
[2024-05-28 21:27:20] [INFO ] Deduced a trap composed of 197 places in 347 ms of which 4 ms to minimize.
[2024-05-28 21:27:20] [INFO ] Deduced a trap composed of 201 places in 323 ms of which 4 ms to minimize.
[2024-05-28 21:27:21] [INFO ] Deduced a trap composed of 206 places in 335 ms of which 4 ms to minimize.
[2024-05-28 21:27:21] [INFO ] Deduced a trap composed of 199 places in 443 ms of which 4 ms to minimize.
[2024-05-28 21:27:22] [INFO ] Deduced a trap composed of 197 places in 346 ms of which 4 ms to minimize.
[2024-05-28 21:27:22] [INFO ] Deduced a trap composed of 204 places in 375 ms of which 4 ms to minimize.
[2024-05-28 21:27:22] [INFO ] Deduced a trap composed of 196 places in 405 ms of which 3 ms to minimize.
[2024-05-28 21:27:23] [INFO ] Deduced a trap composed of 197 places in 381 ms of which 4 ms to minimize.
[2024-05-28 21:27:23] [INFO ] Deduced a trap composed of 201 places in 375 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 21:27:25] [INFO ] Deduced a trap composed of 240 places in 381 ms of which 4 ms to minimize.
[2024-05-28 21:27:26] [INFO ] Deduced a trap composed of 248 places in 360 ms of which 4 ms to minimize.
[2024-05-28 21:27:26] [INFO ] Deduced a trap composed of 211 places in 329 ms of which 3 ms to minimize.
[2024-05-28 21:27:27] [INFO ] Deduced a trap composed of 196 places in 371 ms of which 5 ms to minimize.
[2024-05-28 21:27:27] [INFO ] Deduced a trap composed of 240 places in 337 ms of which 4 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 265 places in 330 ms of which 3 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 233 places in 351 ms of which 3 ms to minimize.
[2024-05-28 21:27:28] [INFO ] Deduced a trap composed of 197 places in 310 ms of which 4 ms to minimize.
[2024-05-28 21:27:29] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 4 ms to minimize.
[2024-05-28 21:27:30] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 4 ms to minimize.
[2024-05-28 21:27:30] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 3 ms to minimize.
[2024-05-28 21:27:30] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 4 ms to minimize.
[2024-05-28 21:27:31] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 4 ms to minimize.
[2024-05-28 21:27:31] [INFO ] Deduced a trap composed of 206 places in 310 ms of which 4 ms to minimize.
[2024-05-28 21:27:31] [INFO ] Deduced a trap composed of 209 places in 305 ms of which 4 ms to minimize.
[2024-05-28 21:27:32] [INFO ] Deduced a trap composed of 206 places in 318 ms of which 4 ms to minimize.
[2024-05-28 21:27:32] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 21:27:32] [INFO ] Deduced a trap composed of 199 places in 326 ms of which 4 ms to minimize.
[2024-05-28 21:27:33] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 4 ms to minimize.
[2024-05-28 21:27:33] [INFO ] Deduced a trap composed of 196 places in 363 ms of which 4 ms to minimize.
SMT process timed out in 32485ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 32501ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46661 ms. Remains : 770/770 places, 1086/1086 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 770 transition count 1082
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 770 transition count 1081
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 769 transition count 1081
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 769 transition count 1080
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 768 transition count 1080
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 768 transition count 1075
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 763 transition count 1075
Applied a total of 18 rules in 348 ms. Remains 763 /770 variables (removed 7) and now considering 1075/1086 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1075 rows 763 cols
[2024-05-28 21:27:34] [INFO ] Computed 137 invariants in 42 ms
[2024-05-28 21:27:34] [INFO ] [Real]Absence check using 112 positive place invariants in 56 ms returned sat
[2024-05-28 21:27:34] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 50 ms returned sat
[2024-05-28 21:27:34] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:27:34] [INFO ] [Nat]Absence check using 112 positive place invariants in 21 ms returned sat
[2024-05-28 21:27:34] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 49 ms returned sat
[2024-05-28 21:27:35] [INFO ] After 762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 21:27:35] [INFO ] Deduced a trap composed of 240 places in 472 ms of which 13 ms to minimize.
[2024-05-28 21:27:43] [INFO ] Deduced a trap composed of 252 places in 7015 ms of which 31 ms to minimize.
[2024-05-28 21:27:47] [INFO ] Deduced a trap composed of 240 places in 4303 ms of which 5 ms to minimize.
[2024-05-28 21:27:47] [INFO ] Deduced a trap composed of 231 places in 331 ms of which 6 ms to minimize.
[2024-05-28 21:27:48] [INFO ] Deduced a trap composed of 270 places in 348 ms of which 5 ms to minimize.
[2024-05-28 21:27:48] [INFO ] Deduced a trap composed of 252 places in 339 ms of which 6 ms to minimize.
[2024-05-28 21:27:48] [INFO ] Deduced a trap composed of 252 places in 340 ms of which 5 ms to minimize.
[2024-05-28 21:27:49] [INFO ] Deduced a trap composed of 240 places in 341 ms of which 5 ms to minimize.
[2024-05-28 21:27:49] [INFO ] Deduced a trap composed of 229 places in 343 ms of which 5 ms to minimize.
[2024-05-28 21:28:07] [INFO ] Deduced a trap composed of 228 places in 17836 ms of which 32 ms to minimize.
[2024-05-28 21:28:08] [INFO ] Deduced a trap composed of 258 places in 347 ms of which 5 ms to minimize.
[2024-05-28 21:28:08] [INFO ] Deduced a trap composed of 240 places in 386 ms of which 6 ms to minimize.
[2024-05-28 21:28:08] [INFO ] Deduced a trap composed of 243 places in 364 ms of which 5 ms to minimize.
[2024-05-28 21:28:09] [INFO ] Deduced a trap composed of 246 places in 435 ms of which 19 ms to minimize.
[2024-05-28 21:28:10] [INFO ] Deduced a trap composed of 249 places in 453 ms of which 31 ms to minimize.
[2024-05-28 21:28:10] [INFO ] Deduced a trap composed of 246 places in 411 ms of which 18 ms to minimize.
[2024-05-28 21:28:11] [INFO ] Deduced a trap composed of 234 places in 435 ms of which 7 ms to minimize.
[2024-05-28 21:28:12] [INFO ] Deduced a trap composed of 246 places in 646 ms of which 19 ms to minimize.
[2024-05-28 21:28:12] [INFO ] Deduced a trap composed of 234 places in 527 ms of which 7 ms to minimize.
[2024-05-28 21:28:13] [INFO ] Deduced a trap composed of 246 places in 307 ms of which 4 ms to minimize.
[2024-05-28 21:28:13] [INFO ] Deduced a trap composed of 258 places in 486 ms of which 7 ms to minimize.
[2024-05-28 21:28:14] [INFO ] Deduced a trap composed of 252 places in 715 ms of which 5 ms to minimize.
[2024-05-28 21:28:15] [INFO ] Deduced a trap composed of 246 places in 492 ms of which 7 ms to minimize.
[2024-05-28 21:28:15] [INFO ] Deduced a trap composed of 228 places in 389 ms of which 7 ms to minimize.
[2024-05-28 21:28:16] [INFO ] Deduced a trap composed of 252 places in 405 ms of which 20 ms to minimize.
[2024-05-28 21:28:16] [INFO ] Deduced a trap composed of 246 places in 433 ms of which 18 ms to minimize.
[2024-05-28 21:28:17] [INFO ] Deduced a trap composed of 262 places in 493 ms of which 7 ms to minimize.
[2024-05-28 21:28:18] [INFO ] Deduced a trap composed of 243 places in 471 ms of which 32 ms to minimize.
[2024-05-28 21:28:18] [INFO ] Deduced a trap composed of 249 places in 446 ms of which 8 ms to minimize.
[2024-05-28 21:28:20] [INFO ] Deduced a trap composed of 240 places in 1982 ms of which 5 ms to minimize.
[2024-05-28 21:28:21] [INFO ] Deduced a trap composed of 243 places in 363 ms of which 5 ms to minimize.
[2024-05-28 21:28:21] [INFO ] Deduced a trap composed of 234 places in 444 ms of which 18 ms to minimize.
[2024-05-28 21:28:22] [INFO ] Deduced a trap composed of 249 places in 457 ms of which 32 ms to minimize.
[2024-05-28 21:28:22] [INFO ] Deduced a trap composed of 225 places in 403 ms of which 7 ms to minimize.
[2024-05-28 21:28:23] [INFO ] Deduced a trap composed of 240 places in 529 ms of which 18 ms to minimize.
[2024-05-28 21:28:23] [INFO ] Deduced a trap composed of 234 places in 450 ms of which 32 ms to minimize.
[2024-05-28 21:28:24] [INFO ] Deduced a trap composed of 228 places in 397 ms of which 7 ms to minimize.
[2024-05-28 21:28:24] [INFO ] Deduced a trap composed of 249 places in 404 ms of which 7 ms to minimize.
[2024-05-28 21:28:25] [INFO ] Deduced a trap composed of 234 places in 393 ms of which 7 ms to minimize.
[2024-05-28 21:28:25] [INFO ] Deduced a trap composed of 228 places in 339 ms of which 5 ms to minimize.
[2024-05-28 21:28:26] [INFO ] Deduced a trap composed of 261 places in 354 ms of which 6 ms to minimize.
[2024-05-28 21:28:26] [INFO ] Deduced a trap composed of 255 places in 348 ms of which 5 ms to minimize.
[2024-05-28 21:28:27] [INFO ] Deduced a trap composed of 234 places in 357 ms of which 5 ms to minimize.
[2024-05-28 21:28:27] [INFO ] Deduced a trap composed of 222 places in 364 ms of which 7 ms to minimize.
[2024-05-28 21:28:28] [INFO ] Deduced a trap composed of 231 places in 354 ms of which 5 ms to minimize.
[2024-05-28 21:28:28] [INFO ] Deduced a trap composed of 237 places in 363 ms of which 5 ms to minimize.
[2024-05-28 21:28:29] [INFO ] Deduced a trap composed of 255 places in 369 ms of which 6 ms to minimize.
[2024-05-28 21:28:29] [INFO ] Deduced a trap composed of 252 places in 349 ms of which 5 ms to minimize.
[2024-05-28 21:28:30] [INFO ] Deduced a trap composed of 249 places in 358 ms of which 5 ms to minimize.
[2024-05-28 21:28:30] [INFO ] Deduced a trap composed of 240 places in 363 ms of which 5 ms to minimize.
[2024-05-28 21:28:31] [INFO ] Deduced a trap composed of 240 places in 353 ms of which 5 ms to minimize.
[2024-05-28 21:28:31] [INFO ] Deduced a trap composed of 243 places in 320 ms of which 5 ms to minimize.
[2024-05-28 21:28:31] [INFO ] Deduced a trap composed of 240 places in 325 ms of which 5 ms to minimize.
[2024-05-28 21:28:32] [INFO ] Deduced a trap composed of 249 places in 374 ms of which 5 ms to minimize.
[2024-05-28 21:28:32] [INFO ] Deduced a trap composed of 255 places in 362 ms of which 6 ms to minimize.
[2024-05-28 21:28:33] [INFO ] Deduced a trap composed of 240 places in 373 ms of which 5 ms to minimize.
[2024-05-28 21:28:34] [INFO ] Deduced a trap composed of 240 places in 372 ms of which 5 ms to minimize.
[2024-05-28 21:28:34] [INFO ] Deduced a trap composed of 238 places in 660 ms of which 20 ms to minimize.
[2024-05-28 21:28:35] [INFO ] Deduced a trap composed of 246 places in 563 ms of which 7 ms to minimize.
[2024-05-28 21:28:35] [INFO ] Deduced a trap composed of 247 places in 465 ms of which 32 ms to minimize.
[2024-05-28 21:28:36] [INFO ] Deduced a trap composed of 263 places in 434 ms of which 17 ms to minimize.
[2024-05-28 21:28:36] [INFO ] Deduced a trap composed of 241 places in 466 ms of which 32 ms to minimize.
[2024-05-28 21:28:37] [INFO ] Deduced a trap composed of 252 places in 353 ms of which 5 ms to minimize.
[2024-05-28 21:28:37] [INFO ] Deduced a trap composed of 259 places in 407 ms of which 8 ms to minimize.
[2024-05-28 21:28:38] [INFO ] Deduced a trap composed of 250 places in 522 ms of which 19 ms to minimize.
[2024-05-28 21:28:38] [INFO ] Deduced a trap composed of 267 places in 321 ms of which 5 ms to minimize.
[2024-05-28 21:28:39] [INFO ] Deduced a trap composed of 260 places in 425 ms of which 7 ms to minimize.
[2024-05-28 21:28:40] [INFO ] Deduced a trap composed of 266 places in 480 ms of which 18 ms to minimize.
[2024-05-28 21:28:42] [INFO ] Deduced a trap composed of 257 places in 632 ms of which 20 ms to minimize.
[2024-05-28 21:28:43] [INFO ] Deduced a trap composed of 243 places in 629 ms of which 9 ms to minimize.
[2024-05-28 21:28:43] [INFO ] Deduced a trap composed of 240 places in 447 ms of which 6 ms to minimize.
[2024-05-28 21:28:44] [INFO ] Deduced a trap composed of 252 places in 541 ms of which 5 ms to minimize.
[2024-05-28 21:29:29] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 114126 ms
TRAPS : Iteration 1
[2024-05-28 21:29:30] [INFO ] After 115687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-28 21:29:30] [INFO ] After 115886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2024-05-28 21:29:30] [INFO ] Flatten gal took : 177 ms
[2024-05-28 21:29:30] [INFO ] Flatten gal took : 127 ms
[2024-05-28 21:29:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14849239007749694714.gal : 35 ms
[2024-05-28 21:29:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2830037612770676703.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/ReachabilityCardinality14849239007749694714.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2830037612770676703.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2830037612770676703.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 23
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :23 after 46
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :46 after 599
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :599 after 12333
Detected timeout of ITS tools.
[2024-05-28 21:29:45] [INFO ] Flatten gal took : 88 ms
[2024-05-28 21:29:45] [INFO ] Applying decomposition
[2024-05-28 21:29:45] [INFO ] Flatten gal took : 59 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/graph15988162011369385504.txt' '-o' '/tmp/graph15988162011369385504.bin' '-w' '/tmp/graph15988162011369385504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15988162011369385504.bin' '-l' '-1' '-v' '-w' '/tmp/graph15988162011369385504.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:29:46] [INFO ] Decomposing Gal with order
[2024-05-28 21:29:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:29:46] [INFO ] Removed a total of 1380 redundant transitions.
[2024-05-28 21:29:46] [INFO ] Flatten gal took : 288 ms
[2024-05-28 21:29:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 31 ms.
[2024-05-28 21:29:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality345295000980661192.gal : 17 ms
[2024-05-28 21:29:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12889768885524095712.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/ReachabilityCardinality345295000980661192.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12889768885524095712.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality12889768885524095712.prop.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 148111 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 21:30:02] [INFO ] Flatten gal took : 71 ms
[2024-05-28 21:30:02] [INFO ] Applying decomposition
[2024-05-28 21:30:02] [INFO ] Flatten gal took : 69 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/graph13184028599414686418.txt' '-o' '/tmp/graph13184028599414686418.bin' '-w' '/tmp/graph13184028599414686418.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13184028599414686418.bin' '-l' '-1' '-v' '-w' '/tmp/graph13184028599414686418.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:30:02] [INFO ] Decomposing Gal with order
[2024-05-28 21:30:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:30:02] [INFO ] Removed a total of 1619 redundant transitions.
[2024-05-28 21:30:02] [INFO ] Flatten gal took : 202 ms
[2024-05-28 21:30:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 263 labels/synchronizations in 59 ms.
[2024-05-28 21:30:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9759447338817251611.gal : 40 ms
[2024-05-28 21:30:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16404159992948843656.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/ReachabilityCardinality9759447338817251611.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16404159992948843656.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/ReachabilityCardinality16404159992948843656.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 64
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :64 after 64
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :64 after 64
ITS-tools command line returned an error code 137
[2024-05-28 21:37:47] [INFO ] Flatten gal took : 52 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10758892644251991229
[2024-05-28 21:37:47] [INFO ] Computing symmetric may disable matrix : 1086 transitions.
[2024-05-28 21:37:47] [INFO ] Applying decomposition
[2024-05-28 21:37:47] [INFO ] Computation of Complete disable matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:37:47] [INFO ] Computing symmetric may enable matrix : 1086 transitions.
[2024-05-28 21:37:47] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:37:47] [INFO ] Flatten gal took : 52 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/graph981168384342650680.txt' '-o' '/tmp/graph981168384342650680.bin' '-w' '/tmp/graph981168384342650680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph981168384342650680.bin' '-l' '-1' '-v' '-w' '/tmp/graph981168384342650680.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:37:47] [INFO ] Decomposing Gal with order
[2024-05-28 21:37:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:37:48] [INFO ] Computing Do-Not-Accords matrix : 1086 transitions.
[2024-05-28 21:37:48] [INFO ] Computation of Completed DNA matrix. took 72 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:37:48] [INFO ] Removed a total of 1264 redundant transitions.
[2024-05-28 21:37:48] [INFO ] Flatten gal took : 261 ms
[2024-05-28 21:37:48] [INFO ] Built C files in 699ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10758892644251991229
Running compilation step : cd /tmp/ltsmin10758892644251991229;'/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-28 21:37:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 51 ms.
[2024-05-28 21:37:48] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15460647929859109063.gal : 26 ms
[2024-05-28 21:37:48] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4708480080221472622.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/ReachabilityFireability15460647929859109063.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4708480080221472622.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/ReachabilityFireability4708480080221472622.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2136
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2136 after 2522
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2522 after 2544
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2544 after 2566
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2566 after 2610
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2610 after 2632
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2632 after 2676
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2676 after 2771
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2771 after 2850
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2850 after 3478
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3478 after 3590
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3590 after 5671
Compilation finished in 7075 ms.
Running link step : cd /tmp/ltsmin10758892644251991229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 127 ms.
Running LTSmin : cd /tmp/ltsmin10758892644251991229;'/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' 'PolyORBNTPTS05J60ReachabilityFireability202404==true'
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5671 after 10730
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :10730 after 12894
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :12894 after 7.26977e+07
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :7.26977e+07 after 7.45168e+07
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :7.45168e+07 after 2.43965e+08
Detected timeout of ITS tools.
[2024-05-28 22:02:27] [INFO ] Applying decomposition
[2024-05-28 22:02:28] [INFO ] Flatten gal took : 135 ms
[2024-05-28 22:02:28] [INFO ] Decomposing Gal with order
[2024-05-28 22:02:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:02:28] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to place_787_1 in partition [NotifyEventJobQueuedB_1_33, CreatedJobs_33_1, CreatedJobs_33_2, FetchJobE_1_33, CreatedJobs_33_5, CreatedJobs_33_3, AvailableJobId_33, CreatedJobs_33_4],[AvailableJobId_40, FetchJobE_1_40, CreatedJobs_40_3, NotifyEventJobQueuedB_1_40, CreatedJobs_40_1, CreatedJobs_40_5, CreatedJobs_40_2, CreatedJobs_40_4],[NotifyEventJobQueuedB_1_5, CreatedJobs_5_1, FetchJobE_1_5, CreatedJobs_5_3, CreatedJobs_5_5, CreatedJobs_5_4, CreatedJobs_5_2, AvailableJobId_5],[CreatedJobs_20_4, CreatedJobs_20_3, NotifyEventJobQueuedB_1_20, CreatedJobs_20_5, FetchJobE_1_20, CreatedJobs_20_1, CreatedJobs_20_2, AvailableJobId_20],[CreatedJobs_23_5, NotifyEventJobQueuedB_1_23, CreatedJobs_23_2, AvailableJobId_23, CreatedJobs_23_4, FetchJobE_1_23, CreatedJobs_23_1, CreatedJobs_23_3],[CreatedJobs_28_3, f3_28, f2_28, CreatedJobs_28_4, NotifyEventJobQueuedB_1_28, CreatedJobs_28_5, CreatedJobs_28_1, CreatedJobs_28_2, FetchJobE_1_28, QueueJobB_1_28, f1_28, AvailableJobId_28],[CreatedJobs_25_5, CreatedJobs_25_1, CreatedJobs_25_2, CreatedJobs_25_4, AvailableJobId_25, CreatedJobs_25_3, NotifyEventJobQueuedB_1_25, FetchJobE_1_25],[CreatedJobs_52_5, AvailableJobId_52, CreatedJobs_52_2, CreatedJobs_52_3, CreatedJobs_52_1, FetchJobE_1_52, NotifyEventJobQueuedB_1_52, CreatedJobs_52_4],[CreatedJobs_21_3, CreatedJobs_21_4, AvailableJobId_21, CreatedJobs_21_5, NotifyEventJobQueuedB_1_21, CreatedJobs_21_1, FetchJobE_1_21, CreatedJobs_21_2],[CreatedJobs_46_3, AvailableJobId_46, CreatedJobs_46_4, CreatedJobs_46_2, CreatedJobs_46_1, NotifyEventJobQueuedB_1_46, CreatedJobs_46_5, FetchJobE_1_46],[QueueJobB_1_24, CreatedJobs_24_2, AvailableJobId_24, f3_24, f1_24, f2_24, CreatedJobs_24_4, CreatedJobs_24_5, CreatedJobs_24_3, NotifyEventJobQueuedB_1_24, FetchJobE_1_24, CreatedJobs_24_1],[CreatedJobs_51_5, CreatedJobs_51_2, CreatedJobs_51_1, CreatedJobs_51_3, AvailableJobId_51, FetchJobE_1_51, NotifyEventJobQueuedB_1_51, CreatedJobs_51_4],[cJobCnt, JobCnt],[CreatedJobs_35_5, AvailableJobId_35, NotifyEventJobQueuedB_1_35, CreatedJobs_35_3, CreatedJobs_35_1, CreatedJobs_35_2, FetchJobE_1_35, CreatedJobs_35_4],[AvailableJobId_31, CreatedJobs_31_2, CreatedJobs_31_1, CreatedJobs_31_4, FetchJobE_1_31, CreatedJobs_31_5, NotifyEventJobQueuedB_1_31, CreatedJobs_31_3],[CreatedJobs_38_3, AvailableJobId_38, CreatedJobs_38_4, CreatedJobs_38_2, CreatedJobs_38_1, CreatedJobs_38_5, FetchJobE_1_38, NotifyEventJobQueuedB_1_38],[CreatedJobs_2_4, AvailableJobId_2, CreatedJobs_2_1, CreatedJobs_2_2, FetchJobE_1_2, CreatedJobs_2_3, NotifyEventJobQueuedB_1_2, CreatedJobs_2_5],[AvailableJobId_12, CreatedJobs_12_3, CreatedJobs_12_1, FetchJobE_1_12, NotifyEventJobQueuedB_1_12, CreatedJobs_12_5, CreatedJobs_12_4, CreatedJobs_12_2],[CreatedJobs_60_5, CreatedJobs_60_3, NotifyEventJobQueuedB_1_60, AvailableJobId_60, FetchJobE_1_60, CreatedJobs_60_2, CreatedJobs_60_4, CreatedJobs_60_1],[CreatedJobs_43_2, CreatedJobs_43_5, CreatedJobs_43_1, AvailableJobId_43, CreatedJobs_43_3, CreatedJobs_43_4, FetchJobE_1_43, NotifyEventJobQueuedB_1_43],[CreatedJobs_10_3, CreatedJobs_10_4, AvailableJobId_10, CreatedJobs_10_2, CreatedJobs_10_1, NotifyEventJobQueuedB_1_10, CreatedJobs_10_5, FetchJobE_1_10],[CreatedJobs_18_3, CreatedJobs_18_1, CreatedJobs_18_4, NotifyEventJobQueuedB_1_18, CreatedJobs_18_2, CreatedJobs_18_5, AvailableJobId_18, FetchJobE_1_18],[CreatedJobs_29_3, CreatedJobs_29_4, NotifyEventJobQueuedB_1_29, CreatedJobs_29_5, CreatedJobs_29_2, CreatedJobs_29_1, FetchJobE_1_29, AvailableJobId_29],[CreatedJobs_7_4, NotifyEventJobQueuedB_1_7, CreatedJobs_7_3, CreatedJobs_7_5, AvailableJobId_7, CreatedJobs_7_2, CreatedJobs_7_1, FetchJobE_1_7],[CreatedJobs_37_4, AvailableJobId_37, CreatedJobs_37_2, CreatedJobs_37_1, FetchJobE_1_37, CreatedJobs_37_5, NotifyEventJobQueuedB_1_37, CreatedJobs_37_3],[CreatedJobs_56_4, NotifyEventJobQueuedB_1_56, CreatedJobs_56_1, CreatedJobs_56_5, CreatedJobs_56_3, AvailableJobId_56, CreatedJobs_56_2, FetchJobE_1_56],[AvailableJobId_3, CreatedJobs_3_2, CreatedJobs_3_1, CreatedJobs_3_4, FetchJobE_1_3, NotifyEventJobQueuedB_1_3, CreatedJobs_3_5, CreatedJobs_3_3],[NotifyEventJobQueuedB_1_41, CreatedJobs_41_5, CreatedJobs_41_3, FetchJobE_1_41, AvailableJobId_41, CreatedJobs_41_4, CreatedJobs_41_2, CreatedJobs_41_1],[CreatedJobs_57_1, FetchJobE_1_57, CreatedJobs_57_2, CreatedJobs_57_3, NotifyEventJobQueuedB_1_57, CreatedJobs_57_4, AvailableJobId_57, CreatedJobs_57_5],[CreatedJobs_6_1, CreatedJobs_6_2, NotifyEventJobQueuedB_1_6, CreatedJobs_6_5, FetchJobE_1_6, CreatedJobs_6_4, CreatedJobs_6_3, AvailableJobId_6],[FetchJobE_1_47, CreatedJobs_47_4, CreatedJobs_47_3, NotifyEventJobQueuedB_1_47, CreatedJobs_47_5, CreatedJobs_47_2, AvailableJobId_47, CreatedJobs_47_1],[AvailableJobId_36, CreatedJobs_36_5, NotifyEventJobQueuedB_1_36, CreatedJobs_36_1, CreatedJobs_36_2, CreatedJobs_36_3, FetchJobE_1_36, CreatedJobs_36_4],[CreatedJobs_27_4, NotifyEventJobQueuedB_1_27, CreatedJobs_27_5, CreatedJobs_27_3, CreatedJobs_27_1, AvailableJobId_27, CreatedJobs_27_2, FetchJobE_1_27],[NotifyEventJobQueuedB_1_13, CreatedJobs_13_5, CreatedJobs_13_1, CreatedJobs_13_3, FetchJobE_1_13, CreatedJobs_13_4, CreatedJobs_13_2, AvailableJobId_13],[CreatedJobs_30_4, AvailableJobId_30, CreatedJobs_30_1, FetchJobE_1_30, CreatedJobs_30_2, CreatedJobs_30_3, CreatedJobs_30_5, NotifyEventJobQueuedB_1_30],[mo1, mo3, FetchJobB_1, mo2],[QueueJobB_1_8, f1_48, f2_6, QueueJobB_1_45, f2_41, f2_13, f1_29, f1_39, f2_20, f1_58, f2_34, QueueJobB_1_18, f3_47, QueueJobB_1_27, QueueJobB_1_36, f3_0, f3_43, f1_5, f1_57, f1_2, QueueJobB_1_16, f1_0, QueueJobB_1_51, f3_22, f3_8, f2_48, f1_11, f3_29, QueueJobB_1_2, f3_50, f3_56, f3_57, QueueJobB_1_23, f3_1, f1_30, f2_55, f3_36, f3_16, f1_26, QueueJobB_1_44, f2_40, f2_14, f1_19, QueueJobB_1_9, QueueJobB_1_37, f2_26, QueueJobB_1_30, mi2, QueueJobB_1_58, f1_54, f2_0, QueueJobB_1_15, f1_12, f1_33, f1_27, f3_2, f1_47, QueueJobB_1_29, f2_54, f3_30, f3_58, QueueJobB_1_1, f3_44, f1_40, QueueJobB_1_14, f3_17, f1_41, f3_21, f2_53, f2_27, QueueJobB_1_38, QueueJobB_1_52, f3_7, f1_60, QueueJobB_1_43, f3_49, f1_13, QueueJobB_1_21, f2_25, QueueJobB_1_57, f1_14, f1_32, mi1, f2_32, f3_3, f1_46, QueueJobB_1_42, f3_31, f1_4, QueueJobB_1_3, f1_7, f1_18, f3_14, f2_35, f2_8, f3_35, f1_55, f2_60, f3_6, f3_34, f3_59, f2_42, QueueJobB_1_49, f2_5, f1_52, f3_41, f2_33, f1_35, f3_52, f1_42, f2_52, f2_7, f1_45, f3_23, f3_32, QueueJobB_1_22, f3_51, QueueJobB_1_4, f1_6, f2_15, QueueJobB_1_32, f1_17, QueueJobB_1_41, f1_53, f3_60, f1_15, QueueJobB_1_59, QueueJobB_1_50, f1_34, f3_33, f3_42, f2_43, f3_15, f3_5, QueueJobB_1_31, QueueJobB_1_13, f1_43, f1_44, f2_44, f2_3, QueueJobB_1_47, f3_19, f2_16, QueueJobB_1_54, QueueJobB_1_40, f1_25, f1_16, QueueJobB_1_33, f2_10, f2_37, QueueJobB_1_5, QueueJobB_1_12, f3_11, QueueJobB_1_26, f2_51, f2_58, QueueJobB_1_48, QueueJobB_1_60, QueueJobB_1_6, QueueJobB_1_19, f3_25, QueueJobB_1_39, f2_31, f3_4, f2_23, f2_50, QueueJobB_1_25, f2_36, f3_18, f2_22, f3_13, f1_8, f2_45, QueueJobB_1_11, f2_17, QueueJobB_1_34, QueueJobB_1_53, f1_1, f2_4, f2_9, f3_53, f3_40, f3_54, f2_59, f2_1, f1_22, f3_39, f2_18, f1_23, f3_12, f2_29, QueueJobB_1_20, f1_36, f3_26, mi3, f1_51, f1_37, f1_9, f1_50, f2_49, f2_46, QueueJobB_1_17, f2_56, f2_39, f3_45, f3_38, QueueJobB_1_10, QueueJobB_1_56, f3_10, QueueJobB_1_35, f2_19, f1_31, QueueJobE_1, QueueJobB_1_7, QueueJobB_1_0, f1_10, f1_21, f3_27, f2_38, f1_59, f1_38, f2_12, f2_21, block, f3_55, f2_11, f2_57, f3_9, f1_3, f1_56, QueueJobB_1_55, QueueJobB_1_46, f2_2, f1_20, f3_46, f3_37, f2_30, f3_20, f1_49, f2_47, f3_48],[CreatedJobs_39_3, CreatedJobs_39_1, CreatedJobs_39_4, FetchJobE_1_39, NotifyEventJobQueuedB_1_39, CreatedJobs_39_5, CreatedJobs_39_2, AvailableJobId_39],[CreatedJobs_14_5, NotifyEventJobQueuedB_1_14, FetchJobE_1_14, CreatedJobs_14_3, CreatedJobs_14_2, CreatedJobs_14_1, CreatedJobs_14_4, AvailableJobId_14],[CreatedJobs_19_1, FetchJobE_1_19, CreatedJobs_19_3, CreatedJobs_19_4, NotifyEventJobQueuedB_1_19, CreatedJobs_19_2, CreatedJobs_19_5, AvailableJobId_19],[NotifyEventJobQueuedB_1_50, CreatedJobs_50_1, CreatedJobs_50_5, FetchJobE_1_50, CreatedJobs_50_3, CreatedJobs_50_4, CreatedJobs_50_2, AvailableJobId_50],[AvailableJobId_22, FetchJobE_1_22, CreatedJobs_22_1, CreatedJobs_22_2, CreatedJobs_22_3, NotifyEventJobQueuedB_1_22, CreatedJobs_22_5, CreatedJobs_22_4],[AvailableJobId_58, CreatedJobs_58_4, CreatedJobs_58_1, CreatedJobs_58_3, CreatedJobs_58_2, FetchJobE_1_58, NotifyEventJobQueuedB_1_58, CreatedJobs_58_5],[CreatedJobs_11_3, AvailableJobId_11, FetchJobE_1_11, NotifyEventJobQueuedB_1_11, CreatedJobs_11_4, CreatedJobs_11_1, CreatedJobs_11_5, CreatedJobs_11_2],[place_482_1_3, DataOnSrc_3],[AvailableJobId_4, CreatedJobs_4_5, CreatedJobs_4_1, CreatedJobs_4_4, CreatedJobs_4_2, CreatedJobs_4_3, FetchJobE_1_4, NotifyEventJobQueuedB_1_4],[FetchJobE_1_45, AvailableJobId_45, CreatedJobs_45_2, CreatedJobs_45_4, CreatedJobs_45_1, NotifyEventJobQueuedB_1_45, CreatedJobs_45_5, CreatedJobs_45_3],[NotifyEventJobQueuedB_1_59, AvailableJobId_59, CreatedJobs_59_5, CreatedJobs_59_2, CreatedJobs_59_3, FetchJobE_1_59, CreatedJobs_59_4, CreatedJobs_59_1],[CreatedJobs_48_4, FetchJobE_1_48, NotifyEventJobQueuedB_1_48, AvailableJobId_48, CreatedJobs_48_5, CreatedJobs_48_2, CreatedJobs_48_1, CreatedJobs_48_3],[DataOnSrc_2, place_482_1_2],[CreatedJobs_9_4, CreatedJobs_9_2, AvailableJobId_9, NotifyEventJobQueuedB_1_9, FetchJobE_1_9, CreatedJobs_9_5, CreatedJobs_9_1, CreatedJobs_9_3],[FetchJobE_1_8, Schedule_Task_B_1, NotifyEventJobQueuedB_1_8, AvailableJobId_8, CreatedJobs_8_5, CreatedJobs_8_1, CreatedJobs_8_2, CreatedJobs_8_3, CreatedJobs_8_4],[CreatedJobs_54_3, FetchJobE_1_54, CreatedJobs_54_5, NotifyEventJobQueuedB_1_54, AvailableJobId_54, CreatedJobs_54_4, CreatedJobs_54_1, CreatedJobs_54_2],[CreatedJobs_1_4, CreatedJobs_1_3, NotifyEventJobQueuedB_1_1, CreatedJobs_1_2, CreatedJobs_1_5, CreatedJobs_1_1, FetchJobE_1_1, AvailableJobId_1],[CreatedJobs_53_2, CreatedJobs_53_3, NotifyEventJobQueuedB_1_53, CreatedJobs_53_4, AvailableJobId_53, CreatedJobs_53_1, CreatedJobs_53_5, FetchJobE_1_53],[CreatedJobs_44_5, CreatedJobs_44_1, AvailableJobId_44, FetchJobE_1_44, CreatedJobs_44_4, CreatedJobs_44_3, NotifyEventJobQueuedB_1_44, CreatedJobs_44_2],[CreatedJobs_15_2, AvailableJobId_15, CreatedJobs_15_3, CreatedJobs_15_1, CreatedJobs_15_4, FetchJobE_1_15, CreatedJobs_15_5, NotifyEventJobQueuedB_1_15],[CreatedJobs_55_4, NotifyEventJobQueuedB_1_55, CreatedJobs_55_5, AvailableJobId_55, CreatedJobs_55_1, CreatedJobs_55_3, FetchJobE_1_55, CreatedJobs_55_2],[CreatedJobs_34_2, FetchJobE_1_34, NotifyEventJobQueuedB_1_34, CreatedJobs_34_5, AvailableJobId_34, CreatedJobs_34_3, CreatedJobs_34_4, CreatedJobs_34_1],[FetchJobE_1_0, CreatedJobs_0_4, NotifyEventJobQueuedB_1_0, CreatedJobs_0_2, CreatedJobs_0_5, CreatedJobs_0_1, AvailableJobId_0, CreatedJobs_0_3],[CreatedJobs_16_1, CreatedJobs_16_2, CreatedJobs_16_4, AvailableJobId_16, FetchJobE_1_16, CreatedJobs_16_5, CreatedJobs_16_3, NotifyEventJobQueuedB_1_16],[CreatedJobs_26_2, FetchJobE_1_26, CreatedJobs_26_3, NotifyEventJobQueuedB_1_26, CreatedJobs_26_1, CreatedJobs_26_5, CreatedJobs_26_4, AvailableJobId_26],[place_482_1_4, DataOnSrc_4],[FetchJobE_1_17, AvailableJobId_17, CreatedJobs_17_2, CreatedJobs_17_4, CreatedJobs_17_5, NotifyEventJobQueuedB_1_17, CreatedJobs_17_1, CreatedJobs_17_3],[CanInjectEvent, place_462, place_482_1_5, place_521_1, place_460, place_522_1, place_458, cSources, DataOnSrc_5, place_456, place_523_1],[CreatedJobs_32_5, CreatedJobs_32_1, CreatedJobs_32_4, FetchJobE_1_32, CreatedJobs_32_2, CreatedJobs_32_3, NotifyEventJobQueuedB_1_32, AvailableJobId_32],[CreatedJobs_42_5, FetchJobE_1_42, CreatedJobs_42_3, CreatedJobs_42_2, AvailableJobId_42, CreatedJobs_42_4, CreatedJobs_42_1, NotifyEventJobQueuedB_1_42],[CreatedJobs_49_5, FetchJobE_1_49, CreatedJobs_49_2, CreatedJobs_49_3, CreatedJobs_49_1, AvailableJobId_49, NotifyEventJobQueuedB_1_49, CreatedJobs_49_4],[place_482_1_1, TheSour_1],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1234)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 22:02:28] [INFO ] Flatten gal took : 103 ms
[2024-05-28 22:02:28] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4989052816492009986.gal : 19 ms
[2024-05-28 22:02:28] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14257886938015282395.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/ReachabilityFireability4989052816492009986.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability14257886938015282395.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability14257886938015282395.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 32
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :32 after 69
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :69 after 80
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :80 after 95
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.303: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.825: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 1.064: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.073: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.073: Initializing POR dependencies: labels 1087, guards 1086
pins2lts-mc-linux64( 3/ 8), 1.075: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 2.017: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 2.126: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 2.286: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 28.281: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 7/ 8), 28.485: "PolyORBNTPTS05J60ReachabilityFireability202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 28.487: "PolyORBNTPTS05J60ReachabilityFireability202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 28.486: "PolyORBNTPTS05J60ReachabilityFireability202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 28.488: "PolyORBNTPTS05J60ReachabilityFireability202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 28.488: "PolyORBNTPTS05J60ReachabilityFireability202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 28.491: "PolyORBNTPTS05J60ReachabilityFireability202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 28.490: "PolyORBNTPTS05J60ReachabilityFireability202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 28.496: "PolyORBNTPTS05J60ReachabilityFireability202404==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 28.498: There are 1087 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 28.498: State length is 770, there are 1086 groups
pins2lts-mc-linux64( 0/ 8), 28.498: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 28.498: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 28.498: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 28.498: Visible groups: 0 / 1086, labels: 1 / 1087
pins2lts-mc-linux64( 0/ 8), 28.498: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 28.498: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 29.406: ~6 levels ~960 states ~3208 transitions
pins2lts-mc-linux64( 5/ 8), 29.770: ~2 levels ~1920 states ~2880 transitions
pins2lts-mc-linux64( 5/ 8), 31.693: ~4 levels ~3840 states ~8384 transitions
pins2lts-mc-linux64( 6/ 8), 33.297: ~7 levels ~7680 states ~25512 transitions
pins2lts-mc-linux64( 6/ 8), 35.578: ~16 levels ~15360 states ~43616 transitions
pins2lts-mc-linux64( 1/ 8), 40.657: ~21 levels ~30720 states ~71560 transitions
pins2lts-mc-linux64( 6/ 8), 46.433: ~25 levels ~61440 states ~124352 transitions
pins2lts-mc-linux64( 3/ 8), 61.310: ~12 levels ~122880 states ~256616 transitions
pins2lts-mc-linux64( 4/ 8), 101.647: ~18 levels ~245760 states ~596040 transitions
pins2lts-mc-linux64( 3/ 8), 133.189: ~25 levels ~491520 states ~1117528 transitions
pins2lts-mc-linux64( 3/ 8), 194.013: ~34 levels ~983040 states ~3246816 transitions
pins2lts-mc-linux64( 3/ 8), 363.231: ~36 levels ~1966080 states ~8331352 transitions
pins2lts-mc-linux64( 7/ 8), 651.603: ~31 levels ~3932160 states ~14866264 transitions
pins2lts-mc-linux64( 7/ 8), 1025.535: ~32 levels ~7864320 states ~24242296 transitions
pins2lts-mc-linux64( 7/ 8), 1350.528: ~35 levels ~15728640 states ~34276872 transitions
pins2lts-mc-linux64( 0/ 8), 1616.078: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1617.844:
pins2lts-mc-linux64( 0/ 8), 1617.844: mean standard work distribution: 47.5% (states) 22.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 1617.844:
pins2lts-mc-linux64( 0/ 8), 1617.844: Explored 9517857 states 50426137 transitions, fanout: 5.298
pins2lts-mc-linux64( 0/ 8), 1617.844: Total exploration time 1589.330 sec (1587.580 sec minimum, 1587.826 sec on average)
pins2lts-mc-linux64( 0/ 8), 1617.844: States per second: 5989, Transitions per second: 31728
pins2lts-mc-linux64( 0/ 8), 1617.844: Ignoring proviso: 0
pins2lts-mc-linux64( 0/ 8), 1617.844:
pins2lts-mc-linux64( 0/ 8), 1617.844: Queue width: 8B, total height: 10343900, memory: 78.92MB
pins2lts-mc-linux64( 0/ 8), 1617.844: Tree memory: 407.5MB, 21.5 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1617.844: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1617.844: Stored 1115 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1617.845: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1617.845: Est. total memory use: 486.4MB (~1102.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10758892644251991229;'/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' 'PolyORBNTPTS05J60ReachabilityFireability202404==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10758892644251991229;'/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' 'PolyORBNTPTS05J60ReachabilityFireability202404==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :95 after 500142
ITS-tools command line returned an error code 137
[2024-05-28 22:13:02] [INFO ] Flatten gal took : 92 ms
[2024-05-28 22:13:02] [INFO ] Input system was already deterministic with 1086 transitions.
[2024-05-28 22:13:02] [INFO ] Transformed 770 places.
[2024-05-28 22:13:02] [INFO ] Transformed 1086 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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-28 22:13:32] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4927308469870881563.gal : 15 ms
[2024-05-28 22:13:32] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8143790087031604098.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/ReachabilityFireability4927308469870881563.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8143790087031604098.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 ...373
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability8143790087031604098.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 95
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :125 after 190
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :190 after 193
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :193 after 197
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :197 after 202
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :202 after 209
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :209 after 219
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :219 after 232
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :232 after 329
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :329 after 458
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :458 after 832
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :832 after 8699
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8699 after 9779
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :9779 after 11886
ITS-tools command line returned an error code 137
Total runtime 3571723 ms.

BK_STOP 1716935001328

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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