fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r453-smll-167912645700663
Last Updated
May 14, 2023

About the Execution of ITS-Tools for StigmergyElection-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3115.504 122254.00 281786.00 746.90 TTFTTFTFTTFTTFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r453-smll-167912645700663.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is StigmergyElection-PT-08b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645700663
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 16:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 16:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 16:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 12M Mar 5 18:23 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-08b-ReachabilityFireability-00
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-01
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-02
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-03
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-04
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-05
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-06
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-07
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-08
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-09
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-10
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-11
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-12
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-13
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-14
FORMULA_NAME StigmergyElection-PT-08b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679430614904

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-08b
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-21 20:30:17] [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]
[2023-03-21 20:30:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 20:30:19] [INFO ] Load time of PNML (sax parser for PT used): 1135 ms
[2023-03-21 20:30:19] [INFO ] Transformed 1107 places.
[2023-03-21 20:30:19] [INFO ] Transformed 14564 transitions.
[2023-03-21 20:30:19] [INFO ] Found NUPN structural information;
[2023-03-21 20:30:19] [INFO ] Parsed PT model containing 1107 places and 14564 transitions and 216524 arcs in 1510 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 71 resets, run finished after 1393 ms. (steps per millisecond=7 ) properties (out of 16) seen :3
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 14564 rows 1107 cols
[2023-03-21 20:30:23] [INFO ] Computed 9 place invariants in 448 ms
[2023-03-21 20:30:24] [INFO ] Flatten gal took : 3303 ms
[2023-03-21 20:30:25] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2023-03-21 20:30:25] [INFO ] Flatten gal took : 1480 ms
[2023-03-21 20:30:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8372890996957391982.gal : 375 ms
[2023-03-21 20:30:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5495567016253274369.prop : 6 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.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8372890996957391982.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5495567016253274369.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.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
[2023-03-21 20:30:32] [INFO ] After 7079ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:11
[2023-03-21 20:30:34] [INFO ] After 8900ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:11
Attempting to minimize the solution found.
Minimization took 817 ms.
[2023-03-21 20:30:35] [INFO ] After 10790ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:11
[2023-03-21 20:30:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
Loading property file /tmp/ReachabilityCardinality5495567016253274369.prop.
[2023-03-21 20:30:46] [INFO ] After 10265ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :11
[2023-03-21 20:30:54] [INFO ] After 18812ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :11
Attempting to minimize the solution found.
Minimization took 3837 ms.
[2023-03-21 20:30:58] [INFO ] After 23557ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :11
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 231 ms.
Support contains 71 out of 1107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1107/1107 places, 14564/14564 transitions.
Graph (trivial) has 948 edges and 1107 vertex of which 159 / 1107 are part of one of the 23 SCC in 10 ms
Free SCC test removed 136 places
Drop transitions removed 174 transitions
Reduce isomorphic transitions removed 174 transitions.
Graph (complete) has 2399 edges and 971 vertex of which 955 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.97 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 569 rules applied. Total rules applied 571 place count 955 transition count 13813
Reduce places removed 561 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 579 rules applied. Total rules applied 1150 place count 394 transition count 13795
Reduce places removed 9 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 2 with 52 rules applied. Total rules applied 1202 place count 385 transition count 13752
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 3 with 43 rules applied. Total rules applied 1245 place count 342 transition count 13752
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 1245 place count 342 transition count 13703
Deduced a syphon composed of 49 places in 11 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 1343 place count 293 transition count 13703
Discarding 76 places :
Symmetric choice reduction at 4 with 76 rule applications. Total rules 1419 place count 217 transition count 13627
Iterating global reduction 4 with 76 rules applied. Total rules applied 1495 place count 217 transition count 13627
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1506 place count 217 transition count 13616
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1506 place count 217 transition count 13615
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1508 place count 216 transition count 13615
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1519 place count 205 transition count 13589
Iterating global reduction 5 with 11 rules applied. Total rules applied 1530 place count 205 transition count 13589
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1531 place count 205 transition count 13588
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1535 place count 201 transition count 13584
Iterating global reduction 6 with 4 rules applied. Total rules applied 1539 place count 201 transition count 13584
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 7 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1583 place count 179 transition count 13562
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1589 place count 173 transition count 13556
Iterating global reduction 6 with 6 rules applied. Total rules applied 1595 place count 173 transition count 13556
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1603 place count 169 transition count 13565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1604 place count 169 transition count 13564
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 1613 place count 169 transition count 13555
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1615 place count 168 transition count 13561
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1623 place count 168 transition count 13553
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1625 place count 167 transition count 13559
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1633 place count 167 transition count 13551
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1635 place count 166 transition count 13557
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1643 place count 166 transition count 13549
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1645 place count 165 transition count 13555
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1653 place count 165 transition count 13547
Free-agglomeration rule applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 1666 place count 165 transition count 13534
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1679 place count 152 transition count 13534
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1686 place count 145 transition count 13527
Iterating global reduction 8 with 7 rules applied. Total rules applied 1693 place count 145 transition count 13527
Applied a total of 1693 rules in 6982 ms. Remains 145 /1107 variables (removed 962) and now considering 13527/14564 (removed 1037) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6989 ms. Remains : 145/1107 places, 13527/14564 transitions.
Incomplete random walk after 10000 steps, including 357 resets, run finished after 681 ms. (steps per millisecond=14 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 66087 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66087 steps, saw 16609 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 13527 rows 145 cols
[2023-03-21 20:31:10] [INFO ] Computed 9 place invariants in 144 ms
[2023-03-21 20:31:11] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-21 20:31:16] [INFO ] After 5263ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:9
[2023-03-21 20:31:17] [INFO ] State equation strengthened by 211 read => feed constraints.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :11 after 19
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :19 after 21
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :21 after 190
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :190 after 5884
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :5884 after 166191
[2023-03-21 20:31:19] [INFO ] After 2911ms SMT Verify possible using 211 Read/Feed constraints in real domain returned unsat :0 sat :2 real:9
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :166191 after 166425
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :166425 after 355004
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :355004 after 461197
[2023-03-21 20:31:21] [INFO ] After 4283ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:9
Attempting to minimize the solution found.
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :461197 after 1.83964e+06
Minimization took 661 ms.
[2023-03-21 20:31:21] [INFO ] After 10619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:9
[2023-03-21 20:31:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :1.83964e+06 after 8.89021e+06
[2023-03-21 20:31:30] [INFO ] After 8058ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-21 20:31:36] [INFO ] After 6038ms SMT Verify possible using 211 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-21 20:31:42] [INFO ] After 12370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 3498 ms.
[2023-03-21 20:31:46] [INFO ] After 24076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 166 ms.
Support contains 71 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 13527/13527 transitions.
Applied a total of 0 rules in 487 ms. Remains 145 /145 variables (removed 0) and now considering 13527/13527 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 487 ms. Remains : 145/145 places, 13527/13527 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 13527/13527 transitions.
Applied a total of 0 rules in 490 ms. Remains 145 /145 variables (removed 0) and now considering 13527/13527 (removed 0) transitions.
[2023-03-21 20:31:47] [INFO ] Invariant cache hit.
[2023-03-21 20:31:47] [INFO ] Implicit Places using invariants in 105 ms returned [144]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 144/145 places, 13527/13527 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 144 transition count 13523
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 140 transition count 13523
Performed 8 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 132 transition count 13508
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 132 transition count 13506
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 130 transition count 13506
SDD proceeding with computation,13 properties remain. new max is 32768
SDD size :8.89021e+06 after 3.61862e+10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 130 transition count 13504
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 130 transition count 13504
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 129 transition count 13503
Applied a total of 34 rules in 3837 ms. Remains 129 /144 variables (removed 15) and now considering 13503/13527 (removed 24) transitions.
// Phase 1: matrix 13503 rows 129 cols
[2023-03-21 20:31:51] [INFO ] Computed 8 place invariants in 159 ms
[2023-03-21 20:31:51] [INFO ] Implicit Places using invariants in 230 ms returned []
Implicit Place search using SMT only with invariants took 231 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 129/145 places, 13503/13527 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4688 ms. Remains : 129/145 places, 13503/13527 transitions.
Incomplete random walk after 10000 steps, including 475 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 11) seen :1
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :1
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 9 properties.
[2023-03-21 20:31:53] [INFO ] Invariant cache hit.
[2023-03-21 20:31:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-21 20:31:58] [INFO ] After 5328ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:7
[2023-03-21 20:32:00] [INFO ] After 6504ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:7
Attempting to minimize the solution found.
Minimization took 632 ms.
[2023-03-21 20:32:00] [INFO ] After 7225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:7
[2023-03-21 20:32:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-21 20:32:08] [INFO ] After 7253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 20:32:13] [INFO ] After 12259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2682 ms.
[2023-03-21 20:32:15] [INFO ] After 15056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=7 )
FORMULA StigmergyElection-PT-08b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 9 properties in 41 ms.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 117925 ms.

BK_STOP 1679430737158

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-08b"
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-5348"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-08b, 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 r453-smll-167912645700663"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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