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-165463872500172.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-07a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872500172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 6.0K May 30 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 30 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 30 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 30 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K May 30 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 30 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K May 30 14:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 5.4M 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-07a-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654791367716

Running Version 202205111006
[2022-06-09 16:16:10] [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 16:16:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 16:16:11] [INFO ] Load time of PNML (sax parser for PT used): 997 ms
[2022-06-09 16:16:11] [INFO ] Transformed 292 places.
[2022-06-09 16:16:11] [INFO ] Transformed 7108 transitions.
[2022-06-09 16:16:11] [INFO ] Found NUPN structural information;
[2022-06-09 16:16:11] [INFO ] Parsed PT model containing 292 places and 7108 transitions in 1303 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
FORMULA StigmergyCommit-PT-07a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 890/890 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 228 transition count 818
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 228 transition count 818
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 136 place count 228 transition count 810
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 169 place count 195 transition count 769
Iterating global reduction 1 with 33 rules applied. Total rules applied 202 place count 195 transition count 769
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 210 place count 195 transition count 761
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 218 place count 187 transition count 753
Iterating global reduction 2 with 8 rules applied. Total rules applied 226 place count 187 transition count 753
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 234 place count 179 transition count 745
Iterating global reduction 2 with 8 rules applied. Total rules applied 242 place count 179 transition count 745
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 250 place count 171 transition count 737
Iterating global reduction 2 with 8 rules applied. Total rules applied 258 place count 171 transition count 737
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 266 place count 163 transition count 729
Iterating global reduction 2 with 8 rules applied. Total rules applied 274 place count 163 transition count 729
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 282 place count 163 transition count 721
Applied a total of 282 rules in 176 ms. Remains 163 /292 variables (removed 129) and now considering 721/890 (removed 169) transitions.
[2022-06-09 16:16:12] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2022-06-09 16:16:12] [INFO ] Computed 2 place invariants in 38 ms
[2022-06-09 16:16:12] [INFO ] Implicit Places using invariants in 400 ms returned []
[2022-06-09 16:16:12] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2022-06-09 16:16:12] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 16:16:12] [INFO ] State equation strengthened by 581 read => feed constraints.
[2022-06-09 16:16:15] [INFO ] Implicit Places using invariants and state equation in 2998 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3463 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/292 places, 721/890 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 44 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2022-06-09 16:16:15] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:16:15] [INFO ] Computed 1 place invariants in 5 ms
[2022-06-09 16:16:15] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-06-09 16:16:15] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:16:15] [INFO ] Computed 1 place invariants in 7 ms
[2022-06-09 16:16:15] [INFO ] State equation strengthened by 517 read => feed constraints.
[2022-06-09 16:16:15] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/292 places, 651/890 transitions.
Finished structural reductions, in 2 iterations. Remains : 100/292 places, 651/890 transitions.
Support contains 8 out of 100 places after structural reductions.
[2022-06-09 16:16:16] [INFO ] Flatten gal took : 231 ms
[2022-06-09 16:16:16] [INFO ] Flatten gal took : 126 ms
[2022-06-09 16:16:16] [INFO ] Input system was already deterministic with 651 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 680 ms. (steps per millisecond=14 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-09 16:16:17] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:16:17] [INFO ] Computed 1 place invariants in 4 ms
[2022-06-09 16:16:17] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA StigmergyCommit-PT-07a-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 3 stabilizing places and 3 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((true U p0))'
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 99 transition count 625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 74 transition count 625
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 74 transition count 617
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 66 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 116 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 371 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 385 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 392 place count 34 transition count 314
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 400 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 416 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 25 transition count 297
Applied a total of 417 rules in 244 ms. Remains 25 /100 variables (removed 75) and now considering 297/651 (removed 354) transitions.
[2022-06-09 16:16:18] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:18] [INFO ] Computed 1 place invariants in 6 ms
[2022-06-09 16:16:18] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-06-09 16:16:18] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:18] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 16:16:18] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:16:18] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2022-06-09 16:16:18] [INFO ] Redundant transitions in 39 ms returned []
[2022-06-09 16:16:18] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:18] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:18] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/100 places, 297/651 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/100 places, 297/651 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-02 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))], 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 11111 reset in 1375 ms.
Product exploration explored 100000 steps with 11111 reset in 1280 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 112 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 35 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2022-06-09 16:16:22] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:22] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 16:16:22] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2022-06-09 16:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:16:22] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2022-06-09 16:16:23] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:16:23] [INFO ] [Real]Added 271 Read/Feed constraints in 97 ms returned sat
[2022-06-09 16:16:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:16:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 16:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:16:23] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2022-06-09 16:16:23] [INFO ] [Nat]Added 271 Read/Feed constraints in 62 ms returned sat
[2022-06-09 16:16:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 80 ms.
[2022-06-09 16:16:23] [INFO ] Added : 0 causal constraints over 0 iterations in 122 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 35 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2022-06-09 16:16:23] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:23] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:23] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-06-09 16:16:23] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:23] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 16:16:23] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:16:23] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2022-06-09 16:16:24] [INFO ] Redundant transitions in 26 ms returned []
[2022-06-09 16:16:24] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:24] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 16:16:24] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 297/297 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 107 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 33 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2022-06-09 16:16:24] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:24] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 16:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:16:24] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2022-06-09 16:16:24] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:16:24] [INFO ] [Real]Added 271 Read/Feed constraints in 55 ms returned sat
[2022-06-09 16:16:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:16:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 16:16:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:16:25] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-06-09 16:16:25] [INFO ] [Nat]Added 271 Read/Feed constraints in 54 ms returned sat
[2022-06-09 16:16:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 45 ms.
[2022-06-09 16:16:25] [INFO ] Added : 0 causal constraints over 0 iterations in 81 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 1014 ms.
Product exploration explored 100000 steps with 11111 reset in 1184 ms.
Built C files in :
/tmp/ltsmin15023697838446241891
[2022-06-09 16:16:27] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2022-06-09 16:16:27] [INFO ] Computation of Complete disable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:16:27] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2022-06-09 16:16:27] [INFO ] Computation of Complete enable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:16:27] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2022-06-09 16:16:27] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:16:27] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15023697838446241891
Running compilation step : cd /tmp/ltsmin15023697838446241891;'/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'
Compilation finished in 1742 ms.
Running link step : cd /tmp/ltsmin15023697838446241891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin15023697838446241891;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7609527362314325296.hoa' '--buchi-type=spotba'
LTSmin run took 459 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-07a-LTLFireability-02 finished in 12051 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 651/651 (removed 0) transitions.
[2022-06-09 16:16:30] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:16:30] [INFO ] Computed 1 place invariants in 7 ms
[2022-06-09 16:16:30] [INFO ] Implicit Places using invariants in 56 ms returned []
[2022-06-09 16:16:30] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:16:30] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 16:16:30] [INFO ] State equation strengthened by 517 read => feed constraints.
[2022-06-09 16:16:30] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2022-06-09 16:16:30] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:16:30] [INFO ] Computed 1 place invariants in 6 ms
[2022-06-09 16:16:31] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 651/651 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s13 1) (EQ s25 1) (EQ s37 1) (EQ s49 1) (EQ s61 1) (EQ s73 1) (EQ s85 1) (EQ s97 1)), p0:(AND (EQ s13 1) (EQ s25 1) (EQ s37 1) (EQ s49 1) (EQ ...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-05 finished in 1136 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!X(F(p0))||p0) U X((G(p0) U p0)))))'
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 651/651 (removed 0) transitions.
[2022-06-09 16:16:31] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:16:31] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 16:16:31] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-06-09 16:16:31] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:16:31] [INFO ] Computed 1 place invariants in 9 ms
[2022-06-09 16:16:31] [INFO ] State equation strengthened by 517 read => feed constraints.
[2022-06-09 16:16:31] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2022-06-09 16:16:31] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:16:31] [INFO ] Computed 1 place invariants in 5 ms
[2022-06-09 16:16:32] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 651/651 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s13 1) (EQ s25 1) (EQ s37 1) (EQ s49 1) (EQ s61 1) (EQ s73 1) (EQ s85 1) (EQ s97 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-08 finished in 1075 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(F(X(p0)))) U G(p0)))'
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 99 transition count 625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 74 transition count 625
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 74 transition count 617
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 116 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 371 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 385 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 392 place count 34 transition count 314
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 400 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 416 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 25 transition count 297
Applied a total of 417 rules in 227 ms. Remains 25 /100 variables (removed 75) and now considering 297/651 (removed 354) transitions.
[2022-06-09 16:16:32] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:32] [INFO ] Computed 1 place invariants in 6 ms
[2022-06-09 16:16:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-06-09 16:16:32] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:32] [INFO ] Computed 1 place invariants in 8 ms
[2022-06-09 16:16:32] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:16:32] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2022-06-09 16:16:32] [INFO ] Redundant transitions in 17 ms returned []
[2022-06-09 16:16:32] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:32] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:33] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/100 places, 297/651 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/100 places, 297/651 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-09 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))], 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 9 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-09 finished in 828 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X((X(F(p1))&&p0)))||F(G(p2)))))'
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 651/651 (removed 0) transitions.
[2022-06-09 16:16:33] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:16:33] [INFO ] Computed 1 place invariants in 5 ms
[2022-06-09 16:16:33] [INFO ] Implicit Places using invariants in 50 ms returned []
[2022-06-09 16:16:33] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:16:33] [INFO ] Computed 1 place invariants in 4 ms
[2022-06-09 16:16:33] [INFO ] State equation strengthened by 517 read => feed constraints.
[2022-06-09 16:16:33] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2022-06-09 16:16:33] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:16:33] [INFO ] Computed 1 place invariants in 4 ms
[2022-06-09 16:16:34] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 651/651 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p2:(OR (EQ s13 0) (EQ s25 0) (EQ s37 0) (EQ s49 0) (EQ s61 0) (EQ s73 0) (EQ s85 0) (EQ s97 0)), p0:(AND (EQ s13 1) (EQ s25 1) (EQ s37 1) (EQ s49 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 318 reset in 428 ms.
Product exploration explored 100000 steps with 146 reset in 257 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 575 ms. (steps per millisecond=17 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-09 16:16:36] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:16:36] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 16:16:36] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 16:16:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-09 16:16:36] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (G (NOT (AND (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT (AND p2 (NOT p0)))), (F p0)]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p0))))
Knowledge based reduction with 6 factoid took 311 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyCommit-PT-07a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-07a-LTLFireability-10 finished in 3371 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((true U p0) U X(p0))))'
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 99 transition count 625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 74 transition count 625
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 74 transition count 617
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 66 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 116 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 371 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 385 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 392 place count 34 transition count 314
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 400 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 416 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 25 transition count 297
Applied a total of 417 rules in 199 ms. Remains 25 /100 variables (removed 75) and now considering 297/651 (removed 354) transitions.
[2022-06-09 16:16:36] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:36] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 16:16:36] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-06-09 16:16:36] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:36] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:36] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:16:37] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2022-06-09 16:16:37] [INFO ] Redundant transitions in 10 ms returned []
[2022-06-09 16:16:37] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:37] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 16:16:37] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/100 places, 297/651 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/100 places, 297/651 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-11 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:(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))], 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 1152 steps with 127 reset in 20 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-11 finished in 988 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G(F(G(p0)))||F(p0)||p0)))'
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 99 transition count 625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 74 transition count 625
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 74 transition count 617
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 116 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 371 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 385 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 392 place count 34 transition count 314
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 400 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 416 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 25 transition count 297
Applied a total of 417 rules in 183 ms. Remains 25 /100 variables (removed 75) and now considering 297/651 (removed 354) transitions.
[2022-06-09 16:16:37] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-06-09 16:16:37] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:37] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 16:16:37] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:16:38] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2022-06-09 16:16:38] [INFO ] Redundant transitions in 9 ms returned []
[2022-06-09 16:16:38] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:38] [INFO ] Computed 1 place invariants in 4 ms
[2022-06-09 16:16:38] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/100 places, 297/651 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/100 places, 297/651 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-12 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))], 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 11111 reset in 978 ms.
Product exploration explored 100000 steps with 11111 reset in 969 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 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 32 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2022-06-09 16:16:40] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:40] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:40] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 16:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:16:41] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2022-06-09 16:16:41] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:16:41] [INFO ] [Real]Added 271 Read/Feed constraints in 56 ms returned sat
[2022-06-09 16:16:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:16:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 16:16:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:16:41] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-06-09 16:16:41] [INFO ] [Nat]Added 271 Read/Feed constraints in 78 ms returned sat
[2022-06-09 16:16:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 36 ms.
[2022-06-09 16:16:41] [INFO ] Added : 0 causal constraints over 0 iterations in 84 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 34 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2022-06-09 16:16:41] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:41] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-06-09 16:16:41] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:41] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 16:16:41] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:16:41] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2022-06-09 16:16:41] [INFO ] Redundant transitions in 8 ms returned []
[2022-06-09 16:16:41] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:42] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 297/297 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 298 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 47 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 179 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2022-06-09 16:16:42] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 16:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:16:43] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2022-06-09 16:16:43] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:16:43] [INFO ] [Real]Added 271 Read/Feed constraints in 84 ms returned sat
[2022-06-09 16:16:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:16:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 16:16:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:16:43] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2022-06-09 16:16:44] [INFO ] [Nat]Added 271 Read/Feed constraints in 85 ms returned sat
[2022-06-09 16:16:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 47 ms.
[2022-06-09 16:16:44] [INFO ] Added : 0 causal constraints over 0 iterations in 103 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 1327 ms.
Product exploration explored 100000 steps with 11111 reset in 940 ms.
Built C files in :
/tmp/ltsmin9873118748537179463
[2022-06-09 16:16:46] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2022-06-09 16:16:46] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:16:46] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2022-06-09 16:16:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:16:46] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2022-06-09 16:16:46] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:16:46] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9873118748537179463
Running compilation step : cd /tmp/ltsmin9873118748537179463;'/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'
Compilation finished in 1688 ms.
Running link step : cd /tmp/ltsmin9873118748537179463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin9873118748537179463;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12800372888286130786.hoa' '--buchi-type=spotba'
LTSmin run took 370 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-07a-LTLFireability-12 finished in 11130 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p0)) U (X((F(p0) U p0))||p0)))'
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 99 transition count 625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 74 transition count 625
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 74 transition count 617
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 66 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 116 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 371 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 385 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 392 place count 34 transition count 314
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 400 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 416 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 25 transition count 297
Applied a total of 417 rules in 166 ms. Remains 25 /100 variables (removed 75) and now considering 297/651 (removed 354) transitions.
[2022-06-09 16:16:48] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:48] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-06-09 16:16:48] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:49] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:16:49] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2022-06-09 16:16:49] [INFO ] Redundant transitions in 10 ms returned []
[2022-06-09 16:16:49] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:49] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/100 places, 297/651 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/100 places, 297/651 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-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))], 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 11111 reset in 1196 ms.
Product exploration explored 100000 steps with 11111 reset in 940 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 102 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 33 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2022-06-09 16:16:52] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:52] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 16:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:16:52] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2022-06-09 16:16:52] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:16:52] [INFO ] [Real]Added 271 Read/Feed constraints in 58 ms returned sat
[2022-06-09 16:16:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:16:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 16:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:16:52] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2022-06-09 16:16:53] [INFO ] [Nat]Added 271 Read/Feed constraints in 84 ms returned sat
[2022-06-09 16:16:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 42 ms.
[2022-06-09 16:16:53] [INFO ] Added : 0 causal constraints over 0 iterations in 78 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 37 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2022-06-09 16:16:53] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:53] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-06-09 16:16:53] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:53] [INFO ] Computed 1 place invariants in 2 ms
[2022-06-09 16:16:53] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:16:53] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2022-06-09 16:16:53] [INFO ] Redundant transitions in 10 ms returned []
[2022-06-09 16:16:53] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:53] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 297/297 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 148 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)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 155 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2022-06-09 16:16:54] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:54] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 16:16:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:16:54] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2022-06-09 16:16:54] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:16:54] [INFO ] [Real]Added 271 Read/Feed constraints in 84 ms returned sat
[2022-06-09 16:16:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:16:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 16:16:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:16:55] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-06-09 16:16:55] [INFO ] [Nat]Added 271 Read/Feed constraints in 80 ms returned sat
[2022-06-09 16:16:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 42 ms.
[2022-06-09 16:16:55] [INFO ] Added : 0 causal constraints over 0 iterations in 79 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 1264 ms.
Product exploration explored 100000 steps with 11111 reset in 942 ms.
Built C files in :
/tmp/ltsmin13805036959590074376
[2022-06-09 16:16:57] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2022-06-09 16:16:57] [INFO ] Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:16:57] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2022-06-09 16:16:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:16:57] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2022-06-09 16:16:57] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:16:57] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13805036959590074376
Running compilation step : cd /tmp/ltsmin13805036959590074376;'/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'
Compilation finished in 1680 ms.
Running link step : cd /tmp/ltsmin13805036959590074376;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13805036959590074376;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18017007338613796876.hoa' '--buchi-type=spotba'
LTSmin run took 356 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-07a-LTLFireability-13 finished in 11037 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 99 transition count 625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 74 transition count 625
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 74 transition count 617
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 116 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 371 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 385 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 392 place count 34 transition count 314
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 400 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 416 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 25 transition count 297
Applied a total of 417 rules in 169 ms. Remains 25 /100 variables (removed 75) and now considering 297/651 (removed 354) transitions.
[2022-06-09 16:16:59] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:16:59] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-06-09 16:16:59] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:16:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:17:00] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:17:00] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2022-06-09 16:17:00] [INFO ] Redundant transitions in 10 ms returned []
[2022-06-09 16:17:00] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:17:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:17:00] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/100 places, 297/651 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/100 places, 297/651 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-14 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))], 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 8 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-14 finished in 837 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)&&F(p0)))||G(p0)))'
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 651/651 (removed 0) transitions.
[2022-06-09 16:17:00] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:17:00] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 16:17:00] [INFO ] Implicit Places using invariants in 50 ms returned []
[2022-06-09 16:17:00] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:17:00] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 16:17:00] [INFO ] State equation strengthened by 517 read => feed constraints.
[2022-06-09 16:17:01] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2022-06-09 16:17:01] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:17:01] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 16:17:01] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 651/651 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s25 1) (EQ s37 1) (EQ s49 1) (EQ s61 1) (EQ s73 1) (EQ s85 1) (EQ s97 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][false, false]]
Product exploration explored 100000 steps with 1923 reset in 708 ms.
Product exploration explored 100000 steps with 1923 reset in 533 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 147 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2022-06-09 16:17:03] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2022-06-09 16:17:03] [INFO ] Computed 1 place invariants in 3 ms
[2022-06-09 16:17:03] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 16:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:04] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2022-06-09 16:17:04] [INFO ] State equation strengthened by 517 read => feed constraints.
[2022-06-09 16:17:04] [INFO ] [Real]Added 517 Read/Feed constraints in 148 ms returned sat
[2022-06-09 16:17:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:17:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 16:17:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:04] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2022-06-09 16:17:05] [INFO ] [Nat]Added 517 Read/Feed constraints in 127 ms returned sat
[2022-06-09 16:17:05] [INFO ] Computed and/alt/rep : 106/130/106 causal constraints (skipped 535 transitions) in 94 ms.
[2022-06-09 16:17:06] [INFO ] Added : 82 causal constraints over 17 iterations in 1383 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 99 transition count 625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 74 transition count 625
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 74 transition count 617
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 66 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 116 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 371 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 385 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 392 place count 34 transition count 314
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 400 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 416 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 25 transition count 297
Applied a total of 417 rules in 171 ms. Remains 25 /100 variables (removed 75) and now considering 297/651 (removed 354) transitions.
[2022-06-09 16:17:06] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:17:06] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:17:06] [INFO ] Implicit Places using invariants in 29 ms returned []
[2022-06-09 16:17:06] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:17:06] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:17:06] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:17:06] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2022-06-09 16:17:06] [INFO ] Redundant transitions in 9 ms returned []
[2022-06-09 16:17:06] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:17:06] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:17:07] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/100 places, 297/651 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/100 places, 297/651 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 141 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 50 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 165 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2022-06-09 16:17:07] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2022-06-09 16:17:07] [INFO ] Computed 1 place invariants in 1 ms
[2022-06-09 16:17:08] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 16:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:08] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2022-06-09 16:17:08] [INFO ] State equation strengthened by 271 read => feed constraints.
[2022-06-09 16:17:08] [INFO ] [Real]Added 271 Read/Feed constraints in 86 ms returned sat
[2022-06-09 16:17:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:17:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 16:17:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:08] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-06-09 16:17:08] [INFO ] [Nat]Added 271 Read/Feed constraints in 82 ms returned sat
[2022-06-09 16:17:08] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 61 ms.
[2022-06-09 16:17:08] [INFO ] Added : 0 causal constraints over 0 iterations in 108 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 1338 ms.
Product exploration explored 100000 steps with 11111 reset in 943 ms.
Built C files in :
/tmp/ltsmin1452246233632195102
[2022-06-09 16:17:11] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2022-06-09 16:17:11] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:17:11] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2022-06-09 16:17:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:17:11] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2022-06-09 16:17:11] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 16:17:11] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1452246233632195102
Running compilation step : cd /tmp/ltsmin1452246233632195102;'/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'
Compilation finished in 1519 ms.
Running link step : cd /tmp/ltsmin1452246233632195102;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1452246233632195102;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10608777478928475666.hoa' '--buchi-type=spotba'
LTSmin run took 370 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-07a-LTLFireability-15 finished in 12732 ms.
All properties solved by simple procedures.
Total runtime 63131 ms.

BK_STOP 1654791433514

--------------------
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-07a"
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-07a, 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-165463872500172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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