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.r294-smll-165463872600204.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 itstools
Input is StigmergyCommit-PT-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872600204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 6.5K May 30 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 30 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 30 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 30 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 25 13:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 17K May 25 13:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 8.1K May 30 15:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 30 15:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 30 15:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 30 15:04 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 51M 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-09a-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-09a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654807493367

Running Version 202205111006
[2022-06-09 20:44:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 20:44:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 20:44:59] [INFO ] Load time of PNML (sax parser for PT used): 3494 ms
[2022-06-09 20:45:00] [INFO ] Transformed 364 places.
[2022-06-09 20:45:00] [INFO ] Transformed 50444 transitions.
[2022-06-09 20:45:00] [INFO ] Found NUPN structural information;
[2022-06-09 20:45:00] [INFO ] Parsed PT model containing 364 places and 50444 transitions in 4431 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 52 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyCommit-PT-09a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 2520/2520 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 284 transition count 2430
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 284 transition count 2430
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 170 place count 284 transition count 2420
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 211 place count 243 transition count 2369
Iterating global reduction 1 with 41 rules applied. Total rules applied 252 place count 243 transition count 2369
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 262 place count 243 transition count 2359
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 272 place count 233 transition count 2349
Iterating global reduction 2 with 10 rules applied. Total rules applied 282 place count 233 transition count 2349
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 292 place count 223 transition count 2339
Iterating global reduction 2 with 10 rules applied. Total rules applied 302 place count 223 transition count 2339
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 312 place count 213 transition count 2329
Iterating global reduction 2 with 10 rules applied. Total rules applied 322 place count 213 transition count 2329
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 332 place count 203 transition count 2319
Iterating global reduction 2 with 10 rules applied. Total rules applied 342 place count 203 transition count 2319
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 352 place count 203 transition count 2309
Applied a total of 352 rules in 279 ms. Remains 203 /364 variables (removed 161) and now considering 2309/2520 (removed 211) transitions.
[2022-06-09 20:45:01] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:01] [INFO ] Computed 2 place invariants in 122 ms
[2022-06-09 20:45:02] [INFO ] Implicit Places using invariants in 567 ms returned []
[2022-06-09 20:45:02] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:02] [INFO ] Computed 2 place invariants in 39 ms
[2022-06-09 20:45:03] [INFO ] State equation strengthened by 2135 read => feed constraints.
[2022-06-09 20:45:03] [INFO ] Implicit Places using invariants and state equation in 1536 ms returned []
Implicit Place search using SMT with State Equation took 2421 ms to find 0 implicit places.
[2022-06-09 20:45:03] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:03] [INFO ] Computed 2 place invariants in 27 ms
[2022-06-09 20:45:06] [INFO ] Dead Transitions using invariants and state equation in 2233 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/364 places, 2309/2520 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/364 places, 2309/2520 transitions.
Support contains 10 out of 203 places after structural reductions.
[2022-06-09 20:45:07] [INFO ] Flatten gal took : 634 ms
[2022-06-09 20:45:07] [INFO ] Flatten gal took : 302 ms
[2022-06-09 20:45:08] [INFO ] Input system was already deterministic with 2309 transitions.
Finished random walk after 63 steps, including 0 resets, run visited all 5 properties in 55 ms. (steps per millisecond=1 )
Computed a total of 62 stabilizing places and 61 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(X(X(F(p0))))&&p1))))'
Support contains 10 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 2309/2309 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 201 transition count 2208
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 129 rules applied. Total rules applied 230 place count 101 transition count 2179
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 250 place count 91 transition count 2169
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 250 place count 91 transition count 2160
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 268 place count 82 transition count 2160
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 287 place count 63 transition count 2141
Iterating global reduction 3 with 19 rules applied. Total rules applied 306 place count 63 transition count 2141
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 3 with 1023 rules applied. Total rules applied 1329 place count 63 transition count 1118
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 1329 place count 63 transition count 1108
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1349 place count 53 transition count 1108
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1371 place count 42 transition count 1096
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1381 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1401 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1402 place count 31 transition count 1075
Applied a total of 1402 rules in 2200 ms. Remains 31 /203 variables (removed 172) and now considering 1075/2309 (removed 1234) transitions.
[2022-06-09 20:45:11] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:11] [INFO ] Computed 1 place invariants in 8 ms
[2022-06-09 20:45:11] [INFO ] Implicit Places using invariants in 62 ms returned []
[2022-06-09 20:45:11] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:11] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-09 20:45:11] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2022-06-09 20:45:12] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2022-06-09 20:45:12] [INFO ] Redundant transitions in 238 ms returned []
[2022-06-09 20:45:12] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:12] [INFO ] Computed 1 place invariants in 5 ms
[2022-06-09 20:45:13] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/203 places, 1075/2309 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/203 places, 1075/2309 transitions.
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s3 0) (EQ s6 0) (EQ s9 0) (EQ s12 0) (EQ s15 0) (EQ s18 0) (EQ s21 0) (EQ s24 0) (EQ s27 0) (EQ s30 0)), p0:(AND (EQ s3 1) (EQ s6 1) (EQ s9 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17720 steps with 1610 reset in 1097 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-00 finished in 5537 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(G(p1)))))'
Support contains 10 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 2309/2309 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 201 transition count 2208
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 129 rules applied. Total rules applied 230 place count 101 transition count 2179
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 250 place count 91 transition count 2169
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 250 place count 91 transition count 2160
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 268 place count 82 transition count 2160
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 287 place count 63 transition count 2141
Iterating global reduction 3 with 19 rules applied. Total rules applied 306 place count 63 transition count 2141
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 3 with 1023 rules applied. Total rules applied 1329 place count 63 transition count 1118
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 1329 place count 63 transition count 1108
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1349 place count 53 transition count 1108
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 1371 place count 42 transition count 1096
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1381 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1401 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1402 place count 31 transition count 1075
Applied a total of 1402 rules in 1251 ms. Remains 31 /203 variables (removed 172) and now considering 1075/2309 (removed 1234) transitions.
[2022-06-09 20:45:15] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:15] [INFO ] Computed 1 place invariants in 5 ms
[2022-06-09 20:45:15] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-06-09 20:45:15] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:15] [INFO ] Computed 1 place invariants in 6 ms
[2022-06-09 20:45:16] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2022-06-09 20:45:17] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1356 ms to find 0 implicit places.
[2022-06-09 20:45:17] [INFO ] Redundant transitions in 157 ms returned []
[2022-06-09 20:45:17] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:17] [INFO ] Computed 1 place invariants in 4 ms
[2022-06-09 20:45:18] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/203 places, 1075/2309 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/203 places, 1075/2309 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s6 1) (EQ s9 1) (EQ s12 1) (EQ s15 1) (EQ s18 1) (EQ s21 1) (EQ s24 1) (EQ s27 1) (EQ s30 1)), p1:(OR (EQ s3 0) (EQ s6 0) (EQ s9 0) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 43 steps with 3 reset in 2 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-01 finished in 3822 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(p0))))'
Support contains 10 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 2309/2309 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 201 transition count 2208
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 129 rules applied. Total rules applied 230 place count 101 transition count 2179
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 250 place count 91 transition count 2169
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 250 place count 91 transition count 2160
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 268 place count 82 transition count 2160
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 287 place count 63 transition count 2141
Iterating global reduction 3 with 19 rules applied. Total rules applied 306 place count 63 transition count 2141
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 3 with 1023 rules applied. Total rules applied 1329 place count 63 transition count 1118
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 1329 place count 63 transition count 1108
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1349 place count 53 transition count 1108
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 1371 place count 42 transition count 1096
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1381 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1401 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1402 place count 31 transition count 1075
Applied a total of 1402 rules in 1218 ms. Remains 31 /203 variables (removed 172) and now considering 1075/2309 (removed 1234) transitions.
[2022-06-09 20:45:19] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:19] [INFO ] Computed 1 place invariants in 4 ms
[2022-06-09 20:45:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-06-09 20:45:19] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:19] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 20:45:19] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2022-06-09 20:45:20] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2022-06-09 20:45:20] [INFO ] Redundant transitions in 91 ms returned []
[2022-06-09 20:45:20] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:20] [INFO ] Computed 1 place invariants in 5 ms
[2022-06-09 20:45:21] [INFO ] Dead Transitions using invariants and state equation in 1115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/203 places, 1075/2309 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/203 places, 1075/2309 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s6 1) (EQ s9 1) (EQ s12 1) (EQ s15 1) (EQ s18 1) (EQ s21 1) (EQ s24 1) (EQ s27 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-02 finished in 3034 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||X(p1)))'
Support contains 10 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 2309/2309 transitions.
Applied a total of 0 rules in 10 ms. Remains 203 /203 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
[2022-06-09 20:45:21] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:21] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-09 20:45:21] [INFO ] Implicit Places using invariants in 133 ms returned []
[2022-06-09 20:45:21] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:21] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 20:45:22] [INFO ] State equation strengthened by 2135 read => feed constraints.
[2022-06-09 20:45:23] [INFO ] Implicit Places using invariants and state equation in 2451 ms returned []
Implicit Place search using SMT with State Equation took 2588 ms to find 0 implicit places.
[2022-06-09 20:45:24] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:24] [INFO ] Computed 2 place invariants in 24 ms
[2022-06-09 20:45:26] [INFO ] Dead Transitions using invariants and state equation in 2164 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 2309/2309 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (EQ s15 0) (EQ s35 0) (EQ s55 0) (EQ s75 0) (EQ s95 0) (EQ s115 0) (EQ s135 0) (EQ s155 0) (EQ s175 0) (EQ s195 0)), p0:(AND (EQ s15 1) (EQ s35 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 955 ms.
Product exploration explored 100000 steps with 50000 reset in 727 ms.
Computed a total of 62 stabilizing places and 61 stable transitions
Computed a total of 62 stabilizing places and 61 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyCommit-PT-09a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-09a-LTLFireability-04 finished in 6713 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p0)||(F((X(G(p0))||p0))&&X(G(p0)))))'
Support contains 10 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 2309/2309 transitions.
Applied a total of 0 rules in 10 ms. Remains 203 /203 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
[2022-06-09 20:45:28] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:28] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-09 20:45:28] [INFO ] Implicit Places using invariants in 112 ms returned []
[2022-06-09 20:45:28] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:28] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-09 20:45:28] [INFO ] State equation strengthened by 2135 read => feed constraints.
[2022-06-09 20:45:29] [INFO ] Implicit Places using invariants and state equation in 1196 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2022-06-09 20:45:29] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:29] [INFO ] Computed 2 place invariants in 24 ms
[2022-06-09 20:45:31] [INFO ] Dead Transitions using invariants and state equation in 2010 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 2309/2309 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s15 1) (EQ s35 1) (EQ s55 1) (EQ s75 1) (EQ s95 1) (EQ s115 1) (EQ s135 1) (EQ s155 1) (EQ s175 1) (EQ s195 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-05 finished in 3470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(G(X(F(p0)))))))'
Support contains 10 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 2309/2309 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 201 transition count 2208
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 129 rules applied. Total rules applied 230 place count 101 transition count 2179
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 250 place count 91 transition count 2169
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 250 place count 91 transition count 2160
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 268 place count 82 transition count 2160
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 287 place count 63 transition count 2141
Iterating global reduction 3 with 19 rules applied. Total rules applied 306 place count 63 transition count 2141
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 3 with 1023 rules applied. Total rules applied 1329 place count 63 transition count 1118
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 1329 place count 63 transition count 1108
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1349 place count 53 transition count 1108
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 1371 place count 42 transition count 1096
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1381 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1401 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1402 place count 31 transition count 1075
Applied a total of 1402 rules in 1080 ms. Remains 31 /203 variables (removed 172) and now considering 1075/2309 (removed 1234) transitions.
[2022-06-09 20:45:32] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:32] [INFO ] Computed 1 place invariants in 4 ms
[2022-06-09 20:45:32] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-06-09 20:45:32] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:32] [INFO ] Computed 1 place invariants in 4 ms
[2022-06-09 20:45:33] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2022-06-09 20:45:33] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2022-06-09 20:45:33] [INFO ] Redundant transitions in 155 ms returned []
[2022-06-09 20:45:33] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:33] [INFO ] Computed 1 place invariants in 6 ms
[2022-06-09 20:45:34] [INFO ] Dead Transitions using invariants and state equation in 943 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/203 places, 1075/2309 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/203 places, 1075/2309 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s6 0) (EQ s9 0) (EQ s12 0) (EQ s15 0) (EQ s18 0) (EQ s21 0) (EQ s24 0) (EQ s27 0) (EQ s30 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 5 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-06 finished in 3063 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(G(p0))))&&(p1 U X(p1))))'
Support contains 10 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 2309/2309 transitions.
Applied a total of 0 rules in 17 ms. Remains 203 /203 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
[2022-06-09 20:45:34] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:34] [INFO ] Computed 2 place invariants in 23 ms
[2022-06-09 20:45:34] [INFO ] Implicit Places using invariants in 162 ms returned []
[2022-06-09 20:45:34] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:34] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 20:45:35] [INFO ] State equation strengthened by 2135 read => feed constraints.
[2022-06-09 20:45:36] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
[2022-06-09 20:45:36] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:36] [INFO ] Computed 2 place invariants in 22 ms
[2022-06-09 20:45:38] [INFO ] Dead Transitions using invariants and state equation in 2217 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 2309/2309 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(AND (EQ s15 1) (EQ s35 1) (EQ s55 1) (EQ s75 1) (EQ s95 1) (EQ s115 1) (EQ s135 1) (EQ s155 1) (EQ s175 1) (EQ s195 1)), p0:(OR (EQ s15 0) (EQ s35 0) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-11 finished in 3879 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F(X(F(p0))))||G(p0)) U p0)))'
Support contains 10 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 2309/2309 transitions.
Applied a total of 0 rules in 11 ms. Remains 203 /203 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
[2022-06-09 20:45:38] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:38] [INFO ] Computed 2 place invariants in 23 ms
[2022-06-09 20:45:38] [INFO ] Implicit Places using invariants in 131 ms returned []
[2022-06-09 20:45:38] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:38] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 20:45:39] [INFO ] State equation strengthened by 2135 read => feed constraints.
[2022-06-09 20:45:39] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2022-06-09 20:45:39] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:45:39] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-09 20:45:41] [INFO ] Dead Transitions using invariants and state equation in 1898 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 2309/2309 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s35 1) (EQ s55 1) (EQ s75 1) (EQ s95 1) (EQ s115 1) (EQ s135 1) (EQ s155 1) (EQ s175 1) (EQ s195 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 68 steps with 0 reset in 4 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-12 finished in 3418 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0)&&G((X(p0) U p0))) U (p0 U p0)))'
Support contains 10 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 2309/2309 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 201 transition count 2208
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 129 rules applied. Total rules applied 230 place count 101 transition count 2179
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 250 place count 91 transition count 2169
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 250 place count 91 transition count 2160
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 268 place count 82 transition count 2160
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 287 place count 63 transition count 2141
Iterating global reduction 3 with 19 rules applied. Total rules applied 306 place count 63 transition count 2141
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 3 with 1023 rules applied. Total rules applied 1329 place count 63 transition count 1118
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 1329 place count 63 transition count 1108
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1349 place count 53 transition count 1108
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 1371 place count 42 transition count 1096
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1381 place count 42 transition count 1086
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 1401 place count 32 transition count 1076
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1402 place count 31 transition count 1075
Applied a total of 1402 rules in 1148 ms. Remains 31 /203 variables (removed 172) and now considering 1075/2309 (removed 1234) transitions.
[2022-06-09 20:45:43] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:43] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 20:45:43] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-06-09 20:45:43] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:43] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 20:45:43] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2022-06-09 20:45:43] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2022-06-09 20:45:43] [INFO ] Redundant transitions in 169 ms returned []
[2022-06-09 20:45:43] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:43] [INFO ] Computed 1 place invariants in 6 ms
[2022-06-09 20:45:44] [INFO ] Dead Transitions using invariants and state equation in 1054 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/203 places, 1075/2309 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/203 places, 1075/2309 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s6 1) (EQ s9 1) (EQ s12 1) (EQ s15 1) (EQ s18 1) (EQ s21 1) (EQ s24 1) (EQ s27 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9090 reset in 3931 ms.
Product exploration explored 100000 steps with 9090 reset in 3588 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2022-06-09 20:45:52] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:53] [INFO ] Computed 1 place invariants in 4 ms
[2022-06-09 20:45:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 20:45:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 20:45:54] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2022-06-09 20:45:55] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2022-06-09 20:45:55] [INFO ] [Real]Added 1043 Read/Feed constraints in 203 ms returned sat
[2022-06-09 20:45:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 20:45:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 20:45:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 20:45:57] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2022-06-09 20:45:57] [INFO ] [Nat]Added 1043 Read/Feed constraints in 230 ms returned sat
[2022-06-09 20:45:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 284 ms.
[2022-06-09 20:45:57] [INFO ] Added : 0 causal constraints over 0 iterations in 446 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 292 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2022-06-09 20:45:58] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:58] [INFO ] Computed 1 place invariants in 5 ms
[2022-06-09 20:45:58] [INFO ] Implicit Places using invariants in 41 ms returned []
[2022-06-09 20:45:58] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:58] [INFO ] Computed 1 place invariants in 5 ms
[2022-06-09 20:45:58] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2022-06-09 20:45:59] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
[2022-06-09 20:45:59] [INFO ] Redundant transitions in 160 ms returned []
[2022-06-09 20:45:59] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:45:59] [INFO ] Computed 1 place invariants in 5 ms
[2022-06-09 20:46:00] [INFO ] Dead Transitions using invariants and state equation in 1256 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 1075/1075 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2022-06-09 20:46:00] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:46:01] [INFO ] Computed 1 place invariants in 4 ms
[2022-06-09 20:46:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 20:46:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 20:46:02] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2022-06-09 20:46:02] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2022-06-09 20:46:02] [INFO ] [Real]Added 1043 Read/Feed constraints in 230 ms returned sat
[2022-06-09 20:46:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 20:46:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 20:46:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 20:46:04] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2022-06-09 20:46:04] [INFO ] [Nat]Added 1043 Read/Feed constraints in 219 ms returned sat
[2022-06-09 20:46:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 1149 ms.
[2022-06-09 20:46:05] [INFO ] Added : 0 causal constraints over 0 iterations in 1249 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9090 reset in 3410 ms.
Product exploration explored 100000 steps with 9090 reset in 3360 ms.
Built C files in :
/tmp/ltsmin14458142403502925747
[2022-06-09 20:46:12] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2022-06-09 20:46:13] [INFO ] Computation of Complete disable matrix. took 597 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 20:46:13] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2022-06-09 20:46:13] [INFO ] Computation of Complete enable matrix. took 111 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 20:46:13] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2022-06-09 20:46:13] [INFO ] Computation of Completed DNA matrix. took 127 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 20:46:14] [INFO ] Built C files in 1475ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14458142403502925747
Running compilation step : cd /tmp/ltsmin14458142403502925747;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14458142403502925747;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14458142403502925747;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 252 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2022-06-09 20:46:17] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:46:17] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 20:46:17] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-06-09 20:46:17] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:46:17] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 20:46:17] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2022-06-09 20:46:17] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2022-06-09 20:46:17] [INFO ] Redundant transitions in 89 ms returned []
[2022-06-09 20:46:17] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2022-06-09 20:46:17] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 20:46:18] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 1075/1075 transitions.
Built C files in :
/tmp/ltsmin13689365350618773278
[2022-06-09 20:46:18] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2022-06-09 20:46:19] [INFO ] Computation of Complete disable matrix. took 388 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 20:46:19] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2022-06-09 20:46:19] [INFO ] Computation of Complete enable matrix. took 93 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 20:46:19] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2022-06-09 20:46:19] [INFO ] Computation of Completed DNA matrix. took 135 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 20:46:19] [INFO ] Built C files in 1067ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13689365350618773278
Running compilation step : cd /tmp/ltsmin13689365350618773278;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13689365350618773278;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13689365350618773278;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-09 20:46:23] [INFO ] Flatten gal took : 140 ms
[2022-06-09 20:46:23] [INFO ] Flatten gal took : 107 ms
[2022-06-09 20:46:23] [INFO ] Time to serialize gal into /tmp/LTL17361735586708352005.gal : 50 ms
[2022-06-09 20:46:23] [INFO ] Time to serialize properties into /tmp/LTL12739022646514034251.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17361735586708352005.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12739022646514034251.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1736173...268
Read 1 LTL properties
Checking formula 0 : !(((!((G("(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&((p318==1)&&(p354==1)))...689
Formula 0 simplified : !(!(G"(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))&&((p318==1)&&(p354==1)))" ...547
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t2289, t2291, t2293, t2295, t2297, t2299, t23...282
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
768 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.2758,140764,1,0,1161,44534,2164,46,44119,27865,2245
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyCommit-PT-09a-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property StigmergyCommit-PT-09a-LTLFireability-13 finished in 50420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(!X(p0)))) U p0)))'
Support contains 10 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 2309/2309 transitions.
Applied a total of 0 rules in 10 ms. Remains 203 /203 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
[2022-06-09 20:46:32] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:46:32] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 20:46:32] [INFO ] Implicit Places using invariants in 131 ms returned []
[2022-06-09 20:46:32] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:46:32] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 20:46:33] [INFO ] State equation strengthened by 2135 read => feed constraints.
[2022-06-09 20:46:33] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1219 ms to find 0 implicit places.
[2022-06-09 20:46:33] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:46:33] [INFO ] Computed 2 place invariants in 22 ms
[2022-06-09 20:46:35] [INFO ] Dead Transitions using invariants and state equation in 2289 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 2309/2309 transitions.
Stuttering acceptance computed with spot in 158 ms :[p0, (NOT p0), (NOT p0), true, p0]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=2, aps=[p0:(AND (EQ s15 1) (EQ s35 1) (EQ s55 1) (EQ s75 1) (EQ s95 1) (EQ s115 1) (EQ s135 1) (EQ s155 1) (EQ s175 1) (EQ s195 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-14 finished in 3701 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X((X(p1)&&p0)))&&F(X(F(p2))))))'
Support contains 10 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 2309/2309 transitions.
Applied a total of 0 rules in 10 ms. Remains 203 /203 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
[2022-06-09 20:46:36] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:46:36] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-09 20:46:36] [INFO ] Implicit Places using invariants in 127 ms returned []
[2022-06-09 20:46:36] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:46:36] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-09 20:46:36] [INFO ] State equation strengthened by 2135 read => feed constraints.
[2022-06-09 20:46:37] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1540 ms to find 0 implicit places.
[2022-06-09 20:46:37] [INFO ] Flow matrix only has 2298 transitions (discarded 11 similar events)
// Phase 1: matrix 2298 rows 203 cols
[2022-06-09 20:46:37] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-09 20:46:39] [INFO ] Dead Transitions using invariants and state equation in 2347 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 2309/2309 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-09a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s15 0) (EQ s35 0) (EQ s55 0) (EQ s75 0) (EQ s95 0) (EQ s115 0) (EQ s135 0) (EQ s155 0) (EQ s175 0) (EQ s195 0)), p0:(AND (EQ s15 1) (EQ s35 1) ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 4 ms.
FORMULA StigmergyCommit-PT-09a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-09a-LTLFireability-15 finished in 4279 ms.
All properties solved by simple procedures.
Total runtime 104334 ms.

BK_STOP 1654807600499

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -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=@none -Xss128m -Xms40m -Xmx8192m

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-09a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-09a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463872600204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-09a.tgz
mv StigmergyCommit-PT-09a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;