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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 18:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 11 18:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 11 18:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 203K 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-04b-ReachabilityFireability-2024-00
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-01
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-02
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-03
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-04
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-05
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-06
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-07
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-08
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-09
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-10
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-11
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-12
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-13
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-14
FORMULA_NAME StigmergyElection-PT-04b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717007483183

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-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-29 18:31:24] [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 18:31:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:31:24] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-29 18:31:24] [INFO ] Transformed 563 places.
[2024-05-29 18:31:24] [INFO ] Transformed 780 transitions.
[2024-05-29 18:31:24] [INFO ] Found NUPN structural information;
[2024-05-29 18:31:24] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 211 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 (547 resets) in 1947 ms. (20 steps per ms) remains 12/16 properties
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 18:31:25] [INFO ] Flatten gal took : 212 ms
BEST_FIRST walk for 40003 steps (109 resets) in 259 ms. (153 steps per ms) remains 12/12 properties
[2024-05-29 18:31:25] [INFO ] Flatten gal took : 57 ms
BEST_FIRST walk for 40003 steps (108 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
[2024-05-29 18:31:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4076756102924166732.gal : 56 ms
BEST_FIRST walk for 40003 steps (114 resets) in 226 ms. (176 steps per ms) remains 12/12 properties
[2024-05-29 18:31:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4474091531441442762.prop : 3 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/ReachabilityCardinality4076756102924166732.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4474091531441442762.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (110 resets) in 135 ms. (294 steps per ms) remains 12/12 properties

its-reach command run as :

BEST_FIRST walk for 40004 steps (106 resets) in 554 ms. (72 steps per ms) remains 9/12 properties
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (122 resets) in 188 ms. (211 steps per ms) remains 8/9 properties
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Loading property file /tmp/ReachabilityCardinality4474091531441442762.prop.
BEST_FIRST walk for 40003 steps (110 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (99 resets) in 233 ms. (170 steps per ms) remains 7/8 properties
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (111 resets) in 1052 ms. (37 steps per ms) remains 7/7 properties
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :7 after 12
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :16 after 17
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :17 after 56
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :56 after 74
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :74 after 130
// Phase 1: matrix 780 rows 563 cols
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :130 after 3971
[2024-05-29 18:31:26] [INFO ] Computed 5 invariants in 17 ms
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :3971 after 240503
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :240503 after 2.41368e+06
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 159/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem StigmergyElection-PT-04b-ReachabilityFireability-2024-12 is UNSAT
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 404/563 variables, 5/164 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 404/568 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/568 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 780/1343 variables, 563/1131 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1343 variables, 0/1131 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1343 variables, 0/1131 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1343/1343 variables, and 1131 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1153 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem StigmergyElection-PT-04b-ReachabilityFireability-2024-15 is UNSAT
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 446/563 variables, 5/122 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/563 variables, 446/568 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-29 18:31:28] [INFO ] Deduced a trap composed of 194 places in 187 ms of which 27 ms to minimize.
[2024-05-29 18:31:28] [INFO ] Deduced a trap composed of 192 places in 186 ms of which 3 ms to minimize.
Problem StigmergyElection-PT-04b-ReachabilityFireability-2024-08 is UNSAT
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 18:31:28] [INFO ] Deduced a trap composed of 191 places in 160 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 3/571 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-29 18:31:28] [INFO ] Deduced a trap composed of 191 places in 143 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 1/572 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/572 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 780/1343 variables, 563/1135 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Reachability property StigmergyElection-PT-04b-ReachabilityFireability-2024-14 is true.
At refinement iteration 8 (INCLUDED_ONLY) 0/1343 variables, 4/1139 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-29 18:31:29] [INFO ] Deduced a trap composed of 109 places in 184 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1343 variables, 1/1140 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1343 variables, 0/1140 constraints. Problems are: Problem set: 3 solved, 4 unsolved
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :2.41368e+06 after 4.16099e+07
At refinement iteration 11 (OVERLAPS) 0/1343 variables, 0/1140 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1343/1343 variables, and 1140 constraints, problems are : Problem set: 3 solved, 4 unsolved in 2944 ms.
Refiners :[Domain max(s): 563/563 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 563/563 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 4330ms problems are : Problem set: 3 solved, 4 unsolved
Parikh walk visited 0 properties in 977 ms.
Support contains 64 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 780/780 transitions.
Graph (trivial) has 436 edges and 563 vertex of which 62 / 563 are part of one of the 10 SCC in 3 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Graph (complete) has 879 edges and 511 vertex of which 504 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 254 rules applied. Total rules applied 256 place count 504 transition count 457
Reduce places removed 252 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 260 rules applied. Total rules applied 516 place count 252 transition count 449
Reduce places removed 4 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 2 with 38 rules applied. Total rules applied 554 place count 248 transition count 415
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 588 place count 214 transition count 415
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 588 place count 214 transition count 398
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 622 place count 197 transition count 398
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 656 place count 163 transition count 364
Iterating global reduction 4 with 34 rules applied. Total rules applied 690 place count 163 transition count 364
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 693 place count 163 transition count 361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 693 place count 163 transition count 360
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 695 place count 162 transition count 360
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 697 place count 160 transition count 351
Iterating global reduction 5 with 2 rules applied. Total rules applied 699 place count 160 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 700 place count 160 transition count 350
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 730 place count 145 transition count 335
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 732 place count 143 transition count 333
Iterating global reduction 6 with 2 rules applied. Total rules applied 734 place count 143 transition count 333
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 736 place count 142 transition count 333
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 751 place count 142 transition count 318
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 766 place count 127 transition count 318
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 770 place count 127 transition count 318
Applied a total of 770 rules in 144 ms. Remains 127 /563 variables (removed 436) and now considering 318/780 (removed 462) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 127/563 places, 318/780 transitions.
RANDOM walk for 40000 steps (1946 resets) in 242 ms. (164 steps per ms) remains 1/4 properties
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (348 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
// Phase 1: matrix 318 rows 127 cols
[2024-05-29 18:31:31] [INFO ] Computed 3 invariants in 6 ms
[2024-05-29 18:31:31] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 274/348 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 65/413 variables, 31/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 8/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/440 variables, 18/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/445 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/445 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 127/127 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 18:31:32] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:31:32] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 274/348 variables, 74/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 65/413 variables, 31/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/440 variables, 18/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/445 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/445 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/445 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 145 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 127/127 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 426ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 318/318 transitions.
Graph (trivial) has 109 edges and 127 vertex of which 12 / 127 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 377 edges and 119 vertex of which 118 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 118 transition count 258
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 74 transition count 254
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 98 place count 73 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 71 transition count 252
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 100 place count 71 transition count 250
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 104 place count 69 transition count 250
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 119 place count 54 transition count 131
Iterating global reduction 4 with 15 rules applied. Total rules applied 134 place count 54 transition count 131
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 140 place count 54 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 140 place count 54 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 53 transition count 124
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 144 place count 51 transition count 122
Iterating global reduction 5 with 2 rules applied. Total rules applied 146 place count 51 transition count 122
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 158 place count 45 transition count 116
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 162 place count 45 transition count 112
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 166 place count 41 transition count 97
Iterating global reduction 6 with 4 rules applied. Total rules applied 170 place count 41 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 171 place count 41 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 173 place count 40 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 177 place count 40 transition count 94
Free-agglomeration rule applied 19 times with reduction of 8 identical transitions.
Iterating global reduction 7 with 19 rules applied. Total rules applied 196 place count 40 transition count 67
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 224 place count 21 transition count 58
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 228 place count 17 transition count 54
Iterating global reduction 8 with 4 rules applied. Total rules applied 232 place count 17 transition count 54
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 239 place count 17 transition count 47
Applied a total of 239 rules in 46 ms. Remains 17 /127 variables (removed 110) and now considering 47/318 (removed 271) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 17/127 places, 47/318 transitions.
RANDOM walk for 488 steps (0 resets) in 15 ms. (30 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-04b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 7938 ms.

BK_STOP 1717007492355

--------------------
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-04b"
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-04b, 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-171690532000295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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