About the Execution of LTSMin+red for PolyORBLF-COL-S02J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3470.312 | 204079.00 | 263512.00 | 73.10 | TFTFTFTTTFFTFTTF | normal |
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.r516-tajo-171654446400103.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 ltsminxred
Input is PolyORBLF-COL-S02J06T06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446400103
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717248990548
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:36:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:36:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:36:31] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 13:36:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:36:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 635 ms
[2024-06-01 13:36:32] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Working with output stream class java.io.PrintStream
[2024-06-01 13:36:32] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-06-01 13:36:32] [INFO ] Skeletonized 14 HLPN properties in 2 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 250 steps (0 resets) in 16 ms. (14 steps per ms) remains 0/1 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 13:36:32] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:36:32] [INFO ] Flatten gal took : 8 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:36:32] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 32 ms.
[2024-06-01 13:36:32] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2024-06-01 13:36:32] [INFO ] Reduced 66 identical enabling conditions.
[2024-06-01 13:36:32] [INFO ] Reduced 24 identical enabling conditions.
[2024-06-01 13:36:32] [INFO ] Reduced 24 identical enabling conditions.
[2024-06-01 13:36:32] [INFO ] Reduced 66 identical enabling conditions.
[2024-06-01 13:36:32] [INFO ] Reduced 6 identical enabling conditions.
[2024-06-01 13:36:32] [INFO ] Reduced 24 identical enabling conditions.
[2024-06-01 13:36:32] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
RANDOM walk for 40001 steps (14 resets) in 2412 ms. (16 steps per ms) remains 6/14 properties
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (10 resets) in 1684 ms. (23 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (10 resets) in 645 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (12 resets) in 477 ms. (83 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (38 resets) in 1020 ms. (39 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 753 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (9 resets) in 378 ms. (105 steps per ms) remains 6/6 properties
[2024-06-01 13:36:35] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-06-01 13:36:35] [INFO ] Computed 50 invariants in 60 ms
[2024-06-01 13:36:35] [INFO ] State equation strengthened by 72 read => feed constraints.
Problem PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-11 is UNSAT
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 13/24 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/476 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-15 is UNSAT
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 48/524 variables, 6/30 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-01 is UNSAT
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 10/40 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 0/40 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-03 is UNSAT
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-14 is UNSAT
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 12/536 variables, 10/50 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/50 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 956/1492 variables, 536/586 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1492 variables, 72/658 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1492 variables, 0/658 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1492 variables, 0/658 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1492/1492 variables, and 658 constraints, problems are : Problem set: 5 solved, 1 unsolved in 1409 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 346/439 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/458 variables, 5/9 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/472 variables, 7/16 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/534 variables, 33/49 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 13:36:39] [INFO ] Deduced a trap composed of 73 places in 209 ms of which 35 ms to minimize.
[2024-06-01 13:36:39] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 3 ms to minimize.
[2024-06-01 13:36:40] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-06-01 13:36:40] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 4/53 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/53 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1490/1492 variables, and 587 constraints, problems are : Problem set: 5 solved, 1 unsolved in 1630 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 534/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 5488ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 93 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 534 transition count 944
Reduce places removed 24 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 36 rules applied. Total rules applied 62 place count 510 transition count 932
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 74 place count 498 transition count 932
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 74 place count 498 transition count 872
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 194 place count 438 transition count 872
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 266 place count 402 transition count 836
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 3 with 18 rules applied. Total rules applied 284 place count 402 transition count 818
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 302 place count 384 transition count 818
Applied a total of 302 rules in 143 ms. Remains 384 /536 variables (removed 152) and now considering 818/968 (removed 150) transitions.
Running 816 sub problems to find dead transitions.
[2024-06-01 13:36:41] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 384 cols
[2024-06-01 13:36:41] [INFO ] Computed 48 invariants in 24 ms
[2024-06-01 13:36:41] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:36:47] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 2 ms to minimize.
[2024-06-01 13:36:47] [INFO ] Deduced a trap composed of 48 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:36:47] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:36:47] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:36:47] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:36:47] [INFO ] Deduced a trap composed of 148 places in 181 ms of which 2 ms to minimize.
[2024-06-01 13:36:47] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 2 ms to minimize.
[2024-06-01 13:36:48] [INFO ] Deduced a trap composed of 48 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:36:51] [INFO ] Deduced a trap composed of 161 places in 201 ms of which 3 ms to minimize.
[2024-06-01 13:36:53] [INFO ] Deduced a trap composed of 130 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:36:53] [INFO ] Deduced a trap composed of 176 places in 156 ms of which 3 ms to minimize.
[2024-06-01 13:36:53] [INFO ] Deduced a trap composed of 126 places in 206 ms of which 3 ms to minimize.
[2024-06-01 13:36:53] [INFO ] Deduced a trap composed of 146 places in 179 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:36:56] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
(s87 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 4.0)
(s1 6.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/1190 variables, and 60 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 236 places in 196 ms of which 2 ms to minimize.
[2024-06-01 13:37:06] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 207 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:37:09] [INFO ] Deduced a trap composed of 226 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 3 ms to minimize.
[2024-06-01 13:37:10] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/382 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:37:17] [INFO ] Deduced a trap composed of 225 places in 142 ms of which 2 ms to minimize.
[2024-06-01 13:37:18] [INFO ] Deduced a trap composed of 161 places in 133 ms of which 2 ms to minimize.
[2024-06-01 13:37:18] [INFO ] Deduced a trap composed of 225 places in 134 ms of which 2 ms to minimize.
[2024-06-01 13:37:18] [INFO ] Deduced a trap composed of 170 places in 119 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1190 variables, and 70 constraints, problems are : Problem set: 0 solved, 816 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/384 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 24/24 constraints]
After SMT, in 41353ms problems are : Problem set: 0 solved, 816 unsolved
Search for dead transitions found 0 dead transitions in 41364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41523 ms. Remains : 384/536 places, 818/968 transitions.
RANDOM walk for 40000 steps (23 resets) in 309 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (11 resets) in 347 ms. (114 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 332501 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 332501 steps, saw 175259 distinct states, run finished after 3005 ms. (steps per millisecond=110 ) properties seen :0
[2024-06-01 13:37:25] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 13:37:25] [INFO ] Invariant cache hit.
[2024-06-01 13:37:25] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 143/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/238 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/374 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/382 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 806/1188 variables, 382/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1188 variables, 72/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1188 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1190 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1190 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1190 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1190 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1190/1190 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 384/384 constraints, ReadFeed: 72/72 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/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 143/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/238 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/374 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:37:26] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 3 ms to minimize.
[2024-06-01 13:37:26] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-06-01 13:37:26] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:37:27] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/382 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 806/1188 variables, 382/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1188 variables, 72/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1188 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1188 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1190 variables, 2/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1190 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1190 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1190 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1190/1190 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2319 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 384/384 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 3111ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 93 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 818/818 transitions.
Applied a total of 0 rules in 29 ms. Remains 384 /384 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 384/384 places, 818/818 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 818/818 transitions.
Applied a total of 0 rules in 25 ms. Remains 384 /384 variables (removed 0) and now considering 818/818 (removed 0) transitions.
[2024-06-01 13:37:29] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 13:37:29] [INFO ] Invariant cache hit.
[2024-06-01 13:37:29] [INFO ] Implicit Places using invariants in 326 ms returned [342, 343, 344, 345, 346, 347]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 332 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 378/384 places, 818/818 transitions.
Applied a total of 0 rules in 24 ms. Remains 378 /378 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 382 ms. Remains : 378/384 places, 818/818 transitions.
RANDOM walk for 40000 steps (19 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (14 resets) in 369 ms. (108 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 347891 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 347891 steps, saw 183119 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
[2024-06-01 13:37:32] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
// Phase 1: matrix 806 rows 378 cols
[2024-06-01 13:37:32] [INFO ] Computed 42 invariants in 45 ms
[2024-06-01 13:37:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/314 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 12/326 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/340 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/376 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 806/1182 variables, 376/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1182 variables, 72/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1182 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1184 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1184 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1184 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1184 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1184/1184 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 742 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 378/378 constraints, ReadFeed: 72/72 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/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 221/314 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/326 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/340 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/376 variables, 25/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:37:33] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 2 ms to minimize.
[2024-06-01 13:37:33] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:37:33] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 806/1182 variables, 376/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1182 variables, 72/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1182 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1182 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1184 variables, 2/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1184 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1184 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1184 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1184/1184 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2780 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 378/378 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 3672ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 93 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 818/818 transitions.
Applied a total of 0 rules in 42 ms. Remains 378 /378 variables (removed 0) and now considering 818/818 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 378/378 places, 818/818 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 818/818 transitions.
Applied a total of 0 rules in 31 ms. Remains 378 /378 variables (removed 0) and now considering 818/818 (removed 0) transitions.
[2024-06-01 13:37:36] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 13:37:36] [INFO ] Invariant cache hit.
[2024-06-01 13:37:36] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-06-01 13:37:36] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 13:37:36] [INFO ] Invariant cache hit.
[2024-06-01 13:37:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:37:39] [INFO ] Implicit Places using invariants and state equation in 2477 ms returned []
Implicit Place search using SMT with State Equation took 2818 ms to find 0 implicit places.
[2024-06-01 13:37:39] [INFO ] Redundant transitions in 71 ms returned []
Running 816 sub problems to find dead transitions.
[2024-06-01 13:37:39] [INFO ] Flow matrix only has 806 transitions (discarded 12 similar events)
[2024-06-01 13:37:39] [INFO ] Invariant cache hit.
[2024-06-01 13:37:39] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 49 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 2 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 2 ms to minimize.
[2024-06-01 13:37:45] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 2 ms to minimize.
[2024-06-01 13:37:50] [INFO ] Deduced a trap composed of 188 places in 203 ms of which 4 ms to minimize.
[2024-06-01 13:37:51] [INFO ] Deduced a trap composed of 126 places in 209 ms of which 3 ms to minimize.
[2024-06-01 13:37:51] [INFO ] Deduced a trap composed of 159 places in 162 ms of which 2 ms to minimize.
[2024-06-01 13:37:52] [INFO ] Deduced a trap composed of 146 places in 150 ms of which 4 ms to minimize.
[2024-06-01 13:37:53] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:37:59] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:38:08] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/1184 variables, and 55 constraints, problems are : Problem set: 0 solved, 816 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 816/816 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 816 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 816 unsolved
[2024-06-01 13:38:14] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:38:17] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 816 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 816 unsolved
Problem TDEAD726 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/377 variables, 1/58 constraints. Problems are: Problem set: 36 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/1184 variables, and 58 constraints, problems are : Problem set: 36 solved, 780 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/25 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/816 constraints, Known Traps: 17/17 constraints]
After SMT, in 61176ms problems are : Problem set: 36 solved, 780 unsolved
Search for dead transitions found 36 dead transitions in 61188ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 378/378 places, 782/818 transitions.
Applied a total of 0 rules in 32 ms. Remains 378 /378 variables (removed 0) and now considering 782/782 (removed 0) transitions.
[2024-06-01 13:38:40] [INFO ] Redundant transitions in 9 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64172 ms. Remains : 378/378 places, 782/818 transitions.
RANDOM walk for 40000 steps (15 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (11 resets) in 457 ms. (87 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 370499 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 370499 steps, saw 194443 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-06-01 13:38:43] [INFO ] Flow matrix only has 770 transitions (discarded 12 similar events)
// Phase 1: matrix 770 rows 378 cols
[2024-06-01 13:38:43] [INFO ] Computed 42 invariants in 38 ms
[2024-06-01 13:38:43] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 262/357 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/370 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/376 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 770/1146 variables, 376/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1146 variables, 72/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1146 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1148 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1148 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1148 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1148 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1148/1148 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 860 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 378/378 constraints, ReadFeed: 72/72 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/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 262/357 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:38:45] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 3 ms to minimize.
[2024-06-01 13:38:45] [INFO ] Deduced a trap composed of 49 places in 195 ms of which 4 ms to minimize.
[2024-06-01 13:38:45] [INFO ] Deduced a trap composed of 148 places in 197 ms of which 3 ms to minimize.
[2024-06-01 13:38:45] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/370 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/376 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 770/1146 variables, 376/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1146 variables, 72/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1146 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1146 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1148 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1148 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1148 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1148 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1148/1148 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3211 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 378/378 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 4214ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 93 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 782/782 transitions.
Applied a total of 0 rules in 14 ms. Remains 378 /378 variables (removed 0) and now considering 782/782 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 378/378 places, 782/782 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 782/782 transitions.
Applied a total of 0 rules in 14 ms. Remains 378 /378 variables (removed 0) and now considering 782/782 (removed 0) transitions.
[2024-06-01 13:38:48] [INFO ] Flow matrix only has 770 transitions (discarded 12 similar events)
[2024-06-01 13:38:48] [INFO ] Invariant cache hit.
[2024-06-01 13:38:48] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-06-01 13:38:48] [INFO ] Flow matrix only has 770 transitions (discarded 12 similar events)
[2024-06-01 13:38:48] [INFO ] Invariant cache hit.
[2024-06-01 13:38:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:38:51] [INFO ] Implicit Places using invariants and state equation in 2649 ms returned []
Implicit Place search using SMT with State Equation took 2921 ms to find 0 implicit places.
[2024-06-01 13:38:51] [INFO ] Redundant transitions in 4 ms returned []
Running 780 sub problems to find dead transitions.
[2024-06-01 13:38:51] [INFO ] Flow matrix only has 770 transitions (discarded 12 similar events)
[2024-06-01 13:38:51] [INFO ] Invariant cache hit.
[2024-06-01 13:38:51] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 6 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 145 places in 187 ms of which 2 ms to minimize.
[2024-06-01 13:38:56] [INFO ] Deduced a trap composed of 138 places in 194 ms of which 3 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 3 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 144 places in 254 ms of which 3 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 143 places in 160 ms of which 2 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 149 places in 192 ms of which 3 ms to minimize.
[2024-06-01 13:38:57] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 3 ms to minimize.
[2024-06-01 13:38:58] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 171 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:39:00] [INFO ] Deduced a trap composed of 182 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:39:01] [INFO ] Deduced a trap composed of 179 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:39:01] [INFO ] Deduced a trap composed of 183 places in 198 ms of which 3 ms to minimize.
[2024-06-01 13:39:02] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 3 ms to minimize.
[2024-06-01 13:39:02] [INFO ] Deduced a trap composed of 150 places in 175 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-06-01 13:39:03] [INFO ] Deduced a trap composed of 125 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:39:03] [INFO ] Deduced a trap composed of 171 places in 196 ms of which 3 ms to minimize.
[2024-06-01 13:39:06] [INFO ] Deduced a trap composed of 172 places in 186 ms of which 3 ms to minimize.
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 132 places in 205 ms of which 3 ms to minimize.
[2024-06-01 13:39:07] [INFO ] Deduced a trap composed of 121 places in 175 ms of which 3 ms to minimize.
[2024-06-01 13:39:08] [INFO ] Deduced a trap composed of 141 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:39:08] [INFO ] Deduced a trap composed of 155 places in 191 ms of which 3 ms to minimize.
[2024-06-01 13:39:09] [INFO ] Deduced a trap composed of 118 places in 190 ms of which 3 ms to minimize.
[2024-06-01 13:39:09] [INFO ] Deduced a trap composed of 126 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:39:10] [INFO ] Deduced a trap composed of 130 places in 178 ms of which 3 ms to minimize.
[2024-06-01 13:39:10] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 3 ms to minimize.
[2024-06-01 13:39:10] [INFO ] Deduced a trap composed of 215 places in 138 ms of which 3 ms to minimize.
[2024-06-01 13:39:10] [INFO ] Deduced a trap composed of 245 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:39:10] [INFO ] Deduced a trap composed of 228 places in 149 ms of which 3 ms to minimize.
[2024-06-01 13:39:11] [INFO ] Deduced a trap composed of 99 places in 185 ms of which 3 ms to minimize.
[2024-06-01 13:39:11] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-06-01 13:39:19] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/1148 variables, and 77 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 37/77 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-06-01 13:39:26] [INFO ] Deduced a trap composed of 176 places in 213 ms of which 3 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 176 places in 177 ms of which 3 ms to minimize.
[2024-06-01 13:39:27] [INFO ] Deduced a trap composed of 198 places in 198 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 5 (OVERLAPS) 1/377 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Problem TDEAD724 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/378 variables, 1/82 constraints. Problems are: Problem set: 30 solved, 750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/1148 variables, and 82 constraints, problems are : Problem set: 30 solved, 750 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/378 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 40/40 constraints]
After SMT, in 60765ms problems are : Problem set: 30 solved, 750 unsolved
Search for dead transitions found 30 dead transitions in 60773ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 378/378 places, 752/782 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 376 transition count 740
Reduce places removed 6 places and 12 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 8 place count 370 transition count 728
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 8 rules in 16 ms. Remains 370 /378 variables (removed 8) and now considering 728/752 (removed 24) transitions.
[2024-06-01 13:39:51] [INFO ] Flow matrix only has 716 transitions (discarded 12 similar events)
// Phase 1: matrix 716 rows 370 cols
[2024-06-01 13:39:51] [INFO ] Computed 48 invariants in 8 ms
[2024-06-01 13:39:52] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-01 13:39:52] [INFO ] Flow matrix only has 716 transitions (discarded 12 similar events)
[2024-06-01 13:39:52] [INFO ] Invariant cache hit.
[2024-06-01 13:39:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 13:39:54] [INFO ] Implicit Places using invariants and state equation in 2494 ms returned []
Implicit Place search using SMT with State Equation took 2752 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 370/378 places, 728/782 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66489 ms. Remains : 370/378 places, 728/782 transitions.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
FORMULA PolyORBLF-COL-S02J06T06-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 202694 ms.
ITS solved all properties within timeout
BK_STOP 1717249194627
--------------------
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="PolyORBLF-COL-S02J06T06"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-COL-S02J06T06, 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 r516-tajo-171654446400103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T06.tgz
mv PolyORBLF-COL-S02J06T06 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 '
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 ;