Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 5.1K Feb 26 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 26 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.7K Mar 5 18:22 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 ERK-PT-100000-LTLCardinality-00
FORMULA_NAME ERK-PT-100000-LTLCardinality-01
FORMULA_NAME ERK-PT-100000-LTLCardinality-02
FORMULA_NAME ERK-PT-100000-LTLCardinality-03
FORMULA_NAME ERK-PT-100000-LTLCardinality-04
FORMULA_NAME ERK-PT-100000-LTLCardinality-05
FORMULA_NAME ERK-PT-100000-LTLCardinality-06
FORMULA_NAME ERK-PT-100000-LTLCardinality-07
FORMULA_NAME ERK-PT-100000-LTLCardinality-08
FORMULA_NAME ERK-PT-100000-LTLCardinality-09
FORMULA_NAME ERK-PT-100000-LTLCardinality-10
FORMULA_NAME ERK-PT-100000-LTLCardinality-11
FORMULA_NAME ERK-PT-100000-LTLCardinality-12
FORMULA_NAME ERK-PT-100000-LTLCardinality-13
FORMULA_NAME ERK-PT-100000-LTLCardinality-14
FORMULA_NAME ERK-PT-100000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679415714012

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ERK-PT-100000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-21 16:21:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 16:21:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 16:21:55] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-21 16:21:55] [INFO ] Transformed 11 places.
[2023-03-21 16:21:55] [INFO ] Transformed 11 transitions.
[2023-03-21 16:21:55] [INFO ] Parsed PT model containing 11 places and 11 transitions and 34 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ERK-PT-100000-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 8 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-21 16:21:55] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-21 16:21:56] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-21 16:21:56] [INFO ] Invariant cache hit.
[2023-03-21 16:21:56] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-21 16:21:56] [INFO ] Invariant cache hit.
[2023-03-21 16:21:56] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 11/11 places, 11/11 transitions.
Support contains 9 out of 11 places after structural reductions.
[2023-03-21 16:21:56] [INFO ] Flatten gal took : 13 ms
[2023-03-21 16:21:56] [INFO ] Flatten gal took : 3 ms
[2023-03-21 16:21:56] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=2127 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-21 16:21:56] [INFO ] Invariant cache hit.
[2023-03-21 16:21:56] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-21 16:21:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-21 16:21:56] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-21 16:21:56] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-21 16:21:56] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 6 properties in 15952 ms.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 9 transition count 9
Performed 1 Post agglomeration using F-continuation condition.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 8 transition count 8
Applied a total of 6 rules in 63973 ms. Remains 8 /11 variables (removed 3) and now considering 8/11 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63973 ms. Remains : 8/11 places, 8/11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=2702 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 755438 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{}
Probabilistic random walk after 755438 steps, saw 228324 distinct states, run finished after 3002 ms. (steps per millisecond=251 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-21 16:23:19] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-21 16:23:19] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 16:23:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-21 16:23:19] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 16:23:19] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-21 16:23:19] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 3 properties in 8698 ms.
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 8/8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 6 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 4 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 4 transition count 4
Performed 1 Post agglomeration using F-continuation condition.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 2 transition count 2
Applied a total of 12 rules in 63283 ms. Remains 2 /8 variables (removed 6) and now considering 2/8 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63283 ms. Remains : 2/8 places, 2/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(p0||F(p1)))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 9 transition count 10
Applied a total of 4 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 9 cols
[2023-03-21 16:24:32] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-21 16:24:32] [INFO ] Implicit Places using invariants in 28 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/11 places, 10/11 transitions.
Graph (trivial) has 3 edges and 8 vertex of which 2 / 8 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 6 ms. Remains 7 /8 variables (removed 1) and now considering 9/10 (removed 1) transitions.
[2023-03-21 16:24:32] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 7 cols
[2023-03-21 16:24:32] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-21 16:24:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-21 16:24:32] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2023-03-21 16:24:32] [INFO ] Invariant cache hit.
[2023-03-21 16:24:32] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/11 places, 9/11 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88 ms. Remains : 7/11 places, 9/11 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s1), p1:(LEQ s3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ERK-PT-100000-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLCardinality-01 finished in 402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0)) U G(p1))))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-21 16:24:32] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-21 16:24:32] [INFO ] Implicit Places using invariants in 30 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s9), p0:(AND (LEQ 1 s9) (LEQ s6 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 203 ms.
Product exploration explored 100000 steps with 0 reset in 152 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=5882 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-03-21 16:24:33] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-21 16:24:33] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:24:33] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:24:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:24:33] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 16:24:33] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-21 16:24:33] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 11/11 transitions.
Graph (trivial) has 2 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 6 transition count 7
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 4 transition count 4
Performed 1 Post agglomeration using F-continuation condition.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 2 transition count 2
Applied a total of 15 rules in 63458 ms. Remains 2 /10 variables (removed 8) and now considering 2/11 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63458 ms. Remains : 2/10 places, 2/11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=14285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Finished probabilistic random walk after 299996 steps, run visited all 2 properties in 748 ms. (steps per millisecond=401 )
Probabilistic random walk after 299996 steps, saw 100001 distinct states, run finished after 749 ms. (steps per millisecond=400 ) properties seen :2
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-21 16:25:40] [INFO ] Invariant cache hit.
[2023-03-21 16:25:40] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-21 16:25:40] [INFO ] Invariant cache hit.
[2023-03-21 16:25:40] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-21 16:25:40] [INFO ] Invariant cache hit.
[2023-03-21 16:25:40] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 10/10 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=6666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 16:25:41] [INFO ] Invariant cache hit.
[2023-03-21 16:25:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:25:41] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:25:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:25:41] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 16:25:41] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-21 16:25:41] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2000 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 11/11 transitions.
Graph (trivial) has 2 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 6 transition count 7
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 4 transition count 4
Performed 1 Post agglomeration using F-continuation condition.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 2 transition count 2
Applied a total of 15 rules in 63724 ms. Remains 2 /10 variables (removed 8) and now considering 2/11 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63724 ms. Remains : 2/10 places, 2/11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=14285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Finished probabilistic random walk after 299996 steps, run visited all 2 properties in 727 ms. (steps per millisecond=412 )
Probabilistic random walk after 299996 steps, saw 100001 distinct states, run finished after 728 ms. (steps per millisecond=412 ) properties seen :2
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 109 ms.
Product exploration explored 100000 steps with 0 reset in 114 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Graph (trivial) has 2 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 9 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 4 ms. Remains 9 /10 variables (removed 1) and now considering 9/11 (removed 2) transitions.
[2023-03-21 16:26:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2023-03-21 16:26:49] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 16:26:49] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/10 places, 9/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 ms. Remains : 9/10 places, 9/11 transitions.
Built C files in :
/tmp/ltsmin238784769336017136
[2023-03-21 16:26:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin238784769336017136
Running compilation step : cd /tmp/ltsmin238784769336017136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 175 ms.
Running link step : cd /tmp/ltsmin238784769336017136;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin238784769336017136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8460462270369029846.hoa' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.005: LTL layer using automaton file : /tmp/stateBased8460462270369029846.hoa
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.025: "(LTLAPp1==true)&&(LTLAPp0==true)" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.032: There are 14 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.032: State length is 11, there are 25 groups
pins2lts-mc-linux64( 0/ 8), 0.032: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.032: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.032: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.032: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.048: [Blue] ~120 levels ~960 states ~4088 transitions
pins2lts-mc-linux64( 5/ 8), 0.053: [Blue] ~240 levels ~1920 states ~8368 transitions
pins2lts-mc-linux64( 5/ 8), 0.079: [Blue] ~480 levels ~3840 states ~18960 transitions
pins2lts-mc-linux64( 5/ 8), 0.100: [Blue] ~960 levels ~7680 states ~38464 transitions
pins2lts-mc-linux64( 5/ 8), 0.183: [Blue] ~1920 levels ~15360 states ~86976 transitions
pins2lts-mc-linux64( 5/ 8), 0.397: [Blue] ~3840 levels ~30720 states ~172944 transitions
pins2lts-mc-linux64( 5/ 8), 0.636: [Blue] ~7680 levels ~61440 states ~338576 transitions
pins2lts-mc-linux64( 0/ 8), 1.140: [Blue] ~15360 levels ~122880 states ~685160 transitions
pins2lts-mc-linux64( 0/ 8), 1.591: [Blue] ~30720 levels ~245760 states ~1394760 transitions
pins2lts-mc-linux64( 6/ 8), 2.012: [Blue] ~61440 levels ~491520 states ~1967512 transitions
pins2lts-mc-linux64( 6/ 8), 2.507: [Blue] ~122880 levels ~983040 states ~4297944 transitions
pins2lts-mc-linux64( 0/ 8), 3.511: [Blue] ~245760 levels ~1966080 states ~12791880 transitions
pins2lts-mc-linux64( 0/ 8), 5.503: [Blue] ~491520 levels ~3932160 states ~25817160 transitions
pins2lts-mc-linux64( 0/ 8), 9.723: [Blue] ~983040 levels ~7864320 states ~51867720 transitions
pins2lts-mc-linux64( 5/ 8), 14.444: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 14.563:
pins2lts-mc-linux64( 0/ 8), 14.563: Explored 7590113 states 49317647 transitions, fanout: 6.498
pins2lts-mc-linux64( 0/ 8), 14.563: Total exploration time 14.520 sec (14.390 sec minimum, 14.422 sec on average)
pins2lts-mc-linux64( 0/ 8), 14.563: States per second: 522735, Transitions per second: 3396532
pins2lts-mc-linux64( 0/ 8), 14.563:
pins2lts-mc-linux64( 0/ 8), 14.563: State space has 25947034 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 14.563: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 14.563: blue states: 7590113 (29.25%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 14.563: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 14.563: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 14.563:
pins2lts-mc-linux64( 0/ 8), 14.563: Total memory used for local state coloring: 115.8MB
pins2lts-mc-linux64( 0/ 8), 14.563:
pins2lts-mc-linux64( 0/ 8), 14.563: Queue width: 8B, total height: 7590112, memory: 57.91MB
pins2lts-mc-linux64( 0/ 8), 14.563: Tree memory: 454.0MB, 18.3 B/state, compr.: 39.9%
pins2lts-mc-linux64( 0/ 8), 14.563: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 14.563: Stored 11 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 14.563: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 14.563: Est. total memory use: 511.9MB (~1081.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin238784769336017136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8460462270369029846.hoa' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin238784769336017136;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8460462270369029846.hoa' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2023-03-21 16:27:04] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-21 16:27:04] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-21 16:27:04] [INFO ] Invariant cache hit.
[2023-03-21 16:27:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-21 16:27:04] [INFO ] Invariant cache hit.
[2023-03-21 16:27:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 10/10 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin11105538974474442374
[2023-03-21 16:27:04] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11105538974474442374
Running compilation step : cd /tmp/ltsmin11105538974474442374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin11105538974474442374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11105538974474442374;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5161477407135809471.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-21 16:27:19] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:27:19] [INFO ] Flatten gal took : 2 ms
[2023-03-21 16:27:19] [INFO ] Time to serialize gal into /tmp/LTL4091636822805552583.gal : 94 ms
[2023-03-21 16:27:19] [INFO ] Time to serialize properties into /tmp/LTL7525895509149217896.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4091636822805552583.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3553134379161527995.hoa' '-atoms' '/tmp/LTL7525895509149217896.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7525895509149217896.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3553134379161527995.hoa
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-21 16:27:19] [INFO ] Flatten gal took : 3 ms
[2023-03-21 16:27:19] [INFO ] Flatten gal took : 2 ms
[2023-03-21 16:27:19] [INFO ] Time to serialize gal into /tmp/LTL11105484504128513699.gal : 1 ms
[2023-03-21 16:27:19] [INFO ] Time to serialize properties into /tmp/LTL7767469289594321739.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11105484504128513699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7767469289594321739.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("((RP>=1)&&(MEKPP<=RP))")))U(G("(RP>=1)")))))))
Formula 0 simplified : XXX(FG!"((RP>=1)&&(MEKPP<=RP))" R F!"(RP>=1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-21 16:27:19] [INFO ] Flatten gal took : 2 ms
[2023-03-21 16:27:19] [INFO ] Applying decomposition
[2023-03-21 16:27:19] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3134830072738147316.txt' '-o' '/tmp/graph3134830072738147316.bin' '-w' '/tmp/graph3134830072738147316.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3134830072738147316.bin' '-l' '-1' '-v' '-w' '/tmp/graph3134830072738147316.weights' '-q' '0' '-e' '0.001'
[2023-03-21 16:27:19] [INFO ] Decomposing Gal with order
[2023-03-21 16:27:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 16:27:19] [INFO ] Removed a total of 2 redundant transitions.
[2023-03-21 16:27:20] [INFO ] Flatten gal took : 22 ms
[2023-03-21 16:27:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-21 16:27:20] [INFO ] Time to serialize gal into /tmp/LTL13692511425725033733.gal : 1 ms
[2023-03-21 16:27:20] [INFO ] Time to serialize properties into /tmp/LTL6473197011241847057.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13692511425725033733.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6473197011241847057.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("((gu4.RP>=1)&&(gu4.MEKPP<=gu4.RP))")))U(G("(gu4.RP>=1)")))))))
Formula 0 simplified : XXX(FG!"((gu4.RP>=1)&&(gu4.MEKPP<=gu4.RP))" R F!"(gu4.RP>=1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin2255766257275674573
[2023-03-21 16:27:20] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2255766257275674573
Running compilation step : cd /tmp/ltsmin2255766257275674573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 69 ms.
Running link step : cd /tmp/ltsmin2255766257275674573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2255766257275674573;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(([](<>((LTLAPp0==true))) U []((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ERK-PT-100000-LTLCardinality-03 finished in 182636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1||(G(p1) U p2)))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-21 16:27:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-21 16:27:35] [INFO ] Implicit Places using invariants in 32 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 s2), p1:(LEQ s7 s2), p2:(LEQ 1 s0)], 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 50000 reset in 102 ms.
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 8 factoid took 126 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ERK-PT-100000-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ERK-PT-100000-LTLCardinality-07 finished in 559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-21 16:27:35] [INFO ] Invariant cache hit.
[2023-03-21 16:27:35] [INFO ] Implicit Places using invariants in 24 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT s3 s6), p0:(LEQ s0 s9)], nbAcceptance=1, 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 970 reset in 165 ms.
Stack based approach found an accepted trace after 176 steps with 3 reset with depth 69 and stack size 56 in 1 ms.
FORMULA ERK-PT-100000-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-100000-LTLCardinality-08 finished in 358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 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 0 with 2 rules applied. Total rules applied 5 place count 8 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 6 transition count 7
Applied a total of 9 rules in 6 ms. Remains 6 /11 variables (removed 5) and now considering 7/11 (removed 4) transitions.
[2023-03-21 16:27:36] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2023-03-21 16:27:36] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-21 16:27:36] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-21 16:27:36] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2023-03-21 16:27:36] [INFO ] Invariant cache hit.
[2023-03-21 16:27:36] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-21 16:27:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 16:27:36] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2023-03-21 16:27:36] [INFO ] Invariant cache hit.
[2023-03-21 16:27:36] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/11 places, 7/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 6/11 places, 7/11 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s3)], 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 0 ms.
FORMULA ERK-PT-100000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLCardinality-10 finished in 127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)&&G(F(!p0)))))))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-21 16:27:36] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-21 16:27:36] [INFO ] Implicit Places using invariants in 28 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32 ms. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 270 ms :[true, true, true, true, (NOT p0), p0, p0]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=true, acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT 3 s6)], 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 77 ms.
Product exploration explored 100000 steps with 0 reset in 128 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 : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 7 states, 10 edges and 1 AP (stutter sensitive) to 7 states, 10 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[true, true, true, true, (NOT p0), p0, p0]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=5882 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 899970 steps, run visited all 1 properties in 890 ms. (steps per millisecond=1011 )
Probabilistic random walk after 899970 steps, saw 558315 distinct states, run finished after 891 ms. (steps per millisecond=1010 ) properties seen :1
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 7 states, 10 edges and 1 AP (stutter sensitive) to 7 states, 10 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 408 ms :[true, true, true, true, (NOT p0), p0, p0]
Stuttering acceptance computed with spot in 265 ms :[true, true, true, true, (NOT p0), p0, p0]
// Phase 1: matrix 11 rows 8 cols
[2023-03-21 16:27:38] [INFO ] Computed 2 place invariants in 1 ms
Proved EG true
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0), true]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 7 states, 10 edges and 1 AP (stutter sensitive) to 7 states, 10 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[true, true, true, true, (NOT p0), p0, p0]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-21 16:27:39] [INFO ] Invariant cache hit.
[2023-03-21 16:27:39] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-21 16:27:39] [INFO ] Invariant cache hit.
[2023-03-21 16:27:39] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-21 16:27:39] [INFO ] Invariant cache hit.
[2023-03-21 16:27:39] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 8/8 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 7 states, 10 edges and 1 AP (stutter sensitive) to 7 states, 10 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[true, true, true, true, (NOT p0), p0, p0]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=6666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Finished probabilistic random walk after 899970 steps, run visited all 1 properties in 808 ms. (steps per millisecond=1113 )
Probabilistic random walk after 899970 steps, saw 558315 distinct states, run finished after 808 ms. (steps per millisecond=1113 ) properties seen :1
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 7 states, 10 edges and 1 AP (stutter sensitive) to 7 states, 10 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[true, true, true, true, (NOT p0), p0, p0]
Stuttering acceptance computed with spot in 258 ms :[true, true, true, true, (NOT p0), p0, p0]
[2023-03-21 16:27:41] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0), true]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 7 states, 10 edges and 1 AP (stutter sensitive) to 7 states, 10 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[true, true, true, true, (NOT p0), p0, p0]
Stuttering acceptance computed with spot in 300 ms :[true, true, true, true, (NOT p0), p0, p0]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA ERK-PT-100000-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-100000-LTLCardinality-11 finished in 5875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X((p1||G(p2))))))))'
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-21 16:27:42] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-21 16:27:42] [INFO ] Implicit Places using invariants in 24 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26 ms. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT s0 s4), p1:(LEQ s9 s2), p2:(LEQ s5 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 97 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=5882 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 2787709 steps, run timeout after 3001 ms. (steps per millisecond=928 ) properties seen :{1=1, 2=1, 3=1}
Probabilistic random walk after 2787709 steps, saw 1616086 distinct states, run finished after 3001 ms. (steps per millisecond=928 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-03-21 16:27:45] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-21 16:27:46] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2023-03-21 16:27:46] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 16:27:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:27:46] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 16:27:46] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-21 16:27:46] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 399890 steps, including 0 resets, run visited all 1 properties in 401 ms. (steps per millisecond=997 )
Parikh walk visited 1 properties in 401 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 231 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Support contains 6 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-21 16:27:47] [INFO ] Invariant cache hit.
[2023-03-21 16:27:47] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-21 16:27:47] [INFO ] Invariant cache hit.
[2023-03-21 16:27:47] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-21 16:27:47] [INFO ] Invariant cache hit.
[2023-03-21 16:27:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 10/10 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=5263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 2957017 steps, run timeout after 3001 ms. (steps per millisecond=985 ) properties seen :{1=1, 2=1, 3=1}
Probabilistic random walk after 2957017 steps, saw 1672657 distinct states, run finished after 3001 ms. (steps per millisecond=985 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-21 16:27:50] [INFO ] Invariant cache hit.
[2023-03-21 16:27:50] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:27:50] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 16:27:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:27:50] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 16:27:50] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-21 16:27:50] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 394980 steps, including 0 resets, run visited all 1 properties in 377 ms. (steps per millisecond=1047 )
Parikh walk visited 1 properties in 378 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 0 reset in 101 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Support contains 6 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-21 16:27:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 16:27:52] [INFO ] Invariant cache hit.
[2023-03-21 16:27:52] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39 ms. Remains : 10/10 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin7096348242865607605
[2023-03-21 16:27:52] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7096348242865607605
Running compilation step : cd /tmp/ltsmin7096348242865607605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin7096348242865607605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7096348242865607605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10858113429540653109.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-21 16:28:07] [INFO ] Invariant cache hit.
[2023-03-21 16:28:07] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-21 16:28:07] [INFO ] Invariant cache hit.
[2023-03-21 16:28:07] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-21 16:28:07] [INFO ] Invariant cache hit.
[2023-03-21 16:28:07] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 10/10 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin1342914064745887634
[2023-03-21 16:28:07] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1342914064745887634
Running compilation step : cd /tmp/ltsmin1342914064745887634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 68 ms.
Running link step : cd /tmp/ltsmin1342914064745887634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1342914064745887634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2819396515810337510.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-21 16:28:22] [INFO ] Flatten gal took : 3 ms
[2023-03-21 16:28:22] [INFO ] Flatten gal took : 2 ms
[2023-03-21 16:28:22] [INFO ] Time to serialize gal into /tmp/LTL8959299373577283812.gal : 1 ms
[2023-03-21 16:28:22] [INFO ] Time to serialize properties into /tmp/LTL15514934723610610628.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8959299373577283812.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5231617346321529085.hoa' '-atoms' '/tmp/LTL15514934723610610628.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15514934723610610628.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5231617346321529085.hoa
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-21 16:28:23] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:28:23] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:28:23] [INFO ] Time to serialize gal into /tmp/LTL15944735843115950077.gal : 0 ms
[2023-03-21 16:28:23] [INFO ] Time to serialize properties into /tmp/LTL14145229516094105172.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15944735843115950077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14145229516094105172.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(Raf1Star>MEKPP_ERK)")||(X(X(X(("(RP<=Raf1Star_RKIP)")||(G("(Raf1Star_RKIP_ERKPP<=ERKPP)")))))))))
Formula 0 simplified : F(!"(Raf1Star>MEKPP_ERK)" & XXX(!"(RP<=Raf1Star_RKIP)" & F!"(Raf1Star_RKIP_ERKPP<=ERKPP)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-21 16:28:23] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:28:23] [INFO ] Applying decomposition
[2023-03-21 16:28:23] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14410556549557534851.txt' '-o' '/tmp/graph14410556549557534851.bin' '-w' '/tmp/graph14410556549557534851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14410556549557534851.bin' '-l' '-1' '-v' '-w' '/tmp/graph14410556549557534851.weights' '-q' '0' '-e' '0.001'
[2023-03-21 16:28:23] [INFO ] Decomposing Gal with order
[2023-03-21 16:28:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 16:28:23] [INFO ] Flatten gal took : 2 ms
[2023-03-21 16:28:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-21 16:28:23] [INFO ] Time to serialize gal into /tmp/LTL13164988581040298791.gal : 1 ms
[2023-03-21 16:28:23] [INFO ] Time to serialize properties into /tmp/LTL17935336866843622560.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13164988581040298791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17935336866843622560.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(gu0.Raf1Star>gu0.MEKPP_ERK)")||(X(X(X(("(gu2.RP<=gu2.Raf1Star_RKIP)")||(G("(gu1.Raf1Star_RKIP_ERKPP<=gu1.ERKPP)")))))))))
Formula 0 simplified : F(!"(gu0.Raf1Star>gu0.MEKPP_ERK)" & XXX(!"(gu2.RP<=gu2.Raf1Star_RKIP)" & F!"(gu1.Raf1Star_RKIP_ERKPP<=gu1.ERKPP)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin4413057385803210177
[2023-03-21 16:28:23] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4413057385803210177
Running compilation step : cd /tmp/ltsmin4413057385803210177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 70 ms.
Running link step : cd /tmp/ltsmin4413057385803210177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4413057385803210177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||X(X(X(((LTLAPp1==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ERK-PT-100000-LTLCardinality-12 finished in 56133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X(p1))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-21 16:28:38] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-21 16:28:38] [INFO ] Implicit Places using invariants in 31 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-13 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: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s9), p1:(LEQ 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 96 ms.
Product exploration explored 100000 steps with 0 reset in 174 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), true, (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=6250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 545278 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 545278 steps, saw 336631 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-03-21 16:28:42] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-21 16:28:42] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-21 16:28:42] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:28:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:28:42] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 16:28:42] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-21 16:28:42] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4000 ms.
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 11/11 transitions.
Graph (trivial) has 2 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 8 transition count 8
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 8 transition count 7
Applied a total of 4 rules in 2 ms. Remains 8 /10 variables (removed 2) and now considering 7/11 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 8/10 places, 7/11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=7142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1103280 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :{}
Probabilistic random walk after 1103280 steps, saw 367812 distinct states, run finished after 3001 ms. (steps per millisecond=367 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 8 cols
[2023-03-21 16:28:49] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 16:28:49] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:28:49] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:28:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-21 16:28:49] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 16:28:49] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-21 16:28:49] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4000 ms.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 8/8 places, 7/7 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 5 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-21 16:28:53] [INFO ] Invariant cache hit.
[2023-03-21 16:28:53] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-21 16:28:53] [INFO ] Invariant cache hit.
[2023-03-21 16:28:53] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-21 16:28:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 16:28:53] [INFO ] Invariant cache hit.
[2023-03-21 16:28:53] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-21 16:28:53] [INFO ] Invariant cache hit.
[2023-03-21 16:28:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:28:53] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:28:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-21 16:28:53] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 16:28:53] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-21 16:28:53] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), true, (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 92 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2023-03-21 16:28:53] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-21 16:28:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-21 16:28:53] [INFO ] Invariant cache hit.
[2023-03-21 16:28:53] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-21 16:28:53] [INFO ] Invariant cache hit.
[2023-03-21 16:28:53] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 10/10 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), true, (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=5882 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 618094 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 618094 steps, saw 382141 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 16:28:57] [INFO ] Invariant cache hit.
[2023-03-21 16:28:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:28:57] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:28:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:28:57] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 16:28:57] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-21 16:28:57] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4000 ms.
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 11/11 transitions.
Graph (trivial) has 2 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 8 transition count 8
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 8 transition count 7
Applied a total of 4 rules in 3 ms. Remains 8 /10 variables (removed 2) and now considering 7/11 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 8/10 places, 7/11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=7692 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1057297 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :{}
Probabilistic random walk after 1057297 steps, saw 352379 distinct states, run finished after 3001 ms. (steps per millisecond=352 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 8 cols
[2023-03-21 16:29:04] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-21 16:29:04] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-21 16:29:04] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:29:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-21 16:29:04] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 16:29:04] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-21 16:29:04] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 400607 steps, including 0 resets, run visited all 2 properties in 1947 ms. (steps per millisecond=205 )
Parikh walk visited 2 properties in 1946 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), true, (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 304 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 83 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 81 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 98 ms.
Product exploration explored 100000 steps with 0 reset in 113 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 142 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Graph (trivial) has 2 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 9 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 5 ms. Remains 9 /10 variables (removed 1) and now considering 9/11 (removed 2) transitions.
[2023-03-21 16:29:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2023-03-21 16:29:07] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-21 16:29:07] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/10 places, 9/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44 ms. Remains : 9/10 places, 9/11 transitions.
Built C files in :
/tmp/ltsmin11639241029631108842
[2023-03-21 16:29:07] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11639241029631108842
Running compilation step : cd /tmp/ltsmin11639241029631108842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin11639241029631108842;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11639241029631108842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13500125021810872263.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 10 cols
[2023-03-21 16:29:22] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-21 16:29:22] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-21 16:29:22] [INFO ] Invariant cache hit.
[2023-03-21 16:29:22] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-21 16:29:22] [INFO ] Invariant cache hit.
[2023-03-21 16:29:22] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 10/10 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin9415894212538406958
[2023-03-21 16:29:22] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9415894212538406958
Running compilation step : cd /tmp/ltsmin9415894212538406958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin9415894212538406958;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9415894212538406958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14790427583739928080.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-21 16:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:29:37] [INFO ] Flatten gal took : 0 ms
[2023-03-21 16:29:37] [INFO ] Time to serialize gal into /tmp/LTL6494478437466033466.gal : 0 ms
[2023-03-21 16:29:37] [INFO ] Time to serialize properties into /tmp/LTL17737264395346882177.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6494478437466033466.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5663094585179905258.hoa' '-atoms' '/tmp/LTL17737264395346882177.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17737264395346882177.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5663094585179905258.hoa
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-21 16:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:29:37] [INFO ] Time to serialize gal into /tmp/LTL15494599528827202796.gal : 1 ms
[2023-03-21 16:29:37] [INFO ] Time to serialize properties into /tmp/LTL428997968366328837.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15494599528827202796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL428997968366328837.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(RP>=2)")&&(X("(MEKPP>=2)")))))
Formula 0 simplified : F(!"(RP>=2)" | X!"(MEKPP>=2)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-21 16:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:29:37] [INFO ] Applying decomposition
[2023-03-21 16:29:37] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10043642915033578260.txt' '-o' '/tmp/graph10043642915033578260.bin' '-w' '/tmp/graph10043642915033578260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10043642915033578260.bin' '-l' '-1' '-v' '-w' '/tmp/graph10043642915033578260.weights' '-q' '0' '-e' '0.001'
[2023-03-21 16:29:37] [INFO ] Decomposing Gal with order
[2023-03-21 16:29:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 16:29:37] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:29:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-21 16:29:37] [INFO ] Time to serialize gal into /tmp/LTL1965608593991638773.gal : 1 ms
[2023-03-21 16:29:37] [INFO ] Time to serialize properties into /tmp/LTL12071875878134143815.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1965608593991638773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12071875878134143815.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("(u3.RP>=2)")&&(X("(u1.MEKPP>=2)")))))
Formula 0 simplified : F(!"(u3.RP>=2)" | X!"(u1.MEKPP>=2)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin15174027374246969412
[2023-03-21 16:29:37] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15174027374246969412
Running compilation step : cd /tmp/ltsmin15174027374246969412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 64 ms.
Running link step : cd /tmp/ltsmin15174027374246969412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin15174027374246969412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)&&X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ERK-PT-100000-LTLCardinality-13 finished in 74777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 9 transition count 10
Applied a total of 4 rules in 7 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
[2023-03-21 16:29:53] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 9 cols
[2023-03-21 16:29:53] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-21 16:29:53] [INFO ] Implicit Places using invariants in 28 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/11 places, 10/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38 ms. Remains : 8/11 places, 10/11 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s5 s0) (GT 3 s5))], 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 154 steps with 0 reset in 1 ms.
FORMULA ERK-PT-100000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLCardinality-14 finished in 103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((G(p1)||F(p2)))))'
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-21 16:29:53] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-21 16:29:53] [INFO ] Implicit Places using invariants in 35 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GT s4 s6) (GT 2 s7)), p1:(LEQ s4 s6), p2:(LEQ s9 s0)], nbAcceptance=1, 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 12622 reset in 88 ms.
Stack based approach found an accepted trace after 32 steps with 9 reset with depth 7 and stack size 6 in 0 ms.
FORMULA ERK-PT-100000-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-100000-LTLCardinality-15 finished in 317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0)) U G(p1))))))'
Found a Lengthening insensitive property : ERK-PT-100000-LTLCardinality-03
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2023-03-21 16:29:53] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-21 16:29:53] [INFO ] Implicit Places using invariants in 35 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 9/11 places, 10/11 transitions.
Graph (trivial) has 2 edges and 9 vertex of which 2 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 8
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-21 16:29:53] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-21 16:29:53] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-21 16:29:53] [INFO ] Invariant cache hit.
[2023-03-21 16:29:53] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 8/11 places, 8/11 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 87 ms. Remains : 8/11 places, 8/11 transitions.
Running random walk in product with property : ERK-PT-100000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s7), p0:(AND (LEQ 1 s7) (LEQ s4 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 0 reset in 94 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 20 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 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 16:29:54] [INFO ] Invariant cache hit.
[2023-03-21 16:29:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:29:54] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:29:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:29:54] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 16:29:54] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-21 16:29:54] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 400000 steps, including 0 resets, run visited all 2 properties in 1816 ms. (steps per millisecond=220 )
Parikh walk visited 2 properties in 1816 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 196 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 16:29:56] [INFO ] Invariant cache hit.
[2023-03-21 16:29:56] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-21 16:29:56] [INFO ] Invariant cache hit.
[2023-03-21 16:29:56] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-21 16:29:56] [INFO ] Invariant cache hit.
[2023-03-21 16:29:57] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 8/8 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=5882 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 16:29:57] [INFO ] Invariant cache hit.
[2023-03-21 16:29:57] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:29:57] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:29:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:29:57] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 16:29:57] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-21 16:29:57] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 400000 steps, including 0 resets, run visited all 2 properties in 1977 ms. (steps per millisecond=202 )
Parikh walk visited 2 properties in 1976 ms.
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 82 ms.
Product exploration explored 100000 steps with 0 reset in 89 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 16:30:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 16:30:00] [INFO ] Invariant cache hit.
[2023-03-21 16:30:00] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35 ms. Remains : 8/8 places, 8/8 transitions.
Built C files in :
/tmp/ltsmin10104036652797676244
[2023-03-21 16:30:00] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10104036652797676244
Running compilation step : cd /tmp/ltsmin10104036652797676244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 77 ms.
Running link step : cd /tmp/ltsmin10104036652797676244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10104036652797676244;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7574479026228706486.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 16:30:15] [INFO ] Invariant cache hit.
[2023-03-21 16:30:15] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-21 16:30:15] [INFO ] Invariant cache hit.
[2023-03-21 16:30:16] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-21 16:30:16] [INFO ] Invariant cache hit.
[2023-03-21 16:30:16] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 8/8 places, 8/8 transitions.
Built C files in :
/tmp/ltsmin17634005395940122315
[2023-03-21 16:30:16] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17634005395940122315
Running compilation step : cd /tmp/ltsmin17634005395940122315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 71 ms.
Running link step : cd /tmp/ltsmin17634005395940122315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17634005395940122315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13806803727040845364.hoa' '--buchi-type=spotba'
LTSmin run took 11546 ms.
Treatment of property ERK-PT-100000-LTLCardinality-03 finished in 34330 ms.
FORMULA ERK-PT-100000-LTLCardinality-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X((p1||G(p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X(p1))))'
Found a Lengthening insensitive property : ERK-PT-100000-LTLCardinality-13
Stuttering acceptance computed with spot in 94 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 2 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2023-03-21 16:30:27] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-21 16:30:28] [INFO ] Implicit Places using invariants in 27 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 9/11 places, 10/11 transitions.
Graph (trivial) has 2 edges and 9 vertex of which 2 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 8
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-21 16:30:28] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-21 16:30:28] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-21 16:30:28] [INFO ] Invariant cache hit.
[2023-03-21 16:30:28] [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.
Starting structural reductions in LI_LTL mode, iteration 2 : 8/11 places, 8/11 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 90 ms. Remains : 8/11 places, 8/11 transitions.
Running random walk in product with property : ERK-PT-100000-LTLCardinality-13 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: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s7), p1:(LEQ 2 s4)], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Product exploration explored 100000 steps with 0 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), true, (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=6666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 1220501 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :{}
Probabilistic random walk after 1220501 steps, saw 356297 distinct states, run finished after 3001 ms. (steps per millisecond=406 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 16:30:31] [INFO ] Invariant cache hit.
[2023-03-21 16:30:31] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-21 16:30:31] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:30:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:30:31] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 16:30:31] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-21 16:30:31] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 99999 steps, including 0 resets, run visited all 2 properties in 916 ms. (steps per millisecond=109 )
Parikh walk visited 2 properties in 915 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), true, (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 248 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 81 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 16:30:33] [INFO ] Invariant cache hit.
[2023-03-21 16:30:33] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-21 16:30:33] [INFO ] Invariant cache hit.
[2023-03-21 16:30:33] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-21 16:30:33] [INFO ] Invariant cache hit.
[2023-03-21 16:30:33] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 8/8 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), true, (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 316 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=6250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1245285 steps, run timeout after 3001 ms. (steps per millisecond=414 ) properties seen :{}
Probabilistic random walk after 1245285 steps, saw 363590 distinct states, run finished after 3001 ms. (steps per millisecond=414 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 16:30:36] [INFO ] Invariant cache hit.
[2023-03-21 16:30:36] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-21 16:30:36] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 16:30:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 16:30:36] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 16:30:36] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-21 16:30:36] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 99999 steps, including 0 resets, run visited all 2 properties in 663 ms. (steps per millisecond=150 )
Parikh walk visited 2 properties in 663 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (OR (NOT p0) (NOT p1))))), true, (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 91 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 85 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 91 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 197 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 16:30:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 16:30:38] [INFO ] Invariant cache hit.
[2023-03-21 16:30:38] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29 ms. Remains : 8/8 places, 8/8 transitions.
Built C files in :
/tmp/ltsmin9713604228237853986
[2023-03-21 16:30:38] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9713604228237853986
Running compilation step : cd /tmp/ltsmin9713604228237853986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 61 ms.
Running link step : cd /tmp/ltsmin9713604228237853986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9713604228237853986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9397412725877854634.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 16:30:53] [INFO ] Invariant cache hit.
[2023-03-21 16:30:53] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-21 16:30:53] [INFO ] Invariant cache hit.
[2023-03-21 16:30:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-21 16:30:53] [INFO ] Invariant cache hit.
[2023-03-21 16:30:53] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 8/8 places, 8/8 transitions.
Built C files in :
/tmp/ltsmin5471276149406461332
[2023-03-21 16:30:53] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5471276149406461332
Running compilation step : cd /tmp/ltsmin5471276149406461332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 65 ms.
Running link step : cd /tmp/ltsmin5471276149406461332;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5471276149406461332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10962947143197026599.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-21 16:31:08] [INFO ] Flatten gal took : 2 ms
[2023-03-21 16:31:08] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:31:08] [INFO ] Time to serialize gal into /tmp/LTL3053642655956331233.gal : 1 ms
[2023-03-21 16:31:08] [INFO ] Time to serialize properties into /tmp/LTL15612764204812585114.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3053642655956331233.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15894558944701895236.hoa' '-atoms' '/tmp/LTL15612764204812585114.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15612764204812585114.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15894558944701895236.hoa
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-21 16:31:08] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:31:08] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:31:08] [INFO ] Time to serialize gal into /tmp/LTL7769546544278092595.gal : 1 ms
[2023-03-21 16:31:08] [INFO ] Time to serialize properties into /tmp/LTL3904674340713146979.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7769546544278092595.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3904674340713146979.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("(RP>=2)")&&(X("(MEKPP>=2)")))))
Formula 0 simplified : F(!"(RP>=2)" | X!"(MEKPP>=2)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-21 16:31:08] [INFO ] Flatten gal took : 0 ms
[2023-03-21 16:31:08] [INFO ] Applying decomposition
[2023-03-21 16:31:08] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7946562204991788020.txt' '-o' '/tmp/graph7946562204991788020.bin' '-w' '/tmp/graph7946562204991788020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7946562204991788020.bin' '-l' '-1' '-v' '-w' '/tmp/graph7946562204991788020.weights' '-q' '0' '-e' '0.001'
[2023-03-21 16:31:08] [INFO ] Decomposing Gal with order
[2023-03-21 16:31:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 16:31:08] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:31:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-21 16:31:08] [INFO ] Time to serialize gal into /tmp/LTL11879277584979390300.gal : 0 ms
[2023-03-21 16:31:08] [INFO ] Time to serialize properties into /tmp/LTL733532311677196395.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11879277584979390300.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL733532311677196395.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(u0.RP>=2)")&&(X("(u1.MEKPP>=2)")))))
Formula 0 simplified : F(!"(u0.RP>=2)" | X!"(u1.MEKPP>=2)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin1138080718627035979
[2023-03-21 16:31:08] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1138080718627035979
Running compilation step : cd /tmp/ltsmin1138080718627035979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 65 ms.
Running link step : cd /tmp/ltsmin1138080718627035979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1138080718627035979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)&&X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ERK-PT-100000-LTLCardinality-13 finished in 56205 ms.
[2023-03-21 16:31:24] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
[2023-03-21 16:31:24] [INFO ] Applying decomposition
[2023-03-21 16:31:24] [INFO ] Flatten gal took : 0 ms
Built C files in :
/tmp/ltsmin9219935936357070158
[2023-03-21 16:31:24] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2023-03-21 16:31:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 16:31:24] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2023-03-21 16:31:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 16:31:24] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2023-03-21 16:31:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 16:31:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9219935936357070158
Running compilation step : cd /tmp/ltsmin9219935936357070158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3901439609014368654.txt' '-o' '/tmp/graph3901439609014368654.bin' '-w' '/tmp/graph3901439609014368654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3901439609014368654.bin' '-l' '-1' '-v' '-w' '/tmp/graph3901439609014368654.weights' '-q' '0' '-e' '0.001'
[2023-03-21 16:31:24] [INFO ] Decomposing Gal with order
[2023-03-21 16:31:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 16:31:24] [INFO ] Flatten gal took : 2 ms
[2023-03-21 16:31:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-21 16:31:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality12080465397610273260.gal : 9 ms
[2023-03-21 16:31:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality4236197178774764740.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12080465397610273260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4236197178774764740.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

Compilation finished in 117 ms.
Running link step : cd /tmp/ltsmin9219935936357070158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G(("(gu0.Raf1Star>gu0.MEKPP_ERK)")||(X(X(X(("(gu2.RP<=gu2.Raf1Star_RKIP)")||(G("(gu1.Raf1Star_RKIP_ERKPP<=gu1.ERKPP)")))))))))
Formula 0 simplified : F(!"(gu0.Raf1Star>gu0.MEKPP_ERK)" & XXX(!"(gu2.RP<=gu2.Raf1Star_RKIP)" & F!"(gu1.Raf1Star_RKIP_ERKPP<=gu1.ERKPP)"))
ITS-tools command line returned an error code 134
terminate called after throwing an instance of 'char const*'
[2023-03-21 16:31:24] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:31:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality10550198684558405357.gal : 1 ms
[2023-03-21 16:31:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality5323963675825733853.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10550198684558405357.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5323963675825733853.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
Link finished in 26 ms.

Running LTSmin : cd /tmp/ltsmin9219935936357070158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp2==true)||X(X(X(((LTLAPp3==true)||[]((LTLAPp4==true))))))))' '--buchi-type=spotba'
its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G(("(Raf1Star>MEKPP_ERK)")||(X(X(X(("(RP<=Raf1Star_RKIP)")||(G("(Raf1Star_RKIP_ERKPP<=ERKPP)")))))))))
Formula 0 simplified : F(!"(Raf1Star>MEKPP_ERK)" & XXX(!"(RP<=Raf1Star_RKIP)" & F!"(Raf1Star_RKIP_ERKPP<=ERKPP)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2023-03-21 16:31:24] [INFO ] Flatten gal took : 1 ms
[2023-03-21 16:31:24] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-21 16:31:24] [INFO ] Transformed 11 places.
[2023-03-21 16:31:24] [INFO ] Transformed 11 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2023-03-21 16:31:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality3737552471569352643.gal : 1 ms
[2023-03-21 16:31:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality6413478013132163814.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3737552471569352643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6413478013132163814.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(Raf1Star>MEKPP_ERK)")||(X(X(X(("(RP<=Raf1Star_RKIP)")||(G("(Raf1Star_RKIP_ERKPP<=ERKPP)")))))))))
Formula 0 simplified : F(!"(Raf1Star>MEKPP_ERK)" & XXX(!"(RP<=Raf1Star_RKIP)" & F!"(Raf1Star_RKIP_ERKPP<=ERKPP)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: [](((LTLAPp2==true)||X(X(X(((LTLAPp3==true)||[]((LTLAPp4==true))))))))
pins2lts-mc-linux64( 1/ 8), 0.001: "[](((LTLAPp2==true)||X(X(X(((LTLAPp3==true)||[]((LTLAPp4==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.096: DFS-FIFO for weak LTL, using special progress label 19
pins2lts-mc-linux64( 0/ 8), 0.096: There are 20 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.096: State length is 12, there are 38 groups
pins2lts-mc-linux64( 0/ 8), 0.096: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.096: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.096: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.096: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.109: ~1 levels ~960 states ~4568 transitions
pins2lts-mc-linux64( 7/ 8), 0.113: ~1 levels ~1920 states ~9848 transitions
pins2lts-mc-linux64( 7/ 8), 0.735: ~1 levels ~3840 states ~20544 transitions
pins2lts-mc-linux64( 7/ 8), 0.797: ~1 levels ~7680 states ~47168 transitions
pins2lts-mc-linux64( 7/ 8), 0.892: ~1 levels ~15360 states ~104776 transitions
pins2lts-mc-linux64( 7/ 8), 1.088: ~1 levels ~30720 states ~226328 transitions
pins2lts-mc-linux64( 7/ 8), 1.410: ~1 levels ~61440 states ~473472 transitions
pins2lts-mc-linux64( 7/ 8), 2.050: ~1 levels ~122880 states ~984872 transitions
pins2lts-mc-linux64( 4/ 8), 3.393: ~1 levels ~245760 states ~2060192 transitions
pins2lts-mc-linux64( 0/ 8), 5.115: ~1 levels ~491520 states ~4061232 transitions
pins2lts-mc-linux64( 0/ 8), 7.552: ~1 levels ~983040 states ~8330520 transitions
pins2lts-mc-linux64( 0/ 8), 10.882: ~1 levels ~1966080 states ~17130152 transitions
pins2lts-mc-linux64( 0/ 8), 15.908: ~1 levels ~3932160 states ~35069416 transitions
pins2lts-mc-linux64( 0/ 8), 22.556: ~1 levels ~7864320 states ~71800296 transitions
pins2lts-mc-linux64( 0/ 8), 35.858: ~1 levels ~15728640 states ~145698192 transitions
pins2lts-mc-linux64( 0/ 8), 64.652: ~1 levels ~31457280 states ~298209096 transitions
pins2lts-mc-linux64( 0/ 8), 125.248: ~1 levels ~62914560 states ~604533960 transitions
pins2lts-mc-linux64( 6/ 8), 252.906: ~1 levels ~125829120 states ~1238292832 transitions
pins2lts-mc-linux64( 6/ 8), 288.710: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 288.768:
pins2lts-mc-linux64( 0/ 8), 288.768: mean standard work distribution: 2.3% (states) 2.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 288.768:
pins2lts-mc-linux64( 0/ 8), 288.768: Explored 129202362 states 1287685305 transitions, fanout: 9.966
pins2lts-mc-linux64( 0/ 8), 288.768: Total exploration time 288.660 sec (288.570 sec minimum, 288.610 sec on average)
pins2lts-mc-linux64( 0/ 8), 288.768: States per second: 447594, Transitions per second: 4460906
pins2lts-mc-linux64( 0/ 8), 288.768:
pins2lts-mc-linux64( 0/ 8), 288.768: Progress states detected: 134217048
pins2lts-mc-linux64( 0/ 8), 288.768: Redundant explorations: -3.7365
pins2lts-mc-linux64( 0/ 8), 288.768:
pins2lts-mc-linux64( 0/ 8), 288.768: Queue width: 8B, total height: 10336276, memory: 78.86MB
pins2lts-mc-linux64( 0/ 8), 288.768: Tree memory: 1069.6MB, 8.4 B/state, compr.: 16.7%
pins2lts-mc-linux64( 0/ 8), 288.768: Tree fill ratio (roots/leafs): 99.0%/17.0%
pins2lts-mc-linux64( 0/ 8), 288.768: Stored 11 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 288.768: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 288.768: Est. total memory use: 1148.4MB (~1102.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9219935936357070158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp2==true)||X(X(X(((LTLAPp3==true)||[]((LTLAPp4==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9219935936357070158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp2==true)||X(X(X(((LTLAPp3==true)||[]((LTLAPp4==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Total runtime 857606 ms.

BK_STOP 1679416577023

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ERK-PT-100000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838849800043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ERK-PT-100000.tgz
mv ERK-PT-100000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;