fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r453-smll-167912645700612
Last Updated
May 14, 2023

About the Execution of ITS-Tools for StigmergyElection-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5911.659 1528847.00 5704911.00 1530.50 FFFFTFFFFTFFTFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r453-smll-167912645700612.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is StigmergyElection-PT-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645700612
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 428K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679416840679

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-21 16:40:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 16:40:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 16:40:45] [INFO ] Load time of PNML (sax parser for PT used): 291 ms
[2023-03-21 16:40:45] [INFO ] Transformed 699 places.
[2023-03-21 16:40:45] [INFO ] Transformed 1266 transitions.
[2023-03-21 16:40:45] [INFO ] Found NUPN structural information;
[2023-03-21 16:40:45] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 481 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyElection-PT-05b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 699 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 88 place count 611 transition count 1178
Iterating global reduction 0 with 88 rules applied. Total rules applied 176 place count 611 transition count 1178
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 223 place count 564 transition count 1131
Iterating global reduction 0 with 47 rules applied. Total rules applied 270 place count 564 transition count 1131
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 280 place count 554 transition count 1121
Iterating global reduction 0 with 10 rules applied. Total rules applied 290 place count 554 transition count 1121
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 295 place count 549 transition count 1116
Iterating global reduction 0 with 5 rules applied. Total rules applied 300 place count 549 transition count 1116
Applied a total of 300 rules in 373 ms. Remains 549 /699 variables (removed 150) and now considering 1116/1266 (removed 150) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2023-03-21 16:40:45] [INFO ] Computed 6 place invariants in 73 ms
[2023-03-21 16:40:46] [INFO ] Implicit Places using invariants in 685 ms returned []
[2023-03-21 16:40:46] [INFO ] Invariant cache hit.
[2023-03-21 16:40:47] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1611 ms to find 0 implicit places.
[2023-03-21 16:40:47] [INFO ] Invariant cache hit.
[2023-03-21 16:40:48] [INFO ] Dead Transitions using invariants and state equation in 1111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 549/699 places, 1116/1266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3111 ms. Remains : 549/699 places, 1116/1266 transitions.
Support contains 44 out of 549 places after structural reductions.
[2023-03-21 16:40:49] [INFO ] Flatten gal took : 276 ms
[2023-03-21 16:40:49] [INFO ] Flatten gal took : 152 ms
[2023-03-21 16:40:49] [INFO ] Input system was already deterministic with 1116 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 859 ms. (steps per millisecond=11 ) properties (out of 28) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-21 16:40:50] [INFO ] Invariant cache hit.
[2023-03-21 16:40:51] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2023-03-21 16:40:52] [INFO ] After 626ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:19
[2023-03-21 16:40:53] [INFO ] Deduced a trap composed of 165 places in 616 ms of which 7 ms to minimize.
[2023-03-21 16:40:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 770 ms
[2023-03-21 16:40:53] [INFO ] After 1456ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-21 16:40:53] [INFO ] After 2128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-21 16:40:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2023-03-21 16:40:56] [INFO ] After 2341ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :19
[2023-03-21 16:40:57] [INFO ] Deduced a trap composed of 165 places in 580 ms of which 2 ms to minimize.
[2023-03-21 16:40:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 697 ms
[2023-03-21 16:40:59] [INFO ] After 5652ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :19
Attempting to minimize the solution found.
Minimization took 1890 ms.
[2023-03-21 16:41:01] [INFO ] After 8449ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :19
Fused 20 Parikh solutions to 17 different solutions.
Parikh walk visited 17 properties in 321 ms.
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 557 edges and 549 vertex of which 78 / 549 are part of one of the 14 SCC in 13 ms
Free SCC test removed 64 places
Drop transitions removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Graph (complete) has 1049 edges and 485 vertex of which 480 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.16 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 345 rules applied. Total rules applied 347 place count 480 transition count 684
Reduce places removed 340 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 352 rules applied. Total rules applied 699 place count 140 transition count 672
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 706 place count 134 transition count 671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 707 place count 133 transition count 671
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 707 place count 133 transition count 645
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 759 place count 107 transition count 645
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 760 place count 107 transition count 644
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 812 place count 81 transition count 618
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 821 place count 81 transition count 609
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 841 place count 61 transition count 168
Iterating global reduction 6 with 20 rules applied. Total rules applied 861 place count 61 transition count 168
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 872 place count 61 transition count 157
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 876 place count 57 transition count 153
Iterating global reduction 7 with 4 rules applied. Total rules applied 880 place count 57 transition count 153
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 890 place count 52 transition count 148
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 896 place count 49 transition count 156
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 904 place count 49 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 906 place count 48 transition count 154
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 914 place count 48 transition count 146
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 940 place count 48 transition count 120
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 43 rules applied. Total rules applied 983 place count 22 transition count 103
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 988 place count 17 transition count 98
Iterating global reduction 8 with 5 rules applied. Total rules applied 993 place count 17 transition count 98
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 1024 place count 17 transition count 67
Applied a total of 1024 rules in 285 ms. Remains 17 /549 variables (removed 532) and now considering 67/1116 (removed 1049) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 17/549 places, 67/1116 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
FORMULA StigmergyElection-PT-05b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA StigmergyElection-PT-05b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA StigmergyElection-PT-05b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 75 stabilizing places and 80 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p1)))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 51 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-21 16:41:02] [INFO ] Invariant cache hit.
[2023-03-21 16:41:03] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-21 16:41:03] [INFO ] Invariant cache hit.
[2023-03-21 16:41:04] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2023-03-21 16:41:04] [INFO ] Invariant cache hit.
[2023-03-21 16:41:05] [INFO ] Dead Transitions using invariants and state equation in 1181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2615 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 439 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s486 1), p1:(NEQ s335 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33361 reset in 790 ms.
Product exploration explored 100000 steps with 33475 reset in 526 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 464 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 110 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 16:41:08] [INFO ] Invariant cache hit.
[2023-03-21 16:41:08] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2023-03-21 16:41:09] [INFO ] After 739ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-21 16:41:10] [INFO ] Deduced a trap composed of 164 places in 700 ms of which 2 ms to minimize.
[2023-03-21 16:41:10] [INFO ] Deduced a trap composed of 165 places in 563 ms of which 2 ms to minimize.
[2023-03-21 16:41:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1457 ms
[2023-03-21 16:41:10] [INFO ] After 2249ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:41:10] [INFO ] After 2432ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:41:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2023-03-21 16:41:11] [INFO ] After 798ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 16:41:12] [INFO ] Deduced a trap composed of 164 places in 712 ms of which 2 ms to minimize.
[2023-03-21 16:41:13] [INFO ] Deduced a trap composed of 165 places in 645 ms of which 1 ms to minimize.
[2023-03-21 16:41:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1545 ms
[2023-03-21 16:41:13] [INFO ] After 2480ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-21 16:41:13] [INFO ] After 2784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 558 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Drop transitions removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1041 edges and 479 vertex of which 474 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 339 rules applied. Total rules applied 341 place count 474 transition count 682
Reduce places removed 334 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 344 rules applied. Total rules applied 685 place count 140 transition count 672
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 692 place count 135 transition count 670
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 694 place count 133 transition count 670
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 694 place count 133 transition count 644
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 746 place count 107 transition count 644
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 747 place count 107 transition count 643
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 799 place count 81 transition count 617
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 809 place count 81 transition count 607
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 829 place count 61 transition count 166
Iterating global reduction 6 with 20 rules applied. Total rules applied 849 place count 61 transition count 166
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 860 place count 61 transition count 155
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 864 place count 57 transition count 151
Iterating global reduction 7 with 4 rules applied. Total rules applied 868 place count 57 transition count 151
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 878 place count 52 transition count 146
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 884 place count 49 transition count 154
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 892 place count 49 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 894 place count 48 transition count 152
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 902 place count 48 transition count 144
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 928 place count 48 transition count 118
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 963 place count 22 transition count 109
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 968 place count 17 transition count 104
Iterating global reduction 8 with 5 rules applied. Total rules applied 973 place count 17 transition count 104
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 996 place count 17 transition count 81
Applied a total of 996 rules in 165 ms. Remains 17 /549 variables (removed 532) and now considering 81/1116 (removed 1035) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 17/549 places, 81/1116 transitions.
Finished random walk after 31 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 513 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 21 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-21 16:41:14] [INFO ] Invariant cache hit.
[2023-03-21 16:41:15] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-21 16:41:15] [INFO ] Invariant cache hit.
[2023-03-21 16:41:16] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
[2023-03-21 16:41:16] [INFO ] Invariant cache hit.
[2023-03-21 16:41:17] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3026 ms. Remains : 549/549 places, 1116/1116 transitions.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 402 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 112 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 16:41:18] [INFO ] Invariant cache hit.
[2023-03-21 16:41:18] [INFO ] [Real]Absence check using 6 positive place invariants in 12 ms returned sat
[2023-03-21 16:41:19] [INFO ] After 716ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-21 16:41:20] [INFO ] Deduced a trap composed of 165 places in 697 ms of which 1 ms to minimize.
[2023-03-21 16:41:20] [INFO ] Deduced a trap composed of 164 places in 631 ms of which 1 ms to minimize.
[2023-03-21 16:41:21] [INFO ] Deduced a trap composed of 163 places in 588 ms of which 1 ms to minimize.
[2023-03-21 16:41:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2181 ms
[2023-03-21 16:41:21] [INFO ] After 2952ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:41:21] [INFO ] After 3167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:41:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2023-03-21 16:41:22] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 16:41:23] [INFO ] Deduced a trap composed of 164 places in 606 ms of which 1 ms to minimize.
[2023-03-21 16:41:23] [INFO ] Deduced a trap composed of 165 places in 644 ms of which 1 ms to minimize.
[2023-03-21 16:41:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1421 ms
[2023-03-21 16:41:24] [INFO ] After 2236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-21 16:41:24] [INFO ] After 2539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 558 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 3 ms
Free SCC test removed 70 places
Drop transitions removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1041 edges and 479 vertex of which 474 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 339 rules applied. Total rules applied 341 place count 474 transition count 682
Reduce places removed 334 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 344 rules applied. Total rules applied 685 place count 140 transition count 672
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 692 place count 135 transition count 670
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 694 place count 133 transition count 670
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 694 place count 133 transition count 644
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 746 place count 107 transition count 644
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 747 place count 107 transition count 643
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 799 place count 81 transition count 617
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 809 place count 81 transition count 607
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 829 place count 61 transition count 166
Iterating global reduction 6 with 20 rules applied. Total rules applied 849 place count 61 transition count 166
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 860 place count 61 transition count 155
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 864 place count 57 transition count 151
Iterating global reduction 7 with 4 rules applied. Total rules applied 868 place count 57 transition count 151
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 878 place count 52 transition count 146
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 884 place count 49 transition count 154
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 892 place count 49 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 894 place count 48 transition count 152
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 902 place count 48 transition count 144
Free-agglomeration rule applied 26 times.
Iterating global reduction 7 with 26 rules applied. Total rules applied 928 place count 48 transition count 118
Reduce places removed 26 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 963 place count 22 transition count 109
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 968 place count 17 transition count 104
Iterating global reduction 8 with 5 rules applied. Total rules applied 973 place count 17 transition count 104
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 996 place count 17 transition count 81
Applied a total of 996 rules in 112 ms. Remains 17 /549 variables (removed 532) and now considering 81/1116 (removed 1035) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 17/549 places, 81/1116 transitions.
Finished random walk after 26 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 561 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33324 reset in 579 ms.
Product exploration explored 100000 steps with 33336 reset in 493 ms.
Built C files in :
/tmp/ltsmin5267137162325181333
[2023-03-21 16:41:26] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5267137162325181333
Running compilation step : cd /tmp/ltsmin5267137162325181333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5267137162325181333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5267137162325181333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 13 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-21 16:41:29] [INFO ] Invariant cache hit.
[2023-03-21 16:41:30] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-21 16:41:30] [INFO ] Invariant cache hit.
[2023-03-21 16:41:30] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
[2023-03-21 16:41:30] [INFO ] Invariant cache hit.
[2023-03-21 16:41:31] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1908 ms. Remains : 549/549 places, 1116/1116 transitions.
Built C files in :
/tmp/ltsmin16785630531114296480
[2023-03-21 16:41:31] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16785630531114296480
Running compilation step : cd /tmp/ltsmin16785630531114296480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16785630531114296480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16785630531114296480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-21 16:41:35] [INFO ] Flatten gal took : 66 ms
[2023-03-21 16:41:35] [INFO ] Flatten gal took : 67 ms
[2023-03-21 16:41:35] [INFO ] Time to serialize gal into /tmp/LTL4065090004512945923.gal : 20 ms
[2023-03-21 16:41:35] [INFO ] Time to serialize properties into /tmp/LTL10014974358841340334.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4065090004512945923.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11289323110554633690.hoa' '-atoms' '/tmp/LTL10014974358841340334.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10014974358841340334.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11289323110554633690.hoa
Detected timeout of ITS tools.
[2023-03-21 16:41:50] [INFO ] Flatten gal took : 65 ms
[2023-03-21 16:41:50] [INFO ] Flatten gal took : 57 ms
[2023-03-21 16:41:50] [INFO ] Time to serialize gal into /tmp/LTL160539478869886668.gal : 18 ms
[2023-03-21 16:41:50] [INFO ] Time to serialize properties into /tmp/LTL8121060607814424356.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL160539478869886668.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8121060607814424356.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p619!=1)")&&(X("(p427!=1)"))))))
Formula 0 simplified : FG(!"(p619!=1)" | X!"(p427!=1)")
Detected timeout of ITS tools.
[2023-03-21 16:42:05] [INFO ] Flatten gal took : 52 ms
[2023-03-21 16:42:05] [INFO ] Applying decomposition
[2023-03-21 16:42:05] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2980905969268445107.txt' '-o' '/tmp/graph2980905969268445107.bin' '-w' '/tmp/graph2980905969268445107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2980905969268445107.bin' '-l' '-1' '-v' '-w' '/tmp/graph2980905969268445107.weights' '-q' '0' '-e' '0.001'
[2023-03-21 16:42:05] [INFO ] Decomposing Gal with order
[2023-03-21 16:42:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 16:42:06] [INFO ] Removed a total of 2731 redundant transitions.
[2023-03-21 16:42:06] [INFO ] Flatten gal took : 212 ms
[2023-03-21 16:42:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 39 ms.
[2023-03-21 16:42:06] [INFO ] Time to serialize gal into /tmp/LTL12048865714792480023.gal : 18 ms
[2023-03-21 16:42:06] [INFO ] Time to serialize properties into /tmp/LTL437021739153544209.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12048865714792480023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL437021739153544209.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i36.u201.p619!=1)")&&(X("(i24.u138.p427!=1)"))))))
Formula 0 simplified : FG(!"(i36.u201.p619!=1)" | X!"(i24.u138.p427!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9615536313881635966
[2023-03-21 16:42:21] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9615536313881635966
Running compilation step : cd /tmp/ltsmin9615536313881635966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9615536313881635966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9615536313881635966;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property StigmergyElection-PT-05b-LTLFireability-00 finished in 81749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 555 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 324 transitions
Trivial Post-agglo rules discarded 324 transitions
Performed 324 trivial Post agglomeration. Transition count delta: 324
Iterating post reduction 0 with 324 rules applied. Total rules applied 325 place count 478 transition count 711
Reduce places removed 324 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 334 rules applied. Total rules applied 659 place count 154 transition count 701
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 664 place count 149 transition count 701
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 664 place count 149 transition count 681
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 704 place count 129 transition count 681
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 708 place count 125 transition count 677
Iterating global reduction 3 with 4 rules applied. Total rules applied 712 place count 125 transition count 677
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 760 place count 101 transition count 653
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 777 place count 84 transition count 292
Iterating global reduction 3 with 17 rules applied. Total rules applied 794 place count 84 transition count 292
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 801 place count 84 transition count 285
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 805 place count 80 transition count 277
Iterating global reduction 4 with 4 rules applied. Total rules applied 809 place count 80 transition count 277
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 813 place count 76 transition count 269
Iterating global reduction 4 with 4 rules applied. Total rules applied 817 place count 76 transition count 269
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 835 place count 67 transition count 276
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 836 place count 66 transition count 265
Iterating global reduction 4 with 1 rules applied. Total rules applied 837 place count 66 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 838 place count 66 transition count 264
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 844 place count 66 transition count 258
Applied a total of 844 rules in 100 ms. Remains 66 /549 variables (removed 483) and now considering 258/1116 (removed 858) transitions.
[2023-03-21 16:42:24] [INFO ] Flow matrix only has 252 transitions (discarded 6 similar events)
// Phase 1: matrix 252 rows 66 cols
[2023-03-21 16:42:24] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-21 16:42:24] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-21 16:42:24] [INFO ] Flow matrix only has 252 transitions (discarded 6 similar events)
[2023-03-21 16:42:24] [INFO ] Invariant cache hit.
[2023-03-21 16:42:24] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 16:42:24] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-21 16:42:24] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-21 16:42:24] [INFO ] Flow matrix only has 252 transitions (discarded 6 similar events)
[2023-03-21 16:42:24] [INFO ] Invariant cache hit.
[2023-03-21 16:42:25] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/549 places, 258/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 607 ms. Remains : 66/549 places, 258/1116 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s19 0) (EQ s32 0) (EQ s45 0) (EQ s58 0)), p1:(EQ s42 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1526 steps with 154 reset in 15 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-02 finished in 759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p0))))))'
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 559 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 324 place count 478 transition count 712
Reduce places removed 323 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 333 rules applied. Total rules applied 657 place count 155 transition count 702
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 664 place count 150 transition count 700
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 666 place count 148 transition count 700
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 666 place count 148 transition count 679
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 708 place count 127 transition count 679
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 712 place count 123 transition count 675
Iterating global reduction 4 with 4 rules applied. Total rules applied 716 place count 123 transition count 675
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 764 place count 99 transition count 651
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 784 place count 79 transition count 214
Iterating global reduction 4 with 20 rules applied. Total rules applied 804 place count 79 transition count 214
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 813 place count 79 transition count 205
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 818 place count 74 transition count 195
Iterating global reduction 5 with 5 rules applied. Total rules applied 823 place count 74 transition count 195
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 828 place count 69 transition count 185
Iterating global reduction 5 with 5 rules applied. Total rules applied 833 place count 69 transition count 185
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 851 place count 60 transition count 192
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 852 place count 59 transition count 182
Iterating global reduction 5 with 1 rules applied. Total rules applied 853 place count 59 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 854 place count 59 transition count 181
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 859 place count 59 transition count 176
Applied a total of 859 rules in 64 ms. Remains 59 /549 variables (removed 490) and now considering 176/1116 (removed 940) transitions.
[2023-03-21 16:42:25] [INFO ] Flow matrix only has 170 transitions (discarded 6 similar events)
// Phase 1: matrix 170 rows 59 cols
[2023-03-21 16:42:25] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 16:42:25] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-21 16:42:25] [INFO ] Flow matrix only has 170 transitions (discarded 6 similar events)
[2023-03-21 16:42:25] [INFO ] Invariant cache hit.
[2023-03-21 16:42:25] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 16:42:25] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-21 16:42:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 16:42:25] [INFO ] Flow matrix only has 170 transitions (discarded 6 similar events)
[2023-03-21 16:42:25] [INFO ] Invariant cache hit.
[2023-03-21 16:42:25] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/549 places, 176/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 424 ms. Remains : 59/549 places, 176/1116 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s41 1), p1:(NEQ s10 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 16597 steps with 1830 reset in 54 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-05 finished in 614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (G(p0)||(F(G(p2))&&p1))))))'
Support contains 9 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 12 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2023-03-21 16:42:25] [INFO ] Computed 6 place invariants in 13 ms
[2023-03-21 16:42:26] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-21 16:42:26] [INFO ] Invariant cache hit.
[2023-03-21 16:42:26] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2023-03-21 16:42:26] [INFO ] Invariant cache hit.
[2023-03-21 16:42:27] [INFO ] Dead Transitions using invariants and state equation in 928 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1791 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s69 1) (EQ s175 1) (EQ s270 1) (EQ s376 1) (EQ s482 1))) (EQ s69 1) (EQ s164 1) (EQ s292 1) (EQ s387 1) (EQ s482 1)), p0:(AND (EQ s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-06 finished in 2026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 13 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-21 16:42:27] [INFO ] Invariant cache hit.
[2023-03-21 16:42:28] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-21 16:42:28] [INFO ] Invariant cache hit.
[2023-03-21 16:42:28] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
[2023-03-21 16:42:28] [INFO ] Invariant cache hit.
[2023-03-21 16:42:29] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1803 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s22 1) (EQ s150 1) (EQ s245 1) (EQ s340 1) (EQ s468 1)), p1:(EQ s521 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][false, false, false]]
Stuttering criterion allowed to conclude after 91 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-07 finished in 1929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(F(p1))))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 13 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-21 16:42:29] [INFO ] Invariant cache hit.
[2023-03-21 16:42:30] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-21 16:42:30] [INFO ] Invariant cache hit.
[2023-03-21 16:42:31] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2023-03-21 16:42:31] [INFO ] Invariant cache hit.
[2023-03-21 16:42:31] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2016 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s542 0), p1:(OR (NEQ s33 1) (NEQ s150 1) (NEQ s234 1) (NEQ s340 1) (NEQ s468 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1123 reset in 230 ms.
Product exploration explored 100000 steps with 1118 reset in 282 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 112 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 667304 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 667304 steps, saw 114262 distinct states, run finished after 3006 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 16:42:35] [INFO ] Invariant cache hit.
[2023-03-21 16:42:36] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2023-03-21 16:42:36] [INFO ] After 473ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 16:42:36] [INFO ] After 574ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-21 16:42:36] [INFO ] After 768ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 97 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=97 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Support contains 5 out of 549 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 556 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 1 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 323 place count 478 transition count 713
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 332 rules applied. Total rules applied 655 place count 156 transition count 703
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 661 place count 151 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 662 place count 150 transition count 702
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 662 place count 150 transition count 681
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 704 place count 129 transition count 681
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 708 place count 125 transition count 677
Iterating global reduction 4 with 4 rules applied. Total rules applied 712 place count 125 transition count 677
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 760 place count 101 transition count 653
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 777 place count 84 transition count 292
Iterating global reduction 4 with 17 rules applied. Total rules applied 794 place count 84 transition count 292
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 801 place count 84 transition count 285
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 806 place count 79 transition count 275
Iterating global reduction 5 with 5 rules applied. Total rules applied 811 place count 79 transition count 275
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 816 place count 74 transition count 265
Iterating global reduction 5 with 5 rules applied. Total rules applied 821 place count 74 transition count 265
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 839 place count 65 transition count 272
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 840 place count 64 transition count 262
Iterating global reduction 5 with 1 rules applied. Total rules applied 841 place count 64 transition count 262
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 846 place count 64 transition count 257
Applied a total of 846 rules in 70 ms. Remains 64 /549 variables (removed 485) and now considering 257/1116 (removed 859) transitions.
[2023-03-21 16:42:37] [INFO ] Flow matrix only has 251 transitions (discarded 6 similar events)
// Phase 1: matrix 251 rows 64 cols
[2023-03-21 16:42:37] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-21 16:42:37] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-21 16:42:37] [INFO ] Flow matrix only has 251 transitions (discarded 6 similar events)
[2023-03-21 16:42:37] [INFO ] Invariant cache hit.
[2023-03-21 16:42:37] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 16:42:37] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-21 16:42:37] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-21 16:42:37] [INFO ] Flow matrix only has 251 transitions (discarded 6 similar events)
[2023-03-21 16:42:37] [INFO ] Invariant cache hit.
[2023-03-21 16:42:37] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/549 places, 257/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 483 ms. Remains : 64/549 places, 257/1116 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1099 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 173532 steps, run visited all 1 properties in 342 ms. (steps per millisecond=507 )
Probabilistic random walk after 173532 steps, saw 38941 distinct states, run finished after 342 ms. (steps per millisecond=507 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 11125 reset in 194 ms.
Product exploration explored 100000 steps with 11144 reset in 203 ms.
Built C files in :
/tmp/ltsmin7306004652144462436
[2023-03-21 16:42:38] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2023-03-21 16:42:38] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 16:42:38] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2023-03-21 16:42:38] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 16:42:38] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2023-03-21 16:42:38] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 16:42:38] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7306004652144462436
Running compilation step : cd /tmp/ltsmin7306004652144462436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1127 ms.
Running link step : cd /tmp/ltsmin7306004652144462436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin7306004652144462436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18021922015144385760.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 257/257 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 256
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 63 transition count 255
Applied a total of 3 rules in 14 ms. Remains 63 /64 variables (removed 1) and now considering 255/257 (removed 2) transitions.
[2023-03-21 16:42:53] [INFO ] Flow matrix only has 249 transitions (discarded 6 similar events)
// Phase 1: matrix 249 rows 63 cols
[2023-03-21 16:42:53] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-21 16:42:54] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-21 16:42:54] [INFO ] Flow matrix only has 249 transitions (discarded 6 similar events)
[2023-03-21 16:42:54] [INFO ] Invariant cache hit.
[2023-03-21 16:42:54] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 16:42:54] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-21 16:42:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 16:42:54] [INFO ] Flow matrix only has 249 transitions (discarded 6 similar events)
[2023-03-21 16:42:54] [INFO ] Invariant cache hit.
[2023-03-21 16:42:54] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/64 places, 255/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 468 ms. Remains : 63/64 places, 255/257 transitions.
Built C files in :
/tmp/ltsmin14903024513670991236
[2023-03-21 16:42:54] [INFO ] Computing symmetric may disable matrix : 255 transitions.
[2023-03-21 16:42:54] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 16:42:54] [INFO ] Computing symmetric may enable matrix : 255 transitions.
[2023-03-21 16:42:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 16:42:54] [INFO ] Computing Do-Not-Accords matrix : 255 transitions.
[2023-03-21 16:42:54] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 16:42:54] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14903024513670991236
Running compilation step : cd /tmp/ltsmin14903024513670991236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 992 ms.
Running link step : cd /tmp/ltsmin14903024513670991236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin14903024513670991236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9987635789893688388.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-21 16:43:09] [INFO ] Flatten gal took : 20 ms
[2023-03-21 16:43:09] [INFO ] Flatten gal took : 17 ms
[2023-03-21 16:43:09] [INFO ] Time to serialize gal into /tmp/LTL4480765264218411957.gal : 4 ms
[2023-03-21 16:43:09] [INFO ] Time to serialize properties into /tmp/LTL8743675641008078879.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4480765264218411957.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18267216325957055450.hoa' '-atoms' '/tmp/LTL8743675641008078879.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8743675641008078879.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18267216325957055450.hoa
Reverse transition relation is NOT exact ! Due to transitions t77, t167.t168.t169.t170.t171.t586, t175, t265.t266.t267.t268.t269.t577, t273, t363.t364.t365...704
Computing Next relation with stutter on 12207 deadlock states
17 unique states visited
0 strongly connected components in search stack
32 transitions explored
16 items max in DFS search stack
993 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.0156,203832,1,0,402,635543,533,256,8941,619164,651
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyElection-PT-05b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property StigmergyElection-PT-05b-LTLFireability-09 finished in 50631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(F(p0))))))'
Support contains 1 out of 549 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 560 edges and 549 vertex of which 78 / 549 are part of one of the 14 SCC in 1 ms
Free SCC test removed 64 places
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 484 transition count 711
Reduce places removed 331 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 343 rules applied. Total rules applied 675 place count 153 transition count 699
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 682 place count 147 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 683 place count 146 transition count 698
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 683 place count 146 transition count 676
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 727 place count 124 transition count 676
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 731 place count 120 transition count 672
Iterating global reduction 4 with 4 rules applied. Total rules applied 735 place count 120 transition count 672
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 783 place count 96 transition count 648
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 802 place count 77 transition count 213
Iterating global reduction 4 with 19 rules applied. Total rules applied 821 place count 77 transition count 213
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 831 place count 77 transition count 203
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 835 place count 73 transition count 195
Iterating global reduction 5 with 4 rules applied. Total rules applied 839 place count 73 transition count 195
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 843 place count 69 transition count 187
Iterating global reduction 5 with 4 rules applied. Total rules applied 847 place count 69 transition count 187
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 867 place count 59 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 868 place count 58 transition count 182
Iterating global reduction 5 with 1 rules applied. Total rules applied 869 place count 58 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 870 place count 58 transition count 181
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 875 place count 58 transition count 176
Applied a total of 875 rules in 66 ms. Remains 58 /549 variables (removed 491) and now considering 176/1116 (removed 940) transitions.
[2023-03-21 16:43:20] [INFO ] Flow matrix only has 170 transitions (discarded 6 similar events)
// Phase 1: matrix 170 rows 58 cols
[2023-03-21 16:43:20] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-21 16:43:20] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-21 16:43:20] [INFO ] Flow matrix only has 170 transitions (discarded 6 similar events)
[2023-03-21 16:43:20] [INFO ] Invariant cache hit.
[2023-03-21 16:43:20] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 16:43:20] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-21 16:43:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 16:43:20] [INFO ] Flow matrix only has 170 transitions (discarded 6 similar events)
[2023-03-21 16:43:20] [INFO ] Invariant cache hit.
[2023-03-21 16:43:21] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/549 places, 176/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 549 ms. Remains : 58/549 places, 176/1116 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s14 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]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-10 finished in 626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
Support contains 10 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 13 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
// Phase 1: matrix 1116 rows 549 cols
[2023-03-21 16:43:21] [INFO ] Computed 6 place invariants in 17 ms
[2023-03-21 16:43:21] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-21 16:43:21] [INFO ] Invariant cache hit.
[2023-03-21 16:43:22] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1087 ms to find 0 implicit places.
[2023-03-21 16:43:22] [INFO ] Invariant cache hit.
[2023-03-21 16:43:22] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1855 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s58 1) (EQ s164 1) (EQ s270 1) (EQ s398 1) (EQ s482 1)), p1:(AND (EQ s44 1) (EQ s150 1) (EQ s234 1) (EQ s340 1) (EQ s446 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-11 finished in 2052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((F(p1)||G(p2))))))'
Support contains 7 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 11 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-21 16:43:23] [INFO ] Invariant cache hit.
[2023-03-21 16:43:23] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-21 16:43:23] [INFO ] Invariant cache hit.
[2023-03-21 16:43:24] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
[2023-03-21 16:43:24] [INFO ] Invariant cache hit.
[2023-03-21 16:43:25] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1950 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s236 1), p0:(AND (EQ s236 0) (EQ s34 0)), p2:(AND (EQ s80 1) (EQ s164 1) (EQ s281 1) (EQ s398 1) (EQ s493 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 459 ms.
Product exploration explored 100000 steps with 50000 reset in 470 ms.
Computed a total of 75 stabilizing places and 80 stable transitions
Computed a total of 75 stabilizing places and 80 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-05b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-05b-LTLFireability-12 finished in 3135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&(p0 U p1)&&X((!p0 U p2)))))'
Support contains 9 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 12 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-21 16:43:26] [INFO ] Invariant cache hit.
[2023-03-21 16:43:26] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-21 16:43:26] [INFO ] Invariant cache hit.
[2023-03-21 16:43:27] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
[2023-03-21 16:43:27] [INFO ] Invariant cache hit.
[2023-03-21 16:43:28] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1908 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s33 1) (EQ s139 1) (EQ s245 1) (EQ s351 1) (EQ s468 1)), p1:(AND (EQ s33 1) (EQ s150 1) (EQ s245 1) (EQ s362 1) (EQ s446 1)), p2:(AND (EQ s44 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-14 finished in 2044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(X(p1)||F(p2)))))'
Support contains 6 out of 549 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Applied a total of 0 rules in 12 ms. Remains 549 /549 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2023-03-21 16:43:28] [INFO ] Invariant cache hit.
[2023-03-21 16:43:28] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-21 16:43:28] [INFO ] Invariant cache hit.
[2023-03-21 16:43:29] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
[2023-03-21 16:43:29] [INFO ] Invariant cache hit.
[2023-03-21 16:43:30] [INFO ] Dead Transitions using invariants and state equation in 1169 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2300 ms. Remains : 549/549 places, 1116/1116 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s372 1), p2:(AND (EQ s33 1) (EQ s128 1) (EQ s234 1) (EQ s351 1) (EQ s468 1)), p1:(OR (EQ s33 0) (EQ s128 0) (EQ s234 0) (EQ s351 0) (EQ s468 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-05b-LTLFireability-15 finished in 2450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p1)))))'
Found a Shortening insensitive property : StigmergyElection-PT-05b-LTLFireability-00
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 549 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 549/549 places, 1116/1116 transitions.
Graph (trivial) has 558 edges and 549 vertex of which 85 / 549 are part of one of the 15 SCC in 2 ms
Free SCC test removed 70 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 325 transitions
Trivial Post-agglo rules discarded 325 transitions
Performed 325 trivial Post agglomeration. Transition count delta: 325
Iterating post reduction 0 with 325 rules applied. Total rules applied 326 place count 478 transition count 710
Reduce places removed 325 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 335 rules applied. Total rules applied 661 place count 153 transition count 700
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 667 place count 148 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 668 place count 147 transition count 699
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 668 place count 147 transition count 678
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 710 place count 126 transition count 678
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 714 place count 122 transition count 674
Iterating global reduction 4 with 4 rules applied. Total rules applied 718 place count 122 transition count 674
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 766 place count 98 transition count 650
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 786 place count 78 transition count 213
Iterating global reduction 4 with 20 rules applied. Total rules applied 806 place count 78 transition count 213
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 816 place count 78 transition count 203
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 820 place count 74 transition count 195
Iterating global reduction 5 with 4 rules applied. Total rules applied 824 place count 74 transition count 195
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 828 place count 70 transition count 187
Iterating global reduction 5 with 4 rules applied. Total rules applied 832 place count 70 transition count 187
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 850 place count 61 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 851 place count 60 transition count 183
Iterating global reduction 5 with 1 rules applied. Total rules applied 852 place count 60 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 853 place count 60 transition count 182
Applied a total of 853 rules in 90 ms. Remains 60 /549 variables (removed 489) and now considering 182/1116 (removed 934) transitions.
[2023-03-21 16:43:31] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
// Phase 1: matrix 176 rows 60 cols
[2023-03-21 16:43:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 16:43:31] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-21 16:43:31] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-21 16:43:31] [INFO ] Invariant cache hit.
[2023-03-21 16:43:31] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 16:43:31] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-21 16:43:31] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-21 16:43:31] [INFO ] Invariant cache hit.
[2023-03-21 16:43:31] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 60/549 places, 182/1116 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 561 ms. Remains : 60/549 places, 182/1116 transitions.
Running random walk in product with property : StigmergyElection-PT-05b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s52 1), p1:(NEQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33534 reset in 421 ms.
Product exploration explored 100000 steps with 33412 reset in 442 ms.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 303 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1106 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 16:43:32] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-21 16:43:32] [INFO ] Invariant cache hit.
[2023-03-21 16:43:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 16:43:33] [INFO ] After 81ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 16:43:33] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 16:43:33] [INFO ] After 23ms SMT Verify possible using 31 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 16:43:33] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 16:43:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 16:43:33] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 16:43:33] [INFO ] After 22ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 16:43:33] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-21 16:43:33] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 182/182 transitions.
Graph (complete) has 321 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 59 transition count 170
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 32 place count 49 transition count 160
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 38 place count 49 transition count 154
Free-agglomeration rule applied 26 times.
Iterating global reduction 2 with 26 rules applied. Total rules applied 64 place count 49 transition count 128
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 100 place count 22 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 100 place count 22 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 21 transition count 118
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 107 place count 16 transition count 113
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 16 transition count 113
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 135 place count 16 transition count 90
Performed 5 Post agglomeration using F-continuation condition with reduction of 63 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 147 place count 9 transition count 22
Drop transitions removed 5 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 161 place count 9 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 8 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 165 place count 6 transition count 6
Applied a total of 165 rules in 29 ms. Remains 6 /60 variables (removed 54) and now considering 6/182 (removed 176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 6/60 places, 6/182 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 341 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 182/182 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-21 16:43:33] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-21 16:43:33] [INFO ] Invariant cache hit.
[2023-03-21 16:43:33] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-21 16:43:33] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-21 16:43:34] [INFO ] Invariant cache hit.
[2023-03-21 16:43:34] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 16:43:34] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-21 16:43:34] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-21 16:43:34] [INFO ] Invariant cache hit.
[2023-03-21 16:43:34] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 526 ms. Remains : 60/60 places, 182/182 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 379 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1117 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 16:43:35] [INFO ] Flow matrix only has 176 transitions (discarded 6 similar events)
[2023-03-21 16:43:35] [INFO ] Invariant cache hit.
[2023-03-21 16:43:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 16:43:35] [INFO ] After 74ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 16:43:35] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 16:43:35] [INFO ] After 17ms SMT Verify possible using 31 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 16:43:35] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 16:43:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 16:43:35] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 16:43:35] [INFO ] After 16ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 16:43:35] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-21 16:43:35] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 182/182 transitions.
Graph (complete) has 321 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 59 transition count 170
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 32 place count 49 transition count 160
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 38 place count 49 transition count 154
Free-agglomeration rule applied 26 times.
Iterating global reduction 2 with 26 rules applied. Total rules applied 64 place count 49 transition count 128
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 100 place count 22 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 100 place count 22 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 21 transition count 118
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 107 place count 16 transition count 113
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 16 transition count 113
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 135 place count 16 transition count 90
Performed 5 Post agglomeration using F-continuation condition with reduction of 63 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 147 place count 9 transition count 22
Drop transitions removed 5 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 161 place count 9 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 8 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 7 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 165 place count 6 transition count 6
Applied a total of 165 rules in 25 ms. Remains 6 /60 variables (removed 54) and now considering 6/182 (removed 176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 6/60 places, 6/182 transitions.
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 458 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33370 reset in 407 ms.
Product exploration explored 100000 steps with 33630 reset in 379 ms.
Built C files in :
/tmp/ltsmin7687880005927492142
[2023-03-21 16:43:37] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7687880005927492142
Running compilation step : cd /tmp/ltsmin7687880005927492142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 658 ms.
Running link step : cd /tmp/ltsmin7687880005927492142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7687880005927492142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14812358070484332055.hoa' '--buchi-type=spotba'
LTSmin run took 1606 ms.
Treatment of property StigmergyElection-PT-05b-LTLFireability-00 finished in 8750 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-21 16:43:39] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17371873979993082775
[2023-03-21 16:43:39] [INFO ] Computing symmetric may disable matrix : 1116 transitions.
[2023-03-21 16:43:39] [INFO ] Applying decomposition
[2023-03-21 16:43:39] [INFO ] Computation of Complete disable matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 16:43:39] [INFO ] Computing symmetric may enable matrix : 1116 transitions.
[2023-03-21 16:43:39] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 16:43:39] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16496370136947904662.txt' '-o' '/tmp/graph16496370136947904662.bin' '-w' '/tmp/graph16496370136947904662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16496370136947904662.bin' '-l' '-1' '-v' '-w' '/tmp/graph16496370136947904662.weights' '-q' '0' '-e' '0.001'
[2023-03-21 16:43:39] [INFO ] Decomposing Gal with order
[2023-03-21 16:43:39] [INFO ] Computing Do-Not-Accords matrix : 1116 transitions.
[2023-03-21 16:43:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 16:43:39] [INFO ] Computation of Completed DNA matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 16:43:40] [INFO ] Built C files in 366ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17371873979993082775
Running compilation step : cd /tmp/ltsmin17371873979993082775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-21 16:43:40] [INFO ] Removed a total of 2732 redundant transitions.
[2023-03-21 16:43:40] [INFO ] Flatten gal took : 143 ms
[2023-03-21 16:43:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 23 ms.
[2023-03-21 16:43:40] [INFO ] Time to serialize gal into /tmp/LTLFireability10622755746902273897.gal : 18 ms
[2023-03-21 16:43:40] [INFO ] Time to serialize properties into /tmp/LTLFireability16672350961919857743.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10622755746902273897.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16672350961919857743.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i31.u197.p619!=1)")&&(X("(i22.u131.p427!=1)"))))))
Formula 0 simplified : FG(!"(i31.u197.p619!=1)" | X!"(i22.u131.p427!=1)")
Compilation finished in 6062 ms.
Running link step : cd /tmp/ltsmin17371873979993082775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin17371873979993082775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)&&X((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t67, t112, t146, t165, t244, t246, t263, t308, t342, t361, t406, t440, t442, t458, t503, t537...549
Computing Next relation with stutter on 96484 deadlock states
Detected timeout of ITS tools.
[2023-03-21 17:04:38] [INFO ] Applying decomposition
[2023-03-21 17:04:38] [INFO ] Flatten gal took : 93 ms
[2023-03-21 17:04:38] [INFO ] Decomposing Gal with order
[2023-03-21 17:04:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 17:04:39] [INFO ] Removed a total of 2587 redundant transitions.
[2023-03-21 17:04:39] [INFO ] Flatten gal took : 377 ms
[2023-03-21 17:04:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 29 ms.
[2023-03-21 17:04:39] [INFO ] Time to serialize gal into /tmp/LTLFireability828074630069093927.gal : 4 ms
[2023-03-21 17:04:39] [INFO ] Time to serialize properties into /tmp/LTLFireability17751317837929036929.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability828074630069093927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17751317837929036929.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i0.u9.p619!=1)")&&(X("(i0.i0.u8.p427!=1)"))))))
Formula 0 simplified : FG(!"(i0.u9.p619!=1)" | X!"(i0.i0.u8.p427!=1)")
Reverse transition relation is NOT exact ! Due to transitions t572, i0.u9.t67, i0.u9.t76, i0.u9.t110, i0.u9.t111, i0.u9.t112, i0.u9.t145, i0.u9.t146, i0.u9...862
Computing Next relation with stutter on 96484 deadlock states
245 unique states visited
245 strongly connected components in search stack
246 transitions explored
245 items max in DFS search stack
3336 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,33.4282,543140,1,0,244576,1.40729e+06,6432,658680,3699,6.24641e+06,137055
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA StigmergyElection-PT-05b-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1523678 ms.

BK_STOP 1679418369526

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-05b"
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-5348"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-05b, 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 r453-smll-167912645700612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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