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.r289-tajo-171654446000471.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 greatspnxred
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 r289-tajo-171654446000471
=====================================================================

--------------------
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 1716888365299

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:26:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 09:26:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:26:07] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2024-05-28 09:26:07] [INFO ] Transformed 909 places.
[2024-05-28 09:26:07] [INFO ] Transformed 1970 transitions.
[2024-05-28 09:26:07] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 327 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 09:26:07] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 09:26:07] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 09:26:07] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 09:26:07] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 40000 steps (2749 resets) in 2844 ms. (14 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
BEST_FIRST walk for 40003 steps (1003 resets) in 2538 ms. (15 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (888 resets) in 2556 ms. (15 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (489 resets) in 242 ms. (164 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (55 resets) in 2875 ms. (13 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (422 resets) in 540 ms. (73 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1096 resets) in 309 ms. (129 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (37 resets) in 292 ms. (136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (455 resets) in 321 ms. (124 steps per ms) remains 11/12 properties
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (55 resets) in 234 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (46 resets) in 309 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (139 resets) in 421 ms. (94 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (56 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
[2024-05-28 09:26:11] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-28 09:26:11] [INFO ] Computed 142 invariants in 141 ms
[2024-05-28 09:26:11] [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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2220/2220 variables, and 1051 constraints, problems are : Problem set: 10 solved, 1 unsolved in 2600 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 909/909 constraints, ReadFeed: 0/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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2219/2220 variables, and 1050 constraints, problems are : Problem set: 10 solved, 1 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 908/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 7127ms problems are : Problem set: 10 solved, 1 unsolved
Parikh walk visited 0 properties in 78 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 4 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 366 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 09:26:19] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2024-05-28 09:26:19] [INFO ] Computed 137 invariants in 71 ms
[2024-05-28 09:26:19] [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 20033 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 09:26:44] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 15 ms to minimize.
[2024-05-28 09:26:55] [INFO ] Deduced a trap composed of 13 places in 327 ms of which 7 ms to minimize.
[2024-05-28 09:27:00] [INFO ] Deduced a trap composed of 195 places in 424 ms of which 6 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 20024 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 42888ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 42919ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43314 ms. Remains : 770/909 places, 1181/1315 transitions.
RANDOM walk for 40000 steps (2072 resets) in 819 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (122 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 153824 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 1
Probabilistic random walk after 153824 steps, saw 45173 distinct states, run finished after 3004 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-28 09:27:05] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 09:27:05] [INFO ] Invariant cache hit.
[2024-05-28 09:27:05] [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 852 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 1214 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 2078ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 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 70 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 70 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 58 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
[2024-05-28 09:27:07] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 09:27:07] [INFO ] Invariant cache hit.
[2024-05-28 09:27:09] [INFO ] Implicit Places using invariants in 1519 ms returned []
[2024-05-28 09:27:09] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 09:27:09] [INFO ] Invariant cache hit.
[2024-05-28 09:27:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:27:23] [INFO ] Implicit Places using invariants and state equation in 14235 ms returned []
Implicit Place search using SMT with State Equation took 15769 ms to find 0 implicit places.
[2024-05-28 09:27:23] [INFO ] Redundant transitions in 100 ms returned []
Running 1175 sub problems to find dead transitions.
[2024-05-28 09:27:23] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 09:27:23] [INFO ] Invariant cache hit.
[2024-05-28 09:27:23] [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
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30027 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 09:28:01] [INFO ] Deduced a trap composed of 13 places in 158 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 09:28:23] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 134 constraints, problems are : Problem set: 95 solved, 1080 unsolved in 30039 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: 2/2 constraints]
After SMT, in 63286ms problems are : Problem set: 95 solved, 1080 unsolved
Search for dead transitions found 95 dead transitions in 63306ms
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 63 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 09:28:26] [INFO ] Redundant transitions in 25 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 79350 ms. Remains : 770/770 places, 1086/1181 transitions.
RANDOM walk for 40001 steps (2031 resets) in 587 ms. (68 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (117 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 146978 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 1
Probabilistic random walk after 146978 steps, saw 43288 distinct states, run finished after 3003 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-28 09:28:30] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2024-05-28 09:28:30] [INFO ] Computed 137 invariants in 55 ms
[2024-05-28 09:28:30] [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 783 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 09:28:31] [INFO ] Deduced a trap composed of 211 places in 315 ms of which 7 ms to minimize.
[2024-05-28 09:28:31] [INFO ] Deduced a trap composed of 261 places in 305 ms of which 5 ms to minimize.
[2024-05-28 09:28:32] [INFO ] Deduced a trap composed of 255 places in 271 ms of which 5 ms to minimize.
[2024-05-28 09:28:32] [INFO ] Deduced a trap composed of 247 places in 255 ms of which 4 ms to minimize.
[2024-05-28 09:28:32] [INFO ] Deduced a trap composed of 245 places in 251 ms of which 4 ms to minimize.
[2024-05-28 09:28:33] [INFO ] Deduced a trap composed of 245 places in 249 ms of which 5 ms to minimize.
[2024-05-28 09:28:33] [INFO ] Deduced a trap composed of 250 places in 255 ms of which 5 ms to minimize.
[2024-05-28 09:28:33] [INFO ] Deduced a trap composed of 245 places in 266 ms of which 5 ms to minimize.
[2024-05-28 09:28:33] [INFO ] Deduced a trap composed of 223 places in 304 ms of which 5 ms to minimize.
[2024-05-28 09:28:34] [INFO ] Deduced a trap composed of 246 places in 262 ms of which 4 ms to minimize.
[2024-05-28 09:28:34] [INFO ] Deduced a trap composed of 236 places in 263 ms of which 4 ms to minimize.
[2024-05-28 09:28:34] [INFO ] Deduced a trap composed of 242 places in 262 ms of which 5 ms to minimize.
[2024-05-28 09:28:35] [INFO ] Deduced a trap composed of 257 places in 252 ms of which 4 ms to minimize.
[2024-05-28 09:28:35] [INFO ] Deduced a trap composed of 133 places in 263 ms of which 5 ms to minimize.
[2024-05-28 09:28:35] [INFO ] Deduced a trap composed of 242 places in 260 ms of which 4 ms to minimize.
[2024-05-28 09:28:35] [INFO ] Deduced a trap composed of 230 places in 264 ms of which 4 ms to minimize.
[2024-05-28 09:28:36] [INFO ] Deduced a trap composed of 242 places in 323 ms of which 5 ms to minimize.
[2024-05-28 09:28:36] [INFO ] Deduced a trap composed of 254 places in 325 ms of which 4 ms to minimize.
[2024-05-28 09:28:36] [INFO ] Deduced a trap composed of 263 places in 300 ms of which 4 ms to minimize.
[2024-05-28 09:28:37] [INFO ] Deduced a trap composed of 248 places in 296 ms of which 5 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 09:28:37] [INFO ] Deduced a trap composed of 264 places in 270 ms of which 4 ms to minimize.
[2024-05-28 09:28:37] [INFO ] Deduced a trap composed of 239 places in 272 ms of which 4 ms to minimize.
[2024-05-28 09:28:38] [INFO ] Deduced a trap composed of 258 places in 320 ms of which 5 ms to minimize.
[2024-05-28 09:28:38] [INFO ] Deduced a trap composed of 234 places in 273 ms of which 5 ms to minimize.
[2024-05-28 09:28:38] [INFO ] Deduced a trap composed of 224 places in 328 ms of which 5 ms to minimize.
[2024-05-28 09:28:39] [INFO ] Deduced a trap composed of 230 places in 348 ms of which 5 ms to minimize.
[2024-05-28 09:28:39] [INFO ] Deduced a trap composed of 242 places in 336 ms of which 5 ms to minimize.
[2024-05-28 09:28:40] [INFO ] Deduced a trap composed of 239 places in 291 ms of which 4 ms to minimize.
[2024-05-28 09:28:40] [INFO ] Deduced a trap composed of 242 places in 296 ms of which 6 ms to minimize.
[2024-05-28 09:28:40] [INFO ] Deduced a trap composed of 233 places in 282 ms of which 8 ms to minimize.
[2024-05-28 09:28:40] [INFO ] Deduced a trap composed of 233 places in 260 ms of which 4 ms to minimize.
[2024-05-28 09:28:41] [INFO ] Deduced a trap composed of 254 places in 344 ms of which 6 ms to minimize.
[2024-05-28 09:28:41] [INFO ] Deduced a trap composed of 242 places in 322 ms of which 5 ms to minimize.
[2024-05-28 09:28:42] [INFO ] Deduced a trap composed of 260 places in 330 ms of which 5 ms to minimize.
[2024-05-28 09:28:42] [INFO ] Deduced a trap composed of 242 places in 285 ms of which 5 ms to minimize.
[2024-05-28 09:28:42] [INFO ] Deduced a trap composed of 230 places in 365 ms of which 8 ms to minimize.
[2024-05-28 09:28:43] [INFO ] Deduced a trap composed of 227 places in 354 ms of which 5 ms to minimize.
[2024-05-28 09:28:43] [INFO ] Deduced a trap composed of 242 places in 270 ms of which 5 ms to minimize.
[2024-05-28 09:28:43] [INFO ] Deduced a trap composed of 248 places in 344 ms of which 6 ms to minimize.
[2024-05-28 09:28:44] [INFO ] Deduced a trap composed of 245 places in 299 ms of which 5 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 09:28:44] [INFO ] Deduced a trap composed of 224 places in 314 ms of which 5 ms to minimize.
[2024-05-28 09:28:44] [INFO ] Deduced a trap composed of 248 places in 280 ms of which 4 ms to minimize.
[2024-05-28 09:28:45] [INFO ] Deduced a trap composed of 239 places in 266 ms of which 5 ms to minimize.
[2024-05-28 09:28:45] [INFO ] Deduced a trap composed of 248 places in 260 ms of which 4 ms to minimize.
[2024-05-28 09:28:45] [INFO ] Deduced a trap composed of 245 places in 316 ms of which 5 ms to minimize.
[2024-05-28 09:28:46] [INFO ] Deduced a trap composed of 233 places in 305 ms of which 4 ms to minimize.
[2024-05-28 09:28:46] [INFO ] Deduced a trap composed of 245 places in 299 ms of which 4 ms to minimize.
[2024-05-28 09:28:46] [INFO ] Deduced a trap composed of 248 places in 342 ms of which 6 ms to minimize.
[2024-05-28 09:28:47] [INFO ] Deduced a trap composed of 257 places in 379 ms of which 5 ms to minimize.
[2024-05-28 09:28:47] [INFO ] Deduced a trap composed of 230 places in 298 ms of which 4 ms to minimize.
[2024-05-28 09:28:48] [INFO ] Deduced a trap composed of 254 places in 310 ms of which 5 ms to minimize.
[2024-05-28 09:28:48] [INFO ] Deduced a trap composed of 239 places in 355 ms of which 10 ms to minimize.
[2024-05-28 09:28:49] [INFO ] Deduced a trap composed of 257 places in 325 ms of which 5 ms to minimize.
[2024-05-28 09:28:49] [INFO ] Deduced a trap composed of 242 places in 245 ms of which 4 ms to minimize.
[2024-05-28 09:28:49] [INFO ] Deduced a trap composed of 233 places in 314 ms of which 5 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 251 places in 307 ms of which 5 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 248 places in 286 ms of which 4 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 258 places in 255 ms of which 4 ms to minimize.
[2024-05-28 09:28:51] [INFO ] Deduced a trap composed of 254 places in 344 ms of which 6 ms to minimize.
[2024-05-28 09:28:51] [INFO ] Deduced a trap composed of 254 places in 253 ms of which 4 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 09:28:51] [INFO ] Deduced a trap composed of 255 places in 342 ms of which 5 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 236 places in 322 ms of which 6 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 257 places in 297 ms of which 5 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 248 places in 280 ms of which 5 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 245 places in 292 ms of which 4 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 248 places in 277 ms of which 4 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 257 places in 329 ms of which 4 ms to minimize.
[2024-05-28 09:28:54] [INFO ] Deduced a trap composed of 245 places in 273 ms of which 4 ms to minimize.
[2024-05-28 09:28:54] [INFO ] Deduced a trap composed of 247 places in 327 ms of which 4 ms to minimize.
[2024-05-28 09:28:54] [INFO ] Deduced a trap composed of 255 places in 308 ms of which 4 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 223 places in 273 ms of which 4 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 239 places in 262 ms of which 4 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 239 places in 291 ms of which 5 ms to minimize.
[2024-05-28 09:28:56] [INFO ] Deduced a trap composed of 245 places in 337 ms of which 4 ms to minimize.
[2024-05-28 09:28:56] [INFO ] Deduced a trap composed of 239 places in 318 ms of which 5 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 246 places in 355 ms of which 5 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 239 places in 323 ms of which 5 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 233 places in 324 ms of which 5 ms to minimize.
[2024-05-28 09:28:58] [INFO ] Deduced a trap composed of 240 places in 341 ms of which 5 ms to minimize.
[2024-05-28 09:28:58] [INFO ] Deduced a trap composed of 251 places in 323 ms of which 4 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 09:28:59] [INFO ] Deduced a trap composed of 245 places in 314 ms of which 5 ms to minimize.
[2024-05-28 09:28:59] [INFO ] Deduced a trap composed of 263 places in 348 ms of which 6 ms to minimize.
[2024-05-28 09:29:00] [INFO ] Deduced a trap composed of 215 places in 300 ms of which 5 ms to minimize.
[2024-05-28 09:29:01] [INFO ] Deduced a trap composed of 234 places in 375 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 38136 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 39003ms 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 67 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 68 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 43 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2024-05-28 09:29:09] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:29:09] [INFO ] Invariant cache hit.
[2024-05-28 09:29:10] [INFO ] Implicit Places using invariants in 1236 ms returned []
[2024-05-28 09:29:10] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:29:10] [INFO ] Invariant cache hit.
[2024-05-28 09:29:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:29:24] [INFO ] Implicit Places using invariants and state equation in 13971 ms returned []
Implicit Place search using SMT with State Equation took 15209 ms to find 0 implicit places.
[2024-05-28 09:29:24] [INFO ] Redundant transitions in 57 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-05-28 09:29:24] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2024-05-28 09:29:24] [INFO ] Invariant cache hit.
[2024-05-28 09:29:24] [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 09:29:37] [INFO ] Deduced a trap composed of 281 places in 332 ms of which 6 ms to minimize.
[2024-05-28 09:29:38] [INFO ] Deduced a trap composed of 242 places in 296 ms of which 5 ms to minimize.
[2024-05-28 09:29:38] [INFO ] Deduced a trap composed of 209 places in 322 ms of which 5 ms to minimize.
[2024-05-28 09:29:39] [INFO ] Deduced a trap composed of 206 places in 287 ms of which 6 ms to minimize.
[2024-05-28 09:29:39] [INFO ] Deduced a trap composed of 209 places in 312 ms of which 5 ms to minimize.
[2024-05-28 09:29:39] [INFO ] Deduced a trap composed of 204 places in 278 ms of which 4 ms to minimize.
[2024-05-28 09:29:40] [INFO ] Deduced a trap composed of 203 places in 342 ms of which 5 ms to minimize.
[2024-05-28 09:29:40] [INFO ] Deduced a trap composed of 197 places in 336 ms of which 6 ms to minimize.
[2024-05-28 09:29:40] [INFO ] Deduced a trap composed of 209 places in 344 ms of which 5 ms to minimize.
[2024-05-28 09:29:41] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 5 ms to minimize.
[2024-05-28 09:29:41] [INFO ] Deduced a trap composed of 206 places in 304 ms of which 6 ms to minimize.
[2024-05-28 09:29:41] [INFO ] Deduced a trap composed of 197 places in 297 ms of which 5 ms to minimize.
[2024-05-28 09:29:42] [INFO ] Deduced a trap composed of 201 places in 295 ms of which 5 ms to minimize.
[2024-05-28 09:29:42] [INFO ] Deduced a trap composed of 206 places in 251 ms of which 4 ms to minimize.
[2024-05-28 09:29:42] [INFO ] Deduced a trap composed of 199 places in 237 ms of which 5 ms to minimize.
[2024-05-28 09:29:43] [INFO ] Deduced a trap composed of 197 places in 252 ms of which 4 ms to minimize.
[2024-05-28 09:29:43] [INFO ] Deduced a trap composed of 204 places in 272 ms of which 4 ms to minimize.
[2024-05-28 09:29:43] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-05-28 09:29:43] [INFO ] Deduced a trap composed of 197 places in 278 ms of which 4 ms to minimize.
[2024-05-28 09:29:44] [INFO ] Deduced a trap composed of 201 places in 280 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 09:29:45] [INFO ] Deduced a trap composed of 240 places in 327 ms of which 5 ms to minimize.
[2024-05-28 09:29:47] [INFO ] Deduced a trap composed of 248 places in 271 ms of which 4 ms to minimize.
[2024-05-28 09:29:47] [INFO ] Deduced a trap composed of 211 places in 299 ms of which 4 ms to minimize.
[2024-05-28 09:29:47] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 4 ms to minimize.
[2024-05-28 09:29:48] [INFO ] Deduced a trap composed of 240 places in 301 ms of which 4 ms to minimize.
[2024-05-28 09:29:48] [INFO ] Deduced a trap composed of 265 places in 291 ms of which 5 ms to minimize.
[2024-05-28 09:29:48] [INFO ] Deduced a trap composed of 233 places in 279 ms of which 4 ms to minimize.
[2024-05-28 09:29:49] [INFO ] Deduced a trap composed of 197 places in 280 ms of which 4 ms to minimize.
[2024-05-28 09:29:50] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-05-28 09:29:50] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-05-28 09:29:50] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 4 ms to minimize.
[2024-05-28 09:29:51] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-05-28 09:29:51] [INFO ] Deduced a trap composed of 196 places in 288 ms of which 5 ms to minimize.
[2024-05-28 09:29:51] [INFO ] Deduced a trap composed of 206 places in 319 ms of which 6 ms to minimize.
[2024-05-28 09:29:52] [INFO ] Deduced a trap composed of 209 places in 369 ms of which 5 ms to minimize.
[2024-05-28 09:29:52] [INFO ] Deduced a trap composed of 206 places in 296 ms of which 5 ms to minimize.
[2024-05-28 09:29:52] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 5 ms to minimize.
[2024-05-28 09:29:53] [INFO ] Deduced a trap composed of 199 places in 353 ms of which 6 ms to minimize.
[2024-05-28 09:29:53] [INFO ] Deduced a trap composed of 196 places in 367 ms of which 5 ms to minimize.
[2024-05-28 09:29:54] [INFO ] Deduced a trap composed of 196 places in 295 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1852 variables, and 172 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30031 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: 1080/1080 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-05-28 09:30:08] [INFO ] Deduced a trap composed of 149 places in 367 ms of which 5 ms to minimize.
[2024-05-28 09:30:09] [INFO ] Deduced a trap composed of 149 places in 361 ms of which 5 ms to minimize.
[2024-05-28 09:30:09] [INFO ] Deduced a trap composed of 136 places in 364 ms of which 5 ms to minimize.
[2024-05-28 09:30:10] [INFO ] Deduced a trap composed of 140 places in 368 ms of which 6 ms to minimize.
[2024-05-28 09:30:10] [INFO ] Deduced a trap composed of 136 places in 408 ms of which 5 ms to minimize.
[2024-05-28 09:30:10] [INFO ] Deduced a trap composed of 246 places in 325 ms of which 4 ms to minimize.
[2024-05-28 09:30:11] [INFO ] Deduced a trap composed of 188 places in 404 ms of which 5 ms to minimize.
[2024-05-28 09:30:11] [INFO ] Deduced a trap composed of 239 places in 325 ms of which 5 ms to minimize.
[2024-05-28 09:30:12] [INFO ] Deduced a trap composed of 242 places in 392 ms of which 5 ms to minimize.
[2024-05-28 09:30:12] [INFO ] Deduced a trap composed of 147 places in 354 ms of which 6 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 210 places in 403 ms of which 6 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 208 places in 332 ms of which 5 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 202 places in 346 ms of which 4 ms to minimize.
[2024-05-28 09:30:14] [INFO ] Deduced a trap composed of 213 places in 415 ms of which 7 ms to minimize.
[2024-05-28 09:30:14] [INFO ] Deduced a trap composed of 212 places in 402 ms of which 5 ms to minimize.
[2024-05-28 09:30:15] [INFO ] Deduced a trap composed of 206 places in 350 ms of which 5 ms to minimize.
[2024-05-28 09:30:15] [INFO ] Deduced a trap composed of 203 places in 322 ms of which 4 ms to minimize.
[2024-05-28 09:30:16] [INFO ] Deduced a trap composed of 240 places in 408 ms of which 5 ms to minimize.
[2024-05-28 09:30:17] [INFO ] Deduced a trap composed of 242 places in 369 ms of which 5 ms to minimize.
[2024-05-28 09:30:17] [INFO ] Deduced a trap composed of 239 places in 432 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1852 variables, and 192 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30046 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/1080 constraints, Known Traps: 60/60 constraints]
After SMT, in 62665ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 62678ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78000 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 163 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 09:30:27] [INFO ] Computed 137 invariants in 34 ms
[2024-05-28 09:30:27] [INFO ] [Real]Absence check using 112 positive place invariants in 22 ms returned sat
[2024-05-28 09:30:27] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 54 ms returned sat
[2024-05-28 09:30:27] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 09:30:27] [INFO ] [Nat]Absence check using 112 positive place invariants in 22 ms returned sat
[2024-05-28 09:30:27] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 54 ms returned sat
[2024-05-28 09:30:28] [INFO ] After 886ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 09:30:29] [INFO ] Deduced a trap composed of 240 places in 355 ms of which 6 ms to minimize.
[2024-05-28 09:30:29] [INFO ] Deduced a trap composed of 252 places in 286 ms of which 5 ms to minimize.
[2024-05-28 09:30:29] [INFO ] Deduced a trap composed of 240 places in 294 ms of which 5 ms to minimize.
[2024-05-28 09:30:30] [INFO ] Deduced a trap composed of 231 places in 321 ms of which 5 ms to minimize.
[2024-05-28 09:30:30] [INFO ] Deduced a trap composed of 270 places in 293 ms of which 6 ms to minimize.
[2024-05-28 09:30:30] [INFO ] Deduced a trap composed of 252 places in 276 ms of which 5 ms to minimize.
[2024-05-28 09:30:31] [INFO ] Deduced a trap composed of 252 places in 247 ms of which 4 ms to minimize.
[2024-05-28 09:30:31] [INFO ] Deduced a trap composed of 240 places in 283 ms of which 5 ms to minimize.
[2024-05-28 09:30:31] [INFO ] Deduced a trap composed of 229 places in 372 ms of which 5 ms to minimize.
[2024-05-28 09:30:32] [INFO ] Deduced a trap composed of 228 places in 386 ms of which 7 ms to minimize.
[2024-05-28 09:30:32] [INFO ] Deduced a trap composed of 258 places in 316 ms of which 5 ms to minimize.
[2024-05-28 09:30:33] [INFO ] Deduced a trap composed of 240 places in 329 ms of which 5 ms to minimize.
[2024-05-28 09:30:33] [INFO ] Deduced a trap composed of 243 places in 306 ms of which 5 ms to minimize.
[2024-05-28 09:30:34] [INFO ] Deduced a trap composed of 246 places in 355 ms of which 5 ms to minimize.
[2024-05-28 09:30:34] [INFO ] Deduced a trap composed of 249 places in 356 ms of which 6 ms to minimize.
[2024-05-28 09:30:35] [INFO ] Deduced a trap composed of 246 places in 363 ms of which 5 ms to minimize.
[2024-05-28 09:30:35] [INFO ] Deduced a trap composed of 234 places in 360 ms of which 6 ms to minimize.
[2024-05-28 09:30:36] [INFO ] Deduced a trap composed of 246 places in 346 ms of which 5 ms to minimize.
[2024-05-28 09:30:36] [INFO ] Deduced a trap composed of 234 places in 336 ms of which 5 ms to minimize.
[2024-05-28 09:30:37] [INFO ] Deduced a trap composed of 246 places in 368 ms of which 5 ms to minimize.
[2024-05-28 09:30:37] [INFO ] Deduced a trap composed of 258 places in 311 ms of which 5 ms to minimize.
[2024-05-28 09:30:38] [INFO ] Deduced a trap composed of 252 places in 354 ms of which 5 ms to minimize.
[2024-05-28 09:30:38] [INFO ] Deduced a trap composed of 246 places in 320 ms of which 4 ms to minimize.
[2024-05-28 09:30:39] [INFO ] Deduced a trap composed of 228 places in 312 ms of which 5 ms to minimize.
[2024-05-28 09:30:39] [INFO ] Deduced a trap composed of 252 places in 309 ms of which 5 ms to minimize.
[2024-05-28 09:30:40] [INFO ] Deduced a trap composed of 246 places in 334 ms of which 5 ms to minimize.
[2024-05-28 09:30:40] [INFO ] Deduced a trap composed of 262 places in 346 ms of which 5 ms to minimize.
[2024-05-28 09:30:41] [INFO ] Deduced a trap composed of 243 places in 371 ms of which 6 ms to minimize.
[2024-05-28 09:30:41] [INFO ] Deduced a trap composed of 249 places in 385 ms of which 5 ms to minimize.
[2024-05-28 09:30:41] [INFO ] Deduced a trap composed of 240 places in 318 ms of which 5 ms to minimize.
[2024-05-28 09:30:42] [INFO ] Deduced a trap composed of 243 places in 334 ms of which 6 ms to minimize.
[2024-05-28 09:30:42] [INFO ] Deduced a trap composed of 234 places in 322 ms of which 5 ms to minimize.
[2024-05-28 09:30:43] [INFO ] Deduced a trap composed of 249 places in 286 ms of which 5 ms to minimize.
[2024-05-28 09:30:43] [INFO ] Deduced a trap composed of 225 places in 327 ms of which 4 ms to minimize.
[2024-05-28 09:30:43] [INFO ] Deduced a trap composed of 240 places in 323 ms of which 5 ms to minimize.
[2024-05-28 09:30:44] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 4 ms to minimize.
[2024-05-28 09:30:44] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 4 ms to minimize.
[2024-05-28 09:30:44] [INFO ] Deduced a trap composed of 249 places in 303 ms of which 5 ms to minimize.
[2024-05-28 09:30:45] [INFO ] Deduced a trap composed of 234 places in 301 ms of which 5 ms to minimize.
[2024-05-28 09:30:45] [INFO ] Deduced a trap composed of 228 places in 354 ms of which 5 ms to minimize.
[2024-05-28 09:30:46] [INFO ] Deduced a trap composed of 261 places in 356 ms of which 5 ms to minimize.
[2024-05-28 09:30:46] [INFO ] Deduced a trap composed of 255 places in 352 ms of which 6 ms to minimize.
[2024-05-28 09:30:47] [INFO ] Deduced a trap composed of 234 places in 357 ms of which 5 ms to minimize.
[2024-05-28 09:30:48] [INFO ] Deduced a trap composed of 222 places in 358 ms of which 6 ms to minimize.
[2024-05-28 09:30:48] [INFO ] Deduced a trap composed of 231 places in 431 ms of which 6 ms to minimize.
[2024-05-28 09:30:48] [INFO ] Deduced a trap composed of 237 places in 384 ms of which 6 ms to minimize.
[2024-05-28 09:30:49] [INFO ] Deduced a trap composed of 255 places in 352 ms of which 5 ms to minimize.
[2024-05-28 09:30:50] [INFO ] Deduced a trap composed of 252 places in 365 ms of which 5 ms to minimize.
[2024-05-28 09:30:50] [INFO ] Deduced a trap composed of 249 places in 365 ms of which 5 ms to minimize.
[2024-05-28 09:30:50] [INFO ] Deduced a trap composed of 240 places in 336 ms of which 5 ms to minimize.
[2024-05-28 09:30:51] [INFO ] Deduced a trap composed of 240 places in 315 ms of which 5 ms to minimize.
[2024-05-28 09:30:51] [INFO ] Deduced a trap composed of 243 places in 307 ms of which 4 ms to minimize.
[2024-05-28 09:30:52] [INFO ] Deduced a trap composed of 240 places in 329 ms of which 5 ms to minimize.
[2024-05-28 09:30:52] [INFO ] Deduced a trap composed of 249 places in 311 ms of which 5 ms to minimize.
[2024-05-28 09:30:52] [INFO ] Deduced a trap composed of 255 places in 294 ms of which 5 ms to minimize.
[2024-05-28 09:30:53] [INFO ] Deduced a trap composed of 240 places in 275 ms of which 4 ms to minimize.
[2024-05-28 09:30:53] [INFO ] Deduced a trap composed of 240 places in 327 ms of which 5 ms to minimize.
[2024-05-28 09:30:54] [INFO ] Deduced a trap composed of 238 places in 263 ms of which 4 ms to minimize.
[2024-05-28 09:30:54] [INFO ] Deduced a trap composed of 246 places in 338 ms of which 6 ms to minimize.
[2024-05-28 09:30:55] [INFO ] Deduced a trap composed of 247 places in 343 ms of which 5 ms to minimize.
[2024-05-28 09:30:55] [INFO ] Deduced a trap composed of 263 places in 311 ms of which 6 ms to minimize.
[2024-05-28 09:30:55] [INFO ] Deduced a trap composed of 241 places in 330 ms of which 6 ms to minimize.
[2024-05-28 09:30:56] [INFO ] Deduced a trap composed of 252 places in 250 ms of which 4 ms to minimize.
[2024-05-28 09:30:56] [INFO ] Deduced a trap composed of 259 places in 247 ms of which 4 ms to minimize.
[2024-05-28 09:30:57] [INFO ] Deduced a trap composed of 250 places in 363 ms of which 5 ms to minimize.
[2024-05-28 09:30:57] [INFO ] Deduced a trap composed of 267 places in 335 ms of which 5 ms to minimize.
[2024-05-28 09:30:57] [INFO ] Deduced a trap composed of 260 places in 296 ms of which 5 ms to minimize.
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 266 places in 345 ms of which 6 ms to minimize.
[2024-05-28 09:31:00] [INFO ] Deduced a trap composed of 257 places in 406 ms of which 6 ms to minimize.
[2024-05-28 09:31:01] [INFO ] Deduced a trap composed of 243 places in 339 ms of which 6 ms to minimize.
[2024-05-28 09:31:01] [INFO ] Deduced a trap composed of 240 places in 347 ms of which 6 ms to minimize.
[2024-05-28 09:31:02] [INFO ] Deduced a trap composed of 252 places in 379 ms of which 5 ms to minimize.
[2024-05-28 09:31:47] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 78793 ms
TRAPS : Iteration 1
[2024-05-28 09:31:48] [INFO ] After 80221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-28 09:31:48] [INFO ] After 80433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Over-approximation ignoring read arcs solved 0 properties in 80873 ms.
[2024-05-28 09:31:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-28 09:31:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 770 places, 1086 transitions and 5509 arcs took 12 ms.
[2024-05-28 09:31:48] [INFO ] Flatten gal took : 136 ms
Total runtime 341787 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-PT-S05J60

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/420/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 770
TRANSITIONS: 1086
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.035s, Sys 0.003s]


SAVING FILE /home/mcc/execution/420/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1312
MODEL NAME: /home/mcc/execution/420/model
770 places, 1086 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="greatspnxred"
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 greatspnxred"
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 r289-tajo-171654446000471"
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 ;