fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r400-tall-171690531700148
Last Updated
July 7, 2024

About the Execution of ITS-Tools for StigmergyCommit-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 208916.00 0.00 0.00 T???F?????F????? normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531700148.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 itstools
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 r400-tall-171690531700148
=====================================================================

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

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 13:05:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 13:05:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:05:42] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2024-05-29 13:05:42] [INFO ] Transformed 1837 places.
[2024-05-29 13:05:42] [INFO ] Transformed 3460 transitions.
[2024-05-29 13:05:42] [INFO ] Found NUPN structural information;
[2024-05-29 13:05:42] [INFO ] Parsed PT model containing 1837 places and 3460 transitions and 22362 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 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 2072 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:05:45] [INFO ] Computed 7 invariants in 45 ms
[2024-05-29 13:05:45] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-29 13:05:45] [INFO ] Invariant cache hit.
[2024-05-29 13:05:46] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1684 ms to find 0 implicit places.
Running 2817 sub problems to find dead transitions.
[2024-05-29 13:05:46] [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 1205/4024 variables, and 0 constraints, problems are : Problem set: 0 solved, 2817 unsolved in 30083 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 30037 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 79772ms problems are : Problem set: 0 solved, 2817 unsolved
Search for dead transitions found 0 dead transitions in 79855ms
Starting structural reductions in LTL mode, iteration 1 : 1206/1837 places, 2818/3460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83656 ms. Remains : 1206/1837 places, 2818/3460 transitions.
Support contains 50 out of 1206 places after structural reductions.
[2024-05-29 13:07:07] [INFO ] Flatten gal took : 279 ms
[2024-05-29 13:07:07] [INFO ] Flatten gal took : 161 ms
[2024-05-29 13:07:07] [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 (355 resets) in 1899 ms. (21 steps per ms) remains 26/28 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 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 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 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 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 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 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 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 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 237280 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :1 out of 26
Probabilistic random walk after 237280 steps, saw 50785 distinct states, run finished after 3004 ms. (steps per millisecond=78 ) properties seen :1
[2024-05-29 13:07:11] [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:07:13] [INFO ] Deduced a trap composed of 295 places in 648 ms of which 43 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:07:18] [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 5078 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 10427ms 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 6 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 2 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 0 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 614 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 615 ms. Remains : 91/1206 places, 1606/2818 transitions.
RANDOM walk for 40000 steps (1811 resets) in 1918 ms. (20 steps per ms) remains 13/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (142 resets) in 88 ms. (449 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 36 ms. (1081 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (161 resets) in 30 ms. (1290 steps per ms) remains 1/2 properties
BEST_FIRST walk for 25437 steps (130 resets) in 22 ms. (1105 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 509 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:07:24] [INFO ] Computed 7 invariants in 44 ms
[2024-05-29 13:07:24] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-29 13:07:24] [INFO ] Invariant cache hit.
[2024-05-29 13:07:26] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 1887 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-05-29 13:07:26] [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 30046 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: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 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 30045 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 80378ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 80411ms
Starting structural reductions in LTL mode, iteration 1 : 1178/1206 places, 2789/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82826 ms. Remains : 1178/1206 places, 2789/2818 transitions.
Stuttering acceptance computed with spot in 285 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 894 reset in 271 ms.
Product exploration explored 100000 steps with 890 reset in 214 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 112 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 173 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 (351 resets) in 178 ms. (223 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (57 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (59 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
[2024-05-29 13:08:48] [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 972 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 2340 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 3351ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 6 out of 1178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Graph (trivial) has 1171 edges and 1178 vertex of which 102 / 1178 are part of one of the 18 SCC in 2 ms
Free SCC test removed 84 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (complete) has 2026 edges and 1094 vertex of which 1088 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 819 transitions
Trivial Post-agglo rules discarded 819 transitions
Performed 819 trivial Post agglomeration. Transition count delta: 819
Iterating post reduction 0 with 825 rules applied. Total rules applied 827 place count 1088 transition count 1850
Reduce places removed 819 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 837 rules applied. Total rules applied 1664 place count 269 transition count 1832
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1670 place count 263 transition count 1832
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 1670 place count 263 transition count 1765
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 1804 place count 196 transition count 1765
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1805 place count 196 transition count 1764
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1891 place count 153 transition count 1721
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1903 place count 153 transition count 1709
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 1935 place count 121 transition count 765
Iterating global reduction 5 with 32 rules applied. Total rules applied 1967 place count 121 transition count 765
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1981 place count 121 transition count 751
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1999 place count 103 transition count 733
Iterating global reduction 6 with 18 rules applied. Total rules applied 2017 place count 103 transition count 733
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2029 place count 91 transition count 721
Iterating global reduction 6 with 12 rules applied. Total rules applied 2041 place count 91 transition count 721
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2047 place count 91 transition count 715
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 2059 place count 85 transition count 709
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2065 place count 82 transition count 717
Free-agglomeration rule applied 36 times.
Iterating global reduction 7 with 36 rules applied. Total rules applied 2101 place count 82 transition count 681
Reduce places removed 36 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 7 with 69 rules applied. Total rules applied 2170 place count 46 transition count 648
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 2176 place count 40 transition count 642
Iterating global reduction 8 with 6 rules applied. Total rules applied 2182 place count 40 transition count 642
Drop transitions (Redundant composition of simpler transitions.) removed 188 transitions
Redundant transition composition rules discarded 188 transitions
Iterating global reduction 8 with 188 rules applied. Total rules applied 2370 place count 40 transition count 454
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2372 place count 39 transition count 453
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2376 place count 37 transition count 471
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2378 place count 37 transition count 469
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2380 place count 35 transition count 469
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2384 place count 35 transition count 469
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2387 place count 35 transition count 466
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2389 place count 33 transition count 462
Iterating global reduction 9 with 2 rules applied. Total rules applied 2391 place count 33 transition count 462
Applied a total of 2391 rules in 317 ms. Remains 33 /1178 variables (removed 1145) and now considering 462/2789 (removed 2327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 33/1178 places, 462/2789 transitions.
RANDOM walk for 91 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/1 properties
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 28 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 87969 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 650 ms. Remains 1178 /1206 variables (removed 28) and now considering 2789/2818 (removed 29) transitions.
[2024-05-29 13:08:52] [INFO ] Invariant cache hit.
[2024-05-29 13:08:52] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-29 13:08:52] [INFO ] Invariant cache hit.
[2024-05-29 13:08:54] [INFO ] Implicit Places using invariants and state equation in 1321 ms returned []
Implicit Place search using SMT with State Equation took 1719 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-05-29 13:08:54] [INFO ] Invariant cache hit.

BK_STOP 1716988150119

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r400-tall-171690531700148"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;