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.r400-tall-171690532200372.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 StigmergyElection-PT-09b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532200372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 38M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 18:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 11 18:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 11 18:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 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 37M 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 StigmergyElection-PT-09b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-09b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717014880396

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 20:34:41] [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 20:34:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:34:43] [INFO ] Load time of PNML (sax parser for PT used): 1609 ms
[2024-05-29 20:34:43] [INFO ] Transformed 1243 places.
[2024-05-29 20:34:43] [INFO ] Transformed 41210 transitions.
[2024-05-29 20:34:43] [INFO ] Found NUPN structural information;
[2024-05-29 20:34:43] [INFO ] Parsed PT model containing 1243 places and 41210 transitions and 720585 arcs in 2032 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyElection-PT-09b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 41210/41210 transitions.
Discarding 156 places :
Symmetric choice reduction at 0 with 156 rule applications. Total rules 156 place count 1087 transition count 41054
Iterating global reduction 0 with 156 rules applied. Total rules applied 312 place count 1087 transition count 41054
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 395 place count 1004 transition count 40971
Iterating global reduction 0 with 83 rules applied. Total rules applied 478 place count 1004 transition count 40971
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 496 place count 986 transition count 40953
Iterating global reduction 0 with 18 rules applied. Total rules applied 514 place count 986 transition count 40953
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 523 place count 977 transition count 40944
Iterating global reduction 0 with 9 rules applied. Total rules applied 532 place count 977 transition count 40944
Applied a total of 532 rules in 1230 ms. Remains 977 /1243 variables (removed 266) and now considering 40944/41210 (removed 266) transitions.
// Phase 1: matrix 40944 rows 977 cols
[2024-05-29 20:34:46] [INFO ] Computed 10 invariants in 826 ms
[2024-05-29 20:34:46] [INFO ] Implicit Places using invariants in 1279 ms returned []
Implicit Place search using SMT only with invariants took 1314 ms to find 0 implicit places.
Running 40943 sub problems to find dead transitions.
[2024-05-29 20:34:47] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 976/41921 variables, and 0 constraints, problems are : Problem set: 0 solved, 40943 unsolved in 30611 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/977 constraints, PredecessorRefiner: 40943/1523 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 976/41921 variables, and 0 constraints, problems are : Problem set: 0 solved, 40943 unsolved in 30451 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/977 constraints, PredecessorRefiner: 39420/1523 constraints, Known Traps: 0/0 constraints]
After SMT, in 781493ms problems are : Problem set: 0 solved, 40943 unsolved
Search for dead transitions found 0 dead transitions in 782052ms
Starting structural reductions in LTL mode, iteration 1 : 977/1243 places, 40944/41210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 784814 ms. Remains : 977/1243 places, 40944/41210 transitions.
Support contains 63 out of 977 places after structural reductions.
[2024-05-29 20:47:53] [INFO ] Flatten gal took : 4153 ms
[2024-05-29 20:47:57] [INFO ] Flatten gal took : 3809 ms
[2024-05-29 20:48:05] [INFO ] Input system was already deterministic with 40944 transitions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (258 resets) in 2913 ms. (13 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 192 ms. (20 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 207 ms. (19 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
Interrupted probabilistic random walk after 20572 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :0 out of 33
Probabilistic random walk after 20572 steps, saw 8308 distinct states, run finished after 3004 ms. (steps per millisecond=6 ) properties seen :0
[2024-05-29 20:48:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 900/963 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 31 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 963/41921 variables, and 9 constraints, problems are : Problem set: 2 solved, 31 unsolved in 5330 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, State Equation: 0/977 constraints, PredecessorRefiner: 33/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 900/963 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 31 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 963/41921 variables, and 9 constraints, problems are : Problem set: 2 solved, 31 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, State Equation: 0/977 constraints, PredecessorRefiner: 30/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 11357ms problems are : Problem set: 2 solved, 31 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 63 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 912 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 11 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Graph (complete) has 2653 edges and 851 vertex of which 842 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.212 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 525 transitions
Trivial Post-agglo rules discarded 525 transitions
Performed 525 trivial Post agglomeration. Transition count delta: 525
Iterating post reduction 0 with 534 rules applied. Total rules applied 536 place count 842 transition count 40239
Reduce places removed 525 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 543 rules applied. Total rules applied 1079 place count 317 transition count 40221
Reduce places removed 9 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 33 rules applied. Total rules applied 1112 place count 308 transition count 40197
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1136 place count 284 transition count 40197
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 1136 place count 284 transition count 40155
Deduced a syphon composed of 42 places in 21 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1220 place count 242 transition count 40155
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 16 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1312 place count 196 transition count 40109
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1330 place count 196 transition count 40091
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1349 place count 177 transition count 40055
Iterating global reduction 5 with 19 rules applied. Total rules applied 1368 place count 177 transition count 40055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1369 place count 177 transition count 40054
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1378 place count 168 transition count 40045
Iterating global reduction 6 with 9 rules applied. Total rules applied 1387 place count 168 transition count 40045
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 15 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1405 place count 159 transition count 40036
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1411 place count 156 transition count 40044
Free-agglomeration rule applied 31 times.
Iterating global reduction 6 with 31 rules applied. Total rules applied 1442 place count 156 transition count 40013
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 6 with 31 rules applied. Total rules applied 1473 place count 125 transition count 40013
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1482 place count 116 transition count 40004
Iterating global reduction 7 with 9 rules applied. Total rules applied 1491 place count 116 transition count 40004
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1499 place count 116 transition count 40004
Applied a total of 1499 rules in 8987 ms. Remains 116 /977 variables (removed 861) and now considering 40004/40944 (removed 940) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8992 ms. Remains : 116/977 places, 40004/40944 transitions.
RANDOM walk for 40000 steps (1664 resets) in 5180 ms. (7 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (13 resets) in 76 ms. (51 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (13 resets) in 50 ms. (78 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (13 resets) in 62 ms. (63 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (13 resets) in 62 ms. (63 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (14 resets) in 55 ms. (71 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (14 resets) in 53 ms. (74 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (14 resets) in 54 ms. (72 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (13 resets) in 45 ms. (87 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (14 resets) in 45 ms. (87 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (13 resets) in 62 ms. (63 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (15 resets) in 50 ms. (78 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (14 resets) in 57 ms. (69 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (14 resets) in 63 ms. (62 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 61 ms. (64 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (15 resets) in 60 ms. (65 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 38 ms. (102 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (13 resets) in 42 ms. (93 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (13 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 43 ms. (91 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (14 resets) in 46 ms. (85 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (16 resets) in 45 ms. (87 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 43 ms. (90 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (13 resets) in 47 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 45 ms. (87 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 43 ms. (91 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (14 resets) in 48 ms. (81 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (13 resets) in 47 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (14 resets) in 47 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (14 resets) in 46 ms. (85 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 43376 steps, run timeout after 6001 ms. (steps per millisecond=7 ) properties seen :0 out of 30
Probabilistic random walk after 43376 steps, saw 13350 distinct states, run finished after 6001 ms. (steps per millisecond=7 ) properties seen :0
[2024-05-29 20:48:38] [INFO ] Flow matrix only has 40002 transitions (discarded 2 similar events)
// Phase 1: matrix 40002 rows 116 cols
[2024-05-29 20:48:39] [INFO ] Computed 10 invariants in 297 ms
[2024-05-29 20:49:00] [INFO ] State equation strengthened by 508 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 61/115 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 1/116 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 40002/40118 variables, 116/126 constraints. Problems are: Problem set: 0 solved, 30 unsolved
SMT process timed out in 67608ms, After SMT, problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 16 different solutions.
Parikh walk visited 19 properties in 1962 ms.
Support contains 52 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 40004/40004 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 40002
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 114 transition count 40002
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 114 transition count 40001
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 113 transition count 40001
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 21 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 110 transition count 39998
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 110 transition count 39997
Free-agglomeration rule applied 33 times.
Iterating global reduction 3 with 33 rules applied. Total rules applied 46 place count 110 transition count 39964
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 79 place count 77 transition count 39964
Applied a total of 79 rules in 5034 ms. Remains 77 /116 variables (removed 39) and now considering 39964/40004 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5034 ms. Remains : 77/116 places, 39964/40004 transitions.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA StigmergyElection-PT-09b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-09b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 135 stabilizing places and 144 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(((!p0 U (p1||G(!p0)))||(X(p0)&&G(p2)))))'
Support contains 29 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 198 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
// Phase 1: matrix 40944 rows 977 cols
[2024-05-29 20:49:55] [INFO ] Computed 10 invariants in 607 ms
[2024-05-29 20:50:01] [INFO ] Implicit Places using invariants in 6860 ms returned []
Implicit Place search using SMT only with invariants took 6862 ms to find 0 implicit places.
Running 40943 sub problems to find dead transitions.
[2024-05-29 20:50:02] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 976/41921 variables, and 0 constraints, problems are : Problem set: 0 solved, 40943 unsolved in 30418 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/977 constraints, PredecessorRefiner: 40943/1523 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 976/41921 variables, and 0 constraints, problems are : Problem set: 0 solved, 40943 unsolved in 30433 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/977 constraints, PredecessorRefiner: 39420/1523 constraints, Known Traps: 0/0 constraints]
After SMT, in 766829ms problems are : Problem set: 0 solved, 40943 unsolved
Search for dead transitions found 0 dead transitions in 767282ms
Finished structural reductions in LTL mode , in 1 iterations and 774501 ms. Remains : 977/977 places, 40944/40944 transitions.
Stuttering acceptance computed with spot in 328 ms :[(AND (NOT p2) (NOT p1) p0), true, (AND p2 (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p2 (NOT p1) p0), false]
Running random walk in product with property : StigmergyElection-PT-09b-LTLFireability-00
Product exploration explored 100000 steps with 652 reset in 2163 ms.
Product exploration explored 100000 steps with 644 reset in 2037 ms.
Computed a total of 135 stabilizing places and 144 stable transitions
Computed a total of 135 stabilizing places and 144 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1 (NOT p0))), (X (AND p2 (NOT p0))), (X (OR (AND p2 p1) (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1 (NOT p0)))), (X (X (AND p2 (NOT p0)))), (X (X (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 135 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND p0 (NOT p2) (NOT p1)), true, (AND (NOT p0) p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p0 p2 (NOT p1)), false]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (258 resets) in 1466 ms. (27 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (30 resets) in 400 ms. (99 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (31 resets) in 2448 ms. (16 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (29 resets) in 963 ms. (41 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (31 resets) in 647 ms. (61 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (30 resets) in 355 ms. (112 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (31 resets) in 342 ms. (116 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (31 resets) in 361 ms. (110 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (30 resets) in 356 ms. (112 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (31 resets) in 227 ms. (175 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (32 resets) in 237 ms. (168 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 43357 steps, run timeout after 6001 ms. (steps per millisecond=7 ) properties seen :0 out of 10
Probabilistic random walk after 43357 steps, saw 12558 distinct states, run finished after 6003 ms. (steps per millisecond=7 ) properties seen :0
[2024-05-29 21:03:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem apf4 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 934/963 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/963 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/977 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/977 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 8 unsolved
SMT process timed out in 5455ms, After SMT, problems are : Problem set: 2 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 974 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 3 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Graph (complete) has 2653 edges and 851 vertex of which 842 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.68 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 574 transitions
Trivial Post-agglo rules discarded 574 transitions
Performed 574 trivial Post agglomeration. Transition count delta: 574
Iterating post reduction 0 with 583 rules applied. Total rules applied 585 place count 842 transition count 40190
Reduce places removed 574 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 592 rules applied. Total rules applied 1177 place count 268 transition count 40172
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1186 place count 259 transition count 40172
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1186 place count 259 transition count 40126
Deduced a syphon composed of 46 places in 19 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1278 place count 213 transition count 40126
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 1279 place count 213 transition count 40125
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 12 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1371 place count 167 transition count 40079
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1389 place count 167 transition count 40061
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1413 place count 143 transition count 22934
Iterating global reduction 5 with 24 rules applied. Total rules applied 1437 place count 143 transition count 22934
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1443 place count 143 transition count 22928
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1452 place count 134 transition count 22919
Iterating global reduction 6 with 9 rules applied. Total rules applied 1461 place count 134 transition count 22919
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1479 place count 125 transition count 22910
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1485 place count 122 transition count 22918
Free-agglomeration rule applied 59 times.
Iterating global reduction 6 with 59 rules applied. Total rules applied 1544 place count 122 transition count 22859
Reduce places removed 59 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 1604 place count 63 transition count 22858
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1613 place count 54 transition count 22849
Iterating global reduction 7 with 9 rules applied. Total rules applied 1622 place count 54 transition count 22849
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1637 place count 54 transition count 22834
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1642 place count 54 transition count 22834
Applied a total of 1642 rules in 10135 ms. Remains 54 /977 variables (removed 923) and now considering 22834/40944 (removed 18110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10136 ms. Remains : 54/977 places, 22834/40944 transitions.
RANDOM walk for 40000 steps (2158 resets) in 7267 ms. (5 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 913 ms. (43 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 936 ms. (42 steps per ms) remains 1/4 properties
BEST_FIRST walk for 1050 steps (1 resets) in 42 ms. (24 steps per ms) remains 0/1 properties
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (OR p2 p1 (NOT p0))), (X (AND p2 (NOT p0))), (X (OR (AND p2 p1) (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (OR p2 p1 (NOT p0)))), (X (X (AND p2 (NOT p0)))), (X (X (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p2 p1)), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p2) (OR p2 (NOT p1))))), (F (NOT (AND (NOT p0) p2))), (F (NOT p2)), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 26 factoid took 311 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 221 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
Support contains 29 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 175 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
[2024-05-29 21:03:22] [INFO ] Invariant cache hit.
[2024-05-29 21:03:28] [INFO ] Implicit Places using invariants in 6276 ms returned []
Implicit Place search using SMT only with invariants took 6282 ms to find 0 implicit places.
Running 40943 sub problems to find dead transitions.
[2024-05-29 21:03:29] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 976/41921 variables, and 0 constraints, problems are : Problem set: 0 solved, 40943 unsolved in 30478 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/977 constraints, PredecessorRefiner: 40943/1523 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40943 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 976/41921 variables, and 0 constraints, problems are : Problem set: 0 solved, 40943 unsolved in 30594 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/977 constraints, PredecessorRefiner: 39420/1523 constraints, Known Traps: 0/0 constraints]
After SMT, in 847181ms problems are : Problem set: 0 solved, 40943 unsolved
Search for dead transitions found 0 dead transitions in 847642ms
Finished structural reductions in LTL mode , in 1 iterations and 854220 ms. Remains : 977/977 places, 40944/40944 transitions.
Computed a total of 135 stabilizing places and 144 stable transitions
Computed a total of 135 stabilizing places and 144 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND (NOT p0) p2) (AND p2 p1))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 153 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
RANDOM walk for 40000 steps (259 resets) in 1444 ms. (27 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (32 resets) in 430 ms. (92 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (31 resets) in 496 ms. (80 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (30 resets) in 486 ms. (82 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (30 resets) in 406 ms. (98 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (32 resets) in 410 ms. (97 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (31 resets) in 412 ms. (96 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (29 resets) in 263 ms. (151 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 22092 steps, run timeout after 3014 ms. (steps per millisecond=7 ) properties seen :0 out of 7
Probabilistic random walk after 22092 steps, saw 8578 distinct states, run finished after 3014 ms. (steps per millisecond=7 ) properties seen :0
[2024-05-29 21:17:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 934/963 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/963 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 14/977 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/977 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 5316ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 974 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 4 ms
Free SCC test removed 126 places
Drop transitions (Empty/Sink Transition effects.) removed 171 transitions
Reduce isomorphic transitions removed 171 transitions.
Graph (complete) has 2653 edges and 851 vertex of which 842 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.68 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 574 transitions
Trivial Post-agglo rules discarded 574 transitions
Performed 574 trivial Post agglomeration. Transition count delta: 574
Iterating post reduction 0 with 583 rules applied. Total rules applied 585 place count 842 transition count 40190
Reduce places removed 574 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 592 rules applied. Total rules applied 1177 place count 268 transition count 40172
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 1186 place count 259 transition count 40172
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1186 place count 259 transition count 40126
Deduced a syphon composed of 46 places in 21 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1278 place count 213 transition count 40126
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 1279 place count 213 transition count 40125
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 14 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1371 place count 167 transition count 40079
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1389 place count 167 transition count 40061
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 1413 place count 143 transition count 22934
Iterating global reduction 5 with 24 rules applied. Total rules applied 1437 place count 143 transition count 22934
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1443 place count 143 transition count 22928
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1452 place count 134 transition count 22919
Iterating global reduction 6 with 9 rules applied. Total rules applied 1461 place count 134 transition count 22919
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1479 place count 125 transition count 22910
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1485 place count 122 transition count 22918
Free-agglomeration rule applied 59 times.
Iterating global reduction 6 with 59 rules applied. Total rules applied 1544 place count 122 transition count 22859
Reduce places removed 59 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 1604 place count 63 transition count 22858
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1613 place count 54 transition count 22849
Iterating global reduction 7 with 9 rules applied. Total rules applied 1622 place count 54 transition count 22849
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1637 place count 54 transition count 22834
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1642 place count 54 transition count 22834
Applied a total of 1642 rules in 10614 ms. Remains 54 /977 variables (removed 923) and now considering 22834/40944 (removed 18110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10616 ms. Remains : 54/977 places, 22834/40944 transitions.
RANDOM walk for 40000 steps (2150 resets) in 8197 ms. (4 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 927 ms. (43 steps per ms) remains 4/7 properties
BEST_FIRST walk for 4468 steps (13 resets) in 127 ms. (34 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND (NOT p0) p2) (AND p2 p1))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 424 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 316 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 277 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 651 reset in 2255 ms.
Product exploration explored 100000 steps with 649 reset in 1836 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 210 ms :[(AND p0 (NOT p1) (NOT p2)), true, (AND (NOT p0) p2), (NOT p2), (AND p0 (NOT p1)), false]
Support contains 29 out of 977 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Graph (trivial) has 974 edges and 977 vertex of which 153 / 977 are part of one of the 27 SCC in 1 ms
Free SCC test removed 126 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 556 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 556 rules applied. Total rules applied 557 place count 851 transition count 40800
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 566 place count 851 transition count 40791
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 566 place count 851 transition count 40800
Deduced a syphon composed of 574 places in 23 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 584 place count 851 transition count 40800
Discarding 472 places :
Symmetric choice reduction at 2 with 472 rule applications. Total rules 1056 place count 379 transition count 40328
Deduced a syphon composed of 110 places in 25 ms
Iterating global reduction 2 with 472 rules applied. Total rules applied 1528 place count 379 transition count 40328
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 183 places in 14 ms
Iterating global reduction 2 with 73 rules applied. Total rules applied 1601 place count 379 transition count 40328
Discarding 88 places :
Symmetric choice reduction at 2 with 88 rule applications. Total rules 1689 place count 291 transition count 23128
Deduced a syphon composed of 119 places in 8 ms
Iterating global reduction 2 with 88 rules applied. Total rules applied 1777 place count 291 transition count 23128
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1783 place count 291 transition count 23122
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1807 place count 267 transition count 23089
Deduced a syphon composed of 104 places in 9 ms
Iterating global reduction 3 with 24 rules applied. Total rules applied 1831 place count 267 transition count 23089
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1840 place count 258 transition count 23080
Deduced a syphon composed of 104 places in 8 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 1849 place count 258 transition count 23080
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 116 places in 9 ms
Iterating global reduction 3 with 12 rules applied. Total rules applied 1861 place count 258 transition count 23136
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1882 place count 237 transition count 23094
Deduced a syphon composed of 95 places in 9 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 1903 place count 237 transition count 23094
Deduced a syphon composed of 95 places in 9 ms
Applied a total of 1903 rules in 15096 ms. Remains 237 /977 variables (removed 740) and now considering 23094/40944 (removed 17850) transitions.
Running 23086 sub problems to find dead transitions.
[2024-05-29 21:18:21] [INFO ] Flow matrix only has 23084 transitions (discarded 10 similar events)
// Phase 1: matrix 23084 rows 237 cols
[2024-05-29 21:18:21] [INFO ] Computed 2 invariants in 314 ms
[2024-05-29 21:18:36] [INFO ] State equation strengthened by 520 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/23321 variables, and 0 constraints, problems are : Problem set: 0 solved, 23086 unsolved in 30252 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/237 constraints, ReadFeed: 0/520 constraints, PredecessorRefiner: 23086/224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23086 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/23321 variables, and 0 constraints, problems are : Problem set: 0 solved, 23086 unsolved in 30251 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/237 constraints, ReadFeed: 0/520 constraints, PredecessorRefiner: 22862/224 constraints, Known Traps: 0/0 constraints]
After SMT, in 497646ms problems are : Problem set: 0 solved, 23086 unsolved
Search for dead transitions found 0 dead transitions in 497858ms
Starting structural reductions in SI_LTL mode, iteration 1 : 237/977 places, 23094/40944 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 513003 ms. Remains : 237/977 places, 23094/40944 transitions.
Built C files in :
/tmp/ltsmin10239878317367686061
[2024-05-29 21:26:39] [INFO ] Built C files in 689ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10239878317367686061
Running compilation step : cd /tmp/ltsmin10239878317367686061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10239878317367686061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10239878317367686061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 29 out of 977 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 977/977 places, 40944/40944 transitions.
Applied a total of 0 rules in 191 ms. Remains 977 /977 variables (removed 0) and now considering 40944/40944 (removed 0) transitions.
// Phase 1: matrix 40944 rows 977 cols
[2024-05-29 21:26:43] [INFO ] Computed 10 invariants in 692 ms
[2024-05-29 21:26:50] [INFO ] Implicit Places using invariants in 7284 ms returned []
Implicit Place search using SMT only with invariants took 7290 ms to find 0 implicit places.
Running 40943 sub problems to find dead transitions.
[2024-05-29 21:26:50] [INFO ] Invariant cache hit.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="StigmergyElection-PT-09b"
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 StigmergyElection-PT-09b, 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-171690532200372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-09b.tgz
mv StigmergyElection-PT-09b 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 ;