Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r329-tall-171662362500543.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r329-tall-171662362500543
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 23:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 23:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 23:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 11 23:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 85K May 18 16:43 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 1716865304803

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R020C002
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 03:01:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 03:01:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:01:46] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2024-05-28 03:01:46] [INFO ] Transformed 80 places.
[2024-05-28 03:01:46] [INFO ] Transformed 42 transitions.
[2024-05-28 03:01:46] [INFO ] Found NUPN structural information;
[2024-05-28 03:01:46] [INFO ] Parsed PT model containing 80 places and 42 transitions and 200 arcs in 106 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ResAllocation-PT-R020C002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R020C002-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 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 11 ms. Remains 80 /80 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 80 cols
[2024-05-28 03:01:46] [INFO ] Computed 40 invariants in 7 ms
[2024-05-28 03:01:46] [INFO ] Implicit Places using invariants in 187 ms returned [45, 47, 57, 61, 65, 69, 71, 77, 79]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 210 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/80 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 222 ms. Remains : 71/80 places, 42/42 transitions.
Support contains 52 out of 71 places after structural reductions.
[2024-05-28 03:01:47] [INFO ] Flatten gal took : 22 ms
[2024-05-28 03:01:47] [INFO ] Flatten gal took : 9 ms
[2024-05-28 03:01:47] [INFO ] Input system was already deterministic with 42 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 30) seen :20
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 42 rows 71 cols
[2024-05-28 03:01:47] [INFO ] Computed 31 invariants in 4 ms
[2024-05-28 03:01:47] [INFO ] [Real]Absence check using 31 positive place invariants in 5 ms returned sat
[2024-05-28 03:01:48] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-28 03:01:48] [INFO ] After 40ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-28 03:01:48] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 3 ms.
Support contains 1 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 69 transition count 41
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 69 transition count 39
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 66 transition count 39
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 1 with 3 rules applied. Total rules applied 11 place count 64 transition count 38
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 64 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 62 transition count 37
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 2 with 2 rules applied. Total rules applied 16 place count 61 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 61 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 59 transition count 35
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 21 place count 58 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 58 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 56 transition count 33
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 27 place count 54 transition count 32
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 54 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 30 place count 52 transition count 31
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 33 place count 50 transition count 30
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 34 place count 50 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 36 place count 48 transition count 29
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 6 with 3 rules applied. Total rules applied 39 place count 46 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 40 place count 46 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 42 place count 44 transition count 27
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 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 45 place count 42 transition count 26
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 46 place count 42 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 48 place count 40 transition count 25
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 8 with 2 rules applied. Total rules applied 50 place count 39 transition count 24
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 51 place count 39 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 53 place count 37 transition count 23
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 9 with 3 rules applied. Total rules applied 56 place count 35 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 57 place count 35 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 59 place count 33 transition count 21
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 61 place count 32 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 62 place count 32 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 64 place count 30 transition count 19
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 11 with 3 rules applied. Total rules applied 67 place count 28 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 68 place count 28 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 70 place count 26 transition count 17
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 12 with 2 rules applied. Total rules applied 72 place count 25 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 73 place count 25 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 75 place count 23 transition count 15
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 78 place count 21 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 79 place count 21 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 81 place count 19 transition count 13
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 14 with 2 rules applied. Total rules applied 83 place count 18 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 84 place count 18 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 86 place count 16 transition count 11
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 15 with 2 rules applied. Total rules applied 88 place count 15 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 89 place count 15 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 91 place count 13 transition count 9
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 94 place count 11 transition count 8
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 95 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 97 place count 9 transition count 7
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 17 with 3 rules applied. Total rules applied 100 place count 7 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 101 place count 7 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 103 place count 5 transition count 5
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 105 place count 4 transition count 4
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 106 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 19 with 1 Pre rules applied. Total rules applied 106 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 3 rules applied. Total rules applied 109 place count 2 transition count 2
Applied a total of 109 rules in 64 ms. Remains 2 /71 variables (removed 69) and now considering 2/42 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 2/71 places, 2/42 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(F(p0)))&&(!p1 U (p2||G(!p1)))))))'
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-28 03:01:48] [INFO ] Invariant cache hit.
[2024-05-28 03:01:48] [INFO ] Implicit Places using invariants in 66 ms returned [41, 43, 47, 49, 51, 53, 56, 59, 62, 66, 68]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 67 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/71 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 LTL mode , in 2 iterations and 70 ms. Remains : 60/71 places, 42/42 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (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=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (NEQ s38 1) (NOT (AND (EQ s2 1) (EQ s5 1)))), p1:(AND (EQ s2 1) (EQ s5 1)), p0:(OR (EQ s2 0) (EQ s5 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19244 reset in 256 ms.
Product exploration explored 100000 steps with 19245 reset in 177 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 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), true, (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR p2 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 224 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), true, (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR p2 (NOT p1))))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 205 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 60 cols
[2024-05-28 03:01:50] [INFO ] Computed 20 invariants in 2 ms
[2024-05-28 03:01:50] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 03:01:50] [INFO ] Invariant cache hit.
[2024-05-28 03:01:50] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-28 03:01:50] [INFO ] Invariant cache hit.
[2024-05-28 03:01:50] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19303 reset in 115 ms.
Product exploration explored 100000 steps with 19320 reset in 155 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 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 60 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-28 03:01:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 42 rows 60 cols
[2024-05-28 03:01:51] [INFO ] Computed 20 invariants in 4 ms
[2024-05-28 03:01:51] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/60 places, 42/42 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 60/60 places, 42/42 transitions.
Built C files in :
/tmp/ltsmin1470175970622143334
[2024-05-28 03:01:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1470175970622143334
Running compilation step : cd /tmp/ltsmin1470175970622143334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 216 ms.
Running link step : cd /tmp/ltsmin1470175970622143334;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin1470175970622143334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13949180759201169316.hoa' '--buchi-type=spotba'
LTSmin run took 12310 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R020C002-LTLFireability-01 finished in 16006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0&&X(p1)))||G(p2))))'
Support contains 6 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 69 transition count 41
Applied a total of 3 rules in 7 ms. Remains 69 /71 variables (removed 2) and now considering 41/42 (removed 1) transitions.
// Phase 1: matrix 41 rows 69 cols
[2024-05-28 03:02:04] [INFO ] Computed 30 invariants in 2 ms
[2024-05-28 03:02:04] [INFO ] Implicit Places using invariants in 55 ms returned [41, 47, 49, 51, 54, 57, 60, 64, 66]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 57 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/71 places, 41/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 66 ms. Remains : 60/71 places, 41/42 transitions.
Stuttering acceptance computed with spot in 36 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s38 1), p1:(OR (NEQ s4 1) (NEQ s7 1)), p2:(AND (EQ s9 1) (EQ s44 1) (EQ s45 1))], nbAcceptance=2, 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 859 reset in 222 ms.
Product exploration explored 100000 steps with 861 reset in 220 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 p0 p1 (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 1 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :2
Finished Best-First random walk after 723 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=361 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 p2)), (F (NOT (AND p0 p1 (NOT p2)))), (F (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))]
Knowledge based reduction with 9 factoid took 209 ms. Reduced automaton from 1 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 37 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 41/41 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 60 cols
[2024-05-28 03:02:05] [INFO ] Computed 21 invariants in 1 ms
[2024-05-28 03:02:05] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-28 03:02:05] [INFO ] Invariant cache hit.
[2024-05-28 03:02:05] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-28 03:02:05] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 03:02:05] [INFO ] Invariant cache hit.
[2024-05-28 03:02:05] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 60/60 places, 41/41 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 p0 p1 (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 1 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 86 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :2
Finished Best-First random walk after 727 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=363 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (F (AND p0 p1 p2)), (F (NOT (AND p0 p1 (NOT p2)))), (F (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))]
Knowledge based reduction with 9 factoid took 230 ms. Reduced automaton from 1 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 36 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 34 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 859 reset in 192 ms.
Product exploration explored 100000 steps with 864 reset in 210 ms.
Built C files in :
/tmp/ltsmin11744353480582216754
[2024-05-28 03:02:06] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-28 03:02:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:02:06] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-28 03:02:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:02:06] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-28 03:02:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:02:06] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11744353480582216754
Running compilation step : cd /tmp/ltsmin11744353480582216754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 131 ms.
Running link step : cd /tmp/ltsmin11744353480582216754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin11744353480582216754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3761913445001301013.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 41/41 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-28 03:02:21] [INFO ] Invariant cache hit.
[2024-05-28 03:02:21] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 03:02:21] [INFO ] Invariant cache hit.
[2024-05-28 03:02:21] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-28 03:02:21] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 03:02:21] [INFO ] Invariant cache hit.
[2024-05-28 03:02:22] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 60/60 places, 41/41 transitions.
Built C files in :
/tmp/ltsmin2186601630599745453
[2024-05-28 03:02:22] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-28 03:02:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:02:22] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-28 03:02:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:02:22] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-28 03:02:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:02:22] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2186601630599745453
Running compilation step : cd /tmp/ltsmin2186601630599745453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 121 ms.
Running link step : cd /tmp/ltsmin2186601630599745453;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2186601630599745453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5838035699371499716.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 03:02:37] [INFO ] Flatten gal took : 4 ms
[2024-05-28 03:02:37] [INFO ] Flatten gal took : 4 ms
[2024-05-28 03:02:37] [INFO ] Time to serialize gal into /tmp/LTL6565306919994446347.gal : 2 ms
[2024-05-28 03:02:37] [INFO ] Time to serialize properties into /tmp/LTL9636224687930304577.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6565306919994446347.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7026435599822339106.hoa' '-atoms' '/tmp/LTL9636224687930304577.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9636224687930304577.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7026435599822339106.hoa
Reverse transition relation is NOT exact ! Due to transitions t20, t22.t21, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
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
296 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,2.97228,117748,1,0,3145,620001,141,2865,1878,924610,6281
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R020C002-LTLFireability-02 finished in 36547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||X(p2)))&&F(G(p1))))'
Support contains 8 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 71 cols
[2024-05-28 03:02:41] [INFO ] Computed 31 invariants in 1 ms
[2024-05-28 03:02:41] [INFO ] Implicit Places using invariants in 64 ms returned [41, 43, 47, 51, 53, 56, 59, 62, 68]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 65 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/71 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 LTL mode , in 2 iterations and 68 ms. Remains : 62/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s14 1) (EQ s17 1)), p0:(AND (EQ s11 1) (EQ s46 1) (EQ s47 1)), p2:(AND (EQ s33 1) (EQ s58 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-03 finished in 257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X((X(!p0)&&p1))))'
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-28 03:02:41] [INFO ] Invariant cache hit.
[2024-05-28 03:02:41] [INFO ] Implicit Places using invariants in 59 ms returned [41, 43, 47, 49, 51, 53, 56, 59, 66, 68]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 61 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/71 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 LTL mode , in 2 iterations and 64 ms. Remains : 61/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true, p0, p0]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}], [{ cond=p0, acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s54 1) (EQ s55 1)), p1:(AND (EQ s8 1) (EQ s11 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]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-05 finished in 289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||G(p2)||p0)))'
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-28 03:02:41] [INFO ] Invariant cache hit.
[2024-05-28 03:02:41] [INFO ] Implicit Places using invariants in 60 ms returned [41, 43, 47, 49, 51, 53, 56, 59, 62, 66, 68]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 61 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/71 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 LTL mode , in 2 iterations and 64 ms. Remains : 60/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(OR (EQ s36 0) (EQ s39 0)), p1:(AND (EQ s36 1) (EQ s39 1)), p0:(OR (EQ s16 0) (EQ s19 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Product exploration explored 100000 steps with 50000 reset in 133 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 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND p1 p2)))), true, (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 20 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResAllocation-PT-R020C002-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResAllocation-PT-R020C002-LTLFireability-06 finished in 639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((!p1 U !p2)))))'
Support contains 7 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 68 transition count 40
Applied a total of 5 rules in 8 ms. Remains 68 /71 variables (removed 3) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 68 cols
[2024-05-28 03:02:42] [INFO ] Computed 30 invariants in 0 ms
[2024-05-28 03:02:42] [INFO ] Implicit Places using invariants in 49 ms returned [44, 46, 50, 53, 56, 59, 63, 65]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 49 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/71 places, 40/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 60/71 places, 40/42 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s13 1)), p2:(AND (EQ s13 1) (EQ s46 1) (EQ s47 1)), p1:(AND (EQ s3 1) (EQ s40 1) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4497 reset in 155 ms.
Product exploration explored 100000 steps with 4548 reset in 160 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 p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 86 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40 rows 60 cols
[2024-05-28 03:02:42] [INFO ] Computed 22 invariants in 1 ms
[2024-05-28 03:02:43] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2024-05-28 03:02:43] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 03:02:43] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-28 03:02:43] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 03:02:43] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2024-05-28 03:02:43] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 03:02:43] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-28 03:02:43] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 70 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p0) p2 p1))]
Knowledge based reduction with 7 factoid took 185 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-05-28 03:02:43] [INFO ] Invariant cache hit.
[2024-05-28 03:02:43] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 03:02:43] [INFO ] Invariant cache hit.
[2024-05-28 03:02:43] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-28 03:02:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 03:02:43] [INFO ] Invariant cache hit.
[2024-05-28 03:02:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 60/60 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 (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 89 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 85 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 03:02:43] [INFO ] Invariant cache hit.
[2024-05-28 03:02:43] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned sat
[2024-05-28 03:02:43] [INFO ] After 14ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 03:02:43] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-28 03:02:43] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 03:02:43] [INFO ] [Nat]Absence check using 22 positive place invariants in 2 ms returned sat
[2024-05-28 03:02:43] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 03:02:43] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-28 03:02:43] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 80 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=80 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p0) p2 p1))]
Knowledge based reduction with 7 factoid took 193 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 4556 reset in 151 ms.
Product exploration explored 100000 steps with 4625 reset in 167 ms.
Built C files in :
/tmp/ltsmin1274206753468587328
[2024-05-28 03:02:44] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2024-05-28 03:02:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:02:44] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2024-05-28 03:02:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:02:44] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2024-05-28 03:02:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:02:44] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1274206753468587328
Running compilation step : cd /tmp/ltsmin1274206753468587328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 134 ms.
Running link step : cd /tmp/ltsmin1274206753468587328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1274206753468587328;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1509973756768963924.hoa' '--buchi-type=spotba'
LTSmin run took 93 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R020C002-LTLFireability-07 finished in 2787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(X(!p2)&&p1)))))'
Support contains 6 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 71 cols
[2024-05-28 03:02:45] [INFO ] Computed 31 invariants in 0 ms
[2024-05-28 03:02:45] [INFO ] Implicit Places using invariants in 51 ms returned [41, 43, 47, 49, 51, 53, 56, 59, 62, 66, 68]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 52 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/71 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 LTL mode , in 2 iterations and 54 ms. Remains : 60/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, p2, (OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 p2)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (NOT (AND (EQ s20 1) (EQ s23 1))) (EQ s8 1) (EQ s11 1)), p1:(AND (EQ s16 1) (EQ s19 1)), p0:(AND (EQ s20 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2552 steps with 37 reset in 7 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-08 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(p0 U p1)&&F(X(X((X(p2)&&!(p0 U p3))))))))'
Support contains 8 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-28 03:02:45] [INFO ] Invariant cache hit.
[2024-05-28 03:02:45] [INFO ] Implicit Places using invariants in 57 ms returned [41, 43, 49, 51, 53, 56, 62, 66, 68]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 57 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/71 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 LTL mode , in 2 iterations and 60 ms. Remains : 62/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p2) p3 p1), (OR (NOT p2) p3), p1, (OR (NOT p2) p3), (NOT p2), p3]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p3, acceptance={0} source=3 dest: 3}, { cond=(NOT p3), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=p3, acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s45 1) (EQ s46 1)), p0:(AND (EQ s28 1) (EQ s31 1)), p3:(AND (EQ s23 1) (EQ s53 1) (EQ s54 1)), p2:(OR (EQ s28 0) (EQ s31 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 111 ms.
Product exploration explored 100000 steps with 25000 reset in 123 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 p1) (NOT p0) (NOT p3) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 187 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 42 rows 62 cols
[2024-05-28 03:02:46] [INFO ] Computed 22 invariants in 1 ms
[2024-05-28 03:02:46] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned sat
[2024-05-28 03:02:46] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 03:02:46] [INFO ] [Nat]Absence check using 22 positive place invariants in 2 ms returned sat
[2024-05-28 03:02:46] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 03:02:46] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-28 03:02:46] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 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 60 transition count 40
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 60 transition count 38
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 56 transition count 38
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 1 with 4 rules applied. Total rules applied 14 place count 54 transition count 36
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 54 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 50 transition count 34
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 2 with 4 rules applied. Total rules applied 24 place count 48 transition count 32
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 48 transition count 30
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 44 transition count 30
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 3 with 4 rules applied. Total rules applied 34 place count 42 transition count 28
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 42 transition count 26
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 38 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 4 with 3 rules applied. Total rules applied 43 place count 36 transition count 25
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 36 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 46 place count 34 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 5 with 2 rules applied. Total rules applied 48 place count 33 transition count 23
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 49 place count 33 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 51 place count 31 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 6 with 2 rules applied. Total rules applied 53 place count 30 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 54 place count 30 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 56 place count 28 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 7 with 2 rules applied. Total rules applied 58 place count 27 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 59 place count 27 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 61 place count 25 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 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 63 place count 24 transition count 17
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 64 place count 24 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 66 place count 22 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 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 68 place count 21 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 69 place count 21 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 71 place count 19 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 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 73 place count 18 transition count 13
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 74 place count 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 76 place count 16 transition count 12
Applied a total of 76 rules in 43 ms. Remains 16 /62 variables (removed 46) and now considering 12/42 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 16/62 places, 12/42 transitions.
Incomplete random walk after 10000 steps, including 907 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 302 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Probably explored full state space saw : 112 states, properties seen :0
Probabilistic random walk after 352 steps, saw 112 distinct states, run finished after 10 ms. (steps per millisecond=35 ) properties seen :0
Explored full state space saw : 112 states, properties seen :0
Exhaustive walk after 352 steps, saw 112 distinct states, run finished after 2 ms. (steps per millisecond=176 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT p1))), (G (NOT (AND p3 (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p3) (NOT p2))), (F (AND (NOT p3) (NOT p2))), (F p3), (F (AND p0 (NOT p3)))]
Knowledge based reduction with 9 factoid took 179 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Support contains 5 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 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.
[2024-05-28 03:02:47] [INFO ] Invariant cache hit.
[2024-05-28 03:02:47] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-28 03:02:47] [INFO ] Invariant cache hit.
[2024-05-28 03:02:47] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-28 03:02:47] [INFO ] Invariant cache hit.
[2024-05-28 03:02:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. 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 p3) (NOT p0) p2), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Finished random walk after 8234 steps, including 71 resets, run visited all 4 properties in 151 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p0) p2), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F p3), (F (NOT p2)), (F (AND p0 (NOT p3)))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (NOT p2), p3]
Product exploration explored 100000 steps with 25000 reset in 117 ms.
Product exploration explored 100000 steps with 25000 reset in 122 ms.
Built C files in :
/tmp/ltsmin14088404470797396499
[2024-05-28 03:02:49] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14088404470797396499
Running compilation step : cd /tmp/ltsmin14088404470797396499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 133 ms.
Running link step : cd /tmp/ltsmin14088404470797396499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14088404470797396499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased199508457896403130.hoa' '--buchi-type=spotba'
LTSmin run took 45 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R020C002-LTLFireability-09 finished in 3970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(X(!X(p0))))) U X(p1)))'
Support contains 6 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 71 cols
[2024-05-28 03:02:49] [INFO ] Computed 31 invariants in 0 ms
[2024-05-28 03:02:49] [INFO ] Implicit Places using invariants in 66 ms returned [41, 43, 47, 49, 51, 53, 59, 62, 68]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 67 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/71 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 67 ms. Remains : 62/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), p0, p0, true]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s33 1) (EQ s58 1) (EQ s59 1)), p0:(AND (EQ s19 1) (EQ s50 1) (EQ s51 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]]
Entered a terminal (fully accepting) state of product in 34 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-11 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 68 transition count 40
Applied a total of 5 rules in 4 ms. Remains 68 /71 variables (removed 3) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 68 cols
[2024-05-28 03:02:49] [INFO ] Computed 30 invariants in 1 ms
[2024-05-28 03:02:49] [INFO ] Implicit Places using invariants in 57 ms returned [40, 44, 46, 48, 50, 53, 56, 59, 63]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 58 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/71 places, 40/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 59/71 places, 40/42 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s35 1) (EQ s56 1) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 71006 steps with 12426 reset in 76 ms.
FORMULA ResAllocation-PT-R020C002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R020C002-LTLFireability-12 finished in 189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (F(X(X(p1)))&&X(p2))) U p0))'
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 71 cols
[2024-05-28 03:02:49] [INFO ] Computed 31 invariants in 1 ms
[2024-05-28 03:02:49] [INFO ] Implicit Places using invariants in 67 ms returned [41, 43, 47, 49, 51, 53, 56, 59, 62, 66, 68]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 69 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/71 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 LTL mode , in 2 iterations and 73 ms. Remains : 60/71 places, 42/42 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p1), true, (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s40 1), p1:(AND (EQ s30 1) (EQ s33 1)), p2:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 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 239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 6 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 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 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 68 transition count 40
Applied a total of 5 rules in 4 ms. Remains 68 /71 variables (removed 3) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 68 cols
[2024-05-28 03:02:49] [INFO ] Computed 30 invariants in 0 ms
[2024-05-28 03:02:50] [INFO ] Implicit Places using invariants in 52 ms returned [44, 46, 48, 53, 56, 59, 63, 65]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 53 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/71 places, 40/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 60/71 places, 40/42 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s3 0) (EQ s40 0) (EQ s41 0)), p0:(OR (EQ s15 0) (EQ s47 0) (EQ s48 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 860 reset in 121 ms.
Product exploration explored 100000 steps with 860 reset in 142 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 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 85 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40 rows 60 cols
[2024-05-28 03:02:50] [INFO ] Computed 22 invariants in 1 ms
[2024-05-28 03:02:50] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned sat
[2024-05-28 03:02:50] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 03:02:50] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2024-05-28 03:02:50] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 03:02:50] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-28 03:02:50] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-05-28 03:02:51] [INFO ] Invariant cache hit.
[2024-05-28 03:02:51] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-28 03:02:51] [INFO ] Invariant cache hit.
[2024-05-28 03:02:51] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-28 03:02:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 03:02:51] [INFO ] Invariant cache hit.
[2024-05-28 03:02:51] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 60/60 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 86 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 03:02:51] [INFO ] Invariant cache hit.
[2024-05-28 03:02:51] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned sat
[2024-05-28 03:02:51] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 03:02:51] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2024-05-28 03:02:51] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 03:02:51] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-28 03:02:51] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 78 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=78 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 863 reset in 125 ms.
Product exploration explored 100000 steps with 862 reset in 144 ms.
Built C files in :
/tmp/ltsmin15842977400450465858
[2024-05-28 03:02:52] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2024-05-28 03:02:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:02:52] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2024-05-28 03:02:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:02:52] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2024-05-28 03:02:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:02:52] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15842977400450465858
Running compilation step : cd /tmp/ltsmin15842977400450465858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 130 ms.
Running link step : cd /tmp/ltsmin15842977400450465858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15842977400450465858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4783647353801190207.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-05-28 03:03:07] [INFO ] Invariant cache hit.
[2024-05-28 03:03:07] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-28 03:03:07] [INFO ] Invariant cache hit.
[2024-05-28 03:03:07] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-28 03:03:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 03:03:07] [INFO ] Invariant cache hit.
[2024-05-28 03:03:07] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 60/60 places, 40/40 transitions.
Built C files in :
/tmp/ltsmin10112583256231470479
[2024-05-28 03:03:07] [INFO ] Computing symmetric may disable matrix : 40 transitions.
[2024-05-28 03:03:07] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:03:07] [INFO ] Computing symmetric may enable matrix : 40 transitions.
[2024-05-28 03:03:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:03:07] [INFO ] Computing Do-Not-Accords matrix : 40 transitions.
[2024-05-28 03:03:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:03:07] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10112583256231470479
Running compilation step : cd /tmp/ltsmin10112583256231470479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 128 ms.
Running link step : cd /tmp/ltsmin10112583256231470479;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10112583256231470479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17946300170271575648.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 03:03:22] [INFO ] Flatten gal took : 4 ms
[2024-05-28 03:03:22] [INFO ] Flatten gal took : 4 ms
[2024-05-28 03:03:22] [INFO ] Time to serialize gal into /tmp/LTL12954197218007198501.gal : 1 ms
[2024-05-28 03:03:22] [INFO ] Time to serialize properties into /tmp/LTL5557022707227374636.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12954197218007198501.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16958194452567983694.hoa' '-atoms' '/tmp/LTL5557022707227374636.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5557022707227374636.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16958194452567983694.hoa
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
27 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.2923,27808,1,0,666,78953,120,392,1931,98308,1422
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R020C002-LTLFireability-14 finished in 32950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 8 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 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 70 transition count 41
Applied a total of 2 rules in 4 ms. Remains 70 /71 variables (removed 1) and now considering 41/42 (removed 1) transitions.
// Phase 1: matrix 41 rows 70 cols
[2024-05-28 03:03:22] [INFO ] Computed 31 invariants in 0 ms
[2024-05-28 03:03:22] [INFO ] Implicit Places using invariants in 65 ms returned [42, 46, 48, 52, 55, 58, 61, 65, 67]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 66 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/71 places, 41/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 72 ms. Remains : 61/71 places, 41/42 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R020C002-LTLFireability-15 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 (AND (EQ s13 1) (EQ s47 1) (EQ s48 1)) (AND (OR (EQ s1 0) (EQ s40 0) (EQ s41 0)) (OR (EQ s34 0) (EQ s37 0))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 861 reset in 220 ms.
Product exploration explored 100000 steps with 861 reset in 245 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 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 86 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Finished Best-First random walk after 4161 steps, including 7 resets, run visited all 1 properties in 11 ms. (steps per millisecond=378 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 247 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 61 cols
[2024-05-28 03:03:24] [INFO ] Computed 22 invariants in 1 ms
[2024-05-28 03:03:24] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 03:03:24] [INFO ] Invariant cache hit.
[2024-05-28 03:03:24] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-28 03:03:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 03:03:24] [INFO ] Invariant cache hit.
[2024-05-28 03:03:24] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 61/61 places, 41/41 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 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 599 steps, run visited all 1 properties in 5 ms. (steps per millisecond=119 )
Probabilistic random walk after 599 steps, saw 447 distinct states, run finished after 6 ms. (steps per millisecond=99 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 859 reset in 136 ms.
Product exploration explored 100000 steps with 861 reset in 147 ms.
Built C files in :
/tmp/ltsmin7648999040143927827
[2024-05-28 03:03:25] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-28 03:03:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:03:25] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-28 03:03:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:03:25] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-28 03:03:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:03:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7648999040143927827
Running compilation step : cd /tmp/ltsmin7648999040143927827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 139 ms.
Running link step : cd /tmp/ltsmin7648999040143927827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7648999040143927827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4683760686180963518.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-05-28 03:03:40] [INFO ] Invariant cache hit.
[2024-05-28 03:03:40] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-28 03:03:40] [INFO ] Invariant cache hit.
[2024-05-28 03:03:40] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-28 03:03:40] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 03:03:40] [INFO ] Invariant cache hit.
[2024-05-28 03:03:40] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 61/61 places, 41/41 transitions.
Built C files in :
/tmp/ltsmin3635163839663214727
[2024-05-28 03:03:40] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-28 03:03:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:03:40] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-28 03:03:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:03:40] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-28 03:03:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 03:03:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3635163839663214727
Running compilation step : cd /tmp/ltsmin3635163839663214727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 120 ms.
Running link step : cd /tmp/ltsmin3635163839663214727;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3635163839663214727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2632395893439807470.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 03:03:55] [INFO ] Flatten gal took : 4 ms
[2024-05-28 03:03:55] [INFO ] Flatten gal took : 3 ms
[2024-05-28 03:03:55] [INFO ] Time to serialize gal into /tmp/LTL12730661155428909013.gal : 1 ms
[2024-05-28 03:03:55] [INFO ] Time to serialize properties into /tmp/LTL11148125307463877548.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12730661155428909013.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9088239889259290794.hoa' '-atoms' '/tmp/LTL11148125307463877548.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11148125307463877548.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9088239889259290794.hoa
Reverse transition relation is NOT exact ! Due to transitions t21, t19.t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
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
15 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.156392,21752,1,0,406,45553,112,203,1971,35235,876
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ResAllocation-PT-R020C002-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ResAllocation-PT-R020C002-LTLFireability-15 finished in 32892 ms.
All properties solved by simple procedures.
Total runtime 129553 ms.

BK_STOP 1716865436717

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R020C002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r329-tall-171662362500543"
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 ;