About the Execution of GreatSPN+red for StigmergyCommit-PT-05b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16015.420 | 1747240.00 | 5409977.00 | 2004.80 | TF??FFFT?FFTT??? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r399-tall-171690529700148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is StigmergyCommit-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529700148
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 StigmergyCommit-PT-05b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-05b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716989147200
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 13:25:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 13:25:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:25:48] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2024-05-29 13:25:48] [INFO ] Transformed 1837 places.
[2024-05-29 13:25:48] [INFO ] Transformed 3460 transitions.
[2024-05-29 13:25:48] [INFO ] Found NUPN structural information;
[2024-05-29 13:25:48] [INFO ] Parsed PT model containing 1837 places and 3460 transitions and 22362 arcs in 341 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyCommit-PT-05b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 1837 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 146 place count 1691 transition count 3314
Iterating global reduction 0 with 146 rules applied. Total rules applied 292 place count 1691 transition count 3314
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 381 place count 1602 transition count 3225
Iterating global reduction 0 with 89 rules applied. Total rules applied 470 place count 1602 transition count 3225
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 522 place count 1550 transition count 3173
Iterating global reduction 0 with 52 rules applied. Total rules applied 574 place count 1550 transition count 3173
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 620 place count 1504 transition count 3127
Iterating global reduction 0 with 46 rules applied. Total rules applied 666 place count 1504 transition count 3127
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 707 place count 1463 transition count 3086
Iterating global reduction 0 with 41 rules applied. Total rules applied 748 place count 1463 transition count 3086
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 789 place count 1422 transition count 3045
Iterating global reduction 0 with 41 rules applied. Total rules applied 830 place count 1422 transition count 3045
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 870 place count 1382 transition count 3005
Iterating global reduction 0 with 40 rules applied. Total rules applied 910 place count 1382 transition count 3005
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 950 place count 1342 transition count 2965
Iterating global reduction 0 with 40 rules applied. Total rules applied 990 place count 1342 transition count 2965
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 1024 place count 1308 transition count 2931
Iterating global reduction 0 with 34 rules applied. Total rules applied 1058 place count 1308 transition count 2931
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1086 place count 1280 transition count 2903
Iterating global reduction 0 with 28 rules applied. Total rules applied 1114 place count 1280 transition count 2903
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1120 place count 1280 transition count 2897
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 1130 place count 1270 transition count 2887
Iterating global reduction 1 with 10 rules applied. Total rules applied 1140 place count 1270 transition count 2887
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 1150 place count 1260 transition count 2877
Iterating global reduction 1 with 10 rules applied. Total rules applied 1160 place count 1260 transition count 2877
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1166 place count 1254 transition count 2871
Iterating global reduction 1 with 6 rules applied. Total rules applied 1172 place count 1254 transition count 2871
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1178 place count 1248 transition count 2865
Iterating global reduction 1 with 6 rules applied. Total rules applied 1184 place count 1248 transition count 2865
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1190 place count 1242 transition count 2859
Iterating global reduction 1 with 6 rules applied. Total rules applied 1196 place count 1242 transition count 2859
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1202 place count 1236 transition count 2853
Iterating global reduction 1 with 6 rules applied. Total rules applied 1208 place count 1236 transition count 2853
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1213 place count 1231 transition count 2848
Iterating global reduction 1 with 5 rules applied. Total rules applied 1218 place count 1231 transition count 2848
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1223 place count 1226 transition count 2843
Iterating global reduction 1 with 5 rules applied. Total rules applied 1228 place count 1226 transition count 2843
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1233 place count 1221 transition count 2838
Iterating global reduction 1 with 5 rules applied. Total rules applied 1238 place count 1221 transition count 2838
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1243 place count 1216 transition count 2833
Iterating global reduction 1 with 5 rules applied. Total rules applied 1248 place count 1216 transition count 2833
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1253 place count 1211 transition count 2828
Iterating global reduction 1 with 5 rules applied. Total rules applied 1258 place count 1211 transition count 2828
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1263 place count 1206 transition count 2823
Iterating global reduction 1 with 5 rules applied. Total rules applied 1268 place count 1206 transition count 2823
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 1273 place count 1206 transition count 2818
Applied a total of 1273 rules in 1721 ms. Remains 1206 /1837 variables (removed 631) and now considering 2818/3460 (removed 642) transitions.
// Phase 1: matrix 2818 rows 1206 cols
[2024-05-29 13:25:50] [INFO ] Computed 7 invariants in 56 ms
[2024-05-29 13:25:51] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-05-29 13:25:51] [INFO ] Invariant cache hit.
[2024-05-29 13:25:52] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1559 ms to find 0 implicit places.
Running 2817 sub problems to find dead transitions.
[2024-05-29 13:25:52] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1205/4024 variables, and 0 constraints, problems are : Problem set: 0 solved, 2817 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1206 constraints, PredecessorRefiner: 2817/2817 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1205/4024 variables, and 0 constraints, problems are : Problem set: 0 solved, 2817 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1206 constraints, PredecessorRefiner: 0/2817 constraints, Known Traps: 0/0 constraints]
After SMT, in 81010ms problems are : Problem set: 0 solved, 2817 unsolved
Search for dead transitions found 0 dead transitions in 81067ms
Starting structural reductions in LTL mode, iteration 1 : 1206/1837 places, 2818/3460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84387 ms. Remains : 1206/1837 places, 2818/3460 transitions.
Support contains 50 out of 1206 places after structural reductions.
[2024-05-29 13:27:13] [INFO ] Flatten gal took : 303 ms
[2024-05-29 13:27:14] [INFO ] Flatten gal took : 187 ms
[2024-05-29 13:27:14] [INFO ] Input system was already deterministic with 2818 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (362 resets) in 2263 ms. (17 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 235998 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :1 out of 26
Probabilistic random walk after 235998 steps, saw 50539 distinct states, run finished after 3011 ms. (steps per millisecond=78 ) properties seen :1
[2024-05-29 13:27:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 1145/1192 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-29 13:27:21] [INFO ] Deduced a trap composed of 295 places in 682 ms of which 39 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1192 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1192 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 14/1206 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1206 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 2818/4024 variables, 1206/1214 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4024/4024 variables, and 1214 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1206/1206 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 1145/1192 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1192 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-29 13:27:25] [INFO ] Deduced a trap composed of 308 places in 562 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1192 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1192 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 14/1206 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 2818/4024 variables, 1206/1215 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4024/4024 variables, and 1240 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5059 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1206/1206 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 2/2 constraints]
After SMT, in 10443ms problems are : Problem set: 0 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 1206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Graph (trivial) has 1147 edges and 1206 vertex of which 101 / 1206 are part of one of the 18 SCC in 7 ms
Free SCC test removed 83 places
Drop transitions (Empty/Sink Transition effects.) removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Graph (complete) has 2059 edges and 1123 vertex of which 1117 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.20 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 792 transitions
Trivial Post-agglo rules discarded 792 transitions
Performed 792 trivial Post agglomeration. Transition count delta: 792
Iterating post reduction 0 with 797 rules applied. Total rules applied 799 place count 1117 transition count 1909
Reduce places removed 792 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 811 rules applied. Total rules applied 1610 place count 325 transition count 1890
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 11 rules applied. Total rules applied 1621 place count 318 transition count 1886
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1625 place count 314 transition count 1886
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 1625 place count 314 transition count 1821
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 1755 place count 249 transition count 1821
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1756 place count 249 transition count 1820
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 1844 place count 205 transition count 1776
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1854 place count 205 transition count 1766
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 1876 place count 183 transition count 1733
Iterating global reduction 6 with 22 rules applied. Total rules applied 1898 place count 183 transition count 1733
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1903 place count 183 transition count 1728
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1918 place count 168 transition count 1713
Iterating global reduction 7 with 15 rules applied. Total rules applied 1933 place count 168 transition count 1713
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1942 place count 159 transition count 1704
Iterating global reduction 7 with 9 rules applied. Total rules applied 1951 place count 159 transition count 1704
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1954 place count 159 transition count 1701
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1970 place count 151 transition count 1693
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1978 place count 147 transition count 1708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1979 place count 147 transition count 1707
Free-agglomeration rule applied 47 times.
Iterating global reduction 9 with 47 rules applied. Total rules applied 2026 place count 147 transition count 1660
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 9 with 47 rules applied. Total rules applied 2073 place count 100 transition count 1660
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 2079 place count 94 transition count 1654
Iterating global reduction 10 with 6 rules applied. Total rules applied 2085 place count 94 transition count 1654
Drop transitions (Redundant composition of simpler transitions.) removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 10 with 63 rules applied. Total rules applied 2148 place count 94 transition count 1591
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2150 place count 93 transition count 1590
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 2154 place count 91 transition count 1608
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2159 place count 91 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2161 place count 91 transition count 1606
Applied a total of 2161 rules in 725 ms. Remains 91 /1206 variables (removed 1115) and now considering 1606/2818 (removed 1212) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 725 ms. Remains : 91/1206 places, 1606/2818 transitions.
RANDOM walk for 40000 steps (1807 resets) in 711 ms. (56 steps per ms) remains 13/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (154 resets) in 88 ms. (449 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (145 resets) in 81 ms. (487 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 71 ms. (555 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (159 resets) in 33 ms. (1176 steps per ms) remains 1/2 properties
BEST_FIRST walk for 30984 steps (153 resets) in 43 ms. (704 steps per ms) remains 0/1 properties
Computed a total of 250 stabilizing places and 262 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((p1||F(p2))))||p0)))'
Support contains 7 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1200 transition count 2812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1200 transition count 2812
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1194 transition count 2806
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1194 transition count 2806
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1190 transition count 2802
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1190 transition count 2802
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 1187 transition count 2799
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1183 transition count 2795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1183 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1182 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1182 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1181 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1181 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1180 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1180 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1179 transition count 2790
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1179 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1178 transition count 2789
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1178 transition count 2789
Applied a total of 57 rules in 442 ms. Remains 1178 /1206 variables (removed 28) and now considering 2789/2818 (removed 29) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2024-05-29 13:27:31] [INFO ] Computed 7 invariants in 42 ms
[2024-05-29 13:27:32] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-29 13:27:32] [INFO ] Invariant cache hit.
[2024-05-29 13:27:33] [INFO ] Implicit Places using invariants and state equation in 1372 ms returned []
Implicit Place search using SMT with State Equation took 1859 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-05-29 13:27:33] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 82003ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 82029ms
Starting structural reductions in LTL mode, iteration 1 : 1178/1206 places, 2789/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84347 ms. Remains : 1178/1206 places, 2789/2818 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-00
Product exploration explored 100000 steps with 889 reset in 284 ms.
Product exploration explored 100000 steps with 886 reset in 222 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (356 resets) in 209 ms. (190 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (59 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (57 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
[2024-05-29 13:28:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1157/1164 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1164 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/1178 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2789/3967 variables, 1178/1185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3967 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3967 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3967/3967 variables, and 1185 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 1157/1164 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1164 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/1178 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2789/3967 variables, 1178/1185 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3967 variables, 1/1186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3967/3967 variables, and 1186 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2472 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3715ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 20192 steps, including 157 resets, run visited all 1 properties in 56 ms. (steps per millisecond=360 )
Parikh walk visited 1 properties in 62 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 11 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-05b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-05b-LTLFireability-00 finished in 89455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1200 transition count 2812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1200 transition count 2812
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1194 transition count 2806
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1194 transition count 2806
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1190 transition count 2802
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1190 transition count 2802
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 1187 transition count 2799
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1183 transition count 2795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1183 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1182 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1182 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1181 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1181 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1180 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1180 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1179 transition count 2790
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1179 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1178 transition count 2789
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1178 transition count 2789
Applied a total of 57 rules in 454 ms. Remains 1178 /1206 variables (removed 28) and now considering 2789/2818 (removed 29) transitions.
[2024-05-29 13:29:01] [INFO ] Invariant cache hit.
[2024-05-29 13:29:01] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-29 13:29:01] [INFO ] Invariant cache hit.
[2024-05-29 13:29:02] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-05-29 13:29:02] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 80924ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 80951ms
Starting structural reductions in LTL mode, iteration 1 : 1178/1206 places, 2789/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83317 ms. Remains : 1178/1206 places, 2789/2818 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-01
Product exploration explored 100000 steps with 887 reset in 242 ms.
Product exploration explored 100000 steps with 894 reset in 190 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (354 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (58 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 324300 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 324300 steps, saw 67507 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2024-05-29 13:30:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1158/1164 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1164 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/1178 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2789/3967 variables, 1178/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3967 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3967 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3967/3967 variables, and 1185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 846 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1158/1164 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1164 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/1178 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2789/3967 variables, 1178/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3967 variables, 1/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3967/3967 variables, and 1186 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1979 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2851ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 278 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=139 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-05b-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-05b-LTLFireability-01 finished in 90050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((F(G(p1))&&p0)))))))'
Support contains 9 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1200 transition count 2812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1200 transition count 2812
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1194 transition count 2806
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1194 transition count 2806
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1190 transition count 2802
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1190 transition count 2802
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 1187 transition count 2799
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1183 transition count 2795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1183 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1182 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1182 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1181 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1181 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1180 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1180 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1179 transition count 2790
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1179 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1178 transition count 2789
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1178 transition count 2789
Applied a total of 57 rules in 429 ms. Remains 1178 /1206 variables (removed 28) and now considering 2789/2818 (removed 29) transitions.
[2024-05-29 13:30:31] [INFO ] Invariant cache hit.
[2024-05-29 13:30:31] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-29 13:30:31] [INFO ] Invariant cache hit.
[2024-05-29 13:30:32] [INFO ] Implicit Places using invariants and state equation in 1378 ms returned []
Implicit Place search using SMT with State Equation took 1786 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-05-29 13:30:32] [INFO ] Invariant cache hit.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running StigmergyCommit-PT-05b
IS_COLORED=
IS_NUPN=1
LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 1837
TRANSITIONS: 3460
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 22362
NUPN UNITS: 13
LOADING TIME: 1.655
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.114
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 2.232
OK.
----------------------------------------------------------------------
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: 753
MODEL NAME: /home/mcc/execution/model
1837 places, 3460 transitions.
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.
Building monolithic NSF...
FORMULA StigmergyCommit-PT-05b-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-05b-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-05b-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-05b-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-05b-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-05b-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-05b-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-05b-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-05b-LTLFireability-01 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-05b-LTLFireability-02 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-05b-LTLFireability-03 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-05b-LTLFireability-04 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-05b-LTLFireability-08 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-05b-LTLFireability-13 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-05b-LTLFireability-14 CANNOT_COMPUTE
FORMULA StigmergyCommit-PT-05b-LTLFireability-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716990894440
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="StigmergyCommit-PT-05b"
export BK_EXAMINATION="LTLFireability"
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 StigmergyCommit-PT-05b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690529700148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-05b.tgz
mv StigmergyCommit-PT-05b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;