Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572600684.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R020C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572600684
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 6.3K Apr 30 02:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 02:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 02:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 02:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 85K May 10 09:34 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 ResAllocation-PT-R020C002-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R020C002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653088635219

Running Version 202205111006
[2022-05-20 23:17:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 23:17:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 23:17:16] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2022-05-20 23:17:16] [INFO ] Transformed 80 places.
[2022-05-20 23:17:16] [INFO ] Transformed 42 transitions.
[2022-05-20 23:17:16] [INFO ] Parsed PT model containing 80 places and 42 transitions in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ResAllocation-PT-R020C002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 42/42 transitions.
Applied a total of 0 rules in 10 ms. Remains 80 /80 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 80 cols
[2022-05-20 23:17:16] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-20 23:17:16] [INFO ] Implicit Places using invariants in 194 ms returned [41, 43, 45, 47, 53, 55, 59, 61, 63, 75, 77]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 229 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/80 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 69/80 places, 42/42 transitions.
Support contains 41 out of 69 places after structural reductions.
[2022-05-20 23:17:17] [INFO ] Flatten gal took : 44 ms
[2022-05-20 23:17:17] [INFO ] Flatten gal took : 15 ms
[2022-05-20 23:17:17] [INFO ] Input system was already deterministic with 42 transitions.
Support contains 39 out of 69 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 17) seen :13
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 42 rows 69 cols
[2022-05-20 23:17:17] [INFO ] Computed 29 place invariants in 2 ms
[2022-05-20 23:17:17] [INFO ] [Real]Absence check using 29 positive place invariants in 6 ms returned sat
[2022-05-20 23:17:17] [INFO ] After 28ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 23:17:17] [INFO ] After 38ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-20 23:17:17] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 69/69 places, 42/42 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 68 transition count 41
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 68 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 66 transition count 40
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 1 with 2 rules applied. Total rules applied 7 place count 65 transition count 39
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 65 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 63 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 62 transition count 37
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 62 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 60 transition count 36
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 3 with 2 rules applied. Total rules applied 17 place count 59 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 59 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 57 transition count 34
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 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 23 place count 55 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 55 transition count 32
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 26 place count 53 transition count 32
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 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 29 place count 51 transition count 31
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 30 place count 51 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 32 place count 49 transition count 30
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 6 with 2 rules applied. Total rules applied 34 place count 48 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 35 place count 48 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 37 place count 46 transition count 28
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 7 with 2 rules applied. Total rules applied 39 place count 45 transition count 27
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 40 place count 45 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 42 place count 43 transition count 26
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 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 45 place count 41 transition count 25
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 46 place count 41 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 48 place count 39 transition count 24
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 9 with 2 rules applied. Total rules applied 50 place count 38 transition count 23
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 51 place count 38 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 53 place count 36 transition count 22
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 10 with 2 rules applied. Total rules applied 55 place count 35 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 56 place count 35 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 58 place count 33 transition count 20
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 11 with 2 rules applied. Total rules applied 60 place count 32 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 61 place count 32 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 63 place count 30 transition count 18
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 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 66 place count 28 transition count 17
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 67 place count 28 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 69 place count 26 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 13 with 3 rules applied. Total rules applied 72 place count 24 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 73 place count 24 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 75 place count 22 transition count 14
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 2 places and 0 transitions.
Iterating global reduction 14 with 3 rules applied. Total rules applied 78 place count 20 transition count 13
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 79 place count 20 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 81 place count 18 transition count 12
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 2 places and 0 transitions.
Iterating global reduction 15 with 3 rules applied. Total rules applied 84 place count 16 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 85 place count 16 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 87 place count 14 transition count 10
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 2 places and 0 transitions.
Iterating global reduction 16 with 3 rules applied. Total rules applied 90 place count 12 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 91 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 93 place count 10 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 17 with 2 rules applied. Total rules applied 95 place count 9 transition count 7
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 96 place count 9 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 98 place count 7 transition count 6
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 18 with 2 rules applied. Total rules applied 100 place count 6 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 101 place count 6 transition count 4
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t40.t39.t38.t37.t36.t35.t34.t33.t32.t31.t30.t29.t28.t27.t26.t25.t24.t23.t22.t21 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 103 place count 2 transition count 2
Applied a total of 103 rules in 72 ms. Remains 2 /69 variables (removed 67) and now considering 2/42 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/69 places, 2/42 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(X(p0))||p1))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 69 cols
[2022-05-20 23:17:18] [INFO ] Computed 29 place invariants in 2 ms
[2022-05-20 23:17:18] [INFO ] Implicit Places using invariants in 63 ms returned [45, 47, 51, 56, 58, 60, 62, 64, 68]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 66 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/69 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/69 places, 42/42 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s1 1), p0:(AND (GEQ s4 1) (GEQ s7 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]]
Product exploration explored 100000 steps with 31980 reset in 272 ms.
Product exploration explored 100000 steps with 31919 reset in 162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 60 cols
[2022-05-20 23:17:19] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-20 23:17:19] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 42 rows 60 cols
[2022-05-20 23:17:19] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 23:17:19] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 60 cols
[2022-05-20 23:17:19] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 23:17:19] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 3 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 32493 reset in 209 ms.
Product exploration explored 100000 steps with 32151 reset in 205 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 42/42 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 42
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2022-05-20 23:17:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 60 cols
[2022-05-20 23:17:20] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 23:17:21] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/60 places, 42/42 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 42/42 transitions.
Product exploration explored 100000 steps with 32241 reset in 243 ms.
Product exploration explored 100000 steps with 32165 reset in 221 ms.
Built C files in :
/tmp/ltsmin5591258852411113253
[2022-05-20 23:17:21] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5591258852411113253
Running compilation step : cd /tmp/ltsmin5591258852411113253;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 304 ms.
Running link step : cd /tmp/ltsmin5591258852411113253;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin5591258852411113253;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17103040380176972645.hoa' '--buchi-type=spotba'
LTSmin run took 7894 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R020C002-LTLFireability-01 finished in 11777 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G((G(p0)||X(F(X(p1)))))))))'
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 69 cols
[2022-05-20 23:17:29] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-20 23:17:29] [INFO ] Implicit Places using invariants in 75 ms returned [45, 51, 56, 58, 60, 64, 68]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 92 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/69 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/69 places, 42/42 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s31 1) (GEQ s57 1) (GEQ s58 1)), p1:(OR (LT s11 1) (LT s46 1) (LT s47 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 16706 reset in 103 ms.
Product exploration explored 100000 steps with 16663 reset in 109 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 8545 steps, including 74 resets, run visited all 2 properties in 48 ms. (steps per millisecond=178 )
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 42/42 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 62 cols
[2022-05-20 23:17:31] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 23:17:31] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 42 rows 62 cols
[2022-05-20 23:17:31] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 23:17:31] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 62 cols
[2022-05-20 23:17:31] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-20 23:17:31] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 842 steps, including 7 resets, run visited all 2 properties in 3 ms. (steps per millisecond=280 )
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 16701 reset in 111 ms.
Product exploration explored 100000 steps with 16641 reset in 131 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2022-05-20 23:17:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 42 rows 62 cols
[2022-05-20 23:17:33] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 23:17:33] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/62 places, 42/42 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 42/42 transitions.
Product exploration explored 100000 steps with 16769 reset in 211 ms.
Product exploration explored 100000 steps with 16664 reset in 216 ms.
Built C files in :
/tmp/ltsmin13774268101156590915
[2022-05-20 23:17:34] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13774268101156590915
Running compilation step : cd /tmp/ltsmin13774268101156590915;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 146 ms.
Running link step : cd /tmp/ltsmin13774268101156590915;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13774268101156590915;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12234708737444291619.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 62 cols
[2022-05-20 23:17:49] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 23:17:49] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 42 rows 62 cols
[2022-05-20 23:17:49] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 23:17:49] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 62 cols
[2022-05-20 23:17:49] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 23:17:49] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 42/42 transitions.
Built C files in :
/tmp/ltsmin10435099956200298056
[2022-05-20 23:17:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10435099956200298056
Running compilation step : cd /tmp/ltsmin10435099956200298056;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 121 ms.
Running link step : cd /tmp/ltsmin10435099956200298056;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin10435099956200298056;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4352457642594230876.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 23:18:04] [INFO ] Flatten gal took : 5 ms
[2022-05-20 23:18:04] [INFO ] Flatten gal took : 4 ms
[2022-05-20 23:18:04] [INFO ] Time to serialize gal into /tmp/LTL969973710471004393.gal : 2 ms
[2022-05-20 23:18:04] [INFO ] Time to serialize properties into /tmp/LTL13597838007186924222.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL969973710471004393.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13597838007186924222.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9699737...266
Read 1 LTL properties
Checking formula 0 : !((X(G(X(G((G("(((r_0_15>=1)&&(r_1_15>=1))&&(p_1_16>=1))"))||(X(F(X("(((r_0_5<1)||(r_1_5<1))||(p_1_6<1))"))))))))))
Formula 0 simplified : !XGXG(G"(((r_0_15>=1)&&(r_1_15>=1))&&(p_1_16>=1))" | XFX"(((r_0_5<1)||(r_1_5<1))||(p_1_6<1))")
Reverse transition relation is NOT exact ! Due to transitions t20, t21, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...169
Computing Next relation with stutter on 19 deadlock states
7 unique states visited
0 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
13 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,0.159103,25248,1,0,462,45545,118,244,1988,43860,990
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ResAllocation-PT-R020C002-LTLFireability-02 finished in 35133 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G((G((F(p0)&&X(p1)))||G(p2)))))))'
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 67 transition count 40
Applied a total of 4 rules in 6 ms. Remains 67 /69 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 67 cols
[2022-05-20 23:18:04] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-20 23:18:05] [INFO ] Implicit Places using invariants in 79 ms returned [43, 45, 49, 54, 56, 58, 60, 62, 66]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 80 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/69 places, 40/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 58/69 places, 40/42 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(OR (LT s34 1) (LT s37 1)), p1:(OR (LT s14 1) (LT s17 1)), p0:(AND (GEQ s10 1) (GEQ s13 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4081 reset in 155 ms.
Product exploration explored 100000 steps with 4070 reset in 171 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (AND p2 p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 650 ms. Reduced automaton from 2 states, 7 edges and 3 AP to 2 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 65 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 86 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 7) seen :4
Finished Best-First random walk after 218 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=109 )
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND p2 (NOT p1)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (AND p2 p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND p1 p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 15 factoid took 681 ms. Reduced automaton from 2 states, 7 edges and 3 AP to 2 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 59 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 63 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 58 cols
[2022-05-20 23:18:07] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 23:18:07] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 40 rows 58 cols
[2022-05-20 23:18:07] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 23:18:07] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2022-05-20 23:18:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 58 cols
[2022-05-20 23:18:07] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 23:18:07] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 40/40 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) p2)), (X (AND p1 p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 454 ms. Reduced automaton from 2 states, 7 edges and 3 AP to 2 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 66 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 86 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 7) seen :4
Finished Best-First random walk after 3198 steps, including 6 resets, run visited all 3 properties in 6 ms. (steps per millisecond=533 )
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) p2)), (X (AND p1 p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND p1 p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 15 factoid took 652 ms. Reduced automaton from 2 states, 7 edges and 3 AP to 2 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 58 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 3993 reset in 194 ms.
Product exploration explored 100000 steps with 3986 reset in 186 ms.
Built C files in :
/tmp/ltsmin16748105469964885561
[2022-05-20 23:18:09] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2022-05-20 23:18:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:18:09] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2022-05-20 23:18:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:18:09] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2022-05-20 23:18:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:18:09] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16748105469964885561
Running compilation step : cd /tmp/ltsmin16748105469964885561;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 169 ms.
Running link step : cd /tmp/ltsmin16748105469964885561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16748105469964885561;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10851991312599802766.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 40/40 transitions.
Applied a total of 0 rules in 6 ms. Remains 58 /58 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 58 cols
[2022-05-20 23:18:24] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 23:18:24] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 40 rows 58 cols
[2022-05-20 23:18:24] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-20 23:18:24] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2022-05-20 23:18:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 58 cols
[2022-05-20 23:18:24] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 23:18:24] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 40/40 transitions.
Built C files in :
/tmp/ltsmin9046029112050200793
[2022-05-20 23:18:24] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2022-05-20 23:18:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:18:24] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2022-05-20 23:18:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:18:24] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2022-05-20 23:18:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:18:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9046029112050200793
Running compilation step : cd /tmp/ltsmin9046029112050200793;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 152 ms.
Running link step : cd /tmp/ltsmin9046029112050200793;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9046029112050200793;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14592310913378832993.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 23:18:39] [INFO ] Flatten gal took : 7 ms
[2022-05-20 23:18:39] [INFO ] Flatten gal took : 4 ms
[2022-05-20 23:18:39] [INFO ] Time to serialize gal into /tmp/LTL12075163022985285618.gal : 1 ms
[2022-05-20 23:18:39] [INFO ] Time to serialize properties into /tmp/LTL2126277513104338700.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12075163022985285618.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2126277513104338700.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1207516...267
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G((G((F("((p_0_5>=1)&&(r_0_6>=1))"))&&(X("((p_0_7<1)||(r_0_8<1))"))))||(G("((p_0_17<1)||(r_0_18<1))"))))))))
Formula 0 simplified : !FXFG(G(F"((p_0_5>=1)&&(r_0_6>=1))" & X"((p_0_7<1)||(r_0_8<1))") | G"((p_0_17<1)||(r_0_18<1))")
Reverse transition relation is NOT exact ! Due to transitions t19.t20, t22.t21, Intersection with reachable at each step enabled. (destroyed/reverse/inter...177
Computing Next relation with stutter on 19 deadlock states
Detected timeout of ITS tools.
[2022-05-20 23:18:54] [INFO ] Flatten gal took : 3 ms
[2022-05-20 23:18:54] [INFO ] Applying decomposition
[2022-05-20 23:18:54] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6704993220738072600.txt' '-o' '/tmp/graph6704993220738072600.bin' '-w' '/tmp/graph6704993220738072600.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6704993220738072600.bin' '-l' '-1' '-v' '-w' '/tmp/graph6704993220738072600.weights' '-q' '0' '-e' '0.001'
[2022-05-20 23:18:54] [INFO ] Decomposing Gal with order
[2022-05-20 23:18:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 23:18:54] [INFO ] Flatten gal took : 45 ms
[2022-05-20 23:18:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 23:18:55] [INFO ] Time to serialize gal into /tmp/LTL12695697673341394590.gal : 2 ms
[2022-05-20 23:18:55] [INFO ] Time to serialize properties into /tmp/LTL9745384319863613649.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12695697673341394590.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9745384319863613649.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1269569...246
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G((G((F("((i1.u4.p_0_5>=1)&&(i1.u5.r_0_6>=1))"))&&(X("((i1.u6.p_0_7<1)||(i2.i0.u7.r_0_8<1))"))))||(G("((i5.u16.p_0_17<1)||(i5...179
Formula 0 simplified : !FXFG(G(F"((i1.u4.p_0_5>=1)&&(i1.u5.r_0_6>=1))" & X"((i1.u6.p_0_7<1)||(i2.i0.u7.r_0_8<1))") | G"((i5.u16.p_0_17<1)||(i5.u17.r_0_18<1...159
Reverse transition relation is NOT exact ! Due to transitions i5.t19_t20, i6.t22_t21, Intersection with reachable at each step enabled. (destroyed/reverse...183
Computing Next relation with stutter on 19 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14896062926610147691
[2022-05-20 23:19:10] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14896062926610147691
Running compilation step : cd /tmp/ltsmin14896062926610147691;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 157 ms.
Running link step : cd /tmp/ltsmin14896062926610147691;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14896062926610147691;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(<>([](([]((<>((LTLAPp0==true))&&X((LTLAPp1==true))))||[]((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ResAllocation-PT-R020C002-LTLFireability-05 finished in 80202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||p1))&&(X(!p0) U p2)))'
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 69 cols
[2022-05-20 23:19:25] [INFO ] Computed 29 place invariants in 0 ms
[2022-05-20 23:19:25] [INFO ] Implicit Places using invariants in 86 ms returned [45, 47, 51, 56, 60, 62, 64]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 88 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/69 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/69 places, 42/42 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1) p0), (AND (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2)) p0), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s13 1)), p2:(AND (GEQ s39 1) (GEQ s61 1)), p0:(OR (LT s27 1) (LT s54 1) (LT s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-07 finished in 414 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))||G(p0)))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 69 cols
[2022-05-20 23:19:25] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-20 23:19:25] [INFO ] Implicit Places using invariants in 84 ms returned [45, 47, 51, 56, 58, 62, 64, 68]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 85 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/69 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/69 places, 42/42 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s29 1) (GEQ s55 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-09 finished in 241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 67 transition count 40
Applied a total of 4 rules in 3 ms. Remains 67 /69 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 67 cols
[2022-05-20 23:19:25] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-20 23:19:25] [INFO ] Implicit Places using invariants in 59 ms returned [43, 45, 49, 54, 56, 58, 60, 62, 66]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 60 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/69 places, 40/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 58/69 places, 40/42 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s20 1) (LT s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 860 reset in 150 ms.
Product exploration explored 100000 steps with 860 reset in 137 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 599 steps, including 5 resets, run visited all 1 properties in 3 ms. (steps per millisecond=199 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 58 cols
[2022-05-20 23:19:26] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 23:19:26] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 40 rows 58 cols
[2022-05-20 23:19:26] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 23:19:26] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2022-05-20 23:19:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 40 rows 58 cols
[2022-05-20 23:19:26] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 23:19:26] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 40/40 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 172 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=172 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 860 reset in 104 ms.
Product exploration explored 100000 steps with 861 reset in 113 ms.
Built C files in :
/tmp/ltsmin13247907067877741461
[2022-05-20 23:19:27] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2022-05-20 23:19:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:19:27] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2022-05-20 23:19:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:19:27] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2022-05-20 23:19:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:19:27] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13247907067877741461
Running compilation step : cd /tmp/ltsmin13247907067877741461;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 196 ms.
Running link step : cd /tmp/ltsmin13247907067877741461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13247907067877741461;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5251409044267265699.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 58 cols
[2022-05-20 23:19:42] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 23:19:42] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 40 rows 58 cols
[2022-05-20 23:19:42] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 23:19:42] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-05-20 23:19:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 58 cols
[2022-05-20 23:19:42] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-20 23:19:42] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 40/40 transitions.
Built C files in :
/tmp/ltsmin5258518935809139304
[2022-05-20 23:19:42] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2022-05-20 23:19:42] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:19:42] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2022-05-20 23:19:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:19:42] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2022-05-20 23:19:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:19:42] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5258518935809139304
Running compilation step : cd /tmp/ltsmin5258518935809139304;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 162 ms.
Running link step : cd /tmp/ltsmin5258518935809139304;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5258518935809139304;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10235975737699070029.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 23:19:57] [INFO ] Flatten gal took : 6 ms
[2022-05-20 23:19:57] [INFO ] Flatten gal took : 5 ms
[2022-05-20 23:19:57] [INFO ] Time to serialize gal into /tmp/LTL12183874045331695973.gal : 1 ms
[2022-05-20 23:19:57] [INFO ] Time to serialize properties into /tmp/LTL13123228246322845553.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12183874045331695973.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13123228246322845553.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1218387...268
Read 1 LTL properties
Checking formula 0 : !((F(G("((p_0_10<1)||(r_0_11<1))"))))
Formula 0 simplified : !FG"((p_0_10<1)||(r_0_11<1))"
Reverse transition relation is NOT exact ! Due to transitions t19.t20, t22.t21, Intersection with reachable at each step enabled. (destroyed/reverse/inter...177
Computing Next relation with stutter on 19 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
145 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,1.46654,70696,1,0,1830,302846,110,1918,1778,478048,3677
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R020C002-LTLFireability-10 finished in 33919 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||X(G(p1))))'
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 69 cols
[2022-05-20 23:19:59] [INFO ] Computed 29 place invariants in 0 ms
[2022-05-20 23:19:59] [INFO ] Implicit Places using invariants in 70 ms returned [45, 47, 56, 58, 60, 62, 64, 68]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 71 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/69 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 61/69 places, 42/42 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s49 1) (GEQ s50 1)) (AND (GEQ s8 1) (GEQ s11 1))), p1:(AND (GEQ s12 1) (GEQ s15 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]]
Product exploration explored 100000 steps with 6107 reset in 145 ms.
Product exploration explored 100000 steps with 6015 reset in 159 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 227 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 193 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 42 rows 61 cols
[2022-05-20 23:20:00] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 23:20:00] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2022-05-20 23:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:20:00] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-20 23:20:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:20:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2022-05-20 23:20:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:20:00] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-20 23:20:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2022-05-20 23:20:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-20 23:20:00] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-20 23:20:01] [INFO ] Added : 34 causal constraints over 7 iterations in 54 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 61 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 : 61/61 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 59 transition count 40
Applied a total of 4 rules in 7 ms. Remains 59 /61 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 59 cols
[2022-05-20 23:20:01] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 23:20:01] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 40 rows 59 cols
[2022-05-20 23:20:01] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 23:20:01] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2022-05-20 23:20:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 59 cols
[2022-05-20 23:20:01] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 23:20:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/61 places, 40/42 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/61 places, 40/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
// Phase 1: matrix 40 rows 59 cols
[2022-05-20 23:20:01] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 23:20:01] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2022-05-20 23:20:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:20:01] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-20 23:20:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:20:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2022-05-20 23:20:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:20:01] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-05-20 23:20:01] [INFO ] Computed and/alt/rep : 38/38/38 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-20 23:20:01] [INFO ] Added : 36 causal constraints over 8 iterations in 49 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6107 reset in 154 ms.
Product exploration explored 100000 steps with 6000 reset in 184 ms.
Built C files in :
/tmp/ltsmin8478261911718616815
[2022-05-20 23:20:02] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2022-05-20 23:20:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:20:02] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2022-05-20 23:20:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:20:02] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2022-05-20 23:20:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:20:02] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8478261911718616815
Running compilation step : cd /tmp/ltsmin8478261911718616815;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 160 ms.
Running link step : cd /tmp/ltsmin8478261911718616815;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8478261911718616815;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1120960565515538755.hoa' '--buchi-type=spotba'
LTSmin run took 458 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R020C002-LTLFireability-11 finished in 3184 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 67 transition count 40
Applied a total of 4 rules in 2 ms. Remains 67 /69 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 67 cols
[2022-05-20 23:20:02] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-20 23:20:02] [INFO ] Implicit Places using invariants in 55 ms returned [43, 45, 49, 56, 58, 60, 62, 66]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 56 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/69 places, 40/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 59/69 places, 40/42 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s25 1) (LT s51 1) (LT s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2274 reset in 159 ms.
Product exploration explored 100000 steps with 2260 reset in 171 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2022-05-20 23:20:03] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 23:20:04] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 40 rows 59 cols
[2022-05-20 23:20:04] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 23:20:04] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2022-05-20 23:20:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 40 rows 59 cols
[2022-05-20 23:20:04] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-20 23:20:04] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 40/40 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2263 reset in 156 ms.
Product exploration explored 100000 steps with 2279 reset in 159 ms.
Built C files in :
/tmp/ltsmin1099110091964303456
[2022-05-20 23:20:05] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2022-05-20 23:20:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:20:05] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2022-05-20 23:20:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:20:05] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2022-05-20 23:20:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:20:05] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1099110091964303456
Running compilation step : cd /tmp/ltsmin1099110091964303456;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 175 ms.
Running link step : cd /tmp/ltsmin1099110091964303456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1099110091964303456;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13955522592675858135.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2022-05-20 23:20:20] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 23:20:20] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 40 rows 59 cols
[2022-05-20 23:20:20] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 23:20:20] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2022-05-20 23:20:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 40 rows 59 cols
[2022-05-20 23:20:20] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 23:20:20] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 40/40 transitions.
Built C files in :
/tmp/ltsmin10582039765196308270
[2022-05-20 23:20:20] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2022-05-20 23:20:20] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:20:20] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2022-05-20 23:20:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:20:20] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2022-05-20 23:20:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:20:20] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10582039765196308270
Running compilation step : cd /tmp/ltsmin10582039765196308270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 113 ms.
Running link step : cd /tmp/ltsmin10582039765196308270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10582039765196308270;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11577407370848668139.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 23:20:35] [INFO ] Flatten gal took : 9 ms
[2022-05-20 23:20:35] [INFO ] Flatten gal took : 8 ms
[2022-05-20 23:20:35] [INFO ] Time to serialize gal into /tmp/LTL884004336319116397.gal : 2 ms
[2022-05-20 23:20:35] [INFO ] Time to serialize properties into /tmp/LTL16574342434051280902.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL884004336319116397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16574342434051280902.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8840043...266
Read 1 LTL properties
Checking formula 0 : !((G(F("(((r_0_12<1)||(r_1_12<1))||(p_1_13<1))"))))
Formula 0 simplified : !GF"(((r_0_12<1)||(r_1_12<1))||(p_1_13<1))"
Reverse transition relation is NOT exact ! Due to transitions t19.t20, t22.t21, Intersection with reachable at each step enabled. (destroyed/reverse/inter...177
Computing Next relation with stutter on 19 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
17 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,0.201759,23684,1,0,424,39220,110,213,1884,34002,929
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ResAllocation-PT-R020C002-LTLFireability-12 finished in 32921 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||F(X(p1))))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 42/42 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 68 transition count 41
Applied a total of 2 rules in 6 ms. Remains 68 /69 variables (removed 1) and now considering 41/42 (removed 1) transitions.
// Phase 1: matrix 41 rows 68 cols
[2022-05-20 23:20:35] [INFO ] Computed 29 place invariants in 0 ms
[2022-05-20 23:20:35] [INFO ] Implicit Places using invariants in 60 ms returned [44, 46, 50, 55, 57, 59, 61, 63, 67]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 62 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/69 places, 41/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 59/69 places, 41/42 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1 1), p1:(AND (GEQ s30 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-13 finished in 145 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(F((X(G(p0)) U X((G(p1)&&!p0))))))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 69 cols
[2022-05-20 23:20:35] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-20 23:20:36] [INFO ] Implicit Places using invariants in 73 ms returned [45, 47, 51, 56, 58, 60, 62, 64, 68]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 74 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/69 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/69 places, 42/42 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s38 1), p1:(AND (GEQ s30 1) (GEQ s33 1))], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-14 finished in 305 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 67 transition count 40
Applied a total of 4 rules in 3 ms. Remains 67 /69 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 67 cols
[2022-05-20 23:20:36] [INFO ] Computed 29 place invariants in 0 ms
[2022-05-20 23:20:36] [INFO ] Implicit Places using invariants in 51 ms returned [45, 49, 54, 56, 58, 60, 62, 66]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 52 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/69 places, 40/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 59/69 places, 40/42 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s43 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-15 finished in 97 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G((G((F(p0)&&X(p1)))||G(p2)))))))'
[2022-05-20 23:20:36] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
[2022-05-20 23:20:36] [INFO ] Applying decomposition
[2022-05-20 23:20:36] [INFO ] Flatten gal took : 6 ms
Built C files in :
/tmp/ltsmin10879779520650264923
[2022-05-20 23:20:36] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2022-05-20 23:20:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:20:36] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2022-05-20 23:20:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:20:36] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2022-05-20 23:20:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:20:36] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10879779520650264923
Running compilation step : cd /tmp/ltsmin10879779520650264923;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5967526521447549518.txt' '-o' '/tmp/graph5967526521447549518.bin' '-w' '/tmp/graph5967526521447549518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5967526521447549518.bin' '-l' '-1' '-v' '-w' '/tmp/graph5967526521447549518.weights' '-q' '0' '-e' '0.001'
[2022-05-20 23:20:36] [INFO ] Decomposing Gal with order
[2022-05-20 23:20:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 23:20:36] [INFO ] Flatten gal took : 10 ms
[2022-05-20 23:20:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-20 23:20:36] [INFO ] Time to serialize gal into /tmp/LTLFireability794496569077639050.gal : 2 ms
[2022-05-20 23:20:36] [INFO ] Time to serialize properties into /tmp/LTLFireability574261884983973402.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability794496569077639050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability574261884983973402.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...265
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G((G((F("((i2.u5.p_0_5>=1)&&(i2.u6.r_0_6>=1))"))&&(X("((i2.u7.p_0_7<1)||(i3.u8.r_0_8<1))"))))||(G("((i6.i0.u17.p_0_17<1)||(i6...182
Formula 0 simplified : !FXFG(G(F"((i2.u5.p_0_5>=1)&&(i2.u6.r_0_6>=1))" & X"((i2.u7.p_0_7<1)||(i3.u8.r_0_8<1))") | G"((i6.i0.u17.p_0_17<1)||(i6.i0.u18.r_0_1...162
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t21, i6.i1.u19.t20, Intersection with reachable at each step enabled. (destroyed/rever...185
Computing Next relation with stutter on 19 deadlock states
Compilation finished in 225 ms.
Running link step : cd /tmp/ltsmin10879779520650264923;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin10879779520650264923;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(<>([](([]((<>((LTLAPp0==true))&&X((LTLAPp1==true))))||[]((LTLAPp2==true)))))))' '--buchi-type=spotba'
LTSmin run took 74316 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 274730 ms.

BK_STOP 1653088911252

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R020C002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ResAllocation-PT-R020C002, 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 r186-tajo-165281572600684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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