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-165463878400068.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 StigmergyCommit-PT-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878400068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 8.8K May 30 15:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 30 15:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 30 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 30 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 12K May 30 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 30 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 30 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 30 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 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 12M 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 StigmergyCommit-PT-07b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-07b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654720189225

Running Version 0
[2022-06-08 20:29:52] [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-08 20:29:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 20:29:53] [INFO ] Load time of PNML (sax parser for PT used): 1230 ms
[2022-06-08 20:29:53] [INFO ] Transformed 2443 places.
[2022-06-08 20:29:53] [INFO ] Transformed 15956 transitions.
[2022-06-08 20:29:53] [INFO ] Found NUPN structural information;
[2022-06-08 20:29:54] [INFO ] Parsed PT model containing 2443 places and 15956 transitions in 1482 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 68 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 16) seen :4
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 15956 rows 2443 cols
[2022-06-08 20:29:56] [INFO ] Computed 9 place invariants in 715 ms
[2022-06-08 20:29:58] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:12
[2022-06-08 20:29:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 32 ms returned sat
[2022-06-08 20:30:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:30:18] [INFO ] [Nat]Absence check using state equation in 18107 ms returned unsat :4 sat :8
Attempting to minimize the solution found.
Minimization took 5113 ms.
[2022-06-08 20:30:23] [INFO ] SMT Verify possible in nat domain returned unsat :4 sat :8
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 8 different solutions.
Incomplete Parikh walk after 48400 steps, including 341 resets, run finished after 659 ms. (steps per millisecond=73 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 44000 steps, including 299 resets, run finished after 449 ms. (steps per millisecond=97 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 38900 steps, including 353 resets, run finished after 312 ms. (steps per millisecond=124 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 57300 steps, including 439 resets, run finished after 530 ms. (steps per millisecond=108 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 60900 steps, including 517 resets, run finished after 632 ms. (steps per millisecond=96 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 66200 steps, including 471 resets, run finished after 770 ms. (steps per millisecond=85 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 52900 steps, including 392 resets, run finished after 443 ms. (steps per millisecond=119 ) properties (out of 8) seen :0 could not realise parikh vector
Support contains 123 out of 2443 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2443/2443 places, 15956/15956 transitions.
Graph (trivial) has 2199 edges and 2443 vertex of which 138 / 2443 are part of one of the 22 SCC in 20 ms
Free SCC test removed 116 places
Drop transitions removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Graph (complete) has 4009 edges and 2327 vertex of which 2311 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.97 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1590 transitions
Trivial Post-agglo rules discarded 1590 transitions
Performed 1590 trivial Post agglomeration. Transition count delta: 1590
Iterating post reduction 0 with 1597 rules applied. Total rules applied 1599 place count 2311 transition count 14203
Reduce places removed 1590 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 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 1 with 1623 rules applied. Total rules applied 3222 place count 721 transition count 14170
Reduce places removed 14 places and 0 transitions.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Iterating post reduction 2 with 98 rules applied. Total rules applied 3320 place count 707 transition count 14086
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 87 rules applied. Total rules applied 3407 place count 623 transition count 14083
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3408 place count 622 transition count 14083
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 91 Pre rules applied. Total rules applied 3408 place count 622 transition count 13992
Deduced a syphon composed of 91 places in 13 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 5 with 182 rules applied. Total rules applied 3590 place count 531 transition count 13992
Discarding 76 places :
Symmetric choice reduction at 5 with 76 rule applications. Total rules 3666 place count 455 transition count 13916
Iterating global reduction 5 with 76 rules applied. Total rules applied 3742 place count 455 transition count 13916
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3742 place count 455 transition count 13915
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3744 place count 454 transition count 13915
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 3779 place count 419 transition count 1525
Iterating global reduction 5 with 35 rules applied. Total rules applied 3814 place count 419 transition count 1525
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 3824 place count 419 transition count 1515
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 3831 place count 412 transition count 1508
Iterating global reduction 6 with 7 rules applied. Total rules applied 3838 place count 412 transition count 1508
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 3843 place count 407 transition count 1503
Iterating global reduction 6 with 5 rules applied. Total rules applied 3848 place count 407 transition count 1503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3850 place count 407 transition count 1501
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 3916 place count 374 transition count 1468
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3923 place count 367 transition count 1461
Iterating global reduction 7 with 7 rules applied. Total rules applied 3930 place count 367 transition count 1461
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3936 place count 361 transition count 1455
Iterating global reduction 7 with 6 rules applied. Total rules applied 3942 place count 361 transition count 1455
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3948 place count 355 transition count 1449
Iterating global reduction 7 with 6 rules applied. Total rules applied 3954 place count 355 transition count 1449
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 3962 place count 351 transition count 1467
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 3964 place count 351 transition count 1465
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 3968 place count 351 transition count 1461
Free-agglomeration rule applied 67 times.
Iterating global reduction 8 with 67 rules applied. Total rules applied 4035 place count 351 transition count 1394
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 8 with 67 rules applied. Total rules applied 4102 place count 284 transition count 1394
Drop transitions removed 249 transitions
Redundant transition composition rules discarded 249 transitions
Iterating global reduction 9 with 249 rules applied. Total rules applied 4351 place count 284 transition count 1145
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 4361 place count 284 transition count 1145
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 4368 place count 284 transition count 1138
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 4370 place count 284 transition count 1138
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 4378 place count 284 transition count 1130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4379 place count 283 transition count 1129
Applied a total of 4379 rules in 4856 ms. Remains 283 /2443 variables (removed 2160) and now considering 1129/15956 (removed 14827) transitions.
Finished structural reductions, in 1 iterations. Remains : 283/2443 places, 1129/15956 transitions.
[2022-06-08 20:30:32] [INFO ] Flatten gal took : 384 ms
[2022-06-08 20:30:32] [INFO ] Flatten gal took : 193 ms
[2022-06-08 20:30:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9938949574341520639.gal : 73 ms
[2022-06-08 20:30:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3050113125952531760.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/ReachabilityCardinality9938949574341520639.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3050113125952531760.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/ReachabilityCardinality9938949574341520639.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3050113125952531760.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3050113125952531760.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :8 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 27
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :27 after 76
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :76 after 103
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :103 after 191
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :191 after 2305
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :2305 after 13201
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :13201 after 96781
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :96781 after 240052
Detected timeout of ITS tools.
[2022-06-08 20:30:48] [INFO ] Flatten gal took : 153 ms
[2022-06-08 20:30:48] [INFO ] Applying decomposition
[2022-06-08 20:30:48] [INFO ] Flatten gal took : 145 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/graph17223796804676455323.txt, -o, /tmp/graph17223796804676455323.bin, -w, /tmp/graph17223796804676455323.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/graph17223796804676455323.bin, -l, -1, -v, -w, /tmp/graph17223796804676455323.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 20:30:49] [INFO ] Decomposing Gal with order
[2022-06-08 20:30:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 20:30:49] [INFO ] Removed a total of 6390 redundant transitions.
[2022-06-08 20:30:49] [INFO ] Flatten gal took : 411 ms
[2022-06-08 20:30:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 149 ms.
[2022-06-08 20:30:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10240566959800649610.gal : 18 ms
[2022-06-08 20:30:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1442675880280928725.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/ReachabilityCardinality10240566959800649610.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1442675880280928725.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/ReachabilityCardinality10240566959800649610.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1442675880280928725.prop --nowitness
Loading property file /tmp/ReachabilityCardinality1442675880280928725.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :25 after 145
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :145 after 1729
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1729 after 11233
Reachability property StigmergyCommit-PT-07b-ReachabilityCardinality-11 is true.
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :11233 after 3.43787e+08
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :3.43787e+08 after 2.64585e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3378607033647330064
[2022-06-08 20:31:05] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3378607033647330064
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/ltsmin3378607033647330064]
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/ltsmin3378607033647330064] 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/ltsmin3378607033647330064] 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 36465 resets, run finished after 4008 ms. (steps per millisecond=249 ) properties (out of 7) seen :1
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4166 resets, run finished after 1432 ms. (steps per millisecond=698 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4151 resets, run finished after 2035 ms. (steps per millisecond=491 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4165 resets, run finished after 702 ms. (steps per millisecond=1424 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4155 resets, run finished after 1224 ms. (steps per millisecond=816 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4162 resets, run finished after 655 ms. (steps per millisecond=1526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4148 resets, run finished after 727 ms. (steps per millisecond=1375 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1129 rows 283 cols
[2022-06-08 20:31:16] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 20:31:16] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-08 20:31:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:31:17] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2022-06-08 20:31:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:31:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-08 20:31:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:31:17] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2022-06-08 20:31:17] [INFO ] State equation strengthened by 678 read => feed constraints.
[2022-06-08 20:31:18] [INFO ] [Nat]Added 678 Read/Feed constraints in 695 ms returned sat
[2022-06-08 20:31:19] [INFO ] Deduced a trap composed of 43 places in 636 ms of which 2 ms to minimize.
[2022-06-08 20:31:19] [INFO ] Deduced a trap composed of 45 places in 554 ms of which 2 ms to minimize.
[2022-06-08 20:31:20] [INFO ] Deduced a trap composed of 42 places in 558 ms of which 2 ms to minimize.
[2022-06-08 20:31:21] [INFO ] Deduced a trap composed of 43 places in 460 ms of which 1 ms to minimize.
[2022-06-08 20:31:21] [INFO ] Deduced a trap composed of 44 places in 438 ms of which 1 ms to minimize.
[2022-06-08 20:31:22] [INFO ] Deduced a trap composed of 47 places in 401 ms of which 2 ms to minimize.
[2022-06-08 20:31:23] [INFO ] Deduced a trap composed of 53 places in 645 ms of which 1 ms to minimize.
[2022-06-08 20:31:23] [INFO ] Deduced a trap composed of 56 places in 485 ms of which 1 ms to minimize.
[2022-06-08 20:31:24] [INFO ] Deduced a trap composed of 40 places in 472 ms of which 1 ms to minimize.
[2022-06-08 20:31:25] [INFO ] Deduced a trap composed of 36 places in 464 ms of which 1 ms to minimize.
[2022-06-08 20:31:25] [INFO ] Deduced a trap composed of 38 places in 556 ms of which 1 ms to minimize.
[2022-06-08 20:31:26] [INFO ] Deduced a trap composed of 34 places in 370 ms of which 0 ms to minimize.
[2022-06-08 20:31:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 7841 ms
[2022-06-08 20:31:26] [INFO ] Computed and/alt/rep : 272/530/272 causal constraints (skipped 828 transitions) in 450 ms.
[2022-06-08 20:31:35] [INFO ] Added : 200 causal constraints over 40 iterations in 8718 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 192 ms.
[2022-06-08 20:31:35] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-06-08 20:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:31:36] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2022-06-08 20:31:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:31:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-08 20:31:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:31:36] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2022-06-08 20:31:37] [INFO ] [Nat]Added 678 Read/Feed constraints in 963 ms returned sat
[2022-06-08 20:31:38] [INFO ] Deduced a trap composed of 54 places in 410 ms of which 1 ms to minimize.
[2022-06-08 20:31:38] [INFO ] Deduced a trap composed of 61 places in 507 ms of which 1 ms to minimize.
[2022-06-08 20:31:39] [INFO ] Deduced a trap composed of 55 places in 509 ms of which 1 ms to minimize.
[2022-06-08 20:31:40] [INFO ] Deduced a trap composed of 43 places in 552 ms of which 1 ms to minimize.
[2022-06-08 20:31:40] [INFO ] Deduced a trap composed of 37 places in 465 ms of which 0 ms to minimize.
[2022-06-08 20:31:41] [INFO ] Deduced a trap composed of 44 places in 433 ms of which 1 ms to minimize.
[2022-06-08 20:31:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4122 ms
[2022-06-08 20:31:42] [INFO ] Computed and/alt/rep : 272/530/272 causal constraints (skipped 828 transitions) in 1090 ms.
[2022-06-08 20:31:49] [INFO ] Deduced a trap composed of 43 places in 333 ms of which 1 ms to minimize.
[2022-06-08 20:31:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 478 ms
[2022-06-08 20:31:49] [INFO ] Added : 186 causal constraints over 38 iterations in 7942 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-06-08 20:31:49] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-06-08 20:31:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:31:50] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2022-06-08 20:31:50] [INFO ] [Real]Added 678 Read/Feed constraints in 546 ms returned sat
[2022-06-08 20:31:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:31:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-08 20:31:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:31:51] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2022-06-08 20:31:51] [INFO ] [Nat]Added 678 Read/Feed constraints in 596 ms returned sat
[2022-06-08 20:31:52] [INFO ] Deduced a trap composed of 47 places in 731 ms of which 1 ms to minimize.
[2022-06-08 20:31:53] [INFO ] Deduced a trap composed of 41 places in 477 ms of which 0 ms to minimize.
[2022-06-08 20:31:53] [INFO ] Deduced a trap composed of 61 places in 443 ms of which 1 ms to minimize.
[2022-06-08 20:31:54] [INFO ] Deduced a trap composed of 40 places in 615 ms of which 1 ms to minimize.
[2022-06-08 20:31:55] [INFO ] Deduced a trap composed of 50 places in 648 ms of which 1 ms to minimize.
[2022-06-08 20:31:56] [INFO ] Deduced a trap composed of 51 places in 665 ms of which 0 ms to minimize.
[2022-06-08 20:31:56] [INFO ] Deduced a trap composed of 40 places in 411 ms of which 0 ms to minimize.
[2022-06-08 20:31:57] [INFO ] Deduced a trap composed of 39 places in 405 ms of which 1 ms to minimize.
[2022-06-08 20:31:58] [INFO ] Deduced a trap composed of 35 places in 557 ms of which 0 ms to minimize.
[2022-06-08 20:31:58] [INFO ] Deduced a trap composed of 63 places in 565 ms of which 0 ms to minimize.
[2022-06-08 20:31:59] [INFO ] Deduced a trap composed of 35 places in 591 ms of which 0 ms to minimize.
[2022-06-08 20:31:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 8128 ms
[2022-06-08 20:32:00] [INFO ] Computed and/alt/rep : 272/530/272 causal constraints (skipped 828 transitions) in 262 ms.
[2022-06-08 20:32:07] [INFO ] Added : 183 causal constraints over 37 iterations in 7521 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 155 ms.
[2022-06-08 20:32:07] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-06-08 20:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:32:08] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2022-06-08 20:32:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:32:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2022-06-08 20:32:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:32:08] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2022-06-08 20:32:09] [INFO ] [Nat]Added 678 Read/Feed constraints in 862 ms returned sat
[2022-06-08 20:32:10] [INFO ] Deduced a trap composed of 47 places in 666 ms of which 1 ms to minimize.
[2022-06-08 20:32:11] [INFO ] Deduced a trap composed of 51 places in 699 ms of which 0 ms to minimize.
[2022-06-08 20:32:12] [INFO ] Deduced a trap composed of 36 places in 690 ms of which 0 ms to minimize.
[2022-06-08 20:32:12] [INFO ] Deduced a trap composed of 44 places in 624 ms of which 0 ms to minimize.
[2022-06-08 20:32:13] [INFO ] Deduced a trap composed of 52 places in 671 ms of which 0 ms to minimize.
[2022-06-08 20:32:14] [INFO ] Deduced a trap composed of 33 places in 638 ms of which 2 ms to minimize.
[2022-06-08 20:32:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5186 ms
[2022-06-08 20:32:15] [INFO ] Computed and/alt/rep : 272/530/272 causal constraints (skipped 828 transitions) in 370 ms.
[2022-06-08 20:32:23] [INFO ] Deduced a trap composed of 54 places in 454 ms of which 0 ms to minimize.
[2022-06-08 20:32:24] [INFO ] Deduced a trap composed of 38 places in 496 ms of which 1 ms to minimize.
[2022-06-08 20:32:25] [INFO ] Deduced a trap composed of 35 places in 652 ms of which 2 ms to minimize.
[2022-06-08 20:32:26] [INFO ] Deduced a trap composed of 43 places in 400 ms of which 1 ms to minimize.
[2022-06-08 20:32:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2862 ms
[2022-06-08 20:32:26] [INFO ] Added : 184 causal constraints over 37 iterations in 11515 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-06-08 20:32:26] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-08 20:32:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:32:26] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2022-06-08 20:32:27] [INFO ] [Real]Added 678 Read/Feed constraints in 626 ms returned sat
[2022-06-08 20:32:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:32:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-08 20:32:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:32:27] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2022-06-08 20:32:28] [INFO ] [Nat]Added 678 Read/Feed constraints in 913 ms returned sat
[2022-06-08 20:32:29] [INFO ] Deduced a trap composed of 42 places in 832 ms of which 1 ms to minimize.
[2022-06-08 20:32:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1018 ms
[2022-06-08 20:32:30] [INFO ] Computed and/alt/rep : 272/530/272 causal constraints (skipped 828 transitions) in 209 ms.
[2022-06-08 20:32:36] [INFO ] Added : 186 causal constraints over 38 iterations in 6319 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 109 ms.
[2022-06-08 20:32:36] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-08 20:32:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:32:36] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2022-06-08 20:32:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:32:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-08 20:32:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:32:37] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2022-06-08 20:32:37] [INFO ] [Nat]Added 678 Read/Feed constraints in 668 ms returned sat
[2022-06-08 20:32:38] [INFO ] Deduced a trap composed of 60 places in 471 ms of which 0 ms to minimize.
[2022-06-08 20:32:38] [INFO ] Deduced a trap composed of 44 places in 431 ms of which 0 ms to minimize.
[2022-06-08 20:32:39] [INFO ] Deduced a trap composed of 49 places in 567 ms of which 1 ms to minimize.
[2022-06-08 20:32:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1902 ms
[2022-06-08 20:32:39] [INFO ] Computed and/alt/rep : 272/530/272 causal constraints (skipped 828 transitions) in 202 ms.
[2022-06-08 20:32:46] [INFO ] Deduced a trap composed of 52 places in 389 ms of which 1 ms to minimize.
[2022-06-08 20:32:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 545 ms
[2022-06-08 20:32:46] [INFO ] Added : 185 causal constraints over 37 iterations in 7067 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 67 ms.
Incomplete Parikh walk after 2961800 steps, including 1002 resets, run finished after 15936 ms. (steps per millisecond=185 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 2021500 steps, including 1002 resets, run finished after 10568 ms. (steps per millisecond=191 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2767800 steps, including 1002 resets, run finished after 14470 ms. (steps per millisecond=191 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2883300 steps, including 1002 resets, run finished after 15560 ms. (steps per millisecond=185 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2024000 steps, including 1002 resets, run finished after 11148 ms. (steps per millisecond=181 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2026900 steps, including 1002 resets, run finished after 11080 ms. (steps per millisecond=182 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 57 out of 283 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 283/283 places, 1129/1129 transitions.
Graph (trivial) has 127 edges and 283 vertex of which 6 / 283 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 280 transition count 1072
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 62 rules applied. Total rules applied 114 place count 229 transition count 1061
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 123 place count 220 transition count 1061
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 123 place count 220 transition count 1051
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 143 place count 210 transition count 1051
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 151 place count 202 transition count 1043
Iterating global reduction 3 with 8 rules applied. Total rules applied 159 place count 202 transition count 1043
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 201 transition count 1042
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 201 transition count 1042
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 177 place count 193 transition count 1034
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 179 place count 193 transition count 1032
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 187 place count 185 transition count 1024
Iterating global reduction 4 with 8 rules applied. Total rules applied 195 place count 185 transition count 1024
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 198 place count 182 transition count 1021
Iterating global reduction 4 with 3 rules applied. Total rules applied 201 place count 182 transition count 1021
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 182 transition count 1020
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 215 place count 182 transition count 1007
Free-agglomeration rule applied 17 times.
Iterating global reduction 5 with 17 rules applied. Total rules applied 232 place count 182 transition count 990
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 250 place count 165 transition count 989
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 265 place count 165 transition count 974
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 268 place count 165 transition count 974
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 269 place count 165 transition count 973
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 270 place count 165 transition count 973
Applied a total of 270 rules in 734 ms. Remains 165 /283 variables (removed 118) and now considering 973/1129 (removed 156) transitions.
Finished structural reductions, in 1 iterations. Remains : 165/283 places, 973/1129 transitions.
[2022-06-08 20:34:06] [INFO ] Flatten gal took : 85 ms
[2022-06-08 20:34:06] [INFO ] Flatten gal took : 80 ms
[2022-06-08 20:34:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11351317222080193215.gal : 16 ms
[2022-06-08 20:34:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16163807142151430353.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/ReachabilityCardinality11351317222080193215.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16163807142151430353.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/ReachabilityCardinality11351317222080193215.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16163807142151430353.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16163807142151430353.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :11 after 14
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :14 after 51
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :51 after 577
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :577 after 2377
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2377 after 12601
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :12601 after 88752
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :88752 after 487641
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :487641 after 2.07397e+06
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :2.07397e+06 after 3.05602e+06
Detected timeout of ITS tools.
[2022-06-08 20:34:21] [INFO ] Flatten gal took : 83 ms
[2022-06-08 20:34:21] [INFO ] Applying decomposition
[2022-06-08 20:34:21] [INFO ] Flatten gal took : 81 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/graph15466598774640693779.txt, -o, /tmp/graph15466598774640693779.bin, -w, /tmp/graph15466598774640693779.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/graph15466598774640693779.bin, -l, -1, -v, -w, /tmp/graph15466598774640693779.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 20:34:22] [INFO ] Decomposing Gal with order
[2022-06-08 20:34:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 20:34:22] [INFO ] Removed a total of 1227 redundant transitions.
[2022-06-08 20:34:22] [INFO ] Flatten gal took : 279 ms
[2022-06-08 20:34:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 546 labels/synchronizations in 42 ms.
[2022-06-08 20:34:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5273673891890232019.gal : 12 ms
[2022-06-08 20:34:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7998266809993841442.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/ReachabilityCardinality5273673891890232019.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7998266809993841442.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/ReachabilityCardinality5273673891890232019.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7998266809993841442.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7998266809993841442.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :25 after 865
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :865 after 19441
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19441 after 28513
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :28513 after 6.05837e+06
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :6.05837e+06 after 6.16282e+06
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :6.16282e+06 after 7.00663e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5241210616964172039
[2022-06-08 20:34:37] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5241210616964172039
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/ltsmin5241210616964172039]
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/ltsmin5241210616964172039] 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/ltsmin5241210616964172039] 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 48384 resets, run finished after 5245 ms. (steps per millisecond=190 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5020 resets, run finished after 1601 ms. (steps per millisecond=624 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4973 resets, run finished after 2163 ms. (steps per millisecond=462 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4944 resets, run finished after 1296 ms. (steps per millisecond=771 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5038 resets, run finished after 787 ms. (steps per millisecond=1270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5035 resets, run finished after 824 ms. (steps per millisecond=1213 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 9002289 steps, run timeout after 30001 ms. (steps per millisecond=300 ) properties seen :{1=1, 2=1, 3=1, 4=1}
Probabilistic random walk after 9002289 steps, saw 1391600 distinct states, run finished after 30006 ms. (steps per millisecond=300 ) properties seen :{1=1, 2=1, 3=1, 4=1}
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 973 rows 165 cols
[2022-06-08 20:35:20] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-08 20:35:20] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-06-08 20:35:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:35:20] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2022-06-08 20:35:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:35:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-08 20:35:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:35:21] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2022-06-08 20:35:21] [INFO ] State equation strengthened by 721 read => feed constraints.
[2022-06-08 20:35:21] [INFO ] [Nat]Added 721 Read/Feed constraints in 775 ms returned sat
[2022-06-08 20:35:22] [INFO ] Deduced a trap composed of 15 places in 396 ms of which 1 ms to minimize.
[2022-06-08 20:35:22] [INFO ] Deduced a trap composed of 29 places in 339 ms of which 0 ms to minimize.
[2022-06-08 20:35:23] [INFO ] Deduced a trap composed of 21 places in 296 ms of which 0 ms to minimize.
[2022-06-08 20:35:23] [INFO ] Deduced a trap composed of 28 places in 265 ms of which 0 ms to minimize.
[2022-06-08 20:35:23] [INFO ] Deduced a trap composed of 38 places in 302 ms of which 1 ms to minimize.
[2022-06-08 20:35:24] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 1 ms to minimize.
[2022-06-08 20:35:24] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 1 ms to minimize.
[2022-06-08 20:35:25] [INFO ] Deduced a trap composed of 16 places in 401 ms of which 15 ms to minimize.
[2022-06-08 20:35:25] [INFO ] Deduced a trap composed of 25 places in 277 ms of which 0 ms to minimize.
[2022-06-08 20:35:25] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 1 ms to minimize.
[2022-06-08 20:35:26] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 1 ms to minimize.
[2022-06-08 20:35:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4144 ms
[2022-06-08 20:35:26] [INFO ] Computed and/alt/rep : 150/236/150 causal constraints (skipped 795 transitions) in 226 ms.
[2022-06-08 20:35:28] [INFO ] Added : 125 causal constraints over 25 iterations in 2853 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 57 ms.
Incomplete Parikh walk after 1581100 steps, including 67739 resets, run finished after 7944 ms. (steps per millisecond=199 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 16 out of 165 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 165/165 places, 973/973 transitions.
Graph (trivial) has 87 edges and 165 vertex of which 4 / 165 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 163 transition count 938
Reduce places removed 31 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 1 with 33 rules applied. Total rules applied 65 place count 132 transition count 936
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 131 transition count 936
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 131 transition count 933
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 128 transition count 933
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 77 place count 123 transition count 928
Iterating global reduction 3 with 5 rules applied. Total rules applied 82 place count 123 transition count 928
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 121 transition count 925
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 121 transition count 925
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 120 transition count 924
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 120 transition count 924
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 97 place count 120 transition count 915
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 119 place count 109 transition count 904
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 127 place count 109 transition count 896
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 135 place count 101 transition count 888
Iterating global reduction 5 with 8 rules applied. Total rules applied 143 place count 101 transition count 888
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 144 place count 101 transition count 887
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 146 place count 99 transition count 885
Iterating global reduction 6 with 2 rules applied. Total rules applied 148 place count 99 transition count 885
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 152 place count 99 transition count 881
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 153 place count 98 transition count 880
Iterating global reduction 7 with 1 rules applied. Total rules applied 154 place count 98 transition count 880
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 155 place count 98 transition count 879
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 157 place count 97 transition count 892
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 163 place count 97 transition count 886
Free-agglomeration rule applied 14 times with reduction of 173 identical transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 177 place count 97 transition count 699
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 73 transitions.
Iterating post reduction 8 with 87 rules applied. Total rules applied 264 place count 83 transition count 626
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 9 with 60 rules applied. Total rules applied 324 place count 83 transition count 566
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 326 place count 83 transition count 566
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 328 place count 83 transition count 564
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 329 place count 83 transition count 564
Applied a total of 329 rules in 516 ms. Remains 83 /165 variables (removed 82) and now considering 564/973 (removed 409) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/165 places, 564/973 transitions.
[2022-06-08 20:35:37] [INFO ] Flatten gal took : 39 ms
[2022-06-08 20:35:37] [INFO ] Flatten gal took : 38 ms
[2022-06-08 20:35:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15926681576381825958.gal : 7 ms
[2022-06-08 20:35:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7949430403376790774.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/ReachabilityCardinality15926681576381825958.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7949430403376790774.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/ReachabilityCardinality15926681576381825958.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7949430403376790774.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7949430403376790774.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 73
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :73 after 169
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :169 after 2444
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2444 after 7484
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7484 after 692216
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,8.0722e+06,4.89233,74272,2,9139,13,130805,7,0,930,78382,0
Total reachable state count : 8072205

Verifying 1 reachability properties.
Invariant property StigmergyCommit-PT-07b-ReachabilityCardinality-02 is true.
FORMULA StigmergyCommit-PT-07b-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyCommit-PT-07b-ReachabilityCardinality-02,0,4.91148,74272,1,0,13,130805,7,0,953,78382,0
All properties solved without resorting to model-checking.

BK_STOP 1654720543738

--------------------
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="StigmergyCommit-PT-07b"
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 StigmergyCommit-PT-07b, 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-165463878400068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-07b.tgz
mv StigmergyCommit-PT-07b 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;