About the Execution of GreatSPN+red for PolyORBNT-COL-S10J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14727.468 | 3600000.00 | 12729823.00 | 154.80 | ??TF????FFFFF?TT | 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.r289-tajo-171654445900425.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-COL-S10J60, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445900425
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.6K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 10:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 10:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-COL-S10J60-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716881876646
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:37:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 07:37:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:37:58] [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-28 07:37:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 07:37:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 727 ms
[2024-05-28 07:37:59] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
[2024-05-28 07:37:59] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2024-05-28 07:37:59] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40010 steps (2279 resets) in 1501 ms. (26 steps per ms) remains 69/87 properties
BEST_FIRST walk for 4002 steps (78 resets) in 88 ms. (44 steps per ms) remains 59/69 properties
BEST_FIRST walk for 4001 steps (101 resets) in 83 ms. (47 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (76 resets) in 61 ms. (64 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (83 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (77 resets) in 21 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (72 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (88 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (77 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (84 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (78 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (73 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (85 resets) in 27 ms. (142 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (77 resets) in 40 ms. (97 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (80 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (66 resets) in 34 ms. (114 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (67 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (84 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4006 steps (129 resets) in 14 ms. (267 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (81 resets) in 29 ms. (133 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4007 steps (82 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (74 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4006 steps (79 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (86 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (96 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (82 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (80 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (73 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (84 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4010 steps (79 resets) in 18 ms. (211 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (73 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4008 steps (79 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (102 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (102 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (84 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (76 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (92 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (129 resets) in 13 ms. (286 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (77 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4006 steps (79 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (77 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (72 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (79 resets) in 32 ms. (121 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (70 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (80 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (84 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (92 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (78 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (74 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (75 resets) in 44 ms. (88 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (76 resets) in 21 ms. (181 steps per ms) remains 59/59 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 07:38:00] [INFO ] Computed 13 invariants in 6 ms
[2024-05-28 07:38:00] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp80 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/3 constraints. Problems are: Problem set: 4 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 55 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp86 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/43 variables, 4/7 constraints. Problems are: Problem set: 26 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 26 solved, 33 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 5 (OVERLAPS) 4/47 variables, 6/13 constraints. Problems are: Problem set: 58 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 58 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/85 variables, 47/60 constraints. Problems are: Problem set: 58 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 1/61 constraints. Problems are: Problem set: 58 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/61 constraints. Problems are: Problem set: 58 solved, 1 unsolved
Problem AtomicPropp50 is UNSAT
After SMT solving in domain Real declared 86/86 variables, and 62 constraints, problems are : Problem set: 59 solved, 0 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 537ms problems are : Problem set: 59 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 59 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 07:38:00] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-05-28 07:38:00] [INFO ] Flatten gal took : 23 ms
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 07:38:00] [INFO ] Flatten gal took : 6 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 07:38:01] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 266 ms.
[2024-05-28 07:38:01] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Deduced a syphon composed of 60 places in 26 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 1229 out of 1234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Applied a total of 0 rules in 42 ms. Remains 1234 /1234 variables (removed 0) and now considering 2810/2810 (removed 0) transitions.
Running 2799 sub problems to find dead transitions.
[2024-05-28 07:38:01] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2024-05-28 07:38:01] [INFO ] Computed 152 invariants in 232 ms
[2024-05-28 07:38:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1213 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2799 unsolved
SMT process timed out in 48042ms, After SMT, problems are : Problem set: 0 solved, 2799 unsolved
Search for dead transitions found 0 dead transitions in 48092ms
[2024-05-28 07:38:49] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 07:38:49] [INFO ] Invariant cache hit.
[2024-05-28 07:38:50] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-28 07:38:50] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 07:38:50] [INFO ] Invariant cache hit.
[2024-05-28 07:38:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:38:52] [INFO ] Implicit Places using invariants and state equation in 2074 ms returned []
Implicit Place search using SMT with State Equation took 2656 ms to find 0 implicit places.
Running 2799 sub problems to find dead transitions.
[2024-05-28 07:38:52] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 07:38:52] [INFO ] Invariant cache hit.
[2024-05-28 07:38:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1213 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2799 unsolved
SMT process timed out in 57883ms, After SMT, problems are : Problem set: 0 solved, 2799 unsolved
Search for dead transitions found 0 dead transitions in 57913ms
Finished structural reductions in LTL mode , in 1 iterations and 108741 ms. Remains : 1234/1234 places, 2810/2810 transitions.
Support contains 1229 out of 1234 places after structural reductions.
[2024-05-28 07:39:50] [INFO ] Flatten gal took : 284 ms
[2024-05-28 07:39:50] [INFO ] Flatten gal took : 184 ms
[2024-05-28 07:39:51] [INFO ] Input system was already deterministic with 2810 transitions.
Support contains 1228 out of 1234 places (down from 1229) after GAL structural reductions.
RANDOM walk for 40000 steps (2240 resets) in 3046 ms. (13 steps per ms) remains 38/53 properties
BEST_FIRST walk for 4004 steps (40 resets) in 71 ms. (55 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (48 resets) in 40 ms. (97 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (40 resets) in 40 ms. (97 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (40 resets) in 60 ms. (65 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (40 resets) in 52 ms. (75 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (40 resets) in 49 ms. (80 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (39 resets) in 59 ms. (66 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (40 resets) in 72 ms. (54 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (40 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 33/38 properties
BEST_FIRST walk for 4004 steps (40 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (32 resets) in 52 ms. (75 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (40 resets) in 52 ms. (75 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (41 resets) in 42 ms. (93 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (39 resets) in 43 ms. (90 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (41 resets) in 58 ms. (67 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 64 ms. (61 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (40 resets) in 38 ms. (102 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (40 resets) in 39 ms. (100 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (41 resets) in 37 ms. (105 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (40 resets) in 64 ms. (61 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (40 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (40 resets) in 53 ms. (74 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (48 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (48 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 68 ms. (58 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 72 ms. (54 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (41 resets) in 43 ms. (90 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (40 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (48 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (40 resets) in 41 ms. (95 steps per ms) remains 33/33 properties
[2024-05-28 07:39:52] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 07:39:52] [INFO ] Invariant cache hit.
[2024-05-28 07:39:52] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 2 (OVERLAPS) 761/1230 variables, 145/146 constraints. Problems are: Problem set: 20 solved, 13 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/1230 variables, 2/148 constraints. Problems are: Problem set: 25 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1230 variables, 0/148 constraints. Problems are: Problem set: 25 solved, 8 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
At refinement iteration 5 (OVERLAPS) 3/1233 variables, 4/152 constraints. Problems are: Problem set: 30 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 0/152 constraints. Problems are: Problem set: 30 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2801/4034 variables, 1233/1385 constraints. Problems are: Problem set: 30 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4034 variables, 1/1386 constraints. Problems are: Problem set: 30 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4034 variables, 0/1386 constraints. Problems are: Problem set: 30 solved, 3 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 10 (OVERLAPS) 1/4035 variables, 1/1387 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4035 variables, 0/1387 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/4035 variables, 0/1387 constraints. Problems are: Problem set: 31 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4035/4035 variables, and 1387 constraints, problems are : Problem set: 31 solved, 2 unsolved in 3742 ms.
Refiners :[Positive P Invariants (semi-flows): 145/145 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1234/1234 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1078/1160 variables, 82/82 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1160 variables, 0/82 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/1222 variables, 62/144 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1222 variables, 0/144 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/1232 variables, 7/151 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1232 variables, 0/151 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/1233 variables, 1/152 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1233 variables, 0/152 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2801/4034 variables, 1233/1385 constraints. Problems are: Problem set: 31 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4034/4035 variables, and 1386 constraints, problems are : Problem set: 31 solved, 2 unsolved in 3486 ms.
Refiners :[Positive P Invariants (semi-flows): 145/145 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1233/1234 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 7592ms problems are : Problem set: 31 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 82 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 1224 transition count 2744
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 142 place count 1158 transition count 2744
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 142 place count 1158 transition count 2679
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 272 place count 1093 transition count 2679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 273 place count 1092 transition count 2678
Iterating global reduction 2 with 1 rules applied. Total rules applied 274 place count 1092 transition count 2678
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 278 place count 1090 transition count 2676
Applied a total of 278 rules in 850 ms. Remains 1090 /1234 variables (removed 144) and now considering 2676/2810 (removed 134) transitions.
Running 2665 sub problems to find dead transitions.
[2024-05-28 07:40:01] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
// Phase 1: matrix 2667 rows 1090 cols
[2024-05-28 07:40:01] [INFO ] Computed 142 invariants in 149 ms
[2024-05-28 07:40:01] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
SMT process timed out in 43196ms, After SMT, problems are : Problem set: 0 solved, 2665 unsolved
Search for dead transitions found 0 dead transitions in 43272ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44145 ms. Remains : 1090/1234 places, 2676/2810 transitions.
RANDOM walk for 2065 steps (150 resets) in 74 ms. (27 steps per ms) remains 0/2 properties
Successfully simplified 31 atomic propositions for a total of 9 simplifications.
[2024-05-28 07:40:44] [INFO ] Flatten gal took : 318 ms
[2024-05-28 07:40:45] [INFO ] Flatten gal took : 190 ms
[2024-05-28 07:40:45] [INFO ] Input system was already deterministic with 2810 transitions.
Support contains 231 out of 1234 places (down from 963) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1223 transition count 2809
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1223 transition count 2809
Applied a total of 12 rules in 189 ms. Remains 1223 /1234 variables (removed 11) and now considering 2809/2810 (removed 1) transitions.
Running 2798 sub problems to find dead transitions.
[2024-05-28 07:40:45] [INFO ] Flow matrix only has 2800 transitions (discarded 9 similar events)
// Phase 1: matrix 2800 rows 1223 cols
[2024-05-28 07:40:45] [INFO ] Computed 142 invariants in 87 ms
[2024-05-28 07:40:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1212 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2798 unsolved
SMT process timed out in 49746ms, After SMT, problems are : Problem set: 0 solved, 2798 unsolved
Search for dead transitions found 0 dead transitions in 49792ms
Finished structural reductions in LTL mode , in 1 iterations and 49996 ms. Remains : 1223/1234 places, 2809/2810 transitions.
[2024-05-28 07:41:35] [INFO ] Flatten gal took : 144 ms
[2024-05-28 07:41:35] [INFO ] Flatten gal took : 155 ms
[2024-05-28 07:41:36] [INFO ] Input system was already deterministic with 2809 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1223 transition count 2809
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1223 transition count 2809
Applied a total of 12 rules in 134 ms. Remains 1223 /1234 variables (removed 11) and now considering 2809/2810 (removed 1) transitions.
Running 2798 sub problems to find dead transitions.
[2024-05-28 07:41:36] [INFO ] Flow matrix only has 2800 transitions (discarded 9 similar events)
[2024-05-28 07:41:36] [INFO ] Invariant cache hit.
[2024-05-28 07:41:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1212 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2798 unsolved
SMT process timed out in 46415ms, After SMT, problems are : Problem set: 0 solved, 2798 unsolved
Search for dead transitions found 0 dead transitions in 46456ms
Finished structural reductions in LTL mode , in 1 iterations and 46599 ms. Remains : 1223/1234 places, 2809/2810 transitions.
[2024-05-28 07:42:23] [INFO ] Flatten gal took : 138 ms
[2024-05-28 07:42:23] [INFO ] Flatten gal took : 151 ms
[2024-05-28 07:42:23] [INFO ] Input system was already deterministic with 2809 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1223 transition count 2809
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1223 transition count 2809
Applied a total of 12 rules in 82 ms. Remains 1223 /1234 variables (removed 11) and now considering 2809/2810 (removed 1) transitions.
Running 2798 sub problems to find dead transitions.
[2024-05-28 07:42:24] [INFO ] Flow matrix only has 2800 transitions (discarded 9 similar events)
[2024-05-28 07:42:24] [INFO ] Invariant cache hit.
[2024-05-28 07:42:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1212 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2798 unsolved
SMT process timed out in 45639ms, After SMT, problems are : Problem set: 0 solved, 2798 unsolved
Search for dead transitions found 0 dead transitions in 45678ms
Finished structural reductions in LTL mode , in 1 iterations and 45769 ms. Remains : 1223/1234 places, 2809/2810 transitions.
[2024-05-28 07:43:09] [INFO ] Flatten gal took : 108 ms
[2024-05-28 07:43:09] [INFO ] Flatten gal took : 117 ms
[2024-05-28 07:43:10] [INFO ] Input system was already deterministic with 2809 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1223 transition count 2809
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1223 transition count 2809
Applied a total of 12 rules in 75 ms. Remains 1223 /1234 variables (removed 11) and now considering 2809/2810 (removed 1) transitions.
Running 2798 sub problems to find dead transitions.
[2024-05-28 07:43:10] [INFO ] Flow matrix only has 2800 transitions (discarded 9 similar events)
[2024-05-28 07:43:10] [INFO ] Invariant cache hit.
[2024-05-28 07:43:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.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 1.0)
(s63 1.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.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 4.0)
(s385 4.0)
(s386 4.0)
(s387 4.0)
(s388 4.0)
(s389 4.0)
(s390 4.0)
(s391 4.0)
(s392 4.0)
(s393 4.0)
(s394 9.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1212 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2798 unsolved
SMT process timed out in 44963ms, After SMT, problems are : Problem set: 0 solved, 2798 unsolved
Search for dead transitions found 0 dead transitions in 44989ms
Finished structural reductions in LTL mode , in 1 iterations and 45082 ms. Remains : 1223/1234 places, 2809/2810 transitions.
[2024-05-28 07:43:55] [INFO ] Flatten gal took : 140 ms
[2024-05-28 07:43:55] [INFO ] Flatten gal took : 142 ms
[2024-05-28 07:43:55] [INFO ] Input system was already deterministic with 2809 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1224 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 1223 transition count 2809
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1223 transition count 2809
Applied a total of 12 rules in 109 ms. Remains 1223 /1234 variables (removed 11) and now considering 2809/2810 (removed 1) transitions.
Running 2798 sub problems to find dead transitions.
[2024-05-28 07:43:55] [INFO ] Flow matrix only has 2800 transitions (discarded 9 similar events)
[2024-05-28 07:43:55] [INFO ] Invariant cache hit.
[2024-05-28 07:43:55] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1212 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2798 unsolved
SMT process timed out in 46981ms, After SMT, problems are : Problem set: 0 solved, 2798 unsolved
Search for dead transitions found 0 dead transitions in 47013ms
Finished structural reductions in LTL mode , in 1 iterations and 47131 ms. Remains : 1223/1234 places, 2809/2810 transitions.
[2024-05-28 07:44:43] [INFO ] Flatten gal took : 134 ms
[2024-05-28 07:44:43] [INFO ] Flatten gal took : 153 ms
[2024-05-28 07:44:43] [INFO ] Input system was already deterministic with 2809 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 1224 transition count 2745
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 1159 transition count 2745
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 130 place count 1159 transition count 2681
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 258 place count 1095 transition count 2681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 259 place count 1094 transition count 2680
Iterating global reduction 2 with 1 rules applied. Total rules applied 260 place count 1094 transition count 2680
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 264 place count 1092 transition count 2678
Applied a total of 264 rules in 340 ms. Remains 1092 /1234 variables (removed 142) and now considering 2678/2810 (removed 132) transitions.
Running 2667 sub problems to find dead transitions.
[2024-05-28 07:44:43] [INFO ] Flow matrix only has 2669 transitions (discarded 9 similar events)
// Phase 1: matrix 2669 rows 1092 cols
[2024-05-28 07:44:44] [INFO ] Computed 142 invariants in 87 ms
[2024-05-28 07:44:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2667 unsolved
SMT process timed out in 48027ms, After SMT, problems are : Problem set: 0 solved, 2667 unsolved
Search for dead transitions found 0 dead transitions in 48064ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 48412 ms. Remains : 1092/1234 places, 2678/2810 transitions.
[2024-05-28 07:45:32] [INFO ] Flatten gal took : 112 ms
[2024-05-28 07:45:32] [INFO ] Flatten gal took : 129 ms
[2024-05-28 07:45:32] [INFO ] Input system was already deterministic with 2678 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1224 transition count 2744
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 1158 transition count 2744
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 1158 transition count 2679
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 1093 transition count 2679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 1092 transition count 2678
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 1092 transition count 2678
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 1090 transition count 2676
Applied a total of 268 rules in 361 ms. Remains 1090 /1234 variables (removed 144) and now considering 2676/2810 (removed 134) transitions.
Running 2665 sub problems to find dead transitions.
[2024-05-28 07:45:33] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
// Phase 1: matrix 2667 rows 1090 cols
[2024-05-28 07:45:33] [INFO ] Computed 142 invariants in 58 ms
[2024-05-28 07:45:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
SMT process timed out in 46856ms, After SMT, problems are : Problem set: 0 solved, 2665 unsolved
Search for dead transitions found 0 dead transitions in 46897ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 47280 ms. Remains : 1090/1234 places, 2676/2810 transitions.
[2024-05-28 07:46:20] [INFO ] Flatten gal took : 134 ms
[2024-05-28 07:46:20] [INFO ] Flatten gal took : 152 ms
[2024-05-28 07:46:20] [INFO ] Input system was already deterministic with 2676 transitions.
RANDOM walk for 186 steps (14 resets) in 23 ms. (7 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 1224 transition count 2744
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 1158 transition count 2744
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 1158 transition count 2679
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 1093 transition count 2679
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 1092 transition count 2678
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 1092 transition count 2678
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 1090 transition count 2676
Applied a total of 268 rules in 366 ms. Remains 1090 /1234 variables (removed 144) and now considering 2676/2810 (removed 134) transitions.
Running 2665 sub problems to find dead transitions.
[2024-05-28 07:46:20] [INFO ] Flow matrix only has 2667 transitions (discarded 9 similar events)
[2024-05-28 07:46:20] [INFO ] Invariant cache hit.
[2024-05-28 07:46:20] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2665 unsolved
SMT process timed out in 46874ms, After SMT, problems are : Problem set: 0 solved, 2665 unsolved
Search for dead transitions found 0 dead transitions in 46915ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 47290 ms. Remains : 1090/1234 places, 2676/2810 transitions.
[2024-05-28 07:47:07] [INFO ] Flatten gal took : 104 ms
[2024-05-28 07:47:08] [INFO ] Flatten gal took : 112 ms
[2024-05-28 07:47:08] [INFO ] Input system was already deterministic with 2676 transitions.
RANDOM walk for 302 steps (21 resets) in 13 ms. (21 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-COL-S10J60-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 1224 transition count 2746
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 1160 transition count 2745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 1159 transition count 2745
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 130 place count 1159 transition count 2681
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 258 place count 1095 transition count 2681
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 1094 transition count 2680
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 1094 transition count 2680
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 264 place count 1092 transition count 2678
Applied a total of 264 rules in 262 ms. Remains 1092 /1234 variables (removed 142) and now considering 2678/2810 (removed 132) transitions.
Running 2667 sub problems to find dead transitions.
[2024-05-28 07:47:08] [INFO ] Flow matrix only has 2669 transitions (discarded 9 similar events)
// Phase 1: matrix 2669 rows 1092 cols
[2024-05-28 07:47:08] [INFO ] Computed 142 invariants in 44 ms
[2024-05-28 07:47:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1082 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2667 unsolved
SMT process timed out in 43900ms, After SMT, problems are : Problem set: 0 solved, 2667 unsolved
Search for dead transitions found 0 dead transitions in 43927ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44197 ms. Remains : 1092/1234 places, 2678/2810 transitions.
[2024-05-28 07:47:52] [INFO ] Flatten gal took : 158 ms
[2024-05-28 07:47:52] [INFO ] Flatten gal took : 135 ms
[2024-05-28 07:47:53] [INFO ] Input system was already deterministic with 2678 transitions.
[2024-05-28 07:47:53] [INFO ] Flatten gal took : 113 ms
[2024-05-28 07:47:53] [INFO ] Flatten gal took : 116 ms
[2024-05-28 07:47:53] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-28 07:47:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1234 places, 2810 transitions and 17669 arcs took 32 ms.
Total runtime 595414 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBNT-COL-S10J60
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1234
TRANSITIONS: 2810
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.096s, Sys 0.009s]
SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.011s, 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: 650
MODEL NAME: /home/mcc/execution/416/model
1234 places, 2810 transitions.
No place bound informations found.
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..
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 CTLCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J60"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBNT-COL-S10J60, examination is CTLCardinality"
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-171654445900425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J60.tgz
mv PolyORBNT-COL-S10J60 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;