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.r132-tall-165271821100619.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 MAPK-PT-05120, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821100619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 7.1K Apr 29 19:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 19:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 19:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 29 19:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 25K May 10 09:34 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 MAPK-PT-05120-LTLCardinality-00
FORMULA_NAME MAPK-PT-05120-LTLCardinality-01
FORMULA_NAME MAPK-PT-05120-LTLCardinality-02
FORMULA_NAME MAPK-PT-05120-LTLCardinality-03
FORMULA_NAME MAPK-PT-05120-LTLCardinality-04
FORMULA_NAME MAPK-PT-05120-LTLCardinality-05
FORMULA_NAME MAPK-PT-05120-LTLCardinality-06
FORMULA_NAME MAPK-PT-05120-LTLCardinality-07
FORMULA_NAME MAPK-PT-05120-LTLCardinality-08
FORMULA_NAME MAPK-PT-05120-LTLCardinality-09
FORMULA_NAME MAPK-PT-05120-LTLCardinality-10
FORMULA_NAME MAPK-PT-05120-LTLCardinality-11
FORMULA_NAME MAPK-PT-05120-LTLCardinality-12
FORMULA_NAME MAPK-PT-05120-LTLCardinality-13
FORMULA_NAME MAPK-PT-05120-LTLCardinality-14
FORMULA_NAME MAPK-PT-05120-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652818604746

Running Version 202205111006
[2022-05-17 20:16:45] [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-17 20:16:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 20:16:45] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2022-05-17 20:16:46] [INFO ] Transformed 22 places.
[2022-05-17 20:16:46] [INFO ] Transformed 30 transitions.
[2022-05-17 20:16:46] [INFO ] Parsed PT model containing 22 places and 30 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MAPK-PT-05120-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 10 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:16:46] [INFO ] Computed 7 place invariants in 8 ms
[2022-05-17 20:16:46] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:16:46] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 20:16:46] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:16:46] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 20:16:46] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 30/30 transitions.
Support contains 21 out of 22 places after structural reductions.
[2022-05-17 20:16:46] [INFO ] Flatten gal took : 17 ms
[2022-05-17 20:16:46] [INFO ] Flatten gal took : 6 ms
[2022-05-17 20:16:46] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10250 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=427 ) properties (out of 28) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 22) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:16:46] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 20:16:46] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 20:16:46] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-17 20:16:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 20:16:46] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2022-05-17 20:16:46] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-17 20:16:47] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 14 Parikh solutions to 12 different solutions.
Finished Parikh walk after 19264 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=1070 )
Parikh walk visited 13 properties in 4395 ms.
FORMULA MAPK-PT-05120-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA MAPK-PT-05120-LTLCardinality-05 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)&&p1)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:16:51] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 20:16:51] [INFO ] Implicit Places using invariants in 28 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s15), p0:(GT s8 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3292 reset in 209 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA MAPK-PT-05120-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-00 finished in 510 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(G(p0)))||(F(G(F(p1)))&&p2))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:16:52] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-17 20:16:52] [INFO ] Implicit Places using invariants in 33 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(GT 2 s0), p0:(LEQ 2 s1), p1:(GT 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1113 reset in 137 ms.
Stack based approach found an accepted trace after 507 steps with 4 reset with depth 84 and stack size 69 in 1 ms.
FORMULA MAPK-PT-05120-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-01 finished in 420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(!(G(p0) U G((G(p1) U p2))))&&X(p0))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:16:52] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 20:16:52] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:16:52] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-17 20:16:52] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:16:52] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 20:16:52] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (AND p2 p1)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s18 s1), p2:(LEQ 1 s15), p1:(LEQ s9 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 206 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-03 finished in 577 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 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 22 transition count 29
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 20 transition count 29
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 19 place count 11 transition count 22
Graph (trivial) has 8 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 21 place count 9 transition count 22
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 24 place count 9 transition count 19
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 32 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 8 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 1 with 2 rules applied. Total rules applied 36 place count 7 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 6 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 6 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 4 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 4 transition count 5
Applied a total of 43 rules in 114 ms. Remains 4 /22 variables (removed 18) and now considering 5/30 (removed 25) transitions.
// Phase 1: matrix 5 rows 4 cols
[2022-05-17 20:16:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 20:16:53] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-17 20:16:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 20:16:53] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2022-05-17 20:16:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-17 20:16:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 20:16:53] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/22 places, 5/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/22 places, 5/30 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-04 finished in 283 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G((F(p1)||p2))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:16:53] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 20:16:53] [INFO ] Implicit Places using invariants in 35 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GT 3 s6), p1:(GT 3 s8), p0:(AND (LEQ 3 s8) (LEQ s9 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Product exploration explored 100000 steps with 50000 reset in 76 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 p2 (NOT p1) p0), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 161 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA MAPK-PT-05120-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MAPK-PT-05120-LTLCardinality-06 finished in 564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(!(p1 U F(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:16:54] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 20:16:54] [INFO ] Implicit Places using invariants in 33 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (AND (NOT p0) p1), p1, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ s3 s19), p1:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-07 finished in 188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:16:54] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 20:16:54] [INFO ] Implicit Places using invariants in 24 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s4 s18)], 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 152 ms.
Product exploration explored 100000 steps with 0 reset in 206 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10250 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1281 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2688029 steps, run timeout after 3001 ms. (steps per millisecond=895 ) properties seen :{}
Probabilistic random walk after 2688029 steps, saw 1759449 distinct states, run finished after 3001 ms. (steps per millisecond=895 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 20 cols
[2022-05-17 20:16:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 20:16:57] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:16:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-17 20:16:58] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:16:58] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 20:16:58] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 30/30 transitions.
Graph (trivial) has 9 edges and 20 vertex of which 6 / 20 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 12 place count 11 transition count 19
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 17 place count 11 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 11 transition count 13
Applied a total of 18 rules in 5 ms. Remains 11 /20 variables (removed 9) and now considering 13/30 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/20 places, 13/30 transitions.
Incomplete random walk after 10249 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2562 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3116279 steps, run timeout after 3001 ms. (steps per millisecond=1038 ) properties seen :{}
Probabilistic random walk after 3116279 steps, saw 1888271 distinct states, run finished after 3001 ms. (steps per millisecond=1038 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:17:01] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:17:01] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:17:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 20:17:01] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:17:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 20:17:01] [INFO ] After 4ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 20:17:01] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 20:17:01] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 11/11 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 13/13 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 11/11 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:17:01] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 20:17:01] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:17:01] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 20:17:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 20:17:01] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-17 20:17:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:17:01] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:17:01] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 13/13 transitions.
Graph (trivial) has 8 edges and 11 vertex of which 5 / 11 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 9 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
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 7 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 4 transition count 4
Applied a total of 8 rules in 134 ms. Remains 4 /11 variables (removed 7) and now considering 4/13 (removed 9) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 20:17:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 20:17:01] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:17:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-17 20:17:01] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:17:01] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 20:17:01] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 20:17:01] [INFO ] Flatten gal took : 1 ms
[2022-05-17 20:17:01] [INFO ] Flatten gal took : 1 ms
[2022-05-17 20:17:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12691689011661930071.gal : 1 ms
[2022-05-17 20:17:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8104079311314266391.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12891378972069086554;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12691689011661930071.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8104079311314266391.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8104079311314266391.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2058,5.8025,92672,2,2062,15,14430,6,0,23,10287,0
Total reachable state count : 2058

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,777,5.80406,92672,2,781,15,14430,7,0,804,10287,0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 20 cols
[2022-05-17 20:17:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 20:17:07] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 30 rows 20 cols
[2022-05-17 20:17:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 20:17:07] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2022-05-17 20:17:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 20:17:07] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 30/30 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10250 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2895708 steps, run timeout after 3001 ms. (steps per millisecond=964 ) properties seen :{}
Probabilistic random walk after 2895708 steps, saw 1884773 distinct states, run finished after 3001 ms. (steps per millisecond=964 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 20 cols
[2022-05-17 20:17:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 20:17:10] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:17:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-17 20:17:10] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:17:10] [INFO ] After 12ms 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-17 20:17:10] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 20/20 places, 30/30 transitions.
Graph (trivial) has 9 edges and 20 vertex of which 6 / 20 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 12 place count 11 transition count 19
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 17 place count 11 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 11 transition count 13
Applied a total of 18 rules in 2 ms. Remains 11 /20 variables (removed 9) and now considering 13/30 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/20 places, 13/30 transitions.
Incomplete random walk after 10249 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3083310 steps, run timeout after 3001 ms. (steps per millisecond=1027 ) properties seen :{}
Probabilistic random walk after 3083310 steps, saw 1868522 distinct states, run finished after 3001 ms. (steps per millisecond=1027 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:17:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 20:17:14] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:17:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 20:17:14] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:17:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 20:17:14] [INFO ] After 2ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 20:17:14] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 20:17:14] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 11/11 places, 13/13 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 13/13 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 11/11 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:17:14] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:17:14] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:17:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 20:17:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 20:17:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-17 20:17:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:17:14] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:17:14] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 13/13 transitions.
Graph (trivial) has 8 edges and 11 vertex of which 5 / 11 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 9 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
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 7 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 4 transition count 4
Applied a total of 8 rules in 116 ms. Remains 4 /11 variables (removed 7) and now considering 4/13 (removed 9) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 20:17:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 20:17:14] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:17:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 20:17:14] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:17:14] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 20:17:14] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 20:17:14] [INFO ] Flatten gal took : 1 ms
[2022-05-17 20:17:14] [INFO ] Flatten gal took : 1 ms
[2022-05-17 20:17:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15831043707959273095.gal : 1 ms
[2022-05-17 20:17:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6637609379365423952.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11839662331190841650;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15831043707959273095.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6637609379365423952.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality6637609379365423952.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2058,5.8115,92872,2,2062,15,14430,6,0,23,10287,0
Total reachable state count : 2058

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,777,5.81308,92872,2,781,15,14430,7,0,804,10287,0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 161 ms.
Product exploration explored 100000 steps with 0 reset in 184 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 30/30 transitions.
Graph (trivial) has 9 edges and 20 vertex of which 6 / 20 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 17 transition count 32
Deduced a syphon composed of 5 places in 0 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 15 place count 17 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 16 transition count 22
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 16 transition count 22
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 17 rules in 7 ms. Remains 16 /20 variables (removed 4) and now considering 22/30 (removed 8) transitions.
[2022-05-17 20:17:21] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 20:17:21] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 16 cols
[2022-05-17 20:17:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 20:17:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/20 places, 22/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/20 places, 22/30 transitions.
Product exploration explored 100000 steps with 0 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 132 ms.
Built C files in :
/tmp/ltsmin17949162597748574016
[2022-05-17 20:17:21] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17949162597748574016
Running compilation step : cd /tmp/ltsmin17949162597748574016;'/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 169 ms.
Running link step : cd /tmp/ltsmin17949162597748574016;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17949162597748574016;'/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/stateBased12651742955213869914.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 20 cols
[2022-05-17 20:17:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 20:17:36] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 30 rows 20 cols
[2022-05-17 20:17:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 20:17:36] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2022-05-17 20:17:36] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 20:17:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 30/30 transitions.
Built C files in :
/tmp/ltsmin1786000087451860270
[2022-05-17 20:17:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1786000087451860270
Running compilation step : cd /tmp/ltsmin1786000087451860270;'/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 92 ms.
Running link step : cd /tmp/ltsmin1786000087451860270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1786000087451860270;'/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/stateBased11416900028246465449.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 20:17:51] [INFO ] Flatten gal took : 3 ms
[2022-05-17 20:17:51] [INFO ] Flatten gal took : 2 ms
[2022-05-17 20:17:51] [INFO ] Time to serialize gal into /tmp/LTL9189807759146488846.gal : 7 ms
[2022-05-17 20:17:51] [INFO ] Time to serialize properties into /tmp/LTL7475366142222784465.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/LTL9189807759146488846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7475366142222784465.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/LTL9189807...266
Read 1 LTL properties
Checking formula 0 : !((X(G("(ERKPP_Phase3<=RasGTP)"))))
Formula 0 simplified : !XG"(ERKPP_Phase3<=RasGTP)"
Detected timeout of ITS tools.
[2022-05-17 20:18:06] [INFO ] Flatten gal took : 16 ms
[2022-05-17 20:18:06] [INFO ] Applying decomposition
[2022-05-17 20:18:06] [INFO ] Flatten gal took : 4 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/graph15830691321059991756.txt' '-o' '/tmp/graph15830691321059991756.bin' '-w' '/tmp/graph15830691321059991756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15830691321059991756.bin' '-l' '-1' '-v' '-w' '/tmp/graph15830691321059991756.weights' '-q' '0' '-e' '0.001'
[2022-05-17 20:18:06] [INFO ] Decomposing Gal with order
[2022-05-17 20:18:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 20:18:06] [INFO ] Removed a total of 11 redundant transitions.
[2022-05-17 20:18:06] [INFO ] Flatten gal took : 26 ms
[2022-05-17 20:18:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2022-05-17 20:18:07] [INFO ] Time to serialize gal into /tmp/LTL2876817156763758766.gal : 1 ms
[2022-05-17 20:18:07] [INFO ] Time to serialize properties into /tmp/LTL287153583423760741.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/LTL2876817156763758766.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL287153583423760741.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/LTL2876817...265
Read 1 LTL properties
Checking formula 0 : !((X(G("(gu1.ERKPP_Phase3<=gu1.RasGTP)"))))
Formula 0 simplified : !XG"(gu1.ERKPP_Phase3<=gu1.RasGTP)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13830997171298528817
[2022-05-17 20:18:22] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13830997171298528817
Running compilation step : cd /tmp/ltsmin13830997171298528817;'/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 90 ms.
Running link step : cd /tmp/ltsmin13830997171298528817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin13830997171298528817;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property MAPK-PT-05120-LTLCardinality-08 finished in 102885 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||G(F((G(X(p1))||p2))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 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 22 transition count 29
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 20 transition count 29
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 17 place count 12 transition count 23
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 12 transition count 19
Applied a total of 21 rules in 4 ms. Remains 12 /22 variables (removed 10) and now considering 19/30 (removed 11) transitions.
[2022-05-17 20:18:37] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 12 cols
[2022-05-17 20:18:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 20:18:37] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-05-17 20:18:37] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 12 cols
[2022-05-17 20:18:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 20:18:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 20:18:37] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-17 20:18:37] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 20:18:37] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 12 cols
[2022-05-17 20:18:37] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:18:37] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/22 places, 19/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/22 places, 19/30 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ s0 s8) (LEQ 1 s6)), p1:(GT 1 s6), p2:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-09 finished in 228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(p1)||G(p2))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:18:37] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 20:18:37] [INFO ] Implicit Places using invariants in 32 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 3 s17), p2:(LEQ s7 s9), p1:(OR (LEQ 2 s1) (GT s7 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 75 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-05120-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-11 finished in 243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:18:37] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 20:18:37] [INFO ] Implicit Places using invariants in 34 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT s6 s14), p0:(GT s8 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Product exploration explored 100000 steps with 0 reset in 205 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10250 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2050 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 421899 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :{}
Probabilistic random walk after 421899 steps, saw 272723 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 20:18:41] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 20:18:41] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 20:18:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-17 20:18:41] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 20:18:41] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-17 20:18:41] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 21/21 places, 30/30 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 21 transition count 29
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 19 transition count 29
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 19 transition count 28
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 11 place count 15 transition count 25
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 2 edges and 15 vertex of which 2 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 15 place count 14 transition count 22
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 13 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 12 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 12 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 12 transition count 17
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 23 place count 11 transition count 16
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 11 transition count 16
Applied a total of 24 rules in 61 ms. Remains 11 /21 variables (removed 10) and now considering 16/30 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/21 places, 16/30 transitions.
Incomplete random walk after 10246 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5123 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 11 cols
[2022-05-17 20:18:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 20:18:41] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:18:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 20:18:41] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:18:41] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 20:18:41] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 10249 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=1138 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 240 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 20:18:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 20:18:42] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 20:18:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 20:18:42] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 20:18:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 20:18:42] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 30/30 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 219 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10250 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2050 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 419532 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 419532 steps, saw 271447 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 20:18:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 20:18:45] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 20:18:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-05-17 20:18:45] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-17 20:18:45] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-17 20:18:45] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 21/21 places, 30/30 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 21 transition count 29
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 19 transition count 29
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 19 transition count 28
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 11 place count 15 transition count 25
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 2 edges and 15 vertex of which 2 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 15 place count 14 transition count 22
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 13 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 12 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 21 place count 12 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 12 transition count 17
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 23 place count 11 transition count 16
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 11 transition count 16
Applied a total of 24 rules in 55 ms. Remains 11 /21 variables (removed 10) and now considering 16/30 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/21 places, 16/30 transitions.
Incomplete random walk after 10246 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5123 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 11 cols
[2022-05-17 20:18:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 20:18:46] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:18:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 20:18:46] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:18:46] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 20:18:46] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 10249 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=1138 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 256 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 173 ms.
Product exploration explored 100000 steps with 0 reset in 192 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 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 21 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 31
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 21 transition count 34
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 21 transition count 30
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 8 rules in 9 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2022-05-17 20:18:47] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 20:18:47] [INFO ] Flow matrix only has 27 transitions (discarded 3 similar events)
// Phase 1: matrix 27 rows 21 cols
[2022-05-17 20:18:47] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 20:18:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/21 places, 30/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 30/30 transitions.
Product exploration explored 100000 steps with 0 reset in 173 ms.
Product exploration explored 100000 steps with 0 reset in 158 ms.
Built C files in :
/tmp/ltsmin16494610848309108746
[2022-05-17 20:18:47] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16494610848309108746
Running compilation step : cd /tmp/ltsmin16494610848309108746;'/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 99 ms.
Running link step : cd /tmp/ltsmin16494610848309108746;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16494610848309108746;'/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/stateBased3552919477370236578.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 20:19:02] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-17 20:19:02] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 20:19:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 20:19:02] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2022-05-17 20:19:02] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-17 20:19:02] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 30/30 transitions.
Built C files in :
/tmp/ltsmin18076776859751794502
[2022-05-17 20:19:02] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18076776859751794502
Running compilation step : cd /tmp/ltsmin18076776859751794502;'/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 89 ms.
Running link step : cd /tmp/ltsmin18076776859751794502;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18076776859751794502;'/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/stateBased4860805585620542729.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 20:19:17] [INFO ] Flatten gal took : 5 ms
[2022-05-17 20:19:17] [INFO ] Flatten gal took : 2 ms
[2022-05-17 20:19:17] [INFO ] Time to serialize gal into /tmp/LTL6017881717677847950.gal : 1 ms
[2022-05-17 20:19:17] [INFO ] Time to serialize properties into /tmp/LTL9628982150650260889.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/LTL6017881717677847950.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9628982150650260889.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/LTL6017881...266
Read 1 LTL properties
Checking formula 0 : !(((X(G("(Phase2>ERKPP)")))||(F("(ERKP>ERK)"))))
Formula 0 simplified : !(XG"(Phase2>ERKPP)" | F"(ERKP>ERK)")
Detected timeout of ITS tools.
[2022-05-17 20:19:32] [INFO ] Flatten gal took : 5 ms
[2022-05-17 20:19:32] [INFO ] Applying decomposition
[2022-05-17 20:19:32] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18318261849542638516.txt' '-o' '/tmp/graph18318261849542638516.bin' '-w' '/tmp/graph18318261849542638516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18318261849542638516.bin' '-l' '-1' '-v' '-w' '/tmp/graph18318261849542638516.weights' '-q' '0' '-e' '0.001'
[2022-05-17 20:19:32] [INFO ] Decomposing Gal with order
[2022-05-17 20:19:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 20:19:32] [INFO ] Removed a total of 10 redundant transitions.
[2022-05-17 20:19:32] [INFO ] Flatten gal took : 3 ms
[2022-05-17 20:19:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 1 ms.
[2022-05-17 20:19:32] [INFO ] Time to serialize gal into /tmp/LTL11115782741533009888.gal : 1 ms
[2022-05-17 20:19:32] [INFO ] Time to serialize properties into /tmp/LTL14393913659459254498.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/LTL11115782741533009888.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14393913659459254498.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/LTL1111578...268
Read 1 LTL properties
Checking formula 0 : !(((X(G("(gu2.Phase2>gu2.ERKPP)")))||(F("(gu3.ERKP>gu3.ERK)"))))
Formula 0 simplified : !(XG"(gu2.Phase2>gu2.ERKPP)" | F"(gu3.ERKP>gu3.ERK)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5814090578183372513
[2022-05-17 20:19:48] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5814090578183372513
Running compilation step : cd /tmp/ltsmin5814090578183372513;'/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 91 ms.
Running link step : cd /tmp/ltsmin5814090578183372513;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5814090578183372513;'/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 MAPK-PT-05120-LTLCardinality-13 finished in 85513 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 20:20:03] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 20:20:03] [INFO ] Implicit Places using invariants in 32 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ s0 s8) (LEQ s13 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 152 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-14 finished in 281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a SL insensitive property : MAPK-PT-05120-LTLCardinality-08
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 12 transition count 22
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 12 transition count 18
Applied a total of 22 rules in 7 ms. Remains 12 /22 variables (removed 10) and now considering 18/30 (removed 12) transitions.
[2022-05-17 20:20:03] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 12 cols
[2022-05-17 20:20:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 20:20:03] [INFO ] Implicit Places using invariants in 25 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 11/22 places, 18/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 11/22 places, 18/30 transitions.
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s1 s9)], 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 94 ms.
Product exploration explored 100000 steps with 0 reset in 104 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10250 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1281 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3865974 steps, run timeout after 3001 ms. (steps per millisecond=1288 ) properties seen :{}
Probabilistic random walk after 3865974 steps, saw 1463105 distinct states, run finished after 3001 ms. (steps per millisecond=1288 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 20:20:07] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 11 cols
[2022-05-17 20:20:07] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:07] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:20:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 20:20:07] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:20:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 20:20:07] [INFO ] After 2ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 20:20:07] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 20:20:07] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 11/11 places, 18/18 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 11 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 11 transition count 13
Applied a total of 5 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 13/18 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 13/18 transitions.
Incomplete random walk after 10249 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3387809 steps, run timeout after 3001 ms. (steps per millisecond=1128 ) properties seen :{}
Probabilistic random walk after 3387809 steps, saw 1431544 distinct states, run finished after 3001 ms. (steps per millisecond=1128 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:20:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:10] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:20:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 20:20:10] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:20:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 20:20:10] [INFO ] After 2ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 20:20:10] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 20:20:10] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 11/11 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 13/13 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 11/11 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:20:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:10] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:20:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 20:20:10] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-17 20:20:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:20:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:10] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 13/13 transitions.
Graph (trivial) has 8 edges and 11 vertex of which 5 / 11 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 9 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
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 7 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 4 transition count 4
Applied a total of 8 rules in 114 ms. Remains 4 /11 variables (removed 7) and now considering 4/13 (removed 9) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 20:20:10] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 20:20:10] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:20:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 20:20:10] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:20:10] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 20:20:10] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 20:20:10] [INFO ] Flatten gal took : 1 ms
[2022-05-17 20:20:10] [INFO ] Flatten gal took : 1 ms
[2022-05-17 20:20:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5290090591570960358.gal : 1 ms
[2022-05-17 20:20:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6619261904730470021.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15656373992880716963;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5290090591570960358.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6619261904730470021.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6619261904730470021.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2058,6.01642,92868,2,2062,15,14430,6,0,23,10287,0
Total reachable state count : 2058

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,777,6.01941,92868,2,781,15,14430,7,0,804,10287,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2022-05-17 20:20:16] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 11 cols
[2022-05-17 20:20:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:16] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-17 20:20:16] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 11 cols
[2022-05-17 20:20:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 20:20:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 20:20:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-17 20:20:16] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 11 cols
[2022-05-17 20:20:16] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:16] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 18/18 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10250 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3711686 steps, run timeout after 3001 ms. (steps per millisecond=1236 ) properties seen :{}
Probabilistic random walk after 3711686 steps, saw 1404656 distinct states, run finished after 3001 ms. (steps per millisecond=1236 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 20:20:20] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 11 cols
[2022-05-17 20:20:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:20] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:20:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 20:20:20] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:20:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 20:20:20] [INFO ] After 3ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 20:20:20] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 20:20:20] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 11/11 places, 18/18 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 11 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 11 transition count 13
Applied a total of 5 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 13/18 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 13/18 transitions.
Incomplete random walk after 10251 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3088288 steps, run timeout after 3001 ms. (steps per millisecond=1029 ) properties seen :{}
Probabilistic random walk after 3088288 steps, saw 1304775 distinct states, run finished after 3001 ms. (steps per millisecond=1029 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:20:23] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:23] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:20:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 20:20:23] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:20:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 20:20:23] [INFO ] After 2ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 20:20:23] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 20:20:23] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 11/11 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 13/13 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 13/13 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 11/11 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 13/13 (removed 0) transitions.
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:20:23] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:23] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:20:23] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 20:20:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 20:20:23] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-17 20:20:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 11 cols
[2022-05-17 20:20:23] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:23] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 13/13 transitions.
Graph (trivial) has 8 edges and 11 vertex of which 5 / 11 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 9 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 5 transition count 6
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 7 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 4 transition count 4
Applied a total of 8 rules in 114 ms. Remains 4 /11 variables (removed 7) and now considering 4/13 (removed 9) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 20:20:23] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 20:20:23] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:20:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-17 20:20:23] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:20:23] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 20:20:23] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 20:20:23] [INFO ] Flatten gal took : 1 ms
[2022-05-17 20:20:23] [INFO ] Flatten gal took : 2 ms
[2022-05-17 20:20:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18174863885870538877.gal : 0 ms
[2022-05-17 20:20:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8833312760495204200.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1883550020522897057;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18174863885870538877.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8833312760495204200.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8833312760495204200.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2058,5.99647,92872,2,2062,15,14430,6,0,23,10287,0
Total reachable state count : 2058

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,777,5.99823,92872,2,781,15,14430,7,0,804,10287,0
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 95 ms.
Product exploration explored 100000 steps with 0 reset in 107 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 18/18 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 17
Applied a total of 1 rules in 4 ms. Remains 11 /11 variables (removed 0) and now considering 17/18 (removed 1) transitions.
[2022-05-17 20:20:30] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 20:20:30] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
// Phase 1: matrix 14 rows 11 cols
[2022-05-17 20:20:30] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:30] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/11 places, 17/18 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 17/18 transitions.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Product exploration explored 100000 steps with 0 reset in 113 ms.
Built C files in :
/tmp/ltsmin8292404383694247495
[2022-05-17 20:20:30] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8292404383694247495
Running compilation step : cd /tmp/ltsmin8292404383694247495;'/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 83 ms.
Running link step : cd /tmp/ltsmin8292404383694247495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8292404383694247495;'/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/stateBased13665653570762173350.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2022-05-17 20:20:45] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 11 cols
[2022-05-17 20:20:45] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:45] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-17 20:20:45] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 11 cols
[2022-05-17 20:20:45] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-17 20:20:45] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2022-05-17 20:20:45] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 11 cols
[2022-05-17 20:20:45] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:20:45] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin162504480083788012
[2022-05-17 20:20:45] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin162504480083788012
Running compilation step : cd /tmp/ltsmin162504480083788012;'/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 75 ms.
Running link step : cd /tmp/ltsmin162504480083788012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin162504480083788012;'/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/stateBased11560198397865812304.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 20:21:00] [INFO ] Flatten gal took : 1 ms
[2022-05-17 20:21:00] [INFO ] Flatten gal took : 1 ms
[2022-05-17 20:21:00] [INFO ] Time to serialize gal into /tmp/LTL1799810520843286566.gal : 1 ms
[2022-05-17 20:21:00] [INFO ] Time to serialize properties into /tmp/LTL10473116132743825141.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/LTL1799810520843286566.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10473116132743825141.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/LTL1799810...267
Read 1 LTL properties
Checking formula 0 : !((X(G("(ERKPP_Phase3<=RasGTP)"))))
Formula 0 simplified : !XG"(ERKPP_Phase3<=RasGTP)"
Detected timeout of ITS tools.
[2022-05-17 20:21:15] [INFO ] Flatten gal took : 3 ms
[2022-05-17 20:21:15] [INFO ] Applying decomposition
[2022-05-17 20:21:15] [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/graph560862437487407748.txt' '-o' '/tmp/graph560862437487407748.bin' '-w' '/tmp/graph560862437487407748.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph560862437487407748.bin' '-l' '-1' '-v' '-w' '/tmp/graph560862437487407748.weights' '-q' '0' '-e' '0.001'
[2022-05-17 20:21:15] [INFO ] Decomposing Gal with order
[2022-05-17 20:21:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 20:21:15] [INFO ] Removed a total of 4 redundant transitions.
[2022-05-17 20:21:15] [INFO ] Flatten gal took : 3 ms
[2022-05-17 20:21:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 1 ms.
[2022-05-17 20:21:15] [INFO ] Time to serialize gal into /tmp/LTL11594925746569032000.gal : 1 ms
[2022-05-17 20:21:15] [INFO ] Time to serialize properties into /tmp/LTL2537842495715767821.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/LTL11594925746569032000.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2537842495715767821.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/LTL1159492...267
Read 1 LTL properties
Checking formula 0 : !((X(G("(gu2.ERKPP_Phase3<=gu2.RasGTP)"))))
Formula 0 simplified : !XG"(gu2.ERKPP_Phase3<=gu2.RasGTP)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9689193939100776757
[2022-05-17 20:21:30] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9689193939100776757
Running compilation step : cd /tmp/ltsmin9689193939100776757;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin9689193939100776757;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9689193939100776757;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property MAPK-PT-05120-LTLCardinality-08 finished in 102492 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Found a SL insensitive property : MAPK-PT-05120-LTLCardinality-13
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 22/22 places, 30/30 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 22 transition count 29
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 20 transition count 29
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 16 transition count 26
Graph (trivial) has 4 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 14 transition count 26
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 14 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 14 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 13 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 13 transition count 19
Applied a total of 20 rules in 62 ms. Remains 13 /22 variables (removed 9) and now considering 19/30 (removed 11) transitions.
// Phase 1: matrix 19 rows 13 cols
[2022-05-17 20:21:46] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 20:21:46] [INFO ] Implicit Places using invariants in 29 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 12/22 places, 19/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 12/22 places, 19/30 transitions.
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT s4 s11), p0:(GT s6 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 155 ms.
Product exploration explored 100000 steps with 0 reset in 180 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2561 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 19 rows 12 cols
[2022-05-17 20:21:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 20:21:46] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:21:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-17 20:21:46] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:21:46] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 20:21:46] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 10249 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=1281 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 234 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 19/19 (removed 0) transitions.
// Phase 1: matrix 19 rows 12 cols
[2022-05-17 20:21:47] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 20:21:47] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 19 rows 12 cols
[2022-05-17 20:21:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 20:21:47] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 19 rows 12 cols
[2022-05-17 20:21:47] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 20:21:47] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 19/19 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 222 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10246 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3415 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 19 rows 12 cols
[2022-05-17 20:21:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 20:21:47] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 20:21:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-17 20:21:47] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 20:21:47] [INFO ] After 12ms 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-17 20:21:47] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 10249 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=854 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 329 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 124 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 98 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 19/19 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 18
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 11 transition count 17
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 11 transition count 17
Applied a total of 3 rules in 3 ms. Remains 11 /12 variables (removed 1) and now considering 17/19 (removed 2) transitions.
[2022-05-17 20:21:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 11 cols
[2022-05-17 20:21:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 20:21:48] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/12 places, 17/19 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/12 places, 17/19 transitions.
Stuttering criterion allowed to conclude after 30826 steps with 0 reset in 34 ms.
Treatment of property MAPK-PT-05120-LTLCardinality-13 finished in 3103 ms.
FORMULA MAPK-PT-05120-LTLCardinality-13 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-17 20:21:48] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8570351782246792230
[2022-05-17 20:21:49] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2022-05-17 20:21:49] [INFO ] Applying decomposition
[2022-05-17 20:21:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 20:21:49] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2022-05-17 20:21:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 20:21:49] [INFO ] Flatten gal took : 5 ms
[2022-05-17 20:21:49] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2022-05-17 20:21:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 20:21:49] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8570351782246792230
Running compilation step : cd /tmp/ltsmin8570351782246792230;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17396280179693338387.txt' '-o' '/tmp/graph17396280179693338387.bin' '-w' '/tmp/graph17396280179693338387.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17396280179693338387.bin' '-l' '-1' '-v' '-w' '/tmp/graph17396280179693338387.weights' '-q' '0' '-e' '0.001'
[2022-05-17 20:21:49] [INFO ] Decomposing Gal with order
[2022-05-17 20:21:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 20:21:49] [INFO ] Removed a total of 10 redundant transitions.
[2022-05-17 20:21:49] [INFO ] Flatten gal took : 4 ms
[2022-05-17 20:21:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2022-05-17 20:21:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality2569919304694464975.gal : 1 ms
[2022-05-17 20:21:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality14637005463924595574.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/LTLCardinality2569919304694464975.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14637005463924595574.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...289
Read 1 LTL properties
Checking formula 0 : !((X(G("(gu0.ERKPP_Phase3<=gu0.RasGTP)"))))
Formula 0 simplified : !XG"(gu0.ERKPP_Phase3<=gu0.RasGTP)"
Compilation finished in 110 ms.
Running link step : cd /tmp/ltsmin8570351782246792230;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8570351782246792230;'/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)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: LTL layer: formula: X([]((LTLAPp0==true)))
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: "X([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.075: DFS-FIFO for weak LTL, using special progress label 34
pins2lts-mc-linux64( 0/ 8), 0.075: There are 35 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.075: State length is 23, there are 34 groups
pins2lts-mc-linux64( 0/ 8), 0.075: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.075: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.075: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.075: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.097: ~1 levels ~960 states ~5000 transitions
pins2lts-mc-linux64( 3/ 8), 0.104: ~1 levels ~1920 states ~10952 transitions
pins2lts-mc-linux64( 3/ 8), 0.143: ~1 levels ~3840 states ~24520 transitions
pins2lts-mc-linux64( 3/ 8), 0.175: ~1 levels ~7680 states ~53552 transitions
pins2lts-mc-linux64( 4/ 8), 0.266: ~1 levels ~15360 states ~136352 transitions
pins2lts-mc-linux64( 4/ 8), 0.419: ~1 levels ~30720 states ~283184 transitions
pins2lts-mc-linux64( 4/ 8), 0.705: ~1 levels ~61440 states ~594664 transitions
pins2lts-mc-linux64( 4/ 8), 1.219: ~1 levels ~122880 states ~1255576 transitions
pins2lts-mc-linux64( 2/ 8), 2.027: ~1 levels ~245760 states ~2603664 transitions
pins2lts-mc-linux64( 2/ 8), 3.092: ~1 levels ~491520 states ~5425528 transitions
pins2lts-mc-linux64( 6/ 8), 4.532: ~1 levels ~983040 states ~10570256 transitions
pins2lts-mc-linux64( 1/ 8), 7.280: ~1 levels ~1966080 states ~22681712 transitions
pins2lts-mc-linux64( 1/ 8), 12.893: ~1 levels ~3932160 states ~46765632 transitions
pins2lts-mc-linux64( 1/ 8), 25.240: ~1 levels ~7864320 states ~98238808 transitions
pins2lts-mc-linux64( 6/ 8), 50.702: ~1 levels ~15728640 states ~196248720 transitions
pins2lts-mc-linux64( 6/ 8), 103.237: ~1 levels ~31457280 states ~407735168 transitions
pins2lts-mc-linux64( 6/ 8), 212.653: ~1 levels ~62914560 states ~838402304 transitions
pins2lts-mc-linux64( 4/ 8), 408.233: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 408.280:
pins2lts-mc-linux64( 0/ 8), 408.280: mean standard work distribution: 3.2% (states) 1.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 408.280:
pins2lts-mc-linux64( 0/ 8), 408.280: Explored 104013829 states 1503546525 transitions, fanout: 14.455
pins2lts-mc-linux64( 0/ 8), 408.280: Total exploration time 408.190 sec (408.140 sec minimum, 408.164 sec on average)
pins2lts-mc-linux64( 0/ 8), 408.280: States per second: 254817, Transitions per second: 3683448
pins2lts-mc-linux64( 0/ 8), 408.280:
pins2lts-mc-linux64( 0/ 8), 408.280: Progress states detected: 134217272
pins2lts-mc-linux64( 0/ 8), 408.280: Redundant explorations: -22.5035
pins2lts-mc-linux64( 0/ 8), 408.280:
pins2lts-mc-linux64( 0/ 8), 408.280: Queue width: 8B, total height: 60741957, memory: 463.42MB
pins2lts-mc-linux64( 0/ 8), 408.280: Tree memory: 1181.4MB, 9.2 B/state, compr.: 9.8%
pins2lts-mc-linux64( 0/ 8), 408.280: Tree fill ratio (roots/leafs): 99.0%/61.0%
pins2lts-mc-linux64( 0/ 8), 408.280: Stored 31 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 408.280: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 408.280: Est. total memory use: 1644.8MB (~1487.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8570351782246792230;'/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)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8570351782246792230;'/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)))' '--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)
ITS-tools command line returned an error code 137
[2022-05-17 20:40:56] [INFO ] Flatten gal took : 58 ms
[2022-05-17 20:40:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality13591521590395304880.gal : 22 ms
[2022-05-17 20:40:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality2115832853768106142.ltl : 8 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/LTLCardinality13591521590395304880.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2115832853768106142.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...289
Read 1 LTL properties
Checking formula 0 : !((X(G("(ERKPP_Phase3<=RasGTP)"))))
Formula 0 simplified : !XG"(ERKPP_Phase3<=RasGTP)"
Detected timeout of ITS tools.
[2022-05-17 21:02:38] [INFO ] Flatten gal took : 9 ms
[2022-05-17 21:02:38] [INFO ] Input system was already deterministic with 30 transitions.
[2022-05-17 21:02:38] [INFO ] Transformed 22 places.
[2022-05-17 21:02:38] [INFO ] Transformed 30 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-17 21:02:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality3402373916942168438.gal : 1 ms
[2022-05-17 21:02:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality11626597335662473264.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/LTLCardinality3402373916942168438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11626597335662473264.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...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G("(ERKPP_Phase3<=RasGTP)"))))
Formula 0 simplified : !XG"(ERKPP_Phase3<=RasGTP)"

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="MAPK-PT-05120"
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 MAPK-PT-05120, 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 r132-tall-165271821100619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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