Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110600604.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FMS-PT-20000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110600604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 02:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 02:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 02:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 16K May 10 09:33 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 FMS-PT-20000-LTLFireability-00
FORMULA_NAME FMS-PT-20000-LTLFireability-01
FORMULA_NAME FMS-PT-20000-LTLFireability-02
FORMULA_NAME FMS-PT-20000-LTLFireability-03
FORMULA_NAME FMS-PT-20000-LTLFireability-04
FORMULA_NAME FMS-PT-20000-LTLFireability-05
FORMULA_NAME FMS-PT-20000-LTLFireability-06
FORMULA_NAME FMS-PT-20000-LTLFireability-07
FORMULA_NAME FMS-PT-20000-LTLFireability-08
FORMULA_NAME FMS-PT-20000-LTLFireability-09
FORMULA_NAME FMS-PT-20000-LTLFireability-10
FORMULA_NAME FMS-PT-20000-LTLFireability-11
FORMULA_NAME FMS-PT-20000-LTLFireability-12
FORMULA_NAME FMS-PT-20000-LTLFireability-13
FORMULA_NAME FMS-PT-20000-LTLFireability-14
FORMULA_NAME FMS-PT-20000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652696871715

Running Version 202205111006
[2022-05-16 10:27:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 10:27:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 10:27:52] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2022-05-16 10:27:53] [INFO ] Transformed 22 places.
[2022-05-16 10:27:53] [INFO ] Transformed 20 transitions.
[2022-05-16 10:27:53] [INFO ] Parsed PT model containing 22 places and 20 transitions in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FMS-PT-20000-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:53] [INFO ] Computed 6 place invariants in 7 ms
[2022-05-16 10:27:53] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:53] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:27:53] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:53] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 10:27:53] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Support contains 20 out of 22 places after structural reductions.
[2022-05-16 10:27:53] [INFO ] Flatten gal took : 15 ms
[2022-05-16 10:27:53] [INFO ] Flatten gal took : 5 ms
[2022-05-16 10:27:53] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 20001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=555 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:53] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:27:53] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 10:27:53] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 10:27:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-16 10:27:53] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 10:27:53] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-16 10:27:53] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 59457 steps, including 0 resets, run visited all 2 properties in 617 ms. (steps per millisecond=96 )
Parikh walk visited 2 properties in 617 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 6 / 14 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 17 place count 10 transition count 12
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 25 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 6 transition count 7
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 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 33 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 10 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 10:27:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 10:27:54] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 10:27:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 10:27:54] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-16 10:27:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 10:27:54] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 10:27:54] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 3/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-20000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 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 0 steps with 0 reset in 2 ms.
FORMULA FMS-PT-20000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-LTLFireability-00 finished in 289 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:54] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:27:54] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:54] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:27:55] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:55] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:27:55] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-20000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(GEQ s3 1), p1:(OR (LT s13 1) (LT s15 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 1 steps with 0 reset in 1 ms.
FORMULA FMS-PT-20000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-LTLFireability-01 finished in 249 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||p1))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 8 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 15 transition count 16
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 15 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 15 transition count 12
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 13 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 10 transition count 9
Applied a total of 22 rules in 5 ms. Remains 10 /22 variables (removed 12) and now considering 9/20 (removed 11) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-16 10:27:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 10:27:55] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-16 10:27:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 10:27:55] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-16 10:27:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-16 10:27:55] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 10:27:55] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/22 places, 9/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/22 places, 9/20 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-20000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1), p1:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-20000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-LTLFireability-02 finished in 284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 4 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:55] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:27:55] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:55] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:27:55] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:55] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:27:55] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FMS-PT-20000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s3 1), p0:(GEQ s9 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 114 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 p1), (X p0), (X (X p1)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FMS-PT-20000-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-20000-LTLFireability-04 finished in 648 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:56] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:27:56] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:56] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 10:27:56] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:56] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:27:56] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-20000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5923 reset in 122 ms.
Stack based approach found an accepted trace after 34 steps with 3 reset with depth 6 and stack size 6 in 0 ms.
FORMULA FMS-PT-20000-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-20000-LTLFireability-05 finished in 340 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!G((G(p0) U (p1 U !p2)))) U !X(p3)))'
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:56] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:27:56] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:56] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 10:27:56] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:56] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:27:56] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 220 ms :[p3, p3, (NOT p2), (NOT p2), (AND (NOT p2) p0)]
Running random walk in product with property : FMS-PT-20000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p3, acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p3 p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND p3 p0 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LT s11 1), p2:(AND (GEQ s10 1) (GEQ s17 1)), p1:(AND (GEQ s8 1) (GEQ s10 1)), p0:(AND (GEQ s2 1) (GEQ s18 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]]
Product exploration explored 100000 steps with 837 reset in 154 ms.
Stack based approach found an accepted trace after 1349 steps with 12 reset with depth 43 and stack size 43 in 8 ms.
FORMULA FMS-PT-20000-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-20000-LTLFireability-06 finished in 493 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 10 edges and 17 vertex of which 6 / 17 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 10 place count 13 transition count 16
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 16 place count 11 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 11 transition count 10
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 20 place count 9 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 8 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 8 transition count 7
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 25 place count 7 transition count 7
Applied a total of 25 rules in 6 ms. Remains 7 /22 variables (removed 15) and now considering 7/20 (removed 13) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-16 10:27:56] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 10:27:57] [INFO ] Implicit Places using invariants in 21 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/22 places, 7/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/22 places, 7/20 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FMS-PT-20000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s0 1), p1:(OR (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-20000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-LTLFireability-08 finished in 166 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!F(p0) U G(p0))))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 10 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 12 transition count 14
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 21 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 22 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
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 31 place count 3 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 4 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 10:27:57] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 10:27:57] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 10:27:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 10:27:57] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-16 10:27:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 10:27:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 10:27:57] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 3/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Running random walk in product with property : FMS-PT-20000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 1 ms.
FORMULA FMS-PT-20000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-LTLFireability-09 finished in 127 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p1&&F(!p0))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:57] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:27:57] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:57] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:27:57] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:57] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:27:57] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-20000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(LT s14 1), p1:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 63 steps with 0 reset in 1 ms.
FORMULA FMS-PT-20000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-LTLFireability-10 finished in 275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 4 places and 0 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 1 with 6 rules applied. Total rules applied 9 place count 18 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 16 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 16 transition count 13
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 15 place count 14 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 3 with 2 rules applied. Total rules applied 17 place count 13 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 13 transition count 12
Applied a total of 18 rules in 6 ms. Remains 13 /22 variables (removed 9) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-16 10:27:57] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 10:27:57] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-16 10:27:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 10:27:57] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-16 10:27:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-16 10:27:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 10:27:57] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/22 places, 12/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/22 places, 12/20 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : FMS-PT-20000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s6 1)) (GEQ s8 1)), p1:(AND (OR (GEQ s12 1) (GEQ s2 1)) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 8342 reset in 109 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA FMS-PT-20000-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-20000-LTLFireability-11 finished in 414 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(G(p0)))&&F(F(p1))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:57] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:27:57] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:57] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:27:58] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:58] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:27:58] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : FMS-PT-20000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s5 1) (LT s7 1)), p0:(AND (GEQ s10 1) (GEQ s17 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 4 steps with 0 reset in 0 ms.
FORMULA FMS-PT-20000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-20000-LTLFireability-12 finished in 331 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U G(!p0))||F(X(p1))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:58] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:27:58] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:58] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:27:58] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:58] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:27:58] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-20000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s9 1), p1:(OR (AND (GEQ s21 1) (GEQ s0 1)) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA FMS-PT-20000-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-20000-LTLFireability-13 finished in 485 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U p1))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:58] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:27:58] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:58] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:27:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:27:58] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:27:58] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : FMS-PT-20000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s0 1) (GEQ s9 1) (AND (GEQ s2 1) (GEQ s18 1))), p0:(AND (GEQ s2 1) (GEQ s18 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 152 ms.
Product exploration explored 100000 steps with 0 reset in 218 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 406 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=3333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:28:00] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:28:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 10:28:00] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-16 10:28:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-16 10:28:00] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-16 10:28:00] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-16 10:28:00] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 60006 steps, including 0 resets, run visited all 2 properties in 451 ms. (steps per millisecond=133 )
Parikh walk visited 2 properties in 451 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (OR p1 p0))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 400 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:28:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:28:01] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:28:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:28:01] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:28:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:28:01] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 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 : [p1, (X p1), (X (X p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 199995 steps, run visited all 1 properties in 264 ms. (steps per millisecond=757 )
Probabilistic random walk after 199995 steps, saw 147333 distinct states, run finished after 264 ms. (steps per millisecond=757 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1)), true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 135 ms.
Product exploration explored 100000 steps with 0 reset in 188 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 22 transition count 20
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 22 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 22 transition count 20
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 7 rules in 7 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2022-05-16 10:28:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:28:02] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:28:02] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/22 places, 20/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Product exploration explored 100000 steps with 0 reset in 153 ms.
Product exploration explored 100000 steps with 0 reset in 218 ms.
Built C files in :
/tmp/ltsmin5381352512044428518
[2022-05-16 10:28:03] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5381352512044428518
Running compilation step : cd /tmp/ltsmin5381352512044428518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 190 ms.
Running link step : cd /tmp/ltsmin5381352512044428518;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5381352512044428518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15910833909077595741.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:28:18] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:28:18] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:28:18] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 10:28:18] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 10:28:18] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 10:28:18] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Built C files in :
/tmp/ltsmin723622667136471776
[2022-05-16 10:28:18] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin723622667136471776
Running compilation step : cd /tmp/ltsmin723622667136471776;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 93 ms.
Running link step : cd /tmp/ltsmin723622667136471776;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin723622667136471776;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8279753846039426713.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 10:28:33] [INFO ] Flatten gal took : 2 ms
[2022-05-16 10:28:33] [INFO ] Flatten gal took : 3 ms
[2022-05-16 10:28:33] [INFO ] Time to serialize gal into /tmp/LTL7131772563985339360.gal : 1 ms
[2022-05-16 10:28:33] [INFO ] Time to serialize properties into /tmp/LTL4550358236558146230.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7131772563985339360.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4550358236558146230.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7131772...266
Read 1 LTL properties
Checking formula 0 : !((X(G((G("((P1wP2>=1)&&(P2wP1>=1))"))U("(((P1d>=1)||(P2>=1))||((P1wP2>=1)&&(P2wP1>=1)))")))))
Formula 0 simplified : !XG(G"((P1wP2>=1)&&(P2wP1>=1))" U "(((P1d>=1)||(P2>=1))||((P1wP2>=1)&&(P2wP1>=1)))")
Detected timeout of ITS tools.
[2022-05-16 10:28:48] [INFO ] Flatten gal took : 2 ms
[2022-05-16 10:28:48] [INFO ] Applying decomposition
[2022-05-16 10:28:48] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16785164038426879829.txt' '-o' '/tmp/graph16785164038426879829.bin' '-w' '/tmp/graph16785164038426879829.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16785164038426879829.bin' '-l' '-1' '-v' '-w' '/tmp/graph16785164038426879829.weights' '-q' '0' '-e' '0.001'
[2022-05-16 10:28:48] [INFO ] Decomposing Gal with order
[2022-05-16 10:28:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 10:28:48] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 10:28:48] [INFO ] Flatten gal took : 32 ms
[2022-05-16 10:28:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 10:28:48] [INFO ] Time to serialize gal into /tmp/LTL9136572999243363023.gal : 1 ms
[2022-05-16 10:28:48] [INFO ] Time to serialize properties into /tmp/LTL6363111294714680031.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9136572999243363023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6363111294714680031.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9136572...245
Read 1 LTL properties
Checking formula 0 : !((X(G((G("((i1.u0.P1wP2>=1)&&(i3.u8.P2wP1>=1))"))U("(((i1.u0.P1d>=1)||(i3.u4.P2>=1))||((i1.u0.P1wP2>=1)&&(i3.u8.P2wP1>=1)))")))))
Formula 0 simplified : !XG(G"((i1.u0.P1wP2>=1)&&(i3.u8.P2wP1>=1))" U "(((i1.u0.P1d>=1)||(i3.u4.P2>=1))||((i1.u0.P1wP2>=1)&&(i3.u8.P2wP1>=1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7995619067774220534
[2022-05-16 10:29:03] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7995619067774220534
Running compilation step : cd /tmp/ltsmin7995619067774220534;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin7995619067774220534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7995619067774220534;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp0==true)) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FMS-PT-20000-LTLFireability-14 finished in 80137 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U p1))))'
Found a SL insensitive property : FMS-PT-20000-LTLFireability-14
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 22/22 places, 20/20 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 22 transition count 18
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 9 edges and 18 vertex of which 3 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 8 place count 16 transition count 17
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 15 place count 14 transition count 12
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 18 place count 11 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 18 place count 11 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 23 place count 8 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 8 transition count 10
Applied a total of 24 rules in 10 ms. Remains 8 /22 variables (removed 14) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 10:29:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 10:29:19] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 10:29:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:29:19] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 10:29:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:29:19] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 8/22 places, 10/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/22 places, 10/20 transitions.
Running random walk in product with property : FMS-PT-20000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s0 1) (GEQ s3 1) (AND (GEQ s1 1) (GEQ s5 1))), p0:(AND (GEQ s1 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 103 ms.
Product exploration explored 100000 steps with 0 reset in 249 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 378 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 5 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=5000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 10:29:20] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:29:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 10:29:20] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-16 10:29:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 10:29:20] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-16 10:29:20] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-16 10:29:20] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 20006 steps, including 0 resets, run visited all 2 properties in 171 ms. (steps per millisecond=116 )
Parikh walk visited 2 properties in 170 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (OR p1 p0))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 439 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 10:29:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 10:29:21] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 10:29:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:29:21] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 10:29:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:29:21] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 20001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=4000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 219999 steps, run visited all 1 properties in 224 ms. (steps per millisecond=982 )
Probabilistic random walk after 219999 steps, saw 115557 distinct states, run finished after 224 ms. (steps per millisecond=982 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1)), true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 132 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p1), (NOT p1)]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2022-05-16 10:29:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 10:29:22] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:29:22] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 10/10 transitions.
Product exploration explored 100000 steps with 0 reset in 97 ms.
Product exploration explored 100000 steps with 0 reset in 153 ms.
Built C files in :
/tmp/ltsmin15664906413044419928
[2022-05-16 10:29:22] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15664906413044419928
Running compilation step : cd /tmp/ltsmin15664906413044419928;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin15664906413044419928;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin15664906413044419928;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14435256496792321665.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 10:29:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 10:29:37] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 10:29:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 10:29:37] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 8 cols
[2022-05-16 10:29:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 10:29:37] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin5834042408054805257
[2022-05-16 10:29:37] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5834042408054805257
Running compilation step : cd /tmp/ltsmin5834042408054805257;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin5834042408054805257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5834042408054805257;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4811462423631842336.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 10:29:53] [INFO ] Flatten gal took : 3 ms
[2022-05-16 10:29:53] [INFO ] Flatten gal took : 1 ms
[2022-05-16 10:29:53] [INFO ] Time to serialize gal into /tmp/LTL12781755056292126153.gal : 1 ms
[2022-05-16 10:29:53] [INFO ] Time to serialize properties into /tmp/LTL7318064637694810026.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12781755056292126153.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7318064637694810026.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1278175...267
Read 1 LTL properties
Checking formula 0 : !((X(G((G("((P1wP2>=1)&&(P2wP1>=1))"))U("(((P1d>=1)||(P2>=1))||((P1wP2>=1)&&(P2wP1>=1)))")))))
Formula 0 simplified : !XG(G"((P1wP2>=1)&&(P2wP1>=1))" U "(((P1d>=1)||(P2>=1))||((P1wP2>=1)&&(P2wP1>=1)))")
Detected timeout of ITS tools.
[2022-05-16 10:30:08] [INFO ] Flatten gal took : 1 ms
[2022-05-16 10:30:08] [INFO ] Applying decomposition
[2022-05-16 10:30:08] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13200974327757720861.txt' '-o' '/tmp/graph13200974327757720861.bin' '-w' '/tmp/graph13200974327757720861.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13200974327757720861.bin' '-l' '-1' '-v' '-w' '/tmp/graph13200974327757720861.weights' '-q' '0' '-e' '0.001'
[2022-05-16 10:30:08] [INFO ] Decomposing Gal with order
[2022-05-16 10:30:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 10:30:08] [INFO ] Flatten gal took : 1 ms
[2022-05-16 10:30:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 10:30:08] [INFO ] Time to serialize gal into /tmp/LTL9438859368939571462.gal : 1 ms
[2022-05-16 10:30:08] [INFO ] Time to serialize properties into /tmp/LTL1182039260369566831.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9438859368939571462.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1182039260369566831.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9438859...245
Read 1 LTL properties
Checking formula 0 : !((X(G((G("((u0.P1wP2>=1)&&(u1.P2wP1>=1))"))U("(((u0.P1d>=1)||(u2.P2>=1))||((u0.P1wP2>=1)&&(u1.P2wP1>=1)))")))))
Formula 0 simplified : !XG(G"((u0.P1wP2>=1)&&(u1.P2wP1>=1))" U "(((u0.P1d>=1)||(u2.P2>=1))||((u0.P1wP2>=1)&&(u1.P2wP1>=1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4384478755048713594
[2022-05-16 10:30:23] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4384478755048713594
Running compilation step : cd /tmp/ltsmin4384478755048713594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin4384478755048713594;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4384478755048713594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp0==true)) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FMS-PT-20000-LTLFireability-14 finished in 79357 ms.
[2022-05-16 10:30:38] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9749343508556004073
[2022-05-16 10:30:38] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2022-05-16 10:30:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:30:38] [INFO ] Applying decomposition
[2022-05-16 10:30:38] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2022-05-16 10:30:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:30:38] [INFO ] Flatten gal took : 1 ms
[2022-05-16 10:30:38] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
[2022-05-16 10:30:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 10:30:38] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9749343508556004073
Running compilation step : cd /tmp/ltsmin9749343508556004073;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1282895517714807410.txt' '-o' '/tmp/graph1282895517714807410.bin' '-w' '/tmp/graph1282895517714807410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1282895517714807410.bin' '-l' '-1' '-v' '-w' '/tmp/graph1282895517714807410.weights' '-q' '0' '-e' '0.001'
[2022-05-16 10:30:38] [INFO ] Decomposing Gal with order
[2022-05-16 10:30:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 10:30:38] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-16 10:30:38] [INFO ] Flatten gal took : 8 ms
[2022-05-16 10:30:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 10:30:38] [INFO ] Time to serialize gal into /tmp/LTLFireability7029785695049677482.gal : 1 ms
[2022-05-16 10:30:38] [INFO ] Time to serialize properties into /tmp/LTLFireability2370241501512427384.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7029785695049677482.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2370241501512427384.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((X(G((G("((i0.u0.P1wP2>=1)&&(i1.u8.P2wP1>=1))"))U("(((i0.u0.P1d>=1)||(i1.u3.P2>=1))||((i0.u0.P1wP2>=1)&&(i1.u8.P2wP1>=1)))")))))
Formula 0 simplified : !XG(G"((i0.u0.P1wP2>=1)&&(i1.u8.P2wP1>=1))" U "(((i0.u0.P1d>=1)||(i1.u3.P2>=1))||((i0.u0.P1wP2>=1)&&(i1.u8.P2wP1>=1)))")
Compilation finished in 102 ms.
Running link step : cd /tmp/ltsmin9749343508556004073;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin9749343508556004073;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp0==true)) U (LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: LTL layer: formula: X([](([]((LTLAPp0==true)) U (LTLAPp1==true))))
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: "X([](([]((LTLAPp0==true)) U (LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.067: DFS-FIFO for weak LTL, using special progress label 23
pins2lts-mc-linux64( 0/ 8), 0.067: There are 24 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.067: State length is 23, there are 32 groups
pins2lts-mc-linux64( 0/ 8), 0.067: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.067: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.067: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.067: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.076: ~1 levels ~960 states ~4824 transitions
pins2lts-mc-linux64( 2/ 8), 0.107: ~1 levels ~1920 states ~10168 transitions
pins2lts-mc-linux64( 2/ 8), 0.114: ~1 levels ~3840 states ~21520 transitions
pins2lts-mc-linux64( 2/ 8), 0.141: ~1 levels ~7680 states ~45000 transitions
pins2lts-mc-linux64( 2/ 8), 0.208: ~1 levels ~15360 states ~93072 transitions
pins2lts-mc-linux64( 2/ 8), 0.315: ~1 levels ~30720 states ~195840 transitions
pins2lts-mc-linux64( 2/ 8), 0.532: ~1 levels ~61440 states ~407760 transitions
pins2lts-mc-linux64( 2/ 8), 0.941: ~1 levels ~122880 states ~848656 transitions
pins2lts-mc-linux64( 2/ 8), 1.463: ~1 levels ~245760 states ~1761176 transitions
pins2lts-mc-linux64( 5/ 8), 2.208: ~1 levels ~491520 states ~4438936 transitions
pins2lts-mc-linux64( 2/ 8), 3.214: ~1 levels ~983040 states ~7569856 transitions
pins2lts-mc-linux64( 2/ 8), 4.843: ~1 levels ~1966080 states ~15796568 transitions
pins2lts-mc-linux64( 2/ 8), 7.989: ~1 levels ~3932160 states ~33305872 transitions
pins2lts-mc-linux64( 2/ 8), 14.310: ~1 levels ~7864320 states ~68739424 transitions
pins2lts-mc-linux64( 2/ 8), 28.097: ~1 levels ~15728640 states ~144335728 transitions
pins2lts-mc-linux64( 2/ 8), 56.539: ~1 levels ~31457280 states ~303871368 transitions
pins2lts-mc-linux64( 2/ 8), 117.500: ~1 levels ~62914560 states ~636021696 transitions
pins2lts-mc-linux64( 3/ 8), 253.240: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 253.258:
pins2lts-mc-linux64( 0/ 8), 253.258: mean standard work distribution: 6.1% (states) 2.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 253.258:
pins2lts-mc-linux64( 0/ 8), 253.258: Explored 106451784 states 1214941591 transitions, fanout: 11.413
pins2lts-mc-linux64( 0/ 8), 253.258: Total exploration time 253.190 sec (253.160 sec minimum, 253.169 sec on average)
pins2lts-mc-linux64( 0/ 8), 253.258: States per second: 420442, Transitions per second: 4798537
pins2lts-mc-linux64( 0/ 8), 253.258:
pins2lts-mc-linux64( 0/ 8), 253.258: Progress states detected: 134217003
pins2lts-mc-linux64( 0/ 8), 253.258: Redundant explorations: -20.6869
pins2lts-mc-linux64( 0/ 8), 253.258:
pins2lts-mc-linux64( 0/ 8), 253.258: Queue width: 8B, total height: 53399651, memory: 407.41MB
pins2lts-mc-linux64( 0/ 8), 253.258: Tree memory: 1033.1MB, 8.1 B/state, compr.: 8.6%
pins2lts-mc-linux64( 0/ 8), 253.258: Tree fill ratio (roots/leafs): 99.0%/3.0%
pins2lts-mc-linux64( 0/ 8), 253.258: Stored 20 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 253.258: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 253.258: Est. total memory use: 1440.5MB (~1431.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9749343508556004073;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp0==true)) U (LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9749343508556004073;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp0==true)) U (LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 10:51:33] [INFO ] Flatten gal took : 6 ms
[2022-05-16 10:51:33] [INFO ] Time to serialize gal into /tmp/LTLFireability10177754476685878514.gal : 1 ms
[2022-05-16 10:51:33] [INFO ] Time to serialize properties into /tmp/LTLFireability6286881570640633420.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10177754476685878514.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6286881570640633420.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((X(G((G("((P1wP2>=1)&&(P2wP1>=1))"))U("(((P1d>=1)||(P2>=1))||((P1wP2>=1)&&(P2wP1>=1)))")))))
Formula 0 simplified : !XG(G"((P1wP2>=1)&&(P2wP1>=1))" U "(((P1d>=1)||(P2>=1))||((P1wP2>=1)&&(P2wP1>=1)))")
Detected timeout of ITS tools.
[2022-05-16 11:12:29] [INFO ] Flatten gal took : 6 ms
[2022-05-16 11:12:29] [INFO ] Input system was already deterministic with 20 transitions.
[2022-05-16 11:12:29] [INFO ] Transformed 22 places.
[2022-05-16 11:12:29] [INFO ] Transformed 20 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 11:12:29] [INFO ] Time to serialize gal into /tmp/LTLFireability1994485756999263232.gal : 1 ms
[2022-05-16 11:12:29] [INFO ] Time to serialize properties into /tmp/LTLFireability5385540950508521601.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1994485756999263232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5385540950508521601.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G((G("((P1wP2>=1)&&(P2wP1>=1))"))U("(((P1d>=1)||(P2>=1))||((P1wP2>=1)&&(P2wP1>=1)))")))))
Formula 0 simplified : !XG(G"((P1wP2>=1)&&(P2wP1>=1))" U "(((P1d>=1)||(P2>=1))||((P1wP2>=1)&&(P2wP1>=1)))")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FMS-PT-20000, 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 r078-tall-165260110600604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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