Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 10:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 10:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 18:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 18:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.7K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620633004037

Running Version 0
[2021-05-10 07:50:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-10 07:50:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 07:50:05] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-10 07:50:05] [INFO ] Transformed 11 places.
[2021-05-10 07:50:05] [INFO ] Transformed 11 transitions.
[2021-05-10 07:50:05] [INFO ] Parsed PT model containing 11 places and 11 transitions in 56 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 07:50:05] [INFO ] Initial state test concluded for 3 properties.
FORMULA ERK-PT-100000-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-10 07:50:05] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-10 07:50:05] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:50:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 07:50:05] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:50:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 07:50:05] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/11 transitions.
[2021-05-10 07:50:05] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-10 07:50:05] [INFO ] Flatten gal took : 17 ms
FORMULA ERK-PT-100000-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 07:50:05] [INFO ] Flatten gal took : 4 ms
[2021-05-10 07:50:05] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=2272 ) properties (out of 9) seen :1
Running SMT prover for 8 properties.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:50:06] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2021-05-10 07:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-10 07:50:06] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 07:50:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 07:50:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2021-05-10 07:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 07:50:06] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-10 07:50:06] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 07:50:06] [INFO ] Added : 3 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-10 07:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 07:50:06] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 07:50:06] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-10 07:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-10 07:50:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 07:50:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2021-05-10 07:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 07:50:06] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-10 07:50:06] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 07:50:06] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-10 07:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 07:50:06] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 07:50:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 07:50:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-10 07:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 07:50:06] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-10 07:50:06] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-10 07:50:06] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-10 07:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 07:50:06] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 07:50:06] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-10 07:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-10 07:50:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 07:50:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-10 07:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 07:50:06] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-10 07:50:06] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 07:50:06] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-10 07:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-10 07:50:06] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-10 07:50:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 07:50:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-10 07:50:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 07:50:06] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-10 07:50:06] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 07:50:06] [INFO ] Added : 4 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-10 07:50:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 07:50:06] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-10 07:50:06] [INFO ] Computed and/alt/rep : 9/14/9 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-10 07:50:06] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||(G(p1)&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 11 places. Attempting structural reductions.
Starting structural reductions, 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 8 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 9 cols
[2021-05-10 07:50:06] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-10 07:50:06] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 10 rows 9 cols
[2021-05-10 07:50:06] [INFO ] Computed 4 place invariants in 15 ms
[2021-05-10 07:50:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-10 07:50:06] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-10 07:50:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 9 cols
[2021-05-10 07:50:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 07:50:06] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/11 places, 10/11 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ERK-PT-100000-00 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s5 1), p1:(GEQ s4 1), p2:(AND (OR (LT s0 1) (LT s1 1)) (OR (LT s6 1) (LT s7 1)) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5838 reset in 250 ms.
Stack based approach found an accepted trace after 10 steps with 1 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ERK-PT-100000-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-00 finished in 531 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-10 07:50:06] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 07:50:06] [INFO ] Implicit Places using invariants in 17 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 18 ms to find 3 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 07:50:06] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 07:50:06] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 07:50:06] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 07:50:06] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3015 reset in 119 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ERK-PT-100000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-03 finished in 217 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G((F(p1)&&F(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions, 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 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-10 07:50:07] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-10 07:50:07] [INFO ] Implicit Places using invariants in 14 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 14 ms to find 3 implicit places.
[2021-05-10 07:50:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 07:50:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 07:50:07] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, 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.
[2021-05-10 07:50:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 07:50:07] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 07:50:07] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ERK-PT-100000-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s1 1), p1:(GEQ s5 1), p2:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 121 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA ERK-PT-100000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-04 finished in 314 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-10 07:50:07] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 07:50:07] [INFO ] Implicit Places using invariants in 11 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 12 ms to find 3 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 07:50:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 07:50:07] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 07:50:07] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 07:50:07] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ERK-PT-100000-05 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GEQ s3 1) (GEQ s4 1)), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 37451 reset in 56 ms.
Product exploration explored 100000 steps with 37417 reset in 79 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 37506 reset in 58 ms.
Product exploration explored 100000 steps with 37484 reset in 70 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, 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 2 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 3 ms. Remains 7 /8 variables (removed 1) and now considering 10/11 (removed 1) transitions.
[2021-05-10 07:50:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 7 cols
[2021-05-10 07:50:08] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 07:50:08] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 10/11 transitions.
Product exploration explored 100000 steps with 37549 reset in 142 ms.
Product exploration explored 100000 steps with 37467 reset in 110 ms.
[2021-05-10 07:50:08] [INFO ] Flatten gal took : 2 ms
[2021-05-10 07:50:08] [INFO ] Flatten gal took : 2 ms
[2021-05-10 07:50:08] [INFO ] Time to serialize gal into /tmp/LTL10812610592461726186.gal : 1 ms
[2021-05-10 07:50:08] [INFO ] Time to serialize properties into /tmp/LTL9445409446750429732.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10812610592461726186.gal, -t, CGAL, -LTL, /tmp/LTL9445409446750429732.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10812610592461726186.gal -t CGAL -LTL /tmp/LTL9445409446750429732.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((MEKPP_ERK>=1)||(Raf1Star_RKIP_ERKPP>=1))"))||(X(X(F("(Raf1Star_RKIP>=1)"))))))
Formula 0 simplified : !(F"((MEKPP_ERK>=1)||(Raf1Star_RKIP_ERKPP>=1))" | XXF"(Raf1Star_RKIP>=1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 07:50:08] [INFO ] Flatten gal took : 1 ms
[2021-05-10 07:50:08] [INFO ] Applying decomposition
[2021-05-10 07:50:08] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16182313692074590549.txt, -o, /tmp/graph16182313692074590549.bin, -w, /tmp/graph16182313692074590549.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16182313692074590549.bin, -l, -1, -v, -w, /tmp/graph16182313692074590549.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 07:50:08] [INFO ] Decomposing Gal with order
[2021-05-10 07:50:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 07:50:08] [INFO ] Flatten gal took : 29 ms
[2021-05-10 07:50:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-10 07:50:08] [INFO ] Time to serialize gal into /tmp/LTL14512660740098265193.gal : 1 ms
[2021-05-10 07:50:08] [INFO ] Time to serialize properties into /tmp/LTL4812794675114991604.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14512660740098265193.gal, -t, CGAL, -LTL, /tmp/LTL4812794675114991604.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14512660740098265193.gal -t CGAL -LTL /tmp/LTL4812794675114991604.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("((i1.u2.MEKPP_ERK>=1)||(i1.u1.Raf1Star_RKIP_ERKPP>=1))"))||(X(X(F("(u0.Raf1Star_RKIP>=1)"))))))
Formula 0 simplified : !(F"((i1.u2.MEKPP_ERK>=1)||(i1.u1.Raf1Star_RKIP_ERKPP>=1))" | XXF"(u0.Raf1Star_RKIP>=1)")
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin7245940295858566980
[2021-05-10 07:50:08] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7245940295858566980
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7245940295858566980]
Compilation finished in 165 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7245940295858566980]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>((LTLAPp0==true))||X(X(<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7245940295858566980]
LTSmin run took 142 ms.
FORMULA ERK-PT-100000-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ERK-PT-100000-05 finished in 1465 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((p0 U X(p0)))||(!p1 U (!p2||G(!p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-10 07:50:08] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 07:50:08] [INFO ] Implicit Places using invariants in 10 ms returned [0, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:50:08] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 07:50:08] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:50:08] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 07:50:08] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0)), (AND (NOT p0) p2 p1), (AND p2 p1 (NOT p0)), (NOT p0), true, (NOT p0), (NOT p0), (AND p2 p1 (NOT p0)), (AND p2 p1)]
Running random walk in product with property : ERK-PT-100000-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 8}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 7}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=p0, acceptance={} source=4 dest: 6}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND p2 p1), acceptance={} source=8 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=9 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(GEQ s1 1), p1:(GEQ s5 1), p0:(AND (GEQ s6 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 35200 reset in 160 ms.
Product exploration explored 100000 steps with 35390 reset in 107 ms.
Knowledge obtained : [(NOT p2), (NOT p1), p0]
Stuttering acceptance computed with spot in 226 ms :[(AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0)), (AND (NOT p0) p2 p1), (AND p2 p1 (NOT p0)), (NOT p0), true, (NOT p0), (NOT p0), (AND p2 p1 (NOT p0)), (AND p2 p1)]
Product exploration explored 100000 steps with 35176 reset in 62 ms.
Product exploration explored 100000 steps with 35330 reset in 70 ms.
Applying partial POR strategy [false, false, false, true, false, true, false, true, false, true]
Stuttering acceptance computed with spot in 204 ms :[(AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0)), (AND (NOT p0) p2 p1), (AND p2 p1 (NOT p0)), (NOT p0), true, (NOT p0), (NOT p0), (AND p2 p1 (NOT p0)), (AND p2 p1)]
Support contains 4 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 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.
[2021-05-10 07:50:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:50:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 07:50:10] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 11/11 transitions.
Product exploration explored 100000 steps with 35260 reset in 63 ms.
Product exploration explored 100000 steps with 35399 reset in 71 ms.
[2021-05-10 07:50:10] [INFO ] Flatten gal took : 2 ms
[2021-05-10 07:50:10] [INFO ] Flatten gal took : 1 ms
[2021-05-10 07:50:10] [INFO ] Time to serialize gal into /tmp/LTL12055705999076061832.gal : 1 ms
[2021-05-10 07:50:10] [INFO ] Time to serialize properties into /tmp/LTL15212742321841391659.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12055705999076061832.gal, -t, CGAL, -LTL, /tmp/LTL15212742321841391659.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12055705999076061832.gal -t CGAL -LTL /tmp/LTL15212742321841391659.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(("((MEKPP>=1)&&(ERK>=1))")U(X("((MEKPP>=1)&&(ERK>=1))"))))||(("(RKIPP_RP<1)")U(("(Raf1Star_RKIP<1)")||(G("(RKIPP_RP<1)")))))))
Formula 0 simplified : !X(X("((MEKPP>=1)&&(ERK>=1))" U X"((MEKPP>=1)&&(ERK>=1))") | ("(RKIPP_RP<1)" U ("(Raf1Star_RKIP<1)" | G"(RKIPP_RP<1)")))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 07:50:10] [INFO ] Flatten gal took : 1 ms
[2021-05-10 07:50:10] [INFO ] Applying decomposition
[2021-05-10 07:50:10] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13642341793313540395.txt, -o, /tmp/graph13642341793313540395.bin, -w, /tmp/graph13642341793313540395.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13642341793313540395.bin, -l, -1, -v, -w, /tmp/graph13642341793313540395.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 07:50:10] [INFO ] Decomposing Gal with order
[2021-05-10 07:50:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 07:50:10] [INFO ] Flatten gal took : 2 ms
[2021-05-10 07:50:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 07:50:10] [INFO ] Time to serialize gal into /tmp/LTL9094491283776300075.gal : 1 ms
[2021-05-10 07:50:10] [INFO ] Time to serialize properties into /tmp/LTL7933255882271822460.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9094491283776300075.gal, -t, CGAL, -LTL, /tmp/LTL7933255882271822460.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9094491283776300075.gal -t CGAL -LTL /tmp/LTL7933255882271822460.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X(("((u2.MEKPP>=1)&&(u2.ERK>=1))")U(X("((u2.MEKPP>=1)&&(u2.ERK>=1))"))))||(("(u3.RKIPP_RP<1)")U(("(u0.Raf1Star_RKIP<1)")||(G("(u3.RKIPP_RP<1)")))))))
Formula 0 simplified : !X(X("((u2.MEKPP>=1)&&(u2.ERK>=1))" U X"((u2.MEKPP>=1)&&(u2.ERK>=1))") | ("(u3.RKIPP_RP<1)" U ("(u0.Raf1Star_RKIP<1)" | G"(u3.RKIPP_RP<1)")))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin7188580679561538995
[2021-05-10 07:50:10] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7188580679561538995
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7188580679561538995]
Compilation finished in 102 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7188580679561538995]
Link finished in 30 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X((X(((LTLAPp0==true) U X((LTLAPp0==true))))||((LTLAPp1==true) U ((LTLAPp2==true)||[]((LTLAPp1==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin7188580679561538995]
LTSmin run took 452 ms.
FORMULA ERK-PT-100000-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ERK-PT-100000-06 finished in 2106 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((F(p0)||X(F(!p1)))) U p2))], workingDir=/home/mcc/execution]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-10 07:50:11] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 07:50:11] [INFO ] Implicit Places using invariants in 10 ms returned [0, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:50:11] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 07:50:11] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:50:11] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 07:50:11] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ERK-PT-100000-07 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s2 1)), p0:(OR (LT s7 1) (LT s8 1)), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2981 reset in 78 ms.
Stack based approach found an accepted trace after 78 steps with 2 reset with depth 20 and stack size 19 in 0 ms.
FORMULA ERK-PT-100000-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-07 finished in 200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-10 07:50:11] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 07:50:11] [INFO ] Implicit Places using invariants in 10 ms returned [0, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:50:11] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:50:11] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:50:11] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:50:11] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, p0, p0]
Running random walk in product with property : ERK-PT-100000-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s7 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-10 finished in 99 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((!p0||G(p1))&&(p1||X(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-10 07:50:11] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-10 07:50:11] [INFO ] Implicit Places using invariants in 9 ms returned [0, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 9 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:50:11] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:50:11] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 11 rows 9 cols
[2021-05-10 07:50:11] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:50:11] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : ERK-PT-100000-11 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) p0) (AND p1 (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s2 1)), p0:(OR (LT s7 1) (LT s8 1)), p2:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 158 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 23 in 0 ms.
FORMULA ERK-PT-100000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-11 finished in 274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, 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
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 5 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 8 transition count 8
Applied a total of 7 rules in 3 ms. Remains 8 /11 variables (removed 3) and now considering 8/11 (removed 3) transitions.
[2021-05-10 07:50:11] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 8 cols
[2021-05-10 07:50:11] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 07:50:11] [INFO ] Implicit Places using invariants in 12 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
[2021-05-10 07:50:11] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 07:50:11] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 07:50:11] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 07:50:11] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 7/11 places, 8/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-10 07:50:11] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 07:50:11] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 07:50:11] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:50:11] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/11 places, 8/11 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : ERK-PT-100000-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, 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 138 ms.
Product exploration explored 100000 steps with 0 reset in 148 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 109 ms.
Product exploration explored 100000 steps with 0 reset in 122 ms.
[2021-05-10 07:50:12] [INFO ] Flatten gal took : 0 ms
[2021-05-10 07:50:12] [INFO ] Flatten gal took : 0 ms
[2021-05-10 07:50:12] [INFO ] Time to serialize gal into /tmp/LTL18294150848570235876.gal : 0 ms
[2021-05-10 07:50:12] [INFO ] Time to serialize properties into /tmp/LTL15145138344002475251.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18294150848570235876.gal, -t, CGAL, -LTL, /tmp/LTL15145138344002475251.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18294150848570235876.gal -t CGAL -LTL /tmp/LTL15145138344002475251.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("((MEKPP>=1)&&(ERK>=1))"))))
Formula 0 simplified : !FG"((MEKPP>=1)&&(ERK>=1))"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 07:50:12] [INFO ] Flatten gal took : 1 ms
[2021-05-10 07:50:12] [INFO ] Applying decomposition
[2021-05-10 07:50:12] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12887825238541235619.txt, -o, /tmp/graph12887825238541235619.bin, -w, /tmp/graph12887825238541235619.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12887825238541235619.bin, -l, -1, -v, -w, /tmp/graph12887825238541235619.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 07:50:12] [INFO ] Decomposing Gal with order
[2021-05-10 07:50:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 07:50:12] [INFO ] Flatten gal took : 1 ms
[2021-05-10 07:50:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 07:50:12] [INFO ] Time to serialize gal into /tmp/LTL18400155563020058257.gal : 0 ms
[2021-05-10 07:50:12] [INFO ] Time to serialize properties into /tmp/LTL3278294734734824356.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18400155563020058257.gal, -t, CGAL, -LTL, /tmp/LTL3278294734734824356.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18400155563020058257.gal -t CGAL -LTL /tmp/LTL3278294734734824356.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("((u0.MEKPP>=1)&&(u0.ERK>=1))"))))
Formula 0 simplified : !FG"((u0.MEKPP>=1)&&(u0.ERK>=1))"
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin4930035879560687522
[2021-05-10 07:50:12] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4930035879560687522
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4930035879560687522]
Compilation finished in 92 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4930035879560687522]
Link finished in 30 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4930035879560687522]
LTSmin run took 966 ms.
FORMULA ERK-PT-100000-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ERK-PT-100000-12 finished in 1767 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 8 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 6 transition count 7
Applied a total of 9 rules in 2 ms. Remains 6 /11 variables (removed 5) and now considering 7/11 (removed 4) transitions.
[2021-05-10 07:50:13] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 07:50:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:50:13] [INFO ] Implicit Places using invariants in 11 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 11 ms to find 1 implicit places.
[2021-05-10 07:50:13] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 07:50:13] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 5 cols
[2021-05-10 07:50:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 07:50:13] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 5/11 places, 7/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-10 07:50:13] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 07:50:13] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 5 cols
[2021-05-10 07:50:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 07:50:13] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 5/11 places, 7/11 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-13 automaton TGBA [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:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-13 finished in 93 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||X(X(X(G(!p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-10 07:50:13] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-10 07:50:13] [INFO ] Implicit Places using invariants in 10 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 11 ms to find 3 implicit places.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 07:50:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 07:50:13] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 11 rows 8 cols
[2021-05-10 07:50:13] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 07:50:13] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 2 iterations. Remains : 8/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p1), p0, (AND (NOT p1) p0), p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ERK-PT-100000-14 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 3}]], initial=6, aps=[p1:(GEQ s1 1), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-14 finished in 220 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)||G((p0 U p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-10 07:50:13] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 07:50:13] [INFO ] Implicit Places using invariants in 8 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 8 ms to find 1 implicit places.
[2021-05-10 07:50:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 8 cols
[2021-05-10 07:50:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:50:13] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 8/11 places, 10/11 transitions.
Graph (trivial) has 4 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 1 ms. Remains 7 /8 variables (removed 1) and now considering 9/10 (removed 1) transitions.
[2021-05-10 07:50:13] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 7 cols
[2021-05-10 07:50:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:50:13] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-10 07:50:13] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 7 cols
[2021-05-10 07:50:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 07:50:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-10 07:50:13] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/11 places, 9/11 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ERK-PT-100000-15 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s3 1), p1:(AND (GEQ s4 1) (GEQ s5 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 126 ms.
Product exploration explored 100000 steps with 0 reset in 274 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 50 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 108 ms.
Product exploration explored 100000 steps with 0 reset in 126 ms.
[2021-05-10 07:50:14] [INFO ] Flatten gal took : 1 ms
[2021-05-10 07:50:14] [INFO ] Flatten gal took : 1 ms
[2021-05-10 07:50:14] [INFO ] Time to serialize gal into /tmp/LTL3694707272561985855.gal : 1 ms
[2021-05-10 07:50:14] [INFO ] Time to serialize properties into /tmp/LTL9537634656888632580.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3694707272561985855.gal, -t, CGAL, -LTL, /tmp/LTL9537634656888632580.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3694707272561985855.gal -t CGAL -LTL /tmp/LTL9537634656888632580.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(Raf1Star_RKIP_ERKPP<1)"))||(G(("(Raf1Star_RKIP_ERKPP>=1)")U("((MEKPP>=1)&&(ERK>=1))"))))))
Formula 0 simplified : !F(G"(Raf1Star_RKIP_ERKPP<1)" | G("(Raf1Star_RKIP_ERKPP>=1)" U "((MEKPP>=1)&&(ERK>=1))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2021-05-10 07:50:14] [INFO ] Flatten gal took : 1 ms
[2021-05-10 07:50:14] [INFO ] Applying decomposition
[2021-05-10 07:50:14] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph443044711362660277.txt, -o, /tmp/graph443044711362660277.bin, -w, /tmp/graph443044711362660277.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph443044711362660277.bin, -l, -1, -v, -w, /tmp/graph443044711362660277.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 07:50:14] [INFO ] Decomposing Gal with order
[2021-05-10 07:50:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 07:50:14] [INFO ] Flatten gal took : 1 ms
[2021-05-10 07:50:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-10 07:50:14] [INFO ] Time to serialize gal into /tmp/LTL62630859740973801.gal : 1 ms
[2021-05-10 07:50:14] [INFO ] Time to serialize properties into /tmp/LTL1203620519526085145.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL62630859740973801.gal, -t, CGAL, -LTL, /tmp/LTL1203620519526085145.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL62630859740973801.gal -t CGAL -LTL /tmp/LTL1203620519526085145.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("(u0.Raf1Star_RKIP_ERKPP<1)"))||(G(("(u0.Raf1Star_RKIP_ERKPP>=1)")U("((u1.MEKPP>=1)&&(u1.ERK>=1))"))))))
Formula 0 simplified : !F(G"(u0.Raf1Star_RKIP_ERKPP<1)" | G("(u0.Raf1Star_RKIP_ERKPP>=1)" U "((u1.MEKPP>=1)&&(u1.ERK>=1))"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin15543360078190679672
[2021-05-10 07:50:14] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15543360078190679672
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15543360078190679672]
Compilation finished in 93 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15543360078190679672]
Link finished in 30 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(([]((LTLAPp0==true))||[]((!(LTLAPp0==true) U (LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15543360078190679672]
LTSmin run took 1201 ms.
FORMULA ERK-PT-100000-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ERK-PT-100000-15 finished in 2230 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620633016827

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ERK-PT-100000.tgz
mv ERK-PT-100000 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;