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.r197-tall-171640625100223.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 GPPP-PT-C0001N0000001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625100223
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 12 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 08:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 12 08:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K May 18 16:42 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 GPPP-PT-C0001N0000001000-LTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000001000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716542066918

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=GPPP-PT-C0001N0000001000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 09:14:28] [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-24 09:14:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 09:14:28] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2024-05-24 09:14:28] [INFO ] Transformed 33 places.
[2024-05-24 09:14:28] [INFO ] Transformed 22 transitions.
[2024-05-24 09:14:28] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 8 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 09:14:28] [INFO ] Computed 13 invariants in 10 ms
[2024-05-24 09:14:28] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
[2024-05-24 09:14:28] [INFO ] Invariant cache hit.
[2024-05-24 09:14:28] [INFO ] Implicit Places using invariants in 42 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 220 ms. Remains : 31/33 places, 22/22 transitions.
Support contains 20 out of 31 places after structural reductions.
[2024-05-24 09:14:29] [INFO ] Flatten gal took : 16 ms
[2024-05-24 09:14:29] [INFO ] Flatten gal took : 5 ms
[2024-05-24 09:14:29] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 31 cols
[2024-05-24 09:14:29] [INFO ] Computed 11 invariants in 5 ms
[2024-05-24 09:14:29] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-24 09:14:29] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-24 09:14:29] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 09:14:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:14:29] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 14 ms returned sat
[2024-05-24 09:14:29] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
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' '!((G(F(p0))&&(p1 U G(!p2))))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 30 transition count 20
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 4 place count 29 transition count 20
Applied a total of 4 rules in 8 ms. Remains 29 /31 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 29 cols
[2024-05-24 09:14:29] [INFO ] Computed 11 invariants in 5 ms
[2024-05-24 09:14:29] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2024-05-24 09:14:29] [INFO ] Invariant cache hit.
[2024-05-24 09:14:29] [INFO ] Implicit Places using invariants in 32 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/31 places, 20/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 26 transition count 19
Applied a total of 2 rules in 3 ms. Remains 26 /27 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 26 cols
[2024-05-24 09:14:29] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 09:14:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 09:14:29] [INFO ] Invariant cache hit.
[2024-05-24 09:14:29] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/31 places, 19/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 26/31 places, 19/22 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 301 ms :[(OR (NOT p0) p2), true, (NOT p0), (NOT p0), p2, p2]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s14 1) (GEQ s15 1)), p1:(LT s3 2), p0:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s24 7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 90 steps with 2 reset in 12 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-00 finished in 524 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)||G(p2)||G(p1)) U G(p0)))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 30 transition count 20
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 4 place count 29 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 27 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 26 transition count 18
Applied a total of 9 rules in 5 ms. Remains 26 /31 variables (removed 5) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 26 cols
[2024-05-24 09:14:30] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 09:14:30] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2024-05-24 09:14:30] [INFO ] Invariant cache hit.
[2024-05-24 09:14:30] [INFO ] Implicit Places using invariants in 37 ms returned [0, 1, 15]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/31 places, 18/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 21 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 21 transition count 15
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 6 place count 20 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 19 transition count 14
Applied a total of 8 rules in 5 ms. Remains 19 /23 variables (removed 4) and now considering 14/18 (removed 4) transitions.
// Phase 1: matrix 14 rows 19 cols
[2024-05-24 09:14:30] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 09:14:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 09:14:30] [INFO ] Invariant cache hit.
[2024-05-24 09:14:30] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/31 places, 14/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 150 ms. Remains : 19/31 places, 14/22 transitions.
Stuttering acceptance computed with spot in 287 ms :[p0, p0, (AND p2 p0), (AND p0 p1), (AND p0 p2)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s9 1) (GEQ s13 3)), p0:(AND (GEQ s0 2) (GEQ s9 1) (GEQ s14 1)), p2:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 16073 reset in 241 ms.
Product exploration explored 100000 steps with 16202 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 (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p2))), (X p2), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 286 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND p2 p0), (AND p2 p0), (AND p2 p0), false, false]
Finished random walk after 91 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p2))), (X p2), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p2)), (F (AND p2 p0)), (F (AND (NOT p2) p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 11 factoid took 347 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND p2 p0), (AND p2 p0), (AND p2 p0), false, false]
Stuttering acceptance computed with spot in 194 ms :[(AND p2 p0), (AND p2 p0), (AND p2 p0), false, false]
Support contains 4 out of 19 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-24 09:14:32] [INFO ] Invariant cache hit.
[2024-05-24 09:14:32] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-24 09:14:32] [INFO ] Invariant cache hit.
[2024-05-24 09:14:32] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 09:14:32] [INFO ] Invariant cache hit.
[2024-05-24 09:14:32] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-24 09:14:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:14:32] [INFO ] Invariant cache hit.
[2024-05-24 09:14:32] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 19/19 places, 14/14 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 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND p0 p2), (AND p2 p0), (AND p0 p2), false, false]
Finished random walk after 12 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND p0 p2)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 9 factoid took 210 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND p0 p2), (AND p2 p0), (AND p0 p2), false, false]
Stuttering acceptance computed with spot in 198 ms :[(AND p0 p2), (AND p2 p0), (AND p0 p2), false, false]
Stuttering acceptance computed with spot in 195 ms :[(AND p0 p2), (AND p2 p0), (AND p0 p2), false, false]
Product exploration explored 100000 steps with 16043 reset in 93 ms.
Product exploration explored 100000 steps with 16082 reset in 175 ms.
Built C files in :
/tmp/ltsmin5363939644084929765
[2024-05-24 09:14:33] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2024-05-24 09:14:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:14:33] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2024-05-24 09:14:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:14:33] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2024-05-24 09:14:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:14:33] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5363939644084929765
Running compilation step : cd /tmp/ltsmin5363939644084929765;'/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 170 ms.
Running link step : cd /tmp/ltsmin5363939644084929765;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5363939644084929765;'/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/stateBased12254056257817766690.hoa' '--buchi-type=spotba'
LTSmin run took 215 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-03 finished in 4107 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(!p1)) U X(X(p2)))))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2024-05-24 09:14:34] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 09:14:34] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-24 09:14:34] [INFO ] Invariant cache hit.
[2024-05-24 09:14:34] [INFO ] Implicit Places using invariants in 28 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 608 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2), true, (NOT p2), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, p1]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(OR (NOT p1) p0), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 9}, { cond=p0, acceptance={} source=3 dest: 10}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 11}], [{ cond=p1, acceptance={} source=4 dest: 6}, { cond=(NOT p1), acceptance={} source=4 dest: 12}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 12}, { cond=p0, acceptance={} source=5 dest: 13}], [{ cond=(NOT p2), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 10}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 11}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 12}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=10 dest: 12}, { cond=(AND p0 (NOT p2)), acceptance={} source=10 dest: 13}], [{ cond=(NOT p2), acceptance={} source=11 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=12 dest: 14}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=13 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=13 dest: 14}, { cond=(AND p0 (NOT p2)), acceptance={} source=13 dest: 15}], [{ cond=p1, acceptance={} source=14 dest: 7}, { cond=(NOT p1), acceptance={} source=14 dest: 14}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=15 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=15 dest: 14}, { cond=(AND (NOT p1) p0), acceptance={} source=15 dest: 15}, { cond=(AND p1 p0), acceptance={0} source=15 dest: 15}]], initial=0, aps=[p1:(AND (GEQ s15 1) (GEQ s16 1)), p0:(AND (GEQ s9 1) (GEQ s0 1) (GEQ s23 1)), p2:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-04 finished in 705 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||(!p1 U X(p2))))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 30 transition count 20
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 4 place count 29 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 27 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 2 with 3 rules applied. Total rules applied 10 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 2 with 2 rules applied. Total rules applied 12 place count 24 transition count 17
Applied a total of 12 rules in 10 ms. Remains 24 /31 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 24 cols
[2024-05-24 09:14:35] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 09:14:35] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-24 09:14:35] [INFO ] Invariant cache hit.
[2024-05-24 09:14:35] [INFO ] Implicit Places using invariants in 29 ms returned [1, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/31 places, 17/22 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 21 transition count 16
Applied a total of 2 rules in 4 ms. Remains 21 /22 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 21 cols
[2024-05-24 09:14:35] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 09:14:35] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 09:14:35] [INFO ] Invariant cache hit.
[2024-05-24 09:14:35] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/31 places, 16/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 21/31 places, 16/22 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1), p2:(AND (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11541 reset in 124 ms.
Product exploration explored 100000 steps with 11569 reset in 112 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)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-24 09:14:36] [INFO ] Invariant cache hit.
[2024-05-24 09:14:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 09:14:36] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 09:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:14:36] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 09:14:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:14:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 09:14:36] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 09:14:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:14:36] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 09:14:36] [INFO ] Computed and/alt/rep : 15/33/15 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 09:14:36] [INFO ] Added : 12 causal constraints over 3 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-24 09:14:36] [INFO ] Invariant cache hit.
[2024-05-24 09:14:36] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-24 09:14:36] [INFO ] Invariant cache hit.
[2024-05-24 09:14:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 09:14:36] [INFO ] Invariant cache hit.
[2024-05-24 09:14:36] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-24 09:14:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 09:14:36] [INFO ] Invariant cache hit.
[2024-05-24 09:14:36] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 21/21 places, 16/16 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)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-24 09:14:36] [INFO ] Invariant cache hit.
[2024-05-24 09:14:36] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 09:14:36] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-24 09:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:14:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 09:14:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:14:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 09:14:36] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-24 09:14:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:14:36] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-24 09:14:36] [INFO ] Computed and/alt/rep : 15/33/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 09:14:36] [INFO ] Added : 12 causal constraints over 3 iterations in 26 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 11547 reset in 84 ms.
Product exploration explored 100000 steps with 11551 reset in 194 ms.
Built C files in :
/tmp/ltsmin3596532220626242613
[2024-05-24 09:14:37] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2024-05-24 09:14:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:14:37] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2024-05-24 09:14:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:14:37] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2024-05-24 09:14:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 09:14:37] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3596532220626242613
Running compilation step : cd /tmp/ltsmin3596532220626242613;'/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 94 ms.
Running link step : cd /tmp/ltsmin3596532220626242613;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3596532220626242613;'/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/stateBased6108283710544192130.hoa' '--buchi-type=spotba'
LTSmin run took 66 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-05 finished in 2371 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 G((!p0 U p1)))&&X((p1 U (p2 U X(p3))))))'
Support contains 7 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2024-05-24 09:14:37] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 09:14:37] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-24 09:14:37] [INFO ] Invariant cache hit.
[2024-05-24 09:14:37] [INFO ] Implicit Places using invariants in 28 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 30/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p1) (NOT p3)), (NOT p1), (NOT p1), (NOT p1), (NOT p3), true, (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 7}, { cond=p1, acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s7 1)), p0:(AND (GEQ s15 1) (GEQ s16 1)), p2:(GEQ s18 1), p3:(AND (GEQ s0 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-07 finished in 422 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)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Graph (trivial) has 3 edges and 31 vertex of which 2 / 31 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 30 transition count 20
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 3 place count 29 transition count 20
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 8 place count 26 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 24 transition count 17
Applied a total of 11 rules in 11 ms. Remains 24 /31 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 24 cols
[2024-05-24 09:14:37] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 09:14:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-24 09:14:37] [INFO ] Invariant cache hit.
[2024-05-24 09:14:37] [INFO ] Implicit Places using invariants in 32 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/31 places, 17/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 16
Applied a total of 2 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 16/17 (removed 1) transitions.
// Phase 1: matrix 16 rows 21 cols
[2024-05-24 09:14:37] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 09:14:38] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 09:14:38] [INFO ] Invariant cache hit.
[2024-05-24 09:14:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 09:14:38] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/31 places, 16/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 127 ms. Remains : 21/31 places, 16/22 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-08 finished in 179 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(((F(G(!p1))&&p0) U (p2||X(p2))))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 31 cols
[2024-05-24 09:14:38] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 09:14:38] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2024-05-24 09:14:38] [INFO ] Invariant cache hit.
[2024-05-24 09:14:38] [INFO ] Implicit Places using invariants in 29 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s14 1) (GEQ s15 1)), p0:(AND (GEQ s5 1) (GEQ s6 1)), p1:(AND (GEQ s5 1) (GEQ s6 1))], nbAcceptance=2, 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 1789 reset in 186 ms.
Stack based approach found an accepted trace after 265 steps with 3 reset with depth 124 and stack size 119 in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-09 finished in 495 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(F(p0)) U (X(G(!p2))&&p1)))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:14:38] [INFO ] Invariant cache hit.
[2024-05-24 09:14:38] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-24 09:14:38] [INFO ] Invariant cache hit.
[2024-05-24 09:14:38] [INFO ] Implicit Places using invariants in 37 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 29/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) p2), (NOT p0), p2]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s15 1) (GEQ s18 1)), p0:(AND (GEQ s5 1) (GEQ s6 1)), p2:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4920 reset in 111 ms.
Stack based approach found an accepted trace after 50 steps with 2 reset with depth 15 and stack size 15 in 1 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-10 finished in 326 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(X(G(!p0))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:14:38] [INFO ] Invariant cache hit.
[2024-05-24 09:14:38] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-24 09:14:38] [INFO ] Invariant cache hit.
[2024-05-24 09:14:38] [INFO ] Implicit Places using invariants in 29 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 30 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, p0, p0, p0]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s0 2) (GEQ s11 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-11 finished in 203 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 X((X(!p0) U (!p0&&G(F(!p0))))))))'
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:14:39] [INFO ] Invariant cache hit.
[2024-05-24 09:14:39] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-24 09:14:39] [INFO ] Invariant cache hit.
[2024-05-24 09:14:39] [INFO ] Implicit Places using invariants in 30 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 260 ms :[p0, p0, p0, p0, p0, p0, true, p0]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(LT s3 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-12 finished in 354 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(!p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-24 09:14:39] [INFO ] Invariant cache hit.
[2024-05-24 09:14:39] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2024-05-24 09:14:39] [INFO ] Invariant cache hit.
[2024-05-24 09:14:39] [INFO ] Implicit Places using invariants in 29 ms returned [0, 1, 17]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/31 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 28/31 places, 22/22 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, p0, p0]
Running random walk in product with property : GPPP-PT-C0001N0000001000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s11 1) (GEQ s22 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000001000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000001000-LTLFireability-15 finished in 167 ms.
All properties solved by simple procedures.
Total runtime 11329 ms.

BK_STOP 1716542080589

--------------------
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="GPPP-PT-C0001N0000001000"
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 GPPP-PT-C0001N0000001000, 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 r197-tall-171640625100223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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