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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 6.8K May 30 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 30 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 30 15:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 30 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 25 13:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 25 13:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 13:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 13K May 30 15:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 30 15:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 15:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K May 30 15:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:02 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 38M 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-08b-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-08b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654721162656

Running Version 0
[2022-06-08 20:46:05] [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:46:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 20:46:07] [INFO ] Load time of PNML (sax parser for PT used): 2374 ms
[2022-06-08 20:46:07] [INFO ] Transformed 2746 places.
[2022-06-08 20:46:08] [INFO ] Transformed 42776 transitions.
[2022-06-08 20:46:08] [INFO ] Found NUPN structural information;
[2022-06-08 20:46:08] [INFO ] Parsed PT model containing 2746 places and 42776 transitions in 2747 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 62 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 15) seen :3
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 42776 rows 2746 cols
[2022-06-08 20:46:12] [INFO ] Computed 10 place invariants in 2075 ms
[2022-06-08 20:46:14] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:12
[2022-06-08 20:46:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 37 ms returned sat
[2022-06-08 20:46:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:46:39] [INFO ] [Nat]Absence check using state equation in 23121 ms returned unsat :2 sat :10
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-08 20:46:39] [INFO ] SMT Verify possible in nat domain returned unsat :2 sat :10
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Support contains 102 out of 2746 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2746/2746 places, 42776/42776 transitions.
Graph (trivial) has 2539 edges and 2746 vertex of which 169 / 2746 are part of one of the 25 SCC in 31 ms
Free SCC test removed 144 places
Drop transitions removed 183 transitions
Reduce isomorphic transitions removed 183 transitions.
Graph (complete) has 4689 edges and 2602 vertex of which 2586 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.223 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 1853 transitions
Trivial Post-agglo rules discarded 1853 transitions
Performed 1853 trivial Post agglomeration. Transition count delta: 1853
Iterating post reduction 0 with 1860 rules applied. Total rules applied 1862 place count 2586 transition count 40725
Reduce places removed 1853 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 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 1 with 1888 rules applied. Total rules applied 3750 place count 733 transition count 40690
Reduce places removed 16 places and 0 transitions.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Iterating post reduction 2 with 88 rules applied. Total rules applied 3838 place count 717 transition count 40618
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 3910 place count 645 transition count 40618
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 98 Pre rules applied. Total rules applied 3910 place count 645 transition count 40520
Deduced a syphon composed of 98 places in 65 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 4106 place count 547 transition count 40520
Discarding 90 places :
Symmetric choice reduction at 4 with 90 rule applications. Total rules 4196 place count 457 transition count 40430
Iterating global reduction 4 with 90 rules applied. Total rules applied 4286 place count 457 transition count 40430
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 4330 place count 413 transition count 2555
Iterating global reduction 4 with 44 rules applied. Total rules applied 4374 place count 413 transition count 2555
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 4388 place count 413 transition count 2541
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 4398 place count 403 transition count 2531
Iterating global reduction 5 with 10 rules applied. Total rules applied 4408 place count 403 transition count 2531
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 4416 place count 395 transition count 2523
Iterating global reduction 5 with 8 rules applied. Total rules applied 4424 place count 395 transition count 2523
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 4431 place count 395 transition count 2516
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 4513 place count 354 transition count 2475
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4514 place count 354 transition count 2474
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 4523 place count 345 transition count 2465
Iterating global reduction 7 with 9 rules applied. Total rules applied 4532 place count 345 transition count 2465
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 4538 place count 339 transition count 2459
Iterating global reduction 7 with 6 rules applied. Total rules applied 4544 place count 339 transition count 2459
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 4550 place count 333 transition count 2453
Iterating global reduction 7 with 6 rules applied. Total rules applied 4556 place count 333 transition count 2453
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
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 4564 place count 329 transition count 2458
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 4566 place count 329 transition count 2456
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 4569 place count 329 transition count 2453
Free-agglomeration rule applied 75 times.
Iterating global reduction 8 with 75 rules applied. Total rules applied 4644 place count 329 transition count 2378
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 8 with 75 rules applied. Total rules applied 4719 place count 254 transition count 2378
Drop transitions removed 512 transitions
Redundant transition composition rules discarded 512 transitions
Iterating global reduction 9 with 512 rules applied. Total rules applied 5231 place count 254 transition count 1866
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 5232 place count 254 transition count 1865
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 5233 place count 253 transition count 1865
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 5244 place count 253 transition count 1865
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 5246 place count 253 transition count 1865
Applied a total of 5246 rules in 14952 ms. Remains 253 /2746 variables (removed 2493) and now considering 1865/42776 (removed 40911) transitions.
Finished structural reductions, in 1 iterations. Remains : 253/2746 places, 1865/42776 transitions.
[2022-06-08 20:46:55] [INFO ] Flatten gal took : 699 ms
[2022-06-08 20:46:55] [INFO ] Flatten gal took : 332 ms
[2022-06-08 20:46:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13049816897813332005.gal : 169 ms
[2022-06-08 20:46:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1476280401825480853.prop : 12 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/ReachabilityCardinality13049816897813332005.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1476280401825480853.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/ReachabilityCardinality13049816897813332005.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1476280401825480853.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1476280401825480853.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :6 after 8
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :14 after 23
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :23 after 177
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :177 after 2835
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :2835 after 3443
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :3443 after 12939
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :12939 after 26127
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :26127 after 1.70513e+07
Detected timeout of ITS tools.
[2022-06-08 20:47:11] [INFO ] Flatten gal took : 341 ms
[2022-06-08 20:47:11] [INFO ] Applying decomposition
[2022-06-08 20:47:11] [INFO ] Flatten gal took : 334 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/graph4388393249586849066.txt, -o, /tmp/graph4388393249586849066.bin, -w, /tmp/graph4388393249586849066.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/graph4388393249586849066.bin, -l, -1, -v, -w, /tmp/graph4388393249586849066.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 20:47:12] [INFO ] Decomposing Gal with order
[2022-06-08 20:47:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 20:47:14] [INFO ] Removed a total of 994 redundant transitions.
[2022-06-08 20:47:14] [INFO ] Flatten gal took : 1210 ms
[2022-06-08 20:47:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 1269 labels/synchronizations in 198 ms.
[2022-06-08 20:47:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2858285354309839735.gal : 73 ms
[2022-06-08 20:47:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18434276977378667915.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/ReachabilityCardinality2858285354309839735.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18434276977378667915.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/ReachabilityCardinality2858285354309839735.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18434276977378667915.prop --nowitness
Loading property file /tmp/ReachabilityCardinality18434276977378667915.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :1 after 196
Invariant property StigmergyCommit-PT-08b-ReachabilityCardinality-13 does not hold.
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :196 after 2284
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :2284 after 5020
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :5020 after 10380
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :10380 after 21544
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :21544 after 40892
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :40892 after 47356
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :47356 after 47996
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :47996 after 58626
Invariant property StigmergyCommit-PT-08b-ReachabilityCardinality-04 does not hold.
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property StigmergyCommit-PT-08b-ReachabilityCardinality-00 does not hold.
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :58626 after 1.36848e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9964833474311790821
[2022-06-08 20:47:30] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9964833474311790821
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/ltsmin9964833474311790821]
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/ltsmin9964833474311790821] 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/ltsmin9964833474311790821] 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 27721 resets, run finished after 6950 ms. (steps per millisecond=143 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3971 resets, run finished after 1149 ms. (steps per millisecond=870 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4184 resets, run finished after 1512 ms. (steps per millisecond=661 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3989 resets, run finished after 1167 ms. (steps per millisecond=856 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3980 resets, run finished after 1269 ms. (steps per millisecond=788 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3982 resets, run finished after 1262 ms. (steps per millisecond=792 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3968 resets, run finished after 2162 ms. (steps per millisecond=462 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4108 resets, run finished after 1466 ms. (steps per millisecond=682 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 6054068 steps, run timeout after 30001 ms. (steps per millisecond=201 ) properties seen :{}
Probabilistic random walk after 6054068 steps, saw 840288 distinct states, run finished after 30023 ms. (steps per millisecond=201 ) properties seen :{}
Running SMT prover for 7 properties.
// Phase 1: matrix 1865 rows 253 cols
[2022-06-08 20:48:18] [INFO ] Computed 9 place invariants in 26 ms
[2022-06-08 20:48:18] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-06-08 20:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:48:19] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2022-06-08 20:48:19] [INFO ] State equation strengthened by 1487 read => feed constraints.
[2022-06-08 20:48:22] [INFO ] [Real]Added 1487 Read/Feed constraints in 2742 ms returned sat
[2022-06-08 20:48:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:48:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2022-06-08 20:48:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:48:23] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2022-06-08 20:48:25] [INFO ] [Nat]Added 1487 Read/Feed constraints in 2375 ms returned sat
[2022-06-08 20:48:26] [INFO ] Deduced a trap composed of 25 places in 1077 ms of which 12 ms to minimize.
[2022-06-08 20:48:30] [INFO ] Deduced a trap composed of 36 places in 3408 ms of which 1 ms to minimize.
[2022-06-08 20:48:31] [INFO ] Deduced a trap composed of 35 places in 781 ms of which 2 ms to minimize.
[2022-06-08 20:48:31] [INFO ] Deduced a trap composed of 45 places in 713 ms of which 2 ms to minimize.
[2022-06-08 20:48:32] [INFO ] Deduced a trap composed of 49 places in 903 ms of which 2 ms to minimize.
[2022-06-08 20:48:33] [INFO ] Deduced a trap composed of 33 places in 969 ms of which 1 ms to minimize.
[2022-06-08 20:48:34] [INFO ] Deduced a trap composed of 36 places in 679 ms of which 1 ms to minimize.
[2022-06-08 20:48:35] [INFO ] Deduced a trap composed of 57 places in 662 ms of which 0 ms to minimize.
[2022-06-08 20:48:36] [INFO ] Deduced a trap composed of 31 places in 627 ms of which 0 ms to minimize.
[2022-06-08 20:48:36] [INFO ] Deduced a trap composed of 35 places in 553 ms of which 1 ms to minimize.
[2022-06-08 20:48:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 11281 ms
[2022-06-08 20:48:38] [INFO ] Computed and/alt/rep : 192/380/192 causal constraints (skipped 1672 transitions) in 1421 ms.
[2022-06-08 20:48:42] [INFO ] Added : 147 causal constraints over 30 iterations in 5279 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-06-08 20:48:42] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2022-06-08 20:48:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:48:42] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2022-06-08 20:48:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:48:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2022-06-08 20:48:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:48:43] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2022-06-08 20:48:46] [INFO ] [Nat]Added 1487 Read/Feed constraints in 2542 ms returned sat
[2022-06-08 20:48:47] [INFO ] Deduced a trap composed of 36 places in 1115 ms of which 1 ms to minimize.
[2022-06-08 20:48:48] [INFO ] Deduced a trap composed of 29 places in 1071 ms of which 1 ms to minimize.
[2022-06-08 20:48:49] [INFO ] Deduced a trap composed of 45 places in 1014 ms of which 1 ms to minimize.
[2022-06-08 20:48:50] [INFO ] Deduced a trap composed of 31 places in 863 ms of which 1 ms to minimize.
[2022-06-08 20:48:51] [INFO ] Deduced a trap composed of 25 places in 824 ms of which 2 ms to minimize.
[2022-06-08 20:48:52] [INFO ] Deduced a trap composed of 27 places in 764 ms of which 1 ms to minimize.
[2022-06-08 20:48:53] [INFO ] Deduced a trap composed of 37 places in 776 ms of which 1 ms to minimize.
[2022-06-08 20:48:53] [INFO ] Deduced a trap composed of 37 places in 761 ms of which 1 ms to minimize.
[2022-06-08 20:48:54] [INFO ] Deduced a trap composed of 29 places in 710 ms of which 5 ms to minimize.
[2022-06-08 20:48:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 8737 ms
[2022-06-08 20:48:56] [INFO ] Computed and/alt/rep : 192/380/192 causal constraints (skipped 1672 transitions) in 1340 ms.
[2022-06-08 20:48:59] [INFO ] Added : 145 causal constraints over 29 iterations in 5124 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-08 20:49:00] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-06-08 20:49:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:49:00] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2022-06-08 20:49:03] [INFO ] [Real]Added 1487 Read/Feed constraints in 2418 ms returned sat
[2022-06-08 20:49:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:49:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2022-06-08 20:49:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:49:03] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2022-06-08 20:49:06] [INFO ] [Nat]Added 1487 Read/Feed constraints in 2343 ms returned sat
[2022-06-08 20:49:07] [INFO ] Deduced a trap composed of 49 places in 1057 ms of which 1 ms to minimize.
[2022-06-08 20:49:08] [INFO ] Deduced a trap composed of 44 places in 1039 ms of which 0 ms to minimize.
[2022-06-08 20:49:09] [INFO ] Deduced a trap composed of 26 places in 954 ms of which 1 ms to minimize.
[2022-06-08 20:49:10] [INFO ] Deduced a trap composed of 37 places in 954 ms of which 0 ms to minimize.
[2022-06-08 20:49:11] [INFO ] Deduced a trap composed of 37 places in 855 ms of which 1 ms to minimize.
[2022-06-08 20:49:12] [INFO ] Deduced a trap composed of 40 places in 816 ms of which 0 ms to minimize.
[2022-06-08 20:49:13] [INFO ] Deduced a trap composed of 34 places in 753 ms of which 0 ms to minimize.
[2022-06-08 20:49:13] [INFO ] Deduced a trap composed of 38 places in 708 ms of which 0 ms to minimize.
[2022-06-08 20:49:14] [INFO ] Deduced a trap composed of 31 places in 665 ms of which 0 ms to minimize.
[2022-06-08 20:49:15] [INFO ] Deduced a trap composed of 53 places in 661 ms of which 1 ms to minimize.
[2022-06-08 20:49:16] [INFO ] Deduced a trap composed of 35 places in 659 ms of which 1 ms to minimize.
[2022-06-08 20:49:17] [INFO ] Deduced a trap composed of 28 places in 888 ms of which 1 ms to minimize.
[2022-06-08 20:49:18] [INFO ] Deduced a trap composed of 29 places in 770 ms of which 8 ms to minimize.
[2022-06-08 20:49:18] [INFO ] Deduced a trap composed of 37 places in 860 ms of which 1 ms to minimize.
[2022-06-08 20:49:19] [INFO ] Deduced a trap composed of 31 places in 832 ms of which 1 ms to minimize.
[2022-06-08 20:49:19] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 13743 ms
[2022-06-08 20:49:20] [INFO ] Computed and/alt/rep : 192/380/192 causal constraints (skipped 1672 transitions) in 856 ms.
[2022-06-08 20:49:24] [INFO ] Added : 146 causal constraints over 30 iterations in 4531 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-06-08 20:49:24] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-06-08 20:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:49:25] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2022-06-08 20:49:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:49:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-06-08 20:49:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:49:25] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2022-06-08 20:49:28] [INFO ] [Nat]Added 1487 Read/Feed constraints in 2576 ms returned sat
[2022-06-08 20:49:29] [INFO ] Deduced a trap composed of 30 places in 1108 ms of which 1 ms to minimize.
[2022-06-08 20:49:30] [INFO ] Deduced a trap composed of 39 places in 943 ms of which 0 ms to minimize.
[2022-06-08 20:49:31] [INFO ] Deduced a trap composed of 27 places in 881 ms of which 0 ms to minimize.
[2022-06-08 20:49:32] [INFO ] Deduced a trap composed of 37 places in 828 ms of which 0 ms to minimize.
[2022-06-08 20:49:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4205 ms
[2022-06-08 20:49:33] [INFO ] Computed and/alt/rep : 192/380/192 causal constraints (skipped 1672 transitions) in 862 ms.
[2022-06-08 20:49:37] [INFO ] Added : 147 causal constraints over 30 iterations in 4761 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-08 20:49:37] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-06-08 20:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:49:38] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2022-06-08 20:49:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:49:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-06-08 20:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:49:38] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2022-06-08 20:49:41] [INFO ] [Nat]Added 1487 Read/Feed constraints in 2363 ms returned sat
[2022-06-08 20:49:42] [INFO ] Deduced a trap composed of 37 places in 1051 ms of which 0 ms to minimize.
[2022-06-08 20:49:43] [INFO ] Deduced a trap composed of 47 places in 990 ms of which 0 ms to minimize.
[2022-06-08 20:49:44] [INFO ] Deduced a trap composed of 30 places in 965 ms of which 1 ms to minimize.
[2022-06-08 20:49:45] [INFO ] Deduced a trap composed of 44 places in 887 ms of which 1 ms to minimize.
[2022-06-08 20:49:46] [INFO ] Deduced a trap composed of 37 places in 806 ms of which 0 ms to minimize.
[2022-06-08 20:49:47] [INFO ] Deduced a trap composed of 41 places in 805 ms of which 1 ms to minimize.
[2022-06-08 20:49:47] [INFO ] Deduced a trap composed of 31 places in 747 ms of which 1 ms to minimize.
[2022-06-08 20:49:48] [INFO ] Deduced a trap composed of 37 places in 763 ms of which 1 ms to minimize.
[2022-06-08 20:49:49] [INFO ] Deduced a trap composed of 32 places in 690 ms of which 4 ms to minimize.
[2022-06-08 20:49:50] [INFO ] Deduced a trap composed of 38 places in 693 ms of which 14 ms to minimize.
[2022-06-08 20:49:51] [INFO ] Deduced a trap composed of 32 places in 727 ms of which 1 ms to minimize.
[2022-06-08 20:49:51] [INFO ] Deduced a trap composed of 25 places in 745 ms of which 1 ms to minimize.
[2022-06-08 20:49:53] [INFO ] Deduced a trap composed of 32 places in 1046 ms of which 0 ms to minimize.
[2022-06-08 20:49:54] [INFO ] Deduced a trap composed of 42 places in 1091 ms of which 20 ms to minimize.
[2022-06-08 20:49:55] [INFO ] Deduced a trap composed of 44 places in 957 ms of which 0 ms to minimize.
[2022-06-08 20:49:56] [INFO ] Deduced a trap composed of 29 places in 873 ms of which 0 ms to minimize.
[2022-06-08 20:49:57] [INFO ] Deduced a trap composed of 50 places in 801 ms of which 1 ms to minimize.
[2022-06-08 20:49:58] [INFO ] Deduced a trap composed of 39 places in 873 ms of which 0 ms to minimize.
[2022-06-08 20:49:58] [INFO ] Deduced a trap composed of 30 places in 803 ms of which 0 ms to minimize.
[2022-06-08 20:49:59] [INFO ] Deduced a trap composed of 33 places in 735 ms of which 0 ms to minimize.
[2022-06-08 20:50:00] [INFO ] Deduced a trap composed of 36 places in 701 ms of which 0 ms to minimize.
[2022-06-08 20:50:01] [INFO ] Deduced a trap composed of 27 places in 634 ms of which 0 ms to minimize.
[2022-06-08 20:50:02] [INFO ] Deduced a trap composed of 39 places in 711 ms of which 1 ms to minimize.
[2022-06-08 20:50:02] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 21027 ms
[2022-06-08 20:50:03] [INFO ] Computed and/alt/rep : 192/380/192 causal constraints (skipped 1672 transitions) in 896 ms.
[2022-06-08 20:50:06] [INFO ] Added : 150 causal constraints over 30 iterations in 4718 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-06-08 20:50:07] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2022-06-08 20:50:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:50:07] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2022-06-08 20:50:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:50:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2022-06-08 20:50:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:50:08] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2022-06-08 20:50:10] [INFO ] [Nat]Added 1487 Read/Feed constraints in 2411 ms returned sat
[2022-06-08 20:50:11] [INFO ] Deduced a trap composed of 31 places in 790 ms of which 0 ms to minimize.
[2022-06-08 20:50:12] [INFO ] Deduced a trap composed of 23 places in 725 ms of which 0 ms to minimize.
[2022-06-08 20:50:13] [INFO ] Deduced a trap composed of 35 places in 713 ms of which 1 ms to minimize.
[2022-06-08 20:50:13] [INFO ] Deduced a trap composed of 33 places in 684 ms of which 0 ms to minimize.
[2022-06-08 20:50:14] [INFO ] Deduced a trap composed of 36 places in 645 ms of which 1 ms to minimize.
[2022-06-08 20:50:15] [INFO ] Deduced a trap composed of 35 places in 634 ms of which 1 ms to minimize.
[2022-06-08 20:50:16] [INFO ] Deduced a trap composed of 41 places in 604 ms of which 0 ms to minimize.
[2022-06-08 20:50:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 5372 ms
[2022-06-08 20:50:16] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2022-06-08 20:50:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:50:16] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2022-06-08 20:50:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:50:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2022-06-08 20:50:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:50:17] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2022-06-08 20:50:19] [INFO ] [Nat]Added 1487 Read/Feed constraints in 2381 ms returned sat
[2022-06-08 20:50:20] [INFO ] Deduced a trap composed of 39 places in 967 ms of which 1 ms to minimize.
[2022-06-08 20:50:21] [INFO ] Deduced a trap composed of 39 places in 927 ms of which 0 ms to minimize.
[2022-06-08 20:50:22] [INFO ] Deduced a trap composed of 31 places in 838 ms of which 0 ms to minimize.
[2022-06-08 20:50:23] [INFO ] Deduced a trap composed of 29 places in 785 ms of which 1 ms to minimize.
[2022-06-08 20:50:24] [INFO ] Deduced a trap composed of 36 places in 758 ms of which 1 ms to minimize.
[2022-06-08 20:50:25] [INFO ] Deduced a trap composed of 38 places in 706 ms of which 1 ms to minimize.
[2022-06-08 20:50:26] [INFO ] Deduced a trap composed of 32 places in 765 ms of which 1 ms to minimize.
[2022-06-08 20:50:26] [INFO ] Deduced a trap composed of 42 places in 769 ms of which 0 ms to minimize.
[2022-06-08 20:50:27] [INFO ] Deduced a trap composed of 35 places in 815 ms of which 1 ms to minimize.
[2022-06-08 20:50:28] [INFO ] Deduced a trap composed of 28 places in 810 ms of which 0 ms to minimize.
[2022-06-08 20:50:29] [INFO ] Deduced a trap composed of 32 places in 739 ms of which 1 ms to minimize.
[2022-06-08 20:50:30] [INFO ] Deduced a trap composed of 23 places in 850 ms of which 1 ms to minimize.
[2022-06-08 20:50:31] [INFO ] Deduced a trap composed of 27 places in 783 ms of which 1 ms to minimize.
[2022-06-08 20:50:32] [INFO ] Deduced a trap composed of 25 places in 773 ms of which 0 ms to minimize.
[2022-06-08 20:50:32] [INFO ] Deduced a trap composed of 36 places in 722 ms of which 0 ms to minimize.
[2022-06-08 20:50:33] [INFO ] Deduced a trap composed of 27 places in 706 ms of which 0 ms to minimize.
[2022-06-08 20:50:33] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 14056 ms
[2022-06-08 20:50:34] [INFO ] Computed and/alt/rep : 192/380/192 causal constraints (skipped 1672 transitions) in 845 ms.
[2022-06-08 20:50:38] [INFO ] Added : 151 causal constraints over 31 iterations in 4695 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Interrupted Parikh walk after 3590391 steps, including 108390 resets, run timeout after 30001 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Interrupted Parikh walk after 3713218 steps, including 104136 resets, run timeout after 30001 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Interrupted Parikh walk after 3670149 steps, including 106952 resets, run timeout after 30001 ms. (steps per millisecond=122 ) properties (out of 6) seen :0
Interrupted Parikh walk after 3653908 steps, including 101954 resets, run timeout after 30001 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Support contains 20 out of 253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 253/253 places, 1865/1865 transitions.
Graph (trivial) has 163 edges and 253 vertex of which 8 / 253 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 949 edges and 249 vertex of which 248 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 248 transition count 1781
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 160 place count 174 transition count 1772
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 160 place count 174 transition count 1764
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 176 place count 166 transition count 1764
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 186 place count 156 transition count 1754
Iterating global reduction 2 with 10 rules applied. Total rules applied 196 place count 156 transition count 1754
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 198 place count 156 transition count 1752
Performed 14 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 14 places in 7 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 226 place count 142 transition count 1736
Ensure Unique test removed 264 transitions
Reduce isomorphic transitions removed 264 transitions.
Iterating post reduction 3 with 264 rules applied. Total rules applied 490 place count 142 transition count 1472
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 504 place count 128 transition count 1458
Iterating global reduction 4 with 14 rules applied. Total rules applied 518 place count 128 transition count 1458
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 522 place count 128 transition count 1454
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 527 place count 123 transition count 1449
Iterating global reduction 5 with 5 rules applied. Total rules applied 532 place count 123 transition count 1449
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 536 place count 123 transition count 1445
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 537 place count 122 transition count 1444
Iterating global reduction 6 with 1 rules applied. Total rules applied 538 place count 122 transition count 1444
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 542 place count 120 transition count 1458
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 546 place count 120 transition count 1454
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 567 place count 120 transition count 1433
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 569 place count 119 transition count 1441
Free-agglomeration rule applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 587 place count 119 transition count 1423
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 286 transitions
Reduce isomorphic transitions removed 289 transitions.
Iterating post reduction 7 with 307 rules applied. Total rules applied 894 place count 101 transition count 1134
Renaming transitions due to excessive name length > 1024 char.
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 903 place count 92 transition count 1125
Iterating global reduction 8 with 9 rules applied. Total rules applied 912 place count 92 transition count 1125
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 913 place count 92 transition count 1124
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 915 place count 92 transition count 1124
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 916 place count 92 transition count 1123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 917 place count 91 transition count 1122
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 8 with 8 rules applied. Total rules applied 925 place count 90 transition count 1115
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 9 with 9 rules applied. Total rules applied 934 place count 83 transition count 1113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 936 place count 81 transition count 1113
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 4 Pre rules applied. Total rules applied 936 place count 81 transition count 1109
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 944 place count 77 transition count 1109
Performed 24 Post agglomeration using F-continuation condition with reduction of 957 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 11 with 48 rules applied. Total rules applied 992 place count 53 transition count 128
Drop transitions removed 9 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 11 with 59 rules applied. Total rules applied 1051 place count 53 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1059 place count 49 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 1063 place count 47 transition count 71
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 12 with 7 rules applied. Total rules applied 1070 place count 47 transition count 64
Applied a total of 1070 rules in 1961 ms. Remains 47 /253 variables (removed 206) and now considering 64/1865 (removed 1801) transitions.
Finished structural reductions, in 1 iterations. Remains : 47/253 places, 64/1865 transitions.
[2022-06-08 20:52:40] [INFO ] Flatten gal took : 4 ms
[2022-06-08 20:52:40] [INFO ] Flatten gal took : 2 ms
[2022-06-08 20:52:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6739847578099584068.gal : 2 ms
[2022-06-08 20:52:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1127985636302422391.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/ReachabilityCardinality6739847578099584068.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1127985636302422391.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/ReachabilityCardinality6739847578099584068.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1127985636302422391.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1127985636302422391.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 9
Invariant property StigmergyCommit-PT-08b-ReachabilityCardinality-12 does not hold.
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property StigmergyCommit-PT-08b-ReachabilityCardinality-08 is true.
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property StigmergyCommit-PT-08b-ReachabilityCardinality-02 is true.
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 234
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :234 after 536
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :536 after 594
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :594 after 663
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :663 after 5091
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,42931,0.056589,4956,2,756,15,3827,9,0,278,2264,0
Total reachable state count : 42931

Verifying 6 reachability properties.
Reachability property StigmergyCommit-PT-08b-ReachabilityCardinality-02 is true.

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-08b-ReachabilityCardinality-02,1,0.057428,4956,2,48,15,3827,10,0,281,2264,0
Reachability property StigmergyCommit-PT-08b-ReachabilityCardinality-07 is true.
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-07 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-08b-ReachabilityCardinality-07,1,0.058452,4956,2,48,15,3827,10,0,286,2264,0
Reachability property StigmergyCommit-PT-08b-ReachabilityCardinality-08 is true.

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-08b-ReachabilityCardinality-08,1,0.058739,4956,2,48,15,3827,11,0,288,2264,0
Invariant property StigmergyCommit-PT-08b-ReachabilityCardinality-10 does not hold.
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-10 FALSE 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-08b-ReachabilityCardinality-10,1215,0.059644,4956,2,433,15,3827,11,0,294,2264,0
Invariant property StigmergyCommit-PT-08b-ReachabilityCardinality-12 does not hold.

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-08b-ReachabilityCardinality-12,1,0.060012,4956,2,48,15,3827,12,0,299,2264,0
Reachability property StigmergyCommit-PT-08b-ReachabilityCardinality-15 is true.
FORMULA StigmergyCommit-PT-08b-ReachabilityCardinality-15 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-08b-ReachabilityCardinality-15,1,0.060572,4956,2,48,15,3827,12,0,302,2264,0
All properties solved without resorting to model-checking.

BK_STOP 1654721561847

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

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