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-171654445200095.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 PolyORBLF-COL-S02J04T10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445200095
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 16:45 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 4.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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-S02J04T10-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716845662444

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 21:34:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 21:34:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:34:24] [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-05-27 21:34:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 21:34:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 890 ms
[2024-05-27 21:34:25] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 21:34:25] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 7 ms.
[2024-05-27 21:34:25] [INFO ] Skeletonized 16 HLPN properties in 1 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 126 steps (0 resets) in 14 ms. (8 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-05-27 21:34:25] [INFO ] Flatten gal took : 44 ms
[2024-05-27 21:34:25] [INFO ] Flatten gal took : 10 ms
RANDOM walk for 0 steps (0 resets) in 5 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 T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 21:34:25] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 52 ms.
[2024-05-27 21:34:25] [INFO ] Unfolded 16 HLPN properties in 2 ms.
[2024-05-27 21:34:25] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-27 21:34:25] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-27 21:34:25] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-27 21:34:25] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-27 21:34:25] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-27 21:34:25] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-27 21:34:25] [INFO ] Reduced 40 identical enabling conditions.
[2024-05-27 21:34:25] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-27 21:34:25] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-27 21:34:25] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-27 21:34:25] [INFO ] Reduced 110 identical enabling conditions.
[2024-05-27 21:34:25] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
RANDOM walk for 40000 steps (11 resets) in 2616 ms. (15 steps per ms) remains 4/16 properties
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (9 resets) in 1474 ms. (27 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 928 ms. (43 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (10 resets) in 1941 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (11 resets) in 1925 ms. (20 steps per ms) remains 4/4 properties
[2024-05-27 21:34:28] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-05-27 21:34:28] [INFO ] Computed 54 invariants in 59 ms
[2024-05-27 21:34:28] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-10 is UNSAT
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 31/671 variables, 10/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 3/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 81/752 variables, 13/54 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 806 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4671 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 23/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/671 variables, 10/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 3/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 81/752 variables, 13/54 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-27 21:34:39] [INFO ] Deduced a trap composed of 66 places in 357 ms of which 43 ms to minimize.
[2024-05-27 21:34:39] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 5 ms to minimize.
[2024-05-27 21:34:39] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 4 ms to minimize.
[2024-05-27 21:34:40] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 3 ms to minimize.
[2024-05-27 21:34:40] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 2 ms to minimize.
[2024-05-27 21:34:40] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-27 21:34:40] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 7/61 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2144/2144 variables, and 813 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 13697ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 419 ms.
Support contains 640 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Applied a total of 0 rules in 84 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-27 21:34:42] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 21:34:42] [INFO ] Invariant cache hit.
[2024-05-27 21:34:42] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 21:35:02] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2144 variables, and 51 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20078 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 21:35:09] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 3 ms to minimize.
[2024-05-27 21:35:09] [INFO ] Deduced a trap composed of 66 places in 146 ms of which 5 ms to minimize.
[2024-05-27 21:35:09] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 2 ms to minimize.
[2024-05-27 21:35:09] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 2 ms to minimize.
[2024-05-27 21:35:09] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-27 21:35:09] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-05-27 21:35:10] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-27 21:35:10] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:35:11] [INFO ] Deduced a trap composed of 238 places in 486 ms of which 5 ms to minimize.
[2024-05-27 21:35:12] [INFO ] Deduced a trap composed of 253 places in 652 ms of which 20 ms to minimize.
[2024-05-27 21:35:12] [INFO ] Deduced a trap composed of 240 places in 464 ms of which 5 ms to minimize.
[2024-05-27 21:35:13] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:35:23] [INFO ] Deduced a trap composed of 84 places in 202 ms of which 4 ms to minimize.
[2024-05-27 21:35:24] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2144 variables, and 65 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 15/15 constraints]
After SMT, in 42380ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 42404ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42512 ms. Remains : 752/752 places, 1412/1412 transitions.
RANDOM walk for 40000 steps (13 resets) in 1008 ms. (39 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1950 ms. (20 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (13 resets) in 1157 ms. (34 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1779 ms. (22 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 112746 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 3
Probabilistic random walk after 112746 steps, saw 63176 distinct states, run finished after 3005 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-27 21:35:29] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 21:35:29] [INFO ] Invariant cache hit.
[2024-05-27 21:35:29] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/671 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-04 is UNSAT
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 81/752 variables, 13/54 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1392/2144 variables, 752/806 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2144 variables, 120/926 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2144 variables, 0/926 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2144 variables, 0/926 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2144/2144 variables, and 926 constraints, problems are : Problem set: 1 solved, 2 unsolved in 45015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 14/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-27 21:36:17] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
[2024-05-27 21:36:17] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/579 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 52/631 variables, 10/31 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/631 variables, 11/42 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-27 21:36:17] [INFO ] Deduced a trap composed of 66 places in 220 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/631 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 121/752 variables, 14/57 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-27 21:36:27] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2024-05-27 21:36:27] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 3 ms to minimize.
[2024-05-27 21:36:27] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:36:27] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-27 21:36:27] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 5/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/752 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1392/2144 variables, 752/814 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2144 variables, 120/934 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-27 21:36:56] [INFO ] Deduced a trap composed of 393 places in 413 ms of which 6 ms to minimize.
[2024-05-27 21:36:58] [INFO ] Deduced a trap composed of 66 places in 397 ms of which 5 ms to minimize.
[2024-05-27 21:36:59] [INFO ] Deduced a trap composed of 412 places in 354 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2144/2144 variables, and 937 constraints, problems are : Problem set: 1 solved, 2 unsolved in 45031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 752/752 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 11/11 constraints]
After SMT, in 92159ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 579 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 752 transition count 1392
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 732 transition count 1392
Applied a total of 40 rules in 71 ms. Remains 732 /752 variables (removed 20) and now considering 1392/1412 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 732/752 places, 1392/1412 transitions.
RANDOM walk for 40000 steps (10 resets) in 999 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1788 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 2271 ms. (17 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 132831 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 2
Probabilistic random walk after 132831 steps, saw 75551 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-27 21:37:06] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 732 cols
[2024-05-27 21:37:06] [INFO ] Computed 54 invariants in 36 ms
[2024-05-27 21:37:06] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/579 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 118/697 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/697 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 35/732 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1372/2104 variables, 732/786 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2104 variables, 120/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2104 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2104 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2104/2104 variables, and 906 constraints, problems are : Problem set: 0 solved, 2 unsolved in 70141 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 732/732 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 21:38:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/579 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 118/697 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 21:38:18] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 35/732 variables, 22/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-06 is UNSAT
FORMULA PolyORBLF-COL-S02J04T10-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-27 21:38:34] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 4 ms to minimize.
[2024-05-27 21:38:34] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 3 ms to minimize.
[2024-05-27 21:38:34] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 3 ms to minimize.
[2024-05-27 21:38:35] [INFO ] Deduced a trap composed of 64 places in 212 ms of which 3 ms to minimize.
[2024-05-27 21:38:35] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 3 ms to minimize.
[2024-05-27 21:38:35] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-05-27 21:38:35] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2024-05-27 21:38:35] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-05-27 21:38:35] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/732 variables, 9/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-27 21:38:36] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/732 variables, 1/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/732 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1372/2104 variables, 732/798 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2104 variables, 120/918 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2104 variables, 0/918 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2104 variables, 0/918 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2104/2104 variables, and 918 constraints, problems are : Problem set: 1 solved, 1 unsolved in 19422 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 732/732 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 12/12 constraints]
After SMT, in 91135ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 84 ms.
Support contains 378 out of 732 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 732/732 places, 1392/1392 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 732 transition count 1382
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 722 transition count 1382
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 20 place count 722 transition count 1312
Deduced a syphon composed of 70 places in 2 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 160 place count 652 transition count 1312
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 16 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 180 place count 642 transition count 1302
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 190 place count 642 transition count 1292
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 200 place count 632 transition count 1292
Applied a total of 200 rules in 192 ms. Remains 632 /732 variables (removed 100) and now considering 1292/1392 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 632/732 places, 1292/1392 transitions.
RANDOM walk for 40001 steps (15 resets) in 423 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 2227 ms. (17 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 242225 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 1
Probabilistic random walk after 242225 steps, saw 135872 distinct states, run finished after 3002 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-27 21:38:41] [INFO ] Flow matrix only has 1272 transitions (discarded 20 similar events)
// Phase 1: matrix 1272 rows 632 cols
[2024-05-27 21:38:41] [INFO ] Computed 54 invariants in 20 ms
[2024-05-27 21:38:41] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 84/462 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 170/632 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/632 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1272/1904 variables, 632/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1904 variables, 120/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1904 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1904/1904 variables, and 806 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1761 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 632/632 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:38:44] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 84/462 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 170/632 variables, 37/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:38:44] [INFO ] Deduced a trap composed of 53 places in 226 ms of which 4 ms to minimize.
[2024-05-27 21:38:45] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 3 ms to minimize.
[2024-05-27 21:38:45] [INFO ] Deduced a trap composed of 53 places in 787 ms of which 2 ms to minimize.
[2024-05-27 21:38:45] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
[2024-05-27 21:38:46] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 2 ms to minimize.
[2024-05-27 21:38:46] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-05-27 21:38:46] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2024-05-27 21:38:46] [INFO ] Deduced a trap composed of 54 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/632 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/632 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1272/1904 variables, 632/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1904 variables, 120/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1904 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1904 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1904/1904 variables, and 815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3850 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 632/632 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 9/9 constraints]
After SMT, in 6299ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 378 out of 632 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1292/1292 transitions.
Applied a total of 0 rules in 36 ms. Remains 632 /632 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 632/632 places, 1292/1292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 632/632 places, 1292/1292 transitions.
Applied a total of 0 rules in 30 ms. Remains 632 /632 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
[2024-05-27 21:38:48] [INFO ] Flow matrix only has 1272 transitions (discarded 20 similar events)
[2024-05-27 21:38:48] [INFO ] Invariant cache hit.
[2024-05-27 21:38:48] [INFO ] Implicit Places using invariants in 326 ms returned [546, 547, 548, 549, 550, 551, 552, 553, 554, 555]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 335 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 622/632 places, 1292/1292 transitions.
Applied a total of 0 rules in 30 ms. Remains 622 /622 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 396 ms. Remains : 622/632 places, 1292/1292 transitions.
RANDOM walk for 40000 steps (12 resets) in 349 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (13 resets) in 1673 ms. (23 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 231577 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 231577 steps, saw 130168 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-27 21:38:52] [INFO ] Flow matrix only has 1272 transitions (discarded 20 similar events)
// Phase 1: matrix 1272 rows 622 cols
[2024-05-27 21:38:52] [INFO ] Computed 44 invariants in 16 ms
[2024-05-27 21:38:52] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/474 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 148/622 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/622 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1272/1894 variables, 622/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1894 variables, 120/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1894 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1894 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1894/1894 variables, and 786 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1791 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 622/622 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:38:54] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:38:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 96/474 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 148/622 variables, 26/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 21:38:55] [INFO ] Deduced a trap composed of 54 places in 296 ms of which 15 ms to minimize.
[2024-05-27 21:38:55] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 4 ms to minimize.
[2024-05-27 21:38:55] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 3 ms to minimize.
[2024-05-27 21:38:56] [INFO ] Deduced a trap composed of 54 places in 163 ms of which 2 ms to minimize.
[2024-05-27 21:38:56] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2024-05-27 21:38:56] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2024-05-27 21:38:56] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-05-27 21:38:56] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/622 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/622 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1272/1894 variables, 622/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1894 variables, 120/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1894 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1894 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1894/1894 variables, and 796 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3536 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 622/622 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 10/10 constraints]
After SMT, in 5986ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 378 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1292/1292 transitions.
Applied a total of 0 rules in 28 ms. Remains 622 /622 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 622/622 places, 1292/1292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1292/1292 transitions.
Applied a total of 0 rules in 24 ms. Remains 622 /622 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
[2024-05-27 21:38:58] [INFO ] Flow matrix only has 1272 transitions (discarded 20 similar events)
[2024-05-27 21:38:58] [INFO ] Invariant cache hit.
[2024-05-27 21:38:58] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-27 21:38:58] [INFO ] Flow matrix only has 1272 transitions (discarded 20 similar events)
[2024-05-27 21:38:58] [INFO ] Invariant cache hit.
[2024-05-27 21:38:59] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:39:05] [INFO ] Implicit Places using invariants and state equation in 7410 ms returned []
Implicit Place search using SMT with State Equation took 7741 ms to find 0 implicit places.
[2024-05-27 21:39:06] [INFO ] Redundant transitions in 74 ms returned []
Running 1290 sub problems to find dead transitions.
[2024-05-27 21:39:06] [INFO ] Flow matrix only has 1272 transitions (discarded 20 similar events)
[2024-05-27 21:39:06] [INFO ] Invariant cache hit.
[2024-05-27 21:39:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2024-05-27 21:39:18] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 2 ms to minimize.
[2024-05-27 21:39:18] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
[2024-05-27 21:39:18] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 0 ms to minimize.
[2024-05-27 21:39:18] [INFO ] Deduced a trap composed of 54 places in 29 ms of which 1 ms to minimize.
[2024-05-27 21:39:19] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:39:19] [INFO ] Deduced a trap composed of 54 places in 33 ms of which 1 ms to minimize.
[2024-05-27 21:39:19] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:39:19] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 0 ms to minimize.
[2024-05-27 21:39:19] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:39:19] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:39:19] [INFO ] Deduced a trap composed of 293 places in 251 ms of which 4 ms to minimize.
[2024-05-27 21:39:20] [INFO ] Deduced a trap composed of 302 places in 274 ms of which 4 ms to minimize.
[2024-05-27 21:39:20] [INFO ] Deduced a trap composed of 274 places in 274 ms of which 4 ms to minimize.
[2024-05-27 21:39:20] [INFO ] Deduced a trap composed of 170 places in 230 ms of which 3 ms to minimize.
[2024-05-27 21:39:20] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 0 ms to minimize.
[2024-05-27 21:39:22] [INFO ] Deduced a trap composed of 307 places in 252 ms of which 4 ms to minimize.
[2024-05-27 21:39:22] [INFO ] Deduced a trap composed of 282 places in 262 ms of which 3 ms to minimize.
[2024-05-27 21:39:22] [INFO ] Deduced a trap composed of 262 places in 271 ms of which 4 ms to minimize.
[2024-05-27 21:39:23] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-27 21:39:23] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2024-05-27 21:39:35] [INFO ] Deduced a trap composed of 331 places in 259 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1894 variables, and 61 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 21/61 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2024-05-27 21:39:45] [INFO ] Deduced a trap composed of 391 places in 244 ms of which 4 ms to minimize.
[2024-05-27 21:39:45] [INFO ] Deduced a trap composed of 299 places in 258 ms of which 4 ms to minimize.
[2024-05-27 21:39:50] [INFO ] Deduced a trap composed of 286 places in 256 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/618 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 618/1894 variables, and 64 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1290 constraints, Known Traps: 24/24 constraints]
After SMT, in 62006ms problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 62019ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69870 ms. Remains : 622/622 places, 1292/1292 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 622 transition count 1272
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 622 transition count 1252
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 1 with 30 rules applied. Total rules applied 70 place count 622 transition count 1252
Applied a total of 70 rules in 69 ms. Remains 622 /622 variables (removed 0) and now considering 1252/1292 (removed 40) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1252 rows 622 cols
[2024-05-27 21:40:08] [INFO ] Computed 44 invariants in 26 ms
[2024-05-27 21:40:08] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-27 21:40:08] [INFO ] [Real]Absence check using 16 positive and 28 generalized place invariants in 30 ms returned sat
[2024-05-27 21:40:08] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:40:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-27 21:40:09] [INFO ] [Nat]Absence check using 16 positive and 28 generalized place invariants in 22 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-27 21:40:09] [INFO ] After 382ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :1
[2024-05-27 21:40:09] [INFO ] After 549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1441 ms.
[2024-05-27 21:40:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 27 ms.
[2024-05-27 21:40:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 622 places, 1292 transitions and 6022 arcs took 10 ms.
[2024-05-27 21:40:09] [INFO ] Flatten gal took : 263 ms
Total runtime 345853 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S02J04T10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 622
TRANSITIONS: 1292
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.031s, Sys 0.000s]


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


----------------------------------------------------------------------
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: 917
MODEL NAME: /home/mcc/execution/417/model
622 places, 1292 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="PolyORBLF-COL-S02J04T10"
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 PolyORBLF-COL-S02J04T10, 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-171654445200095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T10.tgz
mv PolyORBLF-COL-S02J04T10 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 ;