About the Execution of 2021-gold for StigmergyElection-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8353.508 | 887651.00 | 1534538.00 | 3023.30 | TTTTTFTFTFTTTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r305-smll-165463878500146.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is StigmergyElection-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878500146
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 125M
-rw-r--r-- 1 mcc users 6.9K May 30 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 30 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 30 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 30 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 25 13:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 25 13:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 6.6K May 30 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K May 30 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 30 15:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 30 15:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 124M May 29 12:20 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-10b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-10b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1654733756250
Running Version 0
[2022-06-09 00:15:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 00:15:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 00:16:06] [INFO ] Load time of PNML (sax parser for PT used): 6650 ms
[2022-06-09 00:16:06] [INFO ] Transformed 1379 places.
[2022-06-09 00:16:07] [INFO ] Transformed 120600 transitions.
[2022-06-09 00:16:07] [INFO ] Found NUPN structural information;
[2022-06-09 00:16:07] [INFO ] Parsed PT model containing 1379 places and 120600 transitions in 7483 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 59 resets, run finished after 1214 ms. (steps per millisecond=8 ) properties (out of 15) seen :2
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 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 4 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 120600 rows 1379 cols
[2022-06-09 00:16:16] [INFO ] Computed 11 place invariants in 4469 ms
[2022-06-09 00:16:18] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:13
[2022-06-09 00:16:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 24 ms returned sat
[2022-06-09 00:16:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:16:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Support contains 70 out of 1379 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1379/1379 places, 120600/120600 transitions.
Graph (trivial) has 1272 edges and 1379 vertex of which 166 / 1379 are part of one of the 25 SCC in 76 ms
Free SCC test removed 141 places
Drop transitions removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Graph (complete) has 3471 edges and 1238 vertex of which 1223 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.605 ms
Discarding 15 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 768 transitions
Trivial Post-agglo rules discarded 768 transitions
Performed 768 trivial Post agglomeration. Transition count delta: 768
Iterating post reduction 0 with 774 rules applied. Total rules applied 776 place count 1223 transition count 119640
Reduce places removed 768 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 794 rules applied. Total rules applied 1570 place count 455 transition count 119614
Reduce places removed 13 places and 0 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 2 with 58 rules applied. Total rules applied 1628 place count 442 transition count 119569
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 47 rules applied. Total rules applied 1675 place count 397 transition count 119567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1676 place count 396 transition count 119567
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 36 Pre rules applied. Total rules applied 1676 place count 396 transition count 119531
Deduced a syphon composed of 36 places in 337 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1748 place count 360 transition count 119531
Discarding 62 places :
Symmetric choice reduction at 5 with 62 rule applications. Total rules 1810 place count 298 transition count 119469
Iterating global reduction 5 with 62 rules applied. Total rules applied 1872 place count 298 transition count 119469
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1891 place count 279 transition count 5190
Iterating global reduction 5 with 19 rules applied. Total rules applied 1910 place count 279 transition count 5190
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1920 place count 279 transition count 5180
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 5 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 1996 place count 241 transition count 5142
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1997 place count 241 transition count 5141
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2001 place count 237 transition count 5137
Iterating global reduction 7 with 4 rules applied. Total rules applied 2005 place count 237 transition count 5137
Performed 9 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2023 place count 228 transition count 5146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2025 place count 228 transition count 5144
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 2037 place count 228 transition count 5132
Free-agglomeration rule applied 56 times.
Iterating global reduction 8 with 56 rules applied. Total rules applied 2093 place count 228 transition count 5076
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 8 with 56 rules applied. Total rules applied 2149 place count 172 transition count 5076
Drop transitions removed 772 transitions
Redundant transition composition rules discarded 772 transitions
Iterating global reduction 9 with 772 rules applied. Total rules applied 2921 place count 172 transition count 4304
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2922 place count 172 transition count 4303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2923 place count 171 transition count 4303
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 2926 place count 171 transition count 4303
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 2927 place count 171 transition count 4303
Applied a total of 2927 rules in 74732 ms. Remains 171 /1379 variables (removed 1208) and now considering 4303/120600 (removed 116297) transitions.
Finished structural reductions, in 1 iterations. Remains : 171/1379 places, 4303/120600 transitions.
[2022-06-09 00:17:59] [INFO ] Flatten gal took : 1026 ms
[2022-06-09 00:17:59] [INFO ] Flatten gal took : 538 ms
[2022-06-09 00:18:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15018129306574853677.gal : 200 ms
[2022-06-09 00:18:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6570208070896548888.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality15018129306574853677.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6570208070896548888.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality15018129306574853677.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6570208070896548888.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6570208070896548888.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :10 after 11
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :11 after 13
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :13 after 15
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :15 after 323
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :323 after 481
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :481 after 1681
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1681 after 8761
Detected timeout of ITS tools.
[2022-06-09 00:18:15] [INFO ] Flatten gal took : 541 ms
[2022-06-09 00:18:15] [INFO ] Applying decomposition
[2022-06-09 00:18:16] [INFO ] Flatten gal took : 478 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13326234022619216267.txt, -o, /tmp/graph13326234022619216267.bin, -w, /tmp/graph13326234022619216267.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13326234022619216267.bin, -l, -1, -v, -w, /tmp/graph13326234022619216267.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 00:18:18] [INFO ] Decomposing Gal with order
[2022-06-09 00:18:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 00:18:22] [INFO ] Removed a total of 6669 redundant transitions.
[2022-06-09 00:18:23] [INFO ] Flatten gal took : 4055 ms
[2022-06-09 00:18:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 7237 labels/synchronizations in 1084 ms.
[2022-06-09 00:18:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11123855973770158354.gal : 276 ms
[2022-06-09 00:18:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6651301870311963818.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11123855973770158354.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6651301870311963818.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11123855973770158354.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6651301870311963818.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6651301870311963818.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 37
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :37 after 151
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :151 after 241
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :241 after 39685
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :39685 after 43885
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :43885 after 60904
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7353887184808327152
[2022-06-09 00:18:41] [INFO ] Built C files in 197ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7353887184808327152
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7353887184808327152]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7353887184808327152] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7353887184808327152] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 30077 resets, run finished after 24168 ms. (steps per millisecond=41 ) properties (out of 6) seen :2
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3428 resets, run finished after 3142 ms. (steps per millisecond=318 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3425 resets, run finished after 4287 ms. (steps per millisecond=233 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3426 resets, run finished after 3463 ms. (steps per millisecond=288 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2659 resets, run finished after 2545 ms. (steps per millisecond=392 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 4303 rows 171 cols
[2022-06-09 00:19:19] [INFO ] Computed 8 place invariants in 44 ms
[2022-06-09 00:19:20] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:21] [INFO ] [Real]Absence check using state equation in 1250 ms returned sat
[2022-06-09 00:19:25] [INFO ] State equation strengthened by 4014 read => feed constraints.
[2022-06-09 00:19:40] [INFO ] [Real]Added 4014 Read/Feed constraints in 15065 ms returned sat
[2022-06-09 00:19:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:19:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:19:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:41] [INFO ] [Nat]Absence check using state equation in 1097 ms returned sat
[2022-06-09 00:19:56] [INFO ] [Nat]Added 4014 Read/Feed constraints in 15178 ms returned sat
[2022-06-09 00:20:00] [INFO ] Deduced a trap composed of 14 places in 3583 ms of which 18 ms to minimize.
[2022-06-09 00:20:03] [INFO ] Deduced a trap composed of 31 places in 3040 ms of which 3 ms to minimize.
[2022-06-09 00:20:06] [INFO ] Deduced a trap composed of 21 places in 2184 ms of which 1 ms to minimize.
[2022-06-09 00:20:07] [INFO ] Deduced a trap composed of 12 places in 1681 ms of which 1 ms to minimize.
[2022-06-09 00:20:09] [INFO ] Deduced a trap composed of 23 places in 1759 ms of which 2 ms to minimize.
[2022-06-09 00:20:12] [INFO ] Deduced a trap composed of 19 places in 2049 ms of which 1 ms to minimize.
[2022-06-09 00:20:14] [INFO ] Deduced a trap composed of 18 places in 1837 ms of which 1 ms to minimize.
[2022-06-09 00:20:15] [INFO ] Deduced a trap composed of 22 places in 1675 ms of which 1 ms to minimize.
[2022-06-09 00:20:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 19296 ms
[2022-06-09 00:20:22] [INFO ] Computed and/alt/rep : 122/179/122 causal constraints (skipped 4165 transitions) in 5999 ms.
[2022-06-09 00:20:28] [INFO ] Deduced a trap composed of 14 places in 3406 ms of which 1 ms to minimize.
[2022-06-09 00:20:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-09 00:20:28] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-09 00:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:20:30] [INFO ] [Real]Absence check using state equation in 1328 ms returned sat
[2022-06-09 00:20:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:20:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-09 00:20:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:20:31] [INFO ] [Nat]Absence check using state equation in 1141 ms returned sat
[2022-06-09 00:20:48] [INFO ] [Nat]Added 4014 Read/Feed constraints in 17329 ms returned sat
[2022-06-09 00:20:50] [INFO ] Deduced a trap composed of 15 places in 1614 ms of which 1 ms to minimize.
[2022-06-09 00:20:52] [INFO ] Deduced a trap composed of 18 places in 1450 ms of which 1 ms to minimize.
[2022-06-09 00:20:53] [INFO ] Deduced a trap composed of 17 places in 1317 ms of which 0 ms to minimize.
[2022-06-09 00:20:55] [INFO ] Deduced a trap composed of 25 places in 1172 ms of which 1 ms to minimize.
[2022-06-09 00:20:56] [INFO ] Deduced a trap composed of 22 places in 1135 ms of which 1 ms to minimize.
[2022-06-09 00:20:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 7538 ms
[2022-06-09 00:21:02] [INFO ] Computed and/alt/rep : 122/179/122 causal constraints (skipped 4165 transitions) in 5730 ms.
[2022-06-09 00:21:11] [INFO ] Added : 110 causal constraints over 22 iterations in 14880 ms. Result :sat
[2022-06-09 00:21:11] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-06-09 00:21:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:21:13] [INFO ] [Real]Absence check using state equation in 1439 ms returned sat
[2022-06-09 00:21:31] [INFO ] [Real]Added 4014 Read/Feed constraints in 18275 ms returned sat
[2022-06-09 00:21:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:21:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-09 00:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:21:32] [INFO ] [Nat]Absence check using state equation in 1126 ms returned sat
[2022-06-09 00:21:53] [INFO ] [Nat]Added 4014 Read/Feed constraints in 20861 ms returned sat
[2022-06-09 00:21:56] [INFO ] Deduced a trap composed of 22 places in 2609 ms of which 1 ms to minimize.
[2022-06-09 00:21:58] [INFO ] Deduced a trap composed of 18 places in 1816 ms of which 1 ms to minimize.
[2022-06-09 00:22:00] [INFO ] Deduced a trap composed of 22 places in 2060 ms of which 1 ms to minimize.
[2022-06-09 00:22:02] [INFO ] Deduced a trap composed of 23 places in 1738 ms of which 1 ms to minimize.
[2022-06-09 00:22:04] [INFO ] Deduced a trap composed of 14 places in 1669 ms of which 1 ms to minimize.
[2022-06-09 00:22:06] [INFO ] Deduced a trap composed of 20 places in 1623 ms of which 1 ms to minimize.
[2022-06-09 00:22:08] [INFO ] Deduced a trap composed of 21 places in 1772 ms of which 0 ms to minimize.
[2022-06-09 00:22:10] [INFO ] Deduced a trap composed of 12 places in 1898 ms of which 1 ms to minimize.
[2022-06-09 00:22:12] [INFO ] Deduced a trap composed of 26 places in 1916 ms of which 1 ms to minimize.
[2022-06-09 00:22:14] [INFO ] Deduced a trap composed of 19 places in 1751 ms of which 1 ms to minimize.
[2022-06-09 00:22:15] [INFO ] Deduced a trap composed of 23 places in 1476 ms of which 1 ms to minimize.
[2022-06-09 00:22:17] [INFO ] Deduced a trap composed of 24 places in 1478 ms of which 0 ms to minimize.
[2022-06-09 00:22:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-09 00:22:17] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-06-09 00:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:22:18] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2022-06-09 00:22:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:22:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-09 00:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:22:20] [INFO ] [Nat]Absence check using state equation in 1252 ms returned sat
[2022-06-09 00:22:34] [INFO ] [Nat]Added 4014 Read/Feed constraints in 14306 ms returned sat
[2022-06-09 00:22:37] [INFO ] Deduced a trap composed of 12 places in 2496 ms of which 1 ms to minimize.
[2022-06-09 00:22:39] [INFO ] Deduced a trap composed of 14 places in 2587 ms of which 1 ms to minimize.
[2022-06-09 00:22:42] [INFO ] Deduced a trap composed of 21 places in 2943 ms of which 1 ms to minimize.
[2022-06-09 00:22:45] [INFO ] Deduced a trap composed of 19 places in 2105 ms of which 1 ms to minimize.
[2022-06-09 00:22:47] [INFO ] Deduced a trap composed of 24 places in 2137 ms of which 1 ms to minimize.
[2022-06-09 00:22:50] [INFO ] Deduced a trap composed of 26 places in 2329 ms of which 1 ms to minimize.
[2022-06-09 00:22:52] [INFO ] Deduced a trap composed of 25 places in 2245 ms of which 1 ms to minimize.
[2022-06-09 00:22:55] [INFO ] Deduced a trap composed of 13 places in 2332 ms of which 2 ms to minimize.
[2022-06-09 00:22:57] [INFO ] Deduced a trap composed of 14 places in 2189 ms of which 1 ms to minimize.
[2022-06-09 00:22:59] [INFO ] Deduced a trap composed of 26 places in 2097 ms of which 1 ms to minimize.
[2022-06-09 00:23:01] [INFO ] Deduced a trap composed of 21 places in 1873 ms of which 1 ms to minimize.
[2022-06-09 00:23:03] [INFO ] Deduced a trap composed of 27 places in 1655 ms of which 1 ms to minimize.
[2022-06-09 00:23:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 29286 ms
[2022-06-09 00:23:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 3
Fused 4 Parikh solutions to 2 different solutions.
Interrupted Parikh walk after 1471842 steps, including 39291 resets, run timeout after 30001 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Support contains 50 out of 171 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 171/171 places, 4303/4303 transitions.
Graph (trivial) has 45 edges and 171 vertex of which 2 / 171 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 170 transition count 4287
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 156 transition count 4285
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 34 place count 155 transition count 4283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 153 transition count 4283
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 36 place count 153 transition count 4281
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 40 place count 151 transition count 4281
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 42 place count 149 transition count 4279
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 149 transition count 4279
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 56 place count 143 transition count 4273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 143 transition count 4272
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 59 place count 141 transition count 4270
Iterating global reduction 5 with 2 rules applied. Total rules applied 61 place count 141 transition count 4270
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 63 place count 141 transition count 4268
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 69 place count 141 transition count 4262
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 75 place count 135 transition count 4262
Applied a total of 75 rules in 10213 ms. Remains 135 /171 variables (removed 36) and now considering 4262/4303 (removed 41) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/171 places, 4262/4303 transitions.
[2022-06-09 00:23:44] [INFO ] Flatten gal took : 474 ms
[2022-06-09 00:23:45] [INFO ] Flatten gal took : 645 ms
[2022-06-09 00:23:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3960953710931814828.gal : 115 ms
[2022-06-09 00:23:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12090520359077555545.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3960953710931814828.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12090520359077555545.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality3960953710931814828.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12090520359077555545.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12090520359077555545.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 66
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :66 after 114
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :114 after 142
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :142 after 194
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :194 after 601
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :601 after 28681
Detected timeout of ITS tools.
[2022-06-09 00:24:01] [INFO ] Flatten gal took : 599 ms
[2022-06-09 00:24:01] [INFO ] Applying decomposition
[2022-06-09 00:24:01] [INFO ] Flatten gal took : 421 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11652906704993188385.txt, -o, /tmp/graph11652906704993188385.bin, -w, /tmp/graph11652906704993188385.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11652906704993188385.bin, -l, -1, -v, -w, /tmp/graph11652906704993188385.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 00:24:02] [INFO ] Decomposing Gal with order
[2022-06-09 00:24:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 00:24:05] [INFO ] Removed a total of 16965 redundant transitions.
[2022-06-09 00:24:06] [INFO ] Flatten gal took : 3077 ms
[2022-06-09 00:24:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 3824 labels/synchronizations in 601 ms.
[2022-06-09 00:24:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10277645984195161286.gal : 112 ms
[2022-06-09 00:24:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15968996251410697731.prop : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality10277645984195161286.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15968996251410697731.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10277645984195161286.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15968996251410697731.prop --nowitness
Loading property file /tmp/ReachabilityCardinality15968996251410697731.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :11 after 6353
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6353 after 18881
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :18881 after 23361
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :23361 after 37377
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :37377 after 40961
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :40961 after 40961
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :40961 after 3.60169e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11010903211959600871
[2022-06-09 00:24:22] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11010903211959600871
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11010903211959600871]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11010903211959600871] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11010903211959600871] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 35280 resets, run finished after 29002 ms. (steps per millisecond=34 ) properties (out of 4) seen :2
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 982648 steps, including 4198 resets, run timeout after 5001 ms. (steps per millisecond=196 ) properties seen :{}
Incomplete Best-First random walk after 1000000 steps, including 3247 resets, run finished after 3117 ms. (steps per millisecond=320 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4262 rows 135 cols
[2022-06-09 00:25:00] [INFO ] Computed 8 place invariants in 40 ms
[2022-06-09 00:25:00] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-09 00:25:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:25:02] [INFO ] [Real]Absence check using state equation in 1528 ms returned sat
[2022-06-09 00:25:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:25:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-06-09 00:25:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:25:03] [INFO ] [Nat]Absence check using state equation in 1142 ms returned sat
[2022-06-09 00:25:06] [INFO ] State equation strengthened by 4074 read => feed constraints.
[2022-06-09 00:25:18] [INFO ] [Nat]Added 4074 Read/Feed constraints in 12455 ms returned sat
[2022-06-09 00:25:20] [INFO ] Deduced a trap composed of 6 places in 1635 ms of which 2 ms to minimize.
[2022-06-09 00:25:22] [INFO ] Deduced a trap composed of 14 places in 2039 ms of which 2 ms to minimize.
[2022-06-09 00:25:24] [INFO ] Deduced a trap composed of 13 places in 1688 ms of which 0 ms to minimize.
[2022-06-09 00:25:26] [INFO ] Deduced a trap composed of 13 places in 1479 ms of which 1 ms to minimize.
[2022-06-09 00:25:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7695 ms
[2022-06-09 00:25:31] [INFO ] Computed and/alt/rep : 89/143/89 causal constraints (skipped 4157 transitions) in 4515 ms.
[2022-06-09 00:25:36] [INFO ] Deduced a trap composed of 13 places in 1291 ms of which 18 ms to minimize.
[2022-06-09 00:25:37] [INFO ] Deduced a trap composed of 22 places in 1247 ms of which 1 ms to minimize.
[2022-06-09 00:25:39] [INFO ] Deduced a trap composed of 16 places in 1050 ms of which 1 ms to minimize.
[2022-06-09 00:25:40] [INFO ] Deduced a trap composed of 11 places in 1192 ms of which 1 ms to minimize.
[2022-06-09 00:25:41] [INFO ] Deduced a trap composed of 16 places in 933 ms of which 1 ms to minimize.
[2022-06-09 00:25:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 6873 ms
[2022-06-09 00:25:42] [INFO ] Added : 77 causal constraints over 16 iterations in 15541 ms. Result :sat
[2022-06-09 00:25:42] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-09 00:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:25:43] [INFO ] [Real]Absence check using state equation in 1171 ms returned sat
[2022-06-09 00:25:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:25:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-09 00:25:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:25:45] [INFO ] [Nat]Absence check using state equation in 1503 ms returned sat
[2022-06-09 00:26:03] [INFO ] [Nat]Added 4074 Read/Feed constraints in 18241 ms returned sat
[2022-06-09 00:26:06] [INFO ] Deduced a trap composed of 12 places in 2399 ms of which 1 ms to minimize.
[2022-06-09 00:26:08] [INFO ] Deduced a trap composed of 12 places in 2057 ms of which 1 ms to minimize.
[2022-06-09 00:26:10] [INFO ] Deduced a trap composed of 10 places in 2280 ms of which 1 ms to minimize.
[2022-06-09 00:26:13] [INFO ] Deduced a trap composed of 14 places in 2590 ms of which 0 ms to minimize.
[2022-06-09 00:26:15] [INFO ] Deduced a trap composed of 26 places in 1581 ms of which 1 ms to minimize.
[2022-06-09 00:26:16] [INFO ] Deduced a trap composed of 22 places in 1388 ms of which 1 ms to minimize.
[2022-06-09 00:26:18] [INFO ] Deduced a trap composed of 19 places in 1630 ms of which 1 ms to minimize.
[2022-06-09 00:26:19] [INFO ] Deduced a trap composed of 16 places in 1282 ms of which 1 ms to minimize.
[2022-06-09 00:26:21] [INFO ] Deduced a trap composed of 24 places in 1327 ms of which 1 ms to minimize.
[2022-06-09 00:26:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 18149 ms
[2022-06-09 00:26:26] [INFO ] Computed and/alt/rep : 89/143/89 causal constraints (skipped 4157 transitions) in 4494 ms.
[2022-06-09 00:26:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
Incomplete Parikh walk after 9765600 steps, including 1002 resets, run finished after 26748 ms. (steps per millisecond=365 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 32 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 4262/4262 transitions.
Graph (trivial) has 46 edges and 135 vertex of which 8 / 135 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 676 edges and 131 vertex of which 129 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 129 transition count 4238
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 117 transition count 4237
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 116 transition count 4236
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 31 place count 116 transition count 4234
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 35 place count 114 transition count 4234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 113 transition count 4233
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 113 transition count 4233
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 49 place count 107 transition count 4227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 107 transition count 4226
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 52 place count 105 transition count 4224
Iterating global reduction 4 with 2 rules applied. Total rules applied 54 place count 105 transition count 4224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 104 transition count 4224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 58 place count 104 transition count 4222
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 59 place count 104 transition count 4221
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 63 place count 104 transition count 4217
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 67 place count 100 transition count 4217
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 69 place count 100 transition count 4215
Applied a total of 69 rules in 13721 ms. Remains 100 /135 variables (removed 35) and now considering 4215/4262 (removed 47) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/135 places, 4215/4262 transitions.
[2022-06-09 00:27:09] [INFO ] Flatten gal took : 571 ms
[2022-06-09 00:27:10] [INFO ] Flatten gal took : 547 ms
[2022-06-09 00:27:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12385180661345259852.gal : 83 ms
[2022-06-09 00:27:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13996097238167208418.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality12385180661345259852.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13996097238167208418.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality12385180661345259852.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13996097238167208418.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13996097238167208418.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :38 after 39
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :39 after 90
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :90 after 114
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :114 after 213
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :213 after 597
Detected timeout of ITS tools.
[2022-06-09 00:27:26] [INFO ] Flatten gal took : 454 ms
[2022-06-09 00:27:26] [INFO ] Applying decomposition
[2022-06-09 00:27:26] [INFO ] Flatten gal took : 449 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17122986846872514236.txt, -o, /tmp/graph17122986846872514236.bin, -w, /tmp/graph17122986846872514236.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17122986846872514236.bin, -l, -1, -v, -w, /tmp/graph17122986846872514236.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 00:27:27] [INFO ] Decomposing Gal with order
[2022-06-09 00:27:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 00:27:29] [INFO ] Removed a total of 22564 redundant transitions.
[2022-06-09 00:27:30] [INFO ] Flatten gal took : 1817 ms
[2022-06-09 00:27:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2554 labels/synchronizations in 750 ms.
[2022-06-09 00:27:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4782696702618798717.gal : 76 ms
[2022-06-09 00:27:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11649744288149767506.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality4782696702618798717.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11649744288149767506.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality4782696702618798717.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11649744288149767506.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11649744288149767506.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 131
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :131 after 213
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :213 after 327557
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :327557 after 584139
Reachability property StigmergyElection-PT-10b-ReachabilityCardinality-04 is true.
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :584139 after 2.1833e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.1833e+06 after 2.54258e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18214039620585592203
[2022-06-09 00:27:46] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18214039620585592203
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin18214039620585592203]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin18214039620585592203] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin18214039620585592203] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Interrupted random walk after 932874 steps, including 34780 resets, run timeout after 30001 ms. (steps per millisecond=31 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 3639 resets, run finished after 3657 ms. (steps per millisecond=273 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3145588 steps, run timeout after 30001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 3145588 steps, saw 424433 distinct states, run finished after 30001 ms. (steps per millisecond=104 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 4215 rows 100 cols
[2022-06-09 00:28:50] [INFO ] Computed 10 place invariants in 27 ms
[2022-06-09 00:28:50] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 00:28:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:28:51] [INFO ] [Real]Absence check using state equation in 1063 ms returned sat
[2022-06-09 00:28:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:28:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-06-09 00:28:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:28:53] [INFO ] [Nat]Absence check using state equation in 1309 ms returned sat
[2022-06-09 00:28:55] [INFO ] State equation strengthened by 4080 read => feed constraints.
[2022-06-09 00:29:08] [INFO ] [Nat]Added 4080 Read/Feed constraints in 12910 ms returned sat
[2022-06-09 00:29:10] [INFO ] Deduced a trap composed of 13 places in 2129 ms of which 1 ms to minimize.
[2022-06-09 00:29:12] [INFO ] Deduced a trap composed of 11 places in 1913 ms of which 10 ms to minimize.
[2022-06-09 00:29:14] [INFO ] Deduced a trap composed of 23 places in 1676 ms of which 1 ms to minimize.
[2022-06-09 00:29:16] [INFO ] Deduced a trap composed of 18 places in 1683 ms of which 1 ms to minimize.
[2022-06-09 00:29:18] [INFO ] Deduced a trap composed of 8 places in 1836 ms of which 0 ms to minimize.
[2022-06-09 00:29:19] [INFO ] Deduced a trap composed of 17 places in 1547 ms of which 1 ms to minimize.
[2022-06-09 00:29:21] [INFO ] Deduced a trap composed of 7 places in 1565 ms of which 1 ms to minimize.
[2022-06-09 00:29:22] [INFO ] Deduced a trap composed of 10 places in 1130 ms of which 0 ms to minimize.
[2022-06-09 00:29:24] [INFO ] Deduced a trap composed of 16 places in 1408 ms of which 0 ms to minimize.
[2022-06-09 00:29:25] [INFO ] Deduced a trap composed of 15 places in 1108 ms of which 0 ms to minimize.
[2022-06-09 00:29:26] [INFO ] Deduced a trap composed of 10 places in 955 ms of which 1 ms to minimize.
[2022-06-09 00:29:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 18541 ms
[2022-06-09 00:29:30] [INFO ] Computed and/alt/rep : 52/85/52 causal constraints (skipped 4147 transitions) in 3909 ms.
[2022-06-09 00:29:33] [INFO ] Added : 45 causal constraints over 9 iterations in 6229 ms. Result :sat
Interrupted Parikh walk after 647551 steps, including 1002 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Support contains 10 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 4215/4215 transitions.
Graph (trivial) has 45 edges and 100 vertex of which 2 / 100 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 583 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 98 transition count 4195
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 82 transition count 4192
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 41 place count 80 transition count 4191
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 43 place count 78 transition count 4189
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 78 transition count 4189
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 77 transition count 4187
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 77 transition count 4187
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 59 place count 71 transition count 4181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 71 transition count 4178
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 66 place count 67 transition count 4174
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 67 transition count 4174
Drop transitions removed 514 transitions
Redundant transition composition rules discarded 514 transitions
Iterating global reduction 4 with 514 rules applied. Total rules applied 584 place count 67 transition count 3660
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 592 place count 67 transition count 3652
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 4 with 69 rules applied. Total rules applied 661 place count 59 transition count 3591
Drop transitions removed 287 transitions
Redundant transition composition rules discarded 287 transitions
Iterating global reduction 5 with 287 rules applied. Total rules applied 948 place count 59 transition count 3304
Applied a total of 948 rules in 10949 ms. Remains 59 /100 variables (removed 41) and now considering 3304/4215 (removed 911) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/100 places, 3304/4215 transitions.
[2022-06-09 00:30:14] [INFO ] Flatten gal took : 309 ms
[2022-06-09 00:30:14] [INFO ] Flatten gal took : 306 ms
[2022-06-09 00:30:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16363189639995359296.gal : 48 ms
[2022-06-09 00:30:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10393306754264294645.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16363189639995359296.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10393306754264294645.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16363189639995359296.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10393306754264294645.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10393306754264294645.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 17
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :17 after 1824
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1824 after 1840
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1840 after 1860
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1860 after 2020
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2020 after 2213
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2213 after 6971
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6971 after 9477
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9477 after 9749
Detected timeout of ITS tools.
[2022-06-09 00:30:35] [INFO ] Flatten gal took : 312 ms
[2022-06-09 00:30:35] [INFO ] Applying decomposition
[2022-06-09 00:30:35] [INFO ] Flatten gal took : 310 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4663771127877058894.txt, -o, /tmp/graph4663771127877058894.bin, -w, /tmp/graph4663771127877058894.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4663771127877058894.bin, -l, -1, -v, -w, /tmp/graph4663771127877058894.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 00:30:36] [INFO ] Decomposing Gal with order
[2022-06-09 00:30:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 00:30:37] [INFO ] Removed a total of 31582 redundant transitions.
[2022-06-09 00:30:37] [INFO ] Flatten gal took : 907 ms
[2022-06-09 00:30:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 947 ms.
[2022-06-09 00:30:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14120863321298358897.gal : 82 ms
[2022-06-09 00:30:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2743672267404347317.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality14120863321298358897.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2743672267404347317.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality14120863321298358897.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2743672267404347317.prop --nowitness
Loading property file /tmp/ReachabilityCardinality2743672267404347317.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 793
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :793 after 95887
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,111247,3.80741,62000,2982,323,29699,678,9387,197940,104,17328,0
Total reachable state count : 111247
Verifying 1 reachability properties.
Reachability property StigmergyElection-PT-10b-ReachabilityCardinality-13 is true.
FORMULA StigmergyElection-PT-10b-ReachabilityCardinality-13 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-10b-ReachabilityCardinality-13,4,3.81565,62264,34,22,29699,678,9406,197940,112,17328,62
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
BK_STOP 1654734643901
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-10b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is StigmergyElection-PT-10b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r305-smll-165463878500146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-10b.tgz
mv StigmergyElection-PT-10b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;