Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 8.2K Apr 29 12:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 12:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 12:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 12:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 6.7K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ERK-PT-001000-LTLCardinality-00
FORMULA_NAME ERK-PT-001000-LTLCardinality-01
FORMULA_NAME ERK-PT-001000-LTLCardinality-02
FORMULA_NAME ERK-PT-001000-LTLCardinality-03
FORMULA_NAME ERK-PT-001000-LTLCardinality-04
FORMULA_NAME ERK-PT-001000-LTLCardinality-05
FORMULA_NAME ERK-PT-001000-LTLCardinality-06
FORMULA_NAME ERK-PT-001000-LTLCardinality-07
FORMULA_NAME ERK-PT-001000-LTLCardinality-08
FORMULA_NAME ERK-PT-001000-LTLCardinality-09
FORMULA_NAME ERK-PT-001000-LTLCardinality-10
FORMULA_NAME ERK-PT-001000-LTLCardinality-11
FORMULA_NAME ERK-PT-001000-LTLCardinality-12
FORMULA_NAME ERK-PT-001000-LTLCardinality-13
FORMULA_NAME ERK-PT-001000-LTLCardinality-14
FORMULA_NAME ERK-PT-001000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652660043669

Running Version 202205111006
[2022-05-16 00:14:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 00:14:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:14:04] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2022-05-16 00:14:04] [INFO ] Transformed 11 places.
[2022-05-16 00:14:04] [INFO ] Transformed 11 transitions.
[2022-05-16 00:14:04] [INFO ] Parsed PT model containing 11 places and 11 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ERK-PT-001000-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-001000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-001000-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-001000-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-001000-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-001000-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 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 7 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 00:14:05] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-16 00:14:05] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 00:14:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 00:14:05] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 00:14:05] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 00:14:05] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
Support contains 11 out of 11 places after structural reductions.
[2022-05-16 00:14:05] [INFO ] Flatten gal took : 16 ms
[2022-05-16 00:14:05] [INFO ] Flatten gal took : 4 ms
[2022-05-16 00:14:05] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=556 ) properties (out of 18) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 00:14:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 00:14:05] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 00:14:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 00:14:05] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-16 00:14:05] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-16 00:14:05] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 2002 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=333 )
Parikh walk visited 2 properties in 32 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA ERK-PT-001000-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0) U (G(X(p0))||(G((G(!p0) U p1))&&X(p0))))))'
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
[2022-05-16 00:14:06] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 00:14:06] [INFO ] Implicit Places using invariants in 34 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 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 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 400 ms :[(NOT p0), (NOT p0), false, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
Running random walk in product with property : ERK-PT-001000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 1}, { cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 4}, { cond=(NOT p0), acceptance={0, 2} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 3}, { cond=(NOT p0), acceptance={0, 2} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={2} source=2 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}, { cond=(NOT p0), acceptance={0, 2} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={1, 2} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={2} source=5 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 4}]], initial=0, aps=[p1:(LEQ s1 s0), p0:(LEQ 1 s1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 228 ms.
Product exploration explored 100000 steps with 0 reset in 190 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 671 ms. Reduced automaton from 7 states, 30 edges and 2 AP to 7 states, 30 edges and 2 AP.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1430 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 00:14:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 00:14:07] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:14:07] [INFO ] After 13ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 599 ms. Reduced automaton from 7 states, 30 edges and 2 AP to 3 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 00:14:08] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:14:08] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 00:14:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:14:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 00:14:08] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 00:14:08] [INFO ] Added : 1 causal constraints over 1 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 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 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 00:14:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 00:14:08] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 00:14:08] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:14:08] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 00:14:08] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:14:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 3 factoid took 260 ms. Reduced automaton from 3 states, 10 edges and 2 AP to 3 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Finished random walk after 3003 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=1001 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p1)), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 325 ms. Reduced automaton from 3 states, 10 edges and 2 AP to 3 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 00:14:09] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-16 00:14:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 00:14:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 00:14:09] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 00:14:09] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 00:14:09] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2 reset in 145 ms.
Product exploration explored 100000 steps with 0 reset in 204 ms.
Built C files in :
/tmp/ltsmin15164975100446222109
[2022-05-16 00:14:10] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15164975100446222109
Running compilation step : cd /tmp/ltsmin15164975100446222109;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 151 ms.
Running link step : cd /tmp/ltsmin15164975100446222109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15164975100446222109;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6258520186944457391.hoa' '--buchi-type=spotba'
LTSmin run took 270 ms.
FORMULA ERK-PT-001000-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ERK-PT-001000-LTLCardinality-00 finished in 4894 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0) U G(p1)) U G(X(p2))))))'
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.
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 00:14:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 00:14:10] [INFO ] Implicit Places using invariants in 22 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 23 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 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 368 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : ERK-PT-001000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=3 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 10}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 7}, { cond=p1, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 9}, { cond=(AND p1 p0), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) p0), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p2:(LEQ 3 s4), p1:(LEQ s3 s2), p0:(LEQ s3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 47 reset in 126 ms.
Stack based approach found an accepted trace after 21 steps with 2 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ERK-PT-001000-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-001000-LTLCardinality-05 finished in 545 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!X(p0)) U 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 11 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 7 transition count 9
Applied a total of 6 rules in 8 ms. Remains 7 /11 variables (removed 4) and now considering 9/11 (removed 2) transitions.
[2022-05-16 00:14:11] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 7 cols
[2022-05-16 00:14:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 00:14:11] [INFO ] Implicit Places using invariants in 25 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/11 places, 9/11 transitions.
Graph (trivial) has 6 edges and 6 vertex of which 2 / 6 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Applied a total of 1 rules in 7 ms. Remains 5 /6 variables (removed 1) and now considering 8/9 (removed 1) transitions.
[2022-05-16 00:14:11] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 00:14:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:14:11] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-16 00:14:11] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 00:14:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:14:11] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/11 places, 8/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/11 places, 8/11 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, p0, (NOT p0)]
Running random walk in product with property : ERK-PT-001000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 0 ms.
FORMULA ERK-PT-001000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-001000-LTLCardinality-08 finished in 201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(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 9 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 9 cols
[2022-05-16 00:14:11] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 00:14:11] [INFO ] Implicit Places using invariants in 22 ms returned [0, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/11 places, 10/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/11 places, 10/11 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-001000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9605 steps with 0 reset in 27 ms.
FORMULA ERK-PT-001000-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-001000-LTLCardinality-10 finished in 135 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 11 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 7 transition count 9
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 7 transition count 9
Applied a total of 7 rules in 2 ms. Remains 7 /11 variables (removed 4) and now considering 9/11 (removed 2) transitions.
[2022-05-16 00:14:11] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 7 cols
[2022-05-16 00:14:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 00:14:11] [INFO ] Implicit Places using invariants in 16 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/11 places, 9/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/11 places, 9/11 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ERK-PT-001000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s2)], 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 1 ms.
FORMULA ERK-PT-001000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-001000-LTLCardinality-11 finished in 56 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(!(F(p1) U !X(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 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 00:14:11] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 00:14:11] [INFO ] Implicit Places using invariants in 20 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 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 2 iterations. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND p1 (NOT p2)), true, (AND p1 (NOT p2)), (AND p1 p2)]
Running random walk in product with property : ERK-PT-001000-LTLCardinality-12 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=p1, acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND p1 p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GT s7 s1), p1:(LEQ 1 s4), p2:(GT s0 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ERK-PT-001000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-001000-LTLCardinality-12 finished in 304 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||F(G((G(!p0)&&p1)))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 11
Applied a total of 1 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 00:14:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 00:14:12] [INFO ] Implicit Places using invariants in 23 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_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 2 iterations. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ERK-PT-001000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s2), p1:(LEQ s9 s6)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 135 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 27 in 0 ms.
FORMULA ERK-PT-001000-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-001000-LTLCardinality-13 finished in 317 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(((p0 U p1)&&X(p0))))))'
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
[2022-05-16 00:14:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 00:14:12] [INFO ] Implicit Places using invariants in 26 ms returned [0, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 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 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : ERK-PT-001000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s7 s5), p0:(LEQ s5 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9 reset in 112 ms.
Stack based approach found an accepted trace after 5 steps with 1 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ERK-PT-001000-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ERK-PT-001000-LTLCardinality-14 finished in 317 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||p1)))'
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 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 00:14:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 00:14:12] [INFO ] Implicit Places using invariants in 23 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 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 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ERK-PT-001000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s4 s0), p0:(GT 3 s5)], 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 99 ms.
Product exploration explored 100000 steps with 0 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 197 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3337 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 00:14:13] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:14:13] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:14:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 00:14:13] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:14:13] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-16 00:14:13] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1899 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=379 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 236 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 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.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 00:14:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 00:14:13] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 00:14:13] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:14:13] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 00:14:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 00:14:13] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2002 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 00:14:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:14:14] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:14:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 00:14:14] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:14:14] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-16 00:14:14] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1990 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=497 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 140 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 70 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 11/11 transitions.
Graph (trivial) has 3 edges and 8 vertex of which 2 / 8 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.
Applied a total of 1 rules in 4 ms. Remains 7 /8 variables (removed 1) and now considering 10/11 (removed 1) transitions.
[2022-05-16 00:14:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 7 cols
[2022-05-16 00:14:15] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:14:15] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 10/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 10/11 transitions.
Product exploration explored 100000 steps with 0 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 151 ms.
Built C files in :
/tmp/ltsmin16774627479947755919
[2022-05-16 00:14:15] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16774627479947755919
Running compilation step : cd /tmp/ltsmin16774627479947755919;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 60 ms.
Running link step : cd /tmp/ltsmin16774627479947755919;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin16774627479947755919;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15010740510573378452.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 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.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 00:14:30] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:14:30] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 00:14:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 00:14:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2022-05-16 00:14:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 00:14:30] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin17671048119017521668
[2022-05-16 00:14:30] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17671048119017521668
Running compilation step : cd /tmp/ltsmin17671048119017521668;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 71 ms.
Running link step : cd /tmp/ltsmin17671048119017521668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin17671048119017521668;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10439728655765477740.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 00:14:45] [INFO ] Flatten gal took : 3 ms
[2022-05-16 00:14:45] [INFO ] Flatten gal took : 1 ms
[2022-05-16 00:14:45] [INFO ] Time to serialize gal into /tmp/LTL5961751059393491618.gal : 0 ms
[2022-05-16 00:14:45] [INFO ] Time to serialize properties into /tmp/LTL6779632313654983038.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5961751059393491618.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6779632313654983038.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5961751...266
Read 1 LTL properties
Checking formula 0 : !((G((X(G("(RKIPP_RP<3)")))||("(Raf1Star_RKIP_ERKPP<=RKIP)"))))
Formula 0 simplified : !G("(Raf1Star_RKIP_ERKPP<=RKIP)" | XG"(RKIPP_RP<3)")
Detected timeout of ITS tools.
[2022-05-16 00:15:00] [INFO ] Flatten gal took : 4 ms
[2022-05-16 00:15:00] [INFO ] Applying decomposition
[2022-05-16 00:15:00] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11298286377748977533.txt' '-o' '/tmp/graph11298286377748977533.bin' '-w' '/tmp/graph11298286377748977533.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11298286377748977533.bin' '-l' '-1' '-v' '-w' '/tmp/graph11298286377748977533.weights' '-q' '0' '-e' '0.001'
[2022-05-16 00:15:00] [INFO ] Decomposing Gal with order
[2022-05-16 00:15:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 00:15:00] [INFO ] Flatten gal took : 29 ms
[2022-05-16 00:15:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 00:15:00] [INFO ] Time to serialize gal into /tmp/LTL3706428550845559466.gal : 0 ms
[2022-05-16 00:15:00] [INFO ] Time to serialize properties into /tmp/LTL12551067914725473633.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3706428550845559466.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12551067914725473633.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3706428...267
Read 1 LTL properties
Checking formula 0 : !((G((X(G("(gu2.RKIPP_RP<3)")))||("(gu0.Raf1Star_RKIP_ERKPP<=gu0.RKIP)"))))
Formula 0 simplified : !G("(gu0.Raf1Star_RKIP_ERKPP<=gu0.RKIP)" | XG"(gu2.RKIPP_RP<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1583497707604544885
[2022-05-16 00:15:15] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1583497707604544885
Running compilation step : cd /tmp/ltsmin1583497707604544885;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin1583497707604544885;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1583497707604544885;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X([]((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ERK-PT-001000-LTLCardinality-15 finished in 78261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||p1)))'
Found a SL insensitive property : ERK-PT-001000-LTLCardinality-15
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SLCL_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
Applied a total of 3 rules in 1 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 9 cols
[2022-05-16 00:15:31] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 00:15:31] [INFO ] Implicit Places using invariants in 26 ms returned [0, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 7/11 places, 10/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/11 places, 10/11 transitions.
Running random walk in product with property : ERK-PT-001000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ s3 s0), p0:(GT 3 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 163 ms.
Product exploration explored 100000 steps with 0 reset in 132 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 184 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3337 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 10 rows 7 cols
[2022-05-16 00:15:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 00:15:31] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 00:15:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 00:15:31] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 00:15:31] [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 3 ms.
[2022-05-16 00:15:31] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4357 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=396 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 7 cols
[2022-05-16 00:15:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:15:32] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 10 rows 7 cols
[2022-05-16 00:15:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:15:32] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 7 cols
[2022-05-16 00:15:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:15:32] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 10/10 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), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 200 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2503 ) properties (out of 2) seen :1
Finished Best-First random walk after 207 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=207 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 313 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 102 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 71 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2022-05-16 00:15:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 7 cols
[2022-05-16 00:15:33] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:15:33] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 10/10 transitions.
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Built C files in :
/tmp/ltsmin15815788565644129499
[2022-05-16 00:15:33] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15815788565644129499
Running compilation step : cd /tmp/ltsmin15815788565644129499;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin15815788565644129499;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin15815788565644129499;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8528972640400511511.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 7 cols
[2022-05-16 00:15:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 00:15:48] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 10 rows 7 cols
[2022-05-16 00:15:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-16 00:15:48] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 10 rows 7 cols
[2022-05-16 00:15:48] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 00:15:48] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin684663657231705880
[2022-05-16 00:15:48] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin684663657231705880
Running compilation step : cd /tmp/ltsmin684663657231705880;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 72 ms.
Running link step : cd /tmp/ltsmin684663657231705880;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin684663657231705880;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9103160221051703734.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 00:16:04] [INFO ] Flatten gal took : 1 ms
[2022-05-16 00:16:04] [INFO ] Flatten gal took : 1 ms
[2022-05-16 00:16:04] [INFO ] Time to serialize gal into /tmp/LTL5117300228823452961.gal : 0 ms
[2022-05-16 00:16:04] [INFO ] Time to serialize properties into /tmp/LTL4326342027931534465.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5117300228823452961.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4326342027931534465.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5117300...266
Read 1 LTL properties
Checking formula 0 : !((G((X(G("(RKIPP_RP<3)")))||("(Raf1Star_RKIP_ERKPP<=RKIP)"))))
Formula 0 simplified : !G("(Raf1Star_RKIP_ERKPP<=RKIP)" | XG"(RKIPP_RP<3)")
Detected timeout of ITS tools.
[2022-05-16 00:16:19] [INFO ] Flatten gal took : 1 ms
[2022-05-16 00:16:19] [INFO ] Applying decomposition
[2022-05-16 00:16:19] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5799090908195508670.txt' '-o' '/tmp/graph5799090908195508670.bin' '-w' '/tmp/graph5799090908195508670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5799090908195508670.bin' '-l' '-1' '-v' '-w' '/tmp/graph5799090908195508670.weights' '-q' '0' '-e' '0.001'
[2022-05-16 00:16:19] [INFO ] Decomposing Gal with order
[2022-05-16 00:16:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 00:16:19] [INFO ] Flatten gal took : 4 ms
[2022-05-16 00:16:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 00:16:19] [INFO ] Time to serialize gal into /tmp/LTL8692312652101990136.gal : 0 ms
[2022-05-16 00:16:19] [INFO ] Time to serialize properties into /tmp/LTL8636257702834730048.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8692312652101990136.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8636257702834730048.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8692312...266
Read 1 LTL properties
Checking formula 0 : !((G((X(G("(gu2.RKIPP_RP<3)")))||("(gu0.Raf1Star_RKIP_ERKPP<=gu0.RKIP)"))))
Formula 0 simplified : !G("(gu0.Raf1Star_RKIP_ERKPP<=gu0.RKIP)" | XG"(gu2.RKIPP_RP<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7985657367032115411
[2022-05-16 00:16:34] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7985657367032115411
Running compilation step : cd /tmp/ltsmin7985657367032115411;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 70 ms.
Running link step : cd /tmp/ltsmin7985657367032115411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7985657367032115411;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X([]((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ERK-PT-001000-LTLCardinality-15 finished in 78174 ms.
[2022-05-16 00:16:49] [INFO ] Flatten gal took : 2 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5469887257872654458
[2022-05-16 00:16:49] [INFO ] Applying decomposition
[2022-05-16 00:16:49] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2022-05-16 00:16:49] [INFO ] Flatten gal took : 1 ms
[2022-05-16 00:16:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:16:49] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2022-05-16 00:16:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:16:49] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2022-05-16 00:16:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:16:49] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5469887257872654458
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18224267419125157037.txt' '-o' '/tmp/graph18224267419125157037.bin' '-w' '/tmp/graph18224267419125157037.weights'
Running compilation step : cd /tmp/ltsmin5469887257872654458;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18224267419125157037.bin' '-l' '-1' '-v' '-w' '/tmp/graph18224267419125157037.weights' '-q' '0' '-e' '0.001'
[2022-05-16 00:16:49] [INFO ] Decomposing Gal with order
[2022-05-16 00:16:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 00:16:49] [INFO ] Removed a total of 2 redundant transitions.
[2022-05-16 00:16:49] [INFO ] Flatten gal took : 3 ms
[2022-05-16 00:16:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 00:16:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality4906855715934999132.gal : 1 ms
[2022-05-16 00:16:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality3855666569079136671.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4906855715934999132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3855666569079136671.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !((G((X(G("(gu2.RKIPP_RP<3)")))||("(gu0.Raf1Star_RKIP_ERKPP<=gu0.RKIP)"))))
Formula 0 simplified : !G("(gu0.Raf1Star_RKIP_ERKPP<=gu0.RKIP)" | XG"(gu2.RKIPP_RP<3)")
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin5469887257872654458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5469887257872654458;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X([]((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: []((X([]((LTLAPp0==true)))||(LTLAPp1==true)))
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: "[]((X([]((LTLAPp0==true)))||(LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.058: DFS-FIFO for weak LTL, using special progress label 14
pins2lts-mc-linux64( 0/ 8), 0.058: There are 15 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.058: State length is 12, there are 16 groups
pins2lts-mc-linux64( 0/ 8), 0.058: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.058: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.058: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.058: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.067: ~1 levels ~960 states ~4576 transitions
pins2lts-mc-linux64( 7/ 8), 0.072: ~1 levels ~1920 states ~9848 transitions
pins2lts-mc-linux64( 7/ 8), 0.082: ~1 levels ~3840 states ~21168 transitions
pins2lts-mc-linux64( 7/ 8), 0.128: ~1 levels ~7680 states ~44208 transitions
pins2lts-mc-linux64( 7/ 8), 0.174: ~1 levels ~15360 states ~94048 transitions
pins2lts-mc-linux64( 7/ 8), 0.250: ~1 levels ~30720 states ~196184 transitions
pins2lts-mc-linux64( 7/ 8), 0.421: ~1 levels ~61440 states ~404864 transitions
pins2lts-mc-linux64( 7/ 8), 0.776: ~1 levels ~122880 states ~835280 transitions
pins2lts-mc-linux64( 3/ 8), 1.311: ~1 levels ~245760 states ~2071336 transitions
pins2lts-mc-linux64( 5/ 8), 2.004: ~1 levels ~491520 states ~4105320 transitions
pins2lts-mc-linux64( 5/ 8), 2.973: ~1 levels ~983040 states ~8466488 transitions
pins2lts-mc-linux64( 7/ 8), 4.318: ~1 levels ~1966080 states ~16100968 transitions
pins2lts-mc-linux64( 7/ 8), 6.994: ~1 levels ~3932160 states ~33259928 transitions
pins2lts-mc-linux64( 7/ 8), 12.559: ~1 levels ~7864320 states ~68267208 transitions
pins2lts-mc-linux64( 7/ 8), 24.088: ~1 levels ~15728640 states ~139585096 transitions
pins2lts-mc-linux64( 7/ 8), 48.355: ~1 levels ~31457280 states ~286770392 transitions
pins2lts-mc-linux64( 7/ 8), 99.008: ~1 levels ~62914560 states ~585135136 transitions
pins2lts-mc-linux64( 7/ 8), 210.847: ~1 levels ~125829120 states ~1190910200 transitions
pins2lts-mc-linux64( 2/ 8), 251.427: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 251.464:
pins2lts-mc-linux64( 0/ 8), 251.464: mean standard work distribution: 3.0% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 251.464:
pins2lts-mc-linux64( 0/ 8), 251.464: Explored 129285435 states 1287955813 transitions, fanout: 9.962
pins2lts-mc-linux64( 0/ 8), 251.464: Total exploration time 251.400 sec (251.340 sec minimum, 251.371 sec on average)
pins2lts-mc-linux64( 0/ 8), 251.464: States per second: 514262, Transitions per second: 5123134
pins2lts-mc-linux64( 0/ 8), 251.464:
pins2lts-mc-linux64( 0/ 8), 251.464: Progress states detected: 134217118
pins2lts-mc-linux64( 0/ 8), 251.464: Redundant explorations: -3.6745
pins2lts-mc-linux64( 0/ 8), 251.464:
pins2lts-mc-linux64( 0/ 8), 251.464: Queue width: 8B, total height: 10539003, memory: 80.41MB
pins2lts-mc-linux64( 0/ 8), 251.464: Tree memory: 1069.9MB, 8.4 B/state, compr.: 16.7%
pins2lts-mc-linux64( 0/ 8), 251.464: Tree fill ratio (roots/leafs): 99.0%/17.0%
pins2lts-mc-linux64( 0/ 8), 251.464: Stored 11 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 251.464: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 251.464: Est. total memory use: 1150.3MB (~1104.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5469887257872654458;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X([]((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5469887257872654458;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X([]((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 00:37:43] [INFO ] Flatten gal took : 2 ms
[2022-05-16 00:37:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality1740298145508702280.gal : 1 ms
[2022-05-16 00:37:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality3214977216462176270.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1740298145508702280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3214977216462176270.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !((G((X(G("(RKIPP_RP<3)")))||("(Raf1Star_RKIP_ERKPP<=RKIP)"))))
Formula 0 simplified : !G("(Raf1Star_RKIP_ERKPP<=RKIP)" | XG"(RKIPP_RP<3)")
Detected timeout of ITS tools.
[2022-05-16 00:58:37] [INFO ] Flatten gal took : 5 ms
[2022-05-16 00:58:37] [INFO ] Input system was already deterministic with 11 transitions.
[2022-05-16 00:58:37] [INFO ] Transformed 11 places.
[2022-05-16 00:58:37] [INFO ] Transformed 11 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 00:58:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality8348559488495921134.gal : 1 ms
[2022-05-16 00:58:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality7060020714301828765.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8348559488495921134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7060020714301828765.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((X(G("(RKIPP_RP<3)")))||("(Raf1Star_RKIP_ERKPP<=RKIP)"))))
Formula 0 simplified : !G("(Raf1Star_RKIP_ERKPP<=RKIP)" | XG"(RKIPP_RP<3)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ERK-PT-001000"
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-4028"
echo " Executing tool itstools"
echo " Input is ERK-PT-001000, 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 r078-tall-165260110200347"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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