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-171690532100343.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-07b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532100343
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K 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.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 18:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 18:41 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 3.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 StigmergyElection-PT-07b-ReachabilityFireability-2024-00
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-01
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-02
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-03
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-04
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-05
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-06
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-07
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-08
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-09
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-10
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-11
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-12
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-13
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-14
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717011365162

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-29 19:36:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 19:36:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:36:06] [INFO ] Load time of PNML (sax parser for PT used): 385 ms
[2024-05-29 19:36:06] [INFO ] Transformed 971 places.
[2024-05-29 19:36:06] [INFO ] Transformed 5542 transitions.
[2024-05-29 19:36:06] [INFO ] Found NUPN structural information;
[2024-05-29 19:36:06] [INFO ] Parsed PT model containing 971 places and 5542 transitions and 65199 arcs in 559 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (326 resets) in 3191 ms. (12 steps per ms) remains 14/16 properties
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (44 resets) in 1032 ms. (38 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 244 ms. (163 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 176 ms. (226 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (49 resets) in 355 ms. (112 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (47 resets) in 1165 ms. (34 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (47 resets) in 367 ms. (108 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (45 resets) in 127 ms. (312 steps per ms) remains 14/14 properties
[2024-05-29 19:36:09] [INFO ] Flatten gal took : 1521 ms
BEST_FIRST walk for 40004 steps (45 resets) in 395 ms. (101 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (46 resets) in 172 ms. (231 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (45 resets) in 95 ms. (416 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (46 resets) in 176 ms. (226 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (45 resets) in 93 ms. (425 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (44 resets) in 90 ms. (439 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (49 resets) in 388 ms. (102 steps per ms) remains 14/14 properties
// Phase 1: matrix 5542 rows 971 cols
[2024-05-29 19:36:10] [INFO ] Flatten gal took : 621 ms
[2024-05-29 19:36:10] [INFO ] Computed 8 invariants in 287 ms
[2024-05-29 19:36:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11811706444508607499.gal : 252 ms
[2024-05-29 19:36:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17269694207851115694.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11811706444508607499.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17269694207851115694.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem StigmergyElection-PT-07b-ReachabilityFireability-2024-00 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyElection-PT-07b-ReachabilityFireability-2024-09 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyElection-PT-07b-ReachabilityFireability-2024-10 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 884/971 variables, 8/95 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/971 variables, 884/979 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 0/979 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Loading property file /tmp/ReachabilityCardinality17269694207851115694.prop.
At refinement iteration 5 (OVERLAPS) 5542/6513 variables, 971/1950 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6513/6513 variables, and 1950 constraints, problems are : Problem set: 3 solved, 11 unsolved in 4555 ms.
Refiners :[Domain max(s): 971/971 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 971/971 constraints, PredecessorRefiner: 14/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem StigmergyElection-PT-07b-ReachabilityFireability-2024-01 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 889/971 variables, 8/90 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/971 variables, 889/979 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 0/979 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 5542/6513 variables, 971/1950 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 4 solved, 10 unsolved
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :10 after 20
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :20 after 37
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :37 after 217
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :217 after 3621
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :3621 after 11655
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :11655 after 28923
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :28923 after 30712
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :30712 after 125602
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6513/6513 variables, and 1950 constraints, problems are : Problem set: 4 solved, 10 unsolved in 5023 ms.
Refiners :[Domain max(s): 971/971 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 971/971 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10875ms problems are : Problem set: 4 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 5542/5542 transitions.
Graph (trivial) has 772 edges and 971 vertex of which 139 / 971 are part of one of the 19 SCC in 6 ms
Free SCC test removed 120 places
Drop transitions (Empty/Sink Transition effects.) removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 1948 edges and 851 vertex of which 841 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.32 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 446 rules applied. Total rules applied 448 place count 841 transition count 4939
Reduce places removed 441 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 452 rules applied. Total rules applied 900 place count 400 transition count 4928
Reduce places removed 5 places and 0 transitions.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Iterating post reduction 2 with 62 rules applied. Total rules applied 962 place count 395 transition count 4871
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 3 with 57 rules applied. Total rules applied 1019 place count 338 transition count 4871
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1019 place count 338 transition count 4826
Deduced a syphon composed of 45 places in 4 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1109 place count 293 transition count 4826
Discarding 73 places :
Symmetric choice reduction at 4 with 73 rule applications. Total rules 1182 place count 220 transition count 4753
Iterating global reduction 4 with 73 rules applied. Total rules applied 1255 place count 220 transition count 4753
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 13 rules applied. Total rules applied 1268 place count 220 transition count 4740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1269 place count 219 transition count 4740
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1269 place count 219 transition count 4738
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1273 place count 217 transition count 4738
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1280 place count 210 transition count 4731
Iterating global reduction 6 with 7 rules applied. Total rules applied 1287 place count 210 transition count 4731
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1290 place count 207 transition count 4725
Iterating global reduction 6 with 3 rules applied. Total rules applied 1293 place count 207 transition count 4725
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1325 place count 191 transition count 4709
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1330 place count 186 transition count 4704
Iterating global reduction 6 with 5 rules applied. Total rules applied 1335 place count 186 transition count 4704
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1345 place count 181 transition count 4712
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1353 place count 181 transition count 4704
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1356 place count 181 transition count 4701
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1359 place count 178 transition count 4701
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1363 place count 178 transition count 4701
Applied a total of 1363 rules in 979 ms. Remains 178 /971 variables (removed 793) and now considering 4701/5542 (removed 841) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 993 ms. Remains : 178/971 places, 4701/5542 transitions.
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :125602 after 1.28179e+07
RANDOM walk for 40000 steps (1518 resets) in 2437 ms. (16 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (200 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (211 resets) in 339 ms. (117 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (188 resets) in 232 ms. (171 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (196 resets) in 268 ms. (148 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (194 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (197 resets) in 255 ms. (156 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (198 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (190 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (196 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (195 resets) in 293 ms. (136 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 211144 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 10
Probabilistic random walk after 211144 steps, saw 50182 distinct states, run finished after 3008 ms. (steps per millisecond=70 ) properties seen :0
// Phase 1: matrix 4701 rows 178 cols
[2024-05-29 19:36:26] [INFO ] Computed 8 invariants in 61 ms
[2024-05-29 19:36:26] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 97/178 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4701/4879 variables, 178/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4879 variables, 23/209 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4879 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/4879 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4879/4879 variables, and 209 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2477 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 178/178 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 97/178 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4701/4879 variables, 178/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4879 variables, 23/209 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4879 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/4879 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4879/4879 variables, and 209 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3689 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 178/178 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 6782ms problems are : Problem set: 0 solved, 10 unsolved
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 8 properties in 882 ms.
Support contains 60 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 4701/4701 transitions.
Graph (trivial) has 45 edges and 178 vertex of which 4 / 178 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 952 edges and 176 vertex of which 174 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 174 transition count 4684
Reduce places removed 11 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 163 transition count 4680
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 34 place count 159 transition count 4680
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 34 place count 159 transition count 4675
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 44 place count 154 transition count 4675
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 152 transition count 4673
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 152 transition count 4673
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 150 transition count 4671
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 150 transition count 4669
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 56 place count 148 transition count 4666
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 148 transition count 4666
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 147 transition count 4672
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 68 place count 147 transition count 4664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 146 transition count 4670
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 78 place count 146 transition count 4662
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 91 place count 146 transition count 4649
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 115 place count 133 transition count 4638
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 121 place count 127 transition count 4632
Iterating global reduction 5 with 6 rules applied. Total rules applied 127 place count 127 transition count 4632
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 127 transition count 4632
Applied a total of 128 rules in 851 ms. Remains 127 /178 variables (removed 51) and now considering 4632/4701 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 851 ms. Remains : 127/178 places, 4632/4701 transitions.
RANDOM walk for 40000 steps (1525 resets) in 472 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (204 resets) in 293 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (177 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 292275 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 2
Probabilistic random walk after 292275 steps, saw 66659 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
// Phase 1: matrix 4632 rows 127 cols
[2024-05-29 19:36:38] [INFO ] Computed 8 invariants in 56 ms
[2024-05-29 19:36:38] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4632/4759 variables, 127/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4759 variables, 110/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4759 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/4759 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4759/4759 variables, and 245 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1669 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 19:36:41] [INFO ] Deduced a trap composed of 23 places in 1497 ms of which 13 ms to minimize.
[2024-05-29 19:36:42] [INFO ] Deduced a trap composed of 26 places in 1340 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/127 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4632/4759 variables, 127/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4759 variables, 110/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4759 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/4759 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4759/4759 variables, and 247 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4934 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 127/127 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 2/2 constraints]
After SMT, in 7001ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 60 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 4632/4632 transitions.
Applied a total of 0 rules in 119 ms. Remains 127 /127 variables (removed 0) and now considering 4632/4632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 127/127 places, 4632/4632 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 4632/4632 transitions.
Applied a total of 0 rules in 108 ms. Remains 127 /127 variables (removed 0) and now considering 4632/4632 (removed 0) transitions.
[2024-05-29 19:36:45] [INFO ] Invariant cache hit.
[2024-05-29 19:36:45] [INFO ] Implicit Places using invariants in 75 ms returned [126]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/127 places, 4632/4632 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 126 transition count 4629
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 123 transition count 4629
Performed 7 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 20 place count 116 transition count 4618
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 116 transition count 4615
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 116 transition count 4613
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 114 transition count 4613
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 114 transition count 4612
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 113 transition count 4611
Applied a total of 29 rules in 680 ms. Remains 113 /126 variables (removed 13) and now considering 4611/4632 (removed 21) transitions.
// Phase 1: matrix 4611 rows 113 cols
[2024-05-29 19:36:46] [INFO ] Computed 7 invariants in 26 ms
[2024-05-29 19:36:46] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-29 19:36:46] [INFO ] Invariant cache hit.
[2024-05-29 19:36:47] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-29 19:36:47] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 1351 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 113/127 places, 4611/4632 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2229 ms. Remains : 113/127 places, 4611/4632 transitions.
RANDOM walk for 40000 steps (1885 resets) in 453 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (234 resets) in 253 ms. (157 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (202 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 318819 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :1 out of 2
Probabilistic random walk after 318819 steps, saw 73224 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :1
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-29 19:36:50] [INFO ] Invariant cache hit.
[2024-05-29 19:36:50] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4611/4724 variables, 113/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4724 variables, 64/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4724 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4724 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4724/4724 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1246 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 60/113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4611/4724 variables, 113/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4724 variables, 64/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4724 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4724 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4724/4724 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1384 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 113/113 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2828ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 53 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 4611/4611 transitions.
Graph (trivial) has 14 edges and 113 vertex of which 2 / 113 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 6 rules applied. Total rules applied 7 place count 112 transition count 4603
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 106 transition count 4601
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 104 transition count 4600
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 103 transition count 4599
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 103 transition count 4599
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 101 transition count 4597
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 101 transition count 4596
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 100 transition count 4596
Applied a total of 26 rules in 391 ms. Remains 100 /113 variables (removed 13) and now considering 4596/4611 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 100/113 places, 4596/4611 transitions.
RANDOM walk for 40000 steps (2052 resets) in 630 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (243 resets) in 350 ms. (113 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 398600 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 1
Probabilistic random walk after 398600 steps, saw 83783 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
// Phase 1: matrix 4596 rows 100 cols
[2024-05-29 19:36:57] [INFO ] Computed 7 invariants in 39 ms
[2024-05-29 19:36:57] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4596/4696 variables, 100/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4696 variables, 64/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4696 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4696 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4696/4696 variables, and 171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:37:00] [INFO ] Deduced a trap composed of 22 places in 1355 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4596/4696 variables, 100/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4696 variables, 64/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4696 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4696 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4696/4696 variables, and 172 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2914 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints]
After SMT, in 5102ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 53 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 4596/4596 transitions.
Applied a total of 0 rules in 111 ms. Remains 100 /100 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 100/100 places, 4596/4596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 4596/4596 transitions.
Applied a total of 0 rules in 124 ms. Remains 100 /100 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
[2024-05-29 19:37:02] [INFO ] Invariant cache hit.
[2024-05-29 19:37:02] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-29 19:37:02] [INFO ] Invariant cache hit.
[2024-05-29 19:37:03] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-29 19:37:04] [INFO ] Implicit Places using invariants and state equation in 1378 ms returned []
Implicit Place search using SMT with State Equation took 1473 ms to find 0 implicit places.
[2024-05-29 19:37:04] [INFO ] Redundant transitions in 369 ms returned []
Running 4583 sub problems to find dead transitions.
[2024-05-29 19:37:04] [INFO ] Invariant cache hit.
[2024-05-29 19:37:04] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4583 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 94/4696 variables, and 1 constraints, problems are : Problem set: 0 solved, 4583 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/7 constraints, State Equation: 0/100 constraints, ReadFeed: 0/64 constraints, PredecessorRefiner: 4583/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 94/4696 variables, and 1 constraints, problems are : Problem set: 0 solved, 4583 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 1/7 constraints, State Equation: 0/100 constraints, ReadFeed: 0/64 constraints, PredecessorRefiner: 4477/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 126306ms problems are : Problem set: 0 solved, 4583 unsolved
Search for dead transitions found 0 dead transitions in 126360ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128355 ms. Remains : 100/100 places, 4596/4596 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 92 ms. Remains 100 /100 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 19:39:11] [INFO ] Invariant cache hit.
[2024-05-29 19:39:11] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:39:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-29 19:39:12] [INFO ] After 1056ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :1
[2024-05-29 19:39:12] [INFO ] After 1102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1343 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 19:39:12] [INFO ] Flatten gal took : 395 ms
[2024-05-29 19:39:12] [INFO ] Applying decomposition
[2024-05-29 19:39:13] [INFO ] Flatten gal took : 340 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2134756725600670897.txt' '-o' '/tmp/graph2134756725600670897.bin' '-w' '/tmp/graph2134756725600670897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2134756725600670897.bin' '-l' '-1' '-v' '-w' '/tmp/graph2134756725600670897.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:39:14] [INFO ] Decomposing Gal with order
[2024-05-29 19:39:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:39:15] [INFO ] Removed a total of 31652 redundant transitions.
[2024-05-29 19:39:15] [INFO ] Flatten gal took : 846 ms
[2024-05-29 19:39:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 324 ms.
[2024-05-29 19:39:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9068979242629223511.gal : 51 ms
[2024-05-29 19:39:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6971294902856080610.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9068979242629223511.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6971294902856080610.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6971294902856080610.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 9.07944e+09
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9.07944e+09 after 8.38377e+13
ITS-tools command line returned an error code 137
[2024-05-29 19:47:33] [INFO ] Flatten gal took : 410 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15769319049849349385
[2024-05-29 19:47:33] [INFO ] Too many transitions (4596) to apply POR reductions. Disabling POR matrices.
[2024-05-29 19:47:33] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15769319049849349385
Running compilation step : cd /tmp/ltsmin15769319049849349385;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
[2024-05-29 19:47:34] [INFO ] Applying decomposition
[2024-05-29 19:47:34] [INFO ] Flatten gal took : 389 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16177289752420488277.txt' '-o' '/tmp/graph16177289752420488277.bin' '-w' '/tmp/graph16177289752420488277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16177289752420488277.bin' '-l' '-1' '-v' '-w' '/tmp/graph16177289752420488277.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:47:35] [INFO ] Decomposing Gal with order
[2024-05-29 19:47:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:47:36] [INFO ] Removed a total of 32977 redundant transitions.
[2024-05-29 19:47:36] [INFO ] Flatten gal took : 851 ms
[2024-05-29 19:47:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 198 ms.
[2024-05-29 19:47:37] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10666651002930652705.gal : 19 ms
[2024-05-29 19:47:37] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9032422114100174497.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10666651002930652705.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9032422114100174497.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability9032422114100174497.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 504
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :504 after 798
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :798 after 10920
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10920 after 101200
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.0504e+07,11.5342,306472,2048,327,143350,6185,4399,3.26699e+06,207,75405,0
Total reachable state count : 90504000

Verifying 1 reachability properties.
Reachability property StigmergyElection-PT-07b-ReachabilityFireability-2024-03 is true.
FORMULA StigmergyElection-PT-07b-ReachabilityFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-07b-ReachabilityFireability-2024-03,256,11.6862,306472,56,47,143350,6185,4965,3.26699e+06,259,75405,10257
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 702525 ms.

BK_STOP 1717012068999

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-07b"
export BK_EXAMINATION="ReachabilityFireability"
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-07b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532100343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-07b.tgz
mv StigmergyElection-PT-07b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;