Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r241-tall-171649628600302.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r241-tall-171649628600302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 07:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 13 07:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 13 07:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 25K May 18 16:42 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 1716565100962

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPK-PT-05120
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 15:38:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 15:38:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:38:22] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2024-05-24 15:38:22] [INFO ] Transformed 22 places.
[2024-05-24 15:38:22] [INFO ] Transformed 30 transitions.
[2024-05-24 15:38:22] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MAPK-PT-05120-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 8 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2024-05-24 15:38:22] [INFO ] Computed 7 invariants in 4 ms
[2024-05-24 15:38:23] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-24 15:38:23] [INFO ] Invariant cache hit.
[2024-05-24 15:38:23] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2024-05-24 15:38:23] [INFO ] Invariant cache hit.
[2024-05-24 15:38:23] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 22 out of 22 places after structural reductions.
[2024-05-24 15:38:23] [INFO ] Flatten gal took : 20 ms
[2024-05-24 15:38:23] [INFO ] Flatten gal took : 5 ms
[2024-05-24 15:38:23] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10250 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=366 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 27) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2024-05-24 15:38:23] [INFO ] Invariant cache hit.
[2024-05-24 15:38:23] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-24 15:38:23] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-24 15:38:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-24 15:38:23] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-24 15:38:23] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-24 15:38:24] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Finished Parikh walk after 180 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=180 )
Parikh walk visited 16 properties in 7945 ms.
FORMULA MAPK-PT-05120-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 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 2 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 10 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 23 place count 10 transition count 19
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 10 transition count 15
Applied a total of 27 rules in 11 ms. Remains 10 /22 variables (removed 12) and now considering 15/30 (removed 15) transitions.
[2024-05-24 15:38:32] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
// Phase 1: matrix 12 rows 10 cols
[2024-05-24 15:38:32] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 15:38:32] [INFO ] Implicit Places using invariants in 33 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 15/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46 ms. Remains : 9/22 places, 15/30 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s6 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA MAPK-PT-05120-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-00 finished in 246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((F(G(p1))&&F(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 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2024-05-24 15:38:32] [INFO ] Computed 7 invariants in 7 ms
[2024-05-24 15:38:32] [INFO ] Implicit Places using invariants in 40 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 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 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 1 s10), p1:(LEQ s11 s6), p2:(LEQ 3 s1)], 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 60 reset in 259 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 16 in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-01 finished in 562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(p1)&&(p2 U (p3||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.
[2024-05-24 15:38:33] [INFO ] Invariant cache hit.
[2024-05-24 15:38:33] [INFO ] Implicit Places using invariants in 25 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 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 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT 2 s1), p3:(AND (GT 2 s13) (GT s7 s11)), p2:(GT s7 s11), p1:(GT s13 s1)], 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 2 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-03 finished in 324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||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.
[2024-05-24 15:38:33] [INFO ] Invariant cache hit.
[2024-05-24 15:38:33] [INFO ] Implicit Places using invariants in 37 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 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 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GT s11 s3), p0:(OR (GT 1 s10) (GT 2 s19) (GT s14 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 37 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-05120-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-04 finished in 255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(G(!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.
[2024-05-24 15:38:33] [INFO ] Invariant cache hit.
[2024-05-24 15:38:33] [INFO ] Implicit Places using invariants in 35 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 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 LTL mode , in 2 iterations and 40 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 242 ms :[p1, (AND (NOT p0) p1), p1, true, (AND (NOT p0) p1), p1, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(GT 1 s7), p1:(AND (LEQ s1 s8) (LEQ 1 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30979 steps with 7754 reset in 44 ms.
FORMULA MAPK-PT-05120-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-05 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 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 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 14 place count 14 transition count 24
Graph (trivial) has 4 edges and 14 vertex of which 2 / 14 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 16 place count 12 transition count 24
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 12 transition count 21
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 12 transition count 15
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 27 place count 11 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 10 transition count 13
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 10 transition count 13
Applied a total of 29 rules in 110 ms. Remains 10 /22 variables (removed 12) and now considering 13/30 (removed 17) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-24 15:38:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 15:38:34] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 15:38:34] [INFO ] Invariant cache hit.
[2024-05-24 15:38:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 15:38:34] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-24 15:38:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 15:38:34] [INFO ] Invariant cache hit.
[2024-05-24 15:38:34] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/22 places, 13/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 10/22 places, 13/30 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s5 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-05120-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-06 finished in 263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
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
[2024-05-24 15:38:34] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 15:38:34] [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 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s8), p1:(LEQ 2 s15)], 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 754 reset in 121 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-07 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 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 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 13 place count 14 transition count 25
Graph (trivial) has 8 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 13 transition count 25
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 13 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 13 transition count 20
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 13 transition count 20
Applied a total of 20 rules in 10 ms. Remains 13 /22 variables (removed 9) and now considering 20/30 (removed 10) transitions.
[2024-05-24 15:38:34] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 13 cols
[2024-05-24 15:38:34] [INFO ] Computed 4 invariants in 2 ms
[2024-05-24 15:38:34] [INFO ] Implicit Places using invariants in 24 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/22 places, 20/30 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 19
Applied a total of 1 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 19/20 (removed 1) transitions.
[2024-05-24 15:38:34] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2024-05-24 15:38:34] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:38:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 15:38:34] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2024-05-24 15:38:34] [INFO ] Invariant cache hit.
[2024-05-24 15:38:34] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/22 places, 19/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 116 ms. Remains : 12/22 places, 19/30 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s10), p1:(LEQ s7 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-08 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(F(p2)&&p1)))))'
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 17 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 17 transition count 24
Applied a total of 11 rules in 5 ms. Remains 17 /22 variables (removed 5) and now considering 24/30 (removed 6) transitions.
[2024-05-24 15:38:34] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 17 cols
[2024-05-24 15:38:34] [INFO ] Computed 6 invariants in 0 ms
[2024-05-24 15:38:34] [INFO ] Implicit Places using invariants in 27 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/22 places, 24/30 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 16 transition count 23
Applied a total of 1 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 23/24 (removed 1) transitions.
[2024-05-24 15:38:34] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 16 cols
[2024-05-24 15:38:34] [INFO ] Computed 5 invariants in 4 ms
[2024-05-24 15:38:34] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 15:38:34] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2024-05-24 15:38:34] [INFO ] Invariant cache hit.
[2024-05-24 15:38:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 15:38:34] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/22 places, 23/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 16/22 places, 23/30 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GT 3 s1) (GT s7 s8)), p0:(GT s0 s12), p2:(GT 2 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 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 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(G(p1)))) U G((!p1||X(F((!p1&&F(p1))))))))'
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
Graph (trivial) has 8 edges and 12 vertex of which 2 / 12 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 19 place count 10 transition count 23
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 7 edges and 10 vertex of which 3 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 24 place count 8 transition count 19
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 30 place count 8 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 8 transition count 11
Applied a total of 32 rules in 8 ms. Remains 8 /22 variables (removed 14) and now considering 11/30 (removed 19) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-24 15:38:35] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 15:38:35] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 15:38:35] [INFO ] Invariant cache hit.
[2024-05-24 15:38:35] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-24 15:38:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 15:38:35] [INFO ] Invariant cache hit.
[2024-05-24 15:38:35] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 11/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 8/22 places, 11/30 transitions.
Stuttering acceptance computed with spot in 337 ms :[p1, false, (NOT p1), (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=p1, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={0} source=6 dest: 6}, { cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ s6 s0), p1:(GT 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 124 ms.
Product exploration explored 100000 steps with 0 reset in 172 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 134 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter insensitive) to 8 states, 20 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 336 ms :[p1, false, (NOT p1), (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1)]
Incomplete random walk after 11525 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1440 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 607414 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{0=1, 4=1, 5=1}
Probabilistic random walk after 607414 steps, saw 295258 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :3
Running SMT prover for 3 properties.
[2024-05-24 15:38:39] [INFO ] Invariant cache hit.
[2024-05-24 15:38:39] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 15:38:39] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 15:38:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-24 15:38:39] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-24 15:38:39] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-24 15:38:39] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 15360 steps, including 0 resets, run visited all 2 properties in 140 ms. (steps per millisecond=109 )
Parikh walk visited 1 properties in 139 ms.
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 11/11 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 4 place count 6 transition count 9
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 6 transition count 8
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 2 with 2 rules applied. Total rules applied 7 place count 5 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 4 transition count 4
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 4 transition count 4
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 4 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 15 place count 2 transition count 2
Applied a total of 15 rules in 162 ms. Remains 2 /8 variables (removed 6) and now considering 2/11 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 2/8 places, 2/11 transitions.
Finished random walk after 3841 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1920 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 12 factoid took 430 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter insensitive) to 8 states, 20 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 385 ms :[p1, false, (NOT p1), (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1)]
Stuttering acceptance computed with spot in 335 ms :[p1, false, (NOT p1), (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1)]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-24 15:38:41] [INFO ] Invariant cache hit.
[2024-05-24 15:38:41] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 15:38:41] [INFO ] Invariant cache hit.
[2024-05-24 15:38:41] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-24 15:38:41] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 15:38:41] [INFO ] Invariant cache hit.
[2024-05-24 15:38:41] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 8/8 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 141 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter insensitive) to 8 states, 20 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 353 ms :[p1, false, (NOT p1), (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1)]
Incomplete random walk after 11525 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2305 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 541658 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{0=1, 4=1, 5=1}
Probabilistic random walk after 541658 steps, saw 258946 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :3
Running SMT prover for 3 properties.
[2024-05-24 15:38:45] [INFO ] Invariant cache hit.
[2024-05-24 15:38:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 15:38:45] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 15:38:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 15:38:45] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-24 15:38:45] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-24 15:38:45] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 15360 steps, including 0 resets, run visited all 2 properties in 114 ms. (steps per millisecond=134 )
Parikh walk visited 1 properties in 114 ms.
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 11/11 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 4 place count 6 transition count 9
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 6 transition count 8
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 2 with 2 rules applied. Total rules applied 7 place count 5 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 10 place count 4 transition count 4
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 4 transition count 4
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 4 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 15 place count 2 transition count 2
Applied a total of 15 rules in 134 ms. Remains 2 /8 variables (removed 6) and now considering 2/11 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 2/8 places, 2/11 transitions.
Finished random walk after 3841 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3841 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (AND p0 (NOT p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 14 factoid took 302 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter insensitive) to 8 states, 20 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 316 ms :[p1, false, (NOT p1), (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1)]
Stuttering acceptance computed with spot in 326 ms :[p1, false, (NOT p1), (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1)]
Stuttering acceptance computed with spot in 331 ms :[p1, false, (NOT p1), (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 94 ms.
Product exploration explored 100000 steps with 0 reset in 91 ms.
Built C files in :
/tmp/ltsmin14149730516672097339
[2024-05-24 15:38:46] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2024-05-24 15:38:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:38:46] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2024-05-24 15:38:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:38:46] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2024-05-24 15:38:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:38:46] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14149730516672097339
Running compilation step : cd /tmp/ltsmin14149730516672097339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 178 ms.
Running link step : cd /tmp/ltsmin14149730516672097339;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14149730516672097339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3126165240830169576.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-24 15:39:02] [INFO ] Invariant cache hit.
[2024-05-24 15:39:02] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 15:39:02] [INFO ] Invariant cache hit.
[2024-05-24 15:39:02] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-24 15:39:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 15:39:02] [INFO ] Invariant cache hit.
[2024-05-24 15:39:02] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 8/8 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin15869657237139026453
[2024-05-24 15:39:02] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2024-05-24 15:39:02] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:39:02] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2024-05-24 15:39:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:39:02] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2024-05-24 15:39:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:39:02] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15869657237139026453
Running compilation step : cd /tmp/ltsmin15869657237139026453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin15869657237139026453;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15869657237139026453;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15719317764394136432.hoa' '--buchi-type=spotba'
LTSmin run took 3457 ms.
FORMULA MAPK-PT-05120-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MAPK-PT-05120-LTLCardinality-10 finished in 30621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 15 transition count 24
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 15 transition count 21
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 15 transition count 21
Applied a total of 18 rules in 7 ms. Remains 15 /22 variables (removed 7) and now considering 21/30 (removed 9) transitions.
[2024-05-24 15:39:05] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 15 cols
[2024-05-24 15:39:05] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 15:39:05] [INFO ] Implicit Places using invariants in 30 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/22 places, 21/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40 ms. Remains : 14/22 places, 21/30 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 2 s10) (GT 2 s8) (LEQ 3 s11))], 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 3 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-11 finished in 100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(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
[2024-05-24 15:39:05] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 15:39:05] [INFO ] Implicit Places using invariants in 32 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 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 LTL mode , in 2 iterations and 35 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 343 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(AND (LEQ 1 s11) (GT s1 s15)), p0:(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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 263 ms.
Product exploration explored 100000 steps with 0 reset in 281 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 p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Incomplete random walk after 10250 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1025 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2436498 steps, run timeout after 3001 ms. (steps per millisecond=811 ) properties seen :{}
Probabilistic random walk after 2436498 steps, saw 1516435 distinct states, run finished after 3001 ms. (steps per millisecond=811 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 21 cols
[2024-05-24 15:39:09] [INFO ] Computed 6 invariants in 3 ms
[2024-05-24 15:39:09] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 15:39:09] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 15:39:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 15:39:10] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 15:39:10] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 15:39:10] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 30/30 transitions.
Graph (trivial) has 6 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 19 transition count 25
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 4 place count 17 transition count 25
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 17 transition count 24
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 1 with 11 rules applied. Total rules applied 16 place count 11 transition count 19
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 4 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 22 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 4 edges and 9 vertex of which 3 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 7 transition count 12
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 31 place count 6 transition count 8
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 4 with 2 rules applied. Total rules applied 33 place count 5 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 35 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 36 place count 4 transition count 4
Iterating global reduction 5 with 1 rules applied. Total rules applied 37 place count 4 transition count 4
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 38 place count 4 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 41 place count 2 transition count 2
Applied a total of 41 rules in 150 ms. Remains 2 /21 variables (removed 19) and now considering 2/30 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 2/21 places, 2/30 transitions.
Finished random walk after 3841 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1920 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MAPK-PT-05120-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MAPK-PT-05120-LTLCardinality-13 finished in 4472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p0&&F(((p1&&X(p2))||G(p2))))))))'
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
[2024-05-24 15:39:10] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 15:39:10] [INFO ] Implicit Places using invariants in 30 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 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 LTL mode , in 2 iterations and 33 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 332 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 7}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p2 p1), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GT 2 s4), p1:(GT s16 s10), p2:(GT s8 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 18944 reset in 92 ms.
Product exploration explored 100000 steps with 18831 reset in 106 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10250 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1281 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 30 rows 21 cols
[2024-05-24 15:39:11] [INFO ] Computed 6 invariants in 3 ms
[2024-05-24 15:39:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 15:39:11] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 15:39:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 15:39:11] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 15:39:11] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-24 15:39:11] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 3031 ms.
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 30/30 transitions.
Graph (trivial) has 6 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 8 place count 15 transition count 23
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 15 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 15 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 14 transition count 17
Applied a total of 15 rules in 12 ms. Remains 14 /21 variables (removed 7) and now considering 17/30 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 14/21 places, 17/30 transitions.
Incomplete random walk after 10250 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 373551 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 373551 steps, saw 188440 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 17 rows 14 cols
[2024-05-24 15:39:17] [INFO ] Computed 5 invariants in 0 ms
[2024-05-24 15:39:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 15:39:18] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 15:39:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 15:39:18] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 15:39:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-24 15:39:18] [INFO ] After 11ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 15:39:18] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-24 15:39:18] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1104 ms.
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 14/14 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 17/17 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2024-05-24 15:39:19] [INFO ] Invariant cache hit.
[2024-05-24 15:39:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 15:39:19] [INFO ] Invariant cache hit.
[2024-05-24 15:39:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-24 15:39:19] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-24 15:39:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 15:39:19] [INFO ] Invariant cache hit.
[2024-05-24 15:39:19] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 14/14 places, 17/17 transitions.
Graph (trivial) has 5 edges and 14 vertex of which 3 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 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 4 place count 10 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 2 ms. Remains 10 /14 variables (removed 4) and now considering 11/17 (removed 6) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 11 rows 10 cols
[2024-05-24 15:39:19] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 15:39:19] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-05-24 15:39:19] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 15:39:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-24 15:39:19] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 15:39:19] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 15:39:19] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F p1), (F (AND p1 p0)), (F (NOT (AND (NOT p1) p0))), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 2 factoid took 410 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 5 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
[2024-05-24 15:39:20] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 15:39:20] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 15:39:20] [INFO ] Invariant cache hit.
[2024-05-24 15:39:20] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-24 15:39:20] [INFO ] Invariant cache hit.
[2024-05-24 15:39:20] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. 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 p2)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10250 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1281 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
[2024-05-24 15:39:21] [INFO ] Invariant cache hit.
[2024-05-24 15:39:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 15:39:21] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-24 15:39:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 15:39:21] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-24 15:39:21] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-24 15:39:21] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 5 properties in 3864 ms.
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 30/30 transitions.
Graph (trivial) has 6 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 8 place count 15 transition count 23
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 15 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 15 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 14 transition count 17
Applied a total of 15 rules in 4 ms. Remains 14 /21 variables (removed 7) and now considering 17/30 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 14/21 places, 17/30 transitions.
Incomplete random walk after 10250 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 656992 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 656992 steps, saw 331595 distinct states, run finished after 3003 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 17 rows 14 cols
[2024-05-24 15:39:28] [INFO ] Computed 5 invariants in 1 ms
[2024-05-24 15:39:28] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 15:39:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-24 15:39:28] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 15:39:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-24 15:39:28] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 15:39:28] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 15:39:28] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 676 ms.
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 14/14 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2024-05-24 15:39:29] [INFO ] Invariant cache hit.
[2024-05-24 15:39:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 15:39:29] [INFO ] Invariant cache hit.
[2024-05-24 15:39:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-24 15:39:29] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-24 15:39:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 15:39:29] [INFO ] Invariant cache hit.
[2024-05-24 15:39:29] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 14/14 places, 17/17 transitions.
Graph (trivial) has 5 edges and 14 vertex of which 3 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 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 4 place count 10 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 3 ms. Remains 10 /14 variables (removed 4) and now considering 11/17 (removed 6) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 11 rows 10 cols
[2024-05-24 15:39:29] [INFO ] Computed 4 invariants in 0 ms
[2024-05-24 15:39:29] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 15:39:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 15:39:29] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 15:39:29] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-24 15:39:29] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) p0 p2)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1) (NOT p2))), (F p1), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND p1 p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 439 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 18958 reset in 79 ms.
Product exploration explored 100000 steps with 18805 reset in 84 ms.
Built C files in :
/tmp/ltsmin7345268177305531584
[2024-05-24 15:39:30] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7345268177305531584
Running compilation step : cd /tmp/ltsmin7345268177305531584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 98 ms.
Running link step : cd /tmp/ltsmin7345268177305531584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7345268177305531584;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17261373570304186420.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 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 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2024-05-24 15:39:46] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 15:39:46] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 15:39:46] [INFO ] Invariant cache hit.
[2024-05-24 15:39:46] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-24 15:39:46] [INFO ] Invariant cache hit.
[2024-05-24 15:39:46] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 21/21 places, 30/30 transitions.
Built C files in :
/tmp/ltsmin10610324277802851099
[2024-05-24 15:39:46] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10610324277802851099
Running compilation step : cd /tmp/ltsmin10610324277802851099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 96 ms.
Running link step : cd /tmp/ltsmin10610324277802851099;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10610324277802851099;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2891409056245098890.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 15:40:01] [INFO ] Flatten gal took : 3 ms
[2024-05-24 15:40:01] [INFO ] Flatten gal took : 3 ms
[2024-05-24 15:40:01] [INFO ] Time to serialize gal into /tmp/LTL9583418289125757086.gal : 1 ms
[2024-05-24 15:40:01] [INFO ] Time to serialize properties into /tmp/LTL2840510865537125858.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9583418289125757086.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14483229761274580439.hoa' '-atoms' '/tmp/LTL2840510865537125858.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2840510865537125858.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14483229761274580439.hoa
Detected timeout of ITS tools.
[2024-05-24 15:40:16] [INFO ] Flatten gal took : 3 ms
[2024-05-24 15:40:16] [INFO ] Flatten gal took : 3 ms
[2024-05-24 15:40:16] [INFO ] Time to serialize gal into /tmp/LTL5341351770131309629.gal : 1 ms
[2024-05-24 15:40:16] [INFO ] Time to serialize properties into /tmp/LTL6466592443056918269.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5341351770131309629.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6466592443056918269.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(ERKPP_Phase3<2)"))||(("(ERKPP_Phase3<2)")&&(F((G("(Phase3>ERK_MEKPP)"))||(("(Raf_RasGTP>ERKPP)")&&(X("(Phase3>ERK_MEKPP)")...164
Formula 0 simplified : XX(F!"(ERKPP_Phase3<2)" & (!"(ERKPP_Phase3<2)" | G(F!"(Phase3>ERK_MEKPP)" & (!"(Raf_RasGTP>ERKPP)" | X!"(Phase3>ERK_MEKPP)"))))
Detected timeout of ITS tools.
[2024-05-24 15:40:31] [INFO ] Flatten gal took : 7 ms
[2024-05-24 15:40:31] [INFO ] Applying decomposition
[2024-05-24 15:40:31] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4709409968009979270.txt' '-o' '/tmp/graph4709409968009979270.bin' '-w' '/tmp/graph4709409968009979270.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4709409968009979270.bin' '-l' '-1' '-v' '-w' '/tmp/graph4709409968009979270.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:40:31] [INFO ] Decomposing Gal with order
[2024-05-24 15:40:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:40:31] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-24 15:40:31] [INFO ] Flatten gal took : 23 ms
[2024-05-24 15:40:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-24 15:40:31] [INFO ] Time to serialize gal into /tmp/LTL18438515524912050346.gal : 1 ms
[2024-05-24 15:40:31] [INFO ] Time to serialize properties into /tmp/LTL12249715340929475765.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18438515524912050346.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12249715340929475765.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(gi1.gu1.ERKPP_Phase3<2)"))||(("(gi1.gu1.ERKPP_Phase3<2)")&&(F((G("(gu0.Phase3>gu0.ERK_MEKPP)"))||(("(gu5.Raf_RasGTP>gu5.ER...204
Formula 0 simplified : XX(F!"(gi1.gu1.ERKPP_Phase3<2)" & (!"(gi1.gu1.ERKPP_Phase3<2)" | G(F!"(gu0.Phase3>gu0.ERK_MEKPP)" & (!"(gu5.Raf_RasGTP>gu5.ERKPP)" |...190
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14107807135277424493
[2024-05-24 15:40:46] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14107807135277424493
Running compilation step : cd /tmp/ltsmin14107807135277424493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 89 ms.
Running link step : cd /tmp/ltsmin14107807135277424493;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin14107807135277424493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>(([]((LTLAPp1==true))||((LTLAPp2==true)&&X((LTLAPp1==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property MAPK-PT-05120-LTLCardinality-15 finished in 111343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p0&&F(((p1&&X(p2))||G(p2))))))))'
[2024-05-24 15:41:01] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3599487805587848768
[2024-05-24 15:41:01] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2024-05-24 15:41:01] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:41:01] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2024-05-24 15:41:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:41:01] [INFO ] Applying decomposition
[2024-05-24 15:41:01] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2024-05-24 15:41:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 15:41:01] [INFO ] Flatten gal took : 2 ms
[2024-05-24 15:41:01] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3599487805587848768
Running compilation step : cd /tmp/ltsmin3599487805587848768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3949713757805895323.txt' '-o' '/tmp/graph3949713757805895323.bin' '-w' '/tmp/graph3949713757805895323.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3949713757805895323.bin' '-l' '-1' '-v' '-w' '/tmp/graph3949713757805895323.weights' '-q' '0' '-e' '0.001'
[2024-05-24 15:41:01] [INFO ] Decomposing Gal with order
[2024-05-24 15:41:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 15:41:01] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-24 15:41:01] [INFO ] Flatten gal took : 4 ms
[2024-05-24 15:41:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 1 ms.
[2024-05-24 15:41:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality8477048436045686653.gal : 2 ms
[2024-05-24 15:41:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality6624959530443523743.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8477048436045686653.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6624959530443523743.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
Compilation finished in 129 ms.
Running link step : cd /tmp/ltsmin3599487805587848768;'gcc' '-shared' '-o' 'gal.so' 'model.o'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(gi1.gu1.ERKPP_Phase3<2)"))||(("(gi1.gu1.ERKPP_Phase3<2)")&&(F((("(gu5.Raf_RasGTP>gu5.ERKPP)")&&(X("(gu3.Phase3>gu3.ERK_MEK...204
Formula 0 simplified : XX(F!"(gi1.gu1.ERKPP_Phase3<2)" & (!"(gi1.gu1.ERKPP_Phase3<2)" | G(F!"(gu3.Phase3>gu3.ERK_MEKPP)" & (!"(gu5.Raf_RasGTP>gu5.ERKPP)" |...190
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin3599487805587848768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((((LTLAPp1==true)&&X((LTLAPp2==true)))||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: LTL layer: formula: X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((((LTLAPp1==true)&&X((LTLAPp2==true)))||[]((LTLAPp2==true))))))))
pins2lts-mc-linux64( 0/ 8), 0.012: "X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((((LTLAPp1==true)&&X((LTLAPp2==true)))||[]((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.012: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: buchi has 9 states
pins2lts-mc-linux64( 7/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.104: There are 34 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.104: State length is 23, there are 52 groups
pins2lts-mc-linux64( 0/ 8), 0.104: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.104: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.104: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.104: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.121: [Blue] ~19 levels ~960 states ~1368 transitions
pins2lts-mc-linux64( 2/ 8), 0.133: [Blue] ~34 levels ~1920 states ~2680 transitions
pins2lts-mc-linux64( 2/ 8), 0.185: [Blue] ~64 levels ~3840 states ~5320 transitions
pins2lts-mc-linux64( 2/ 8), 0.293: [Blue] ~124 levels ~7680 states ~10600 transitions
pins2lts-mc-linux64( 2/ 8), 0.446: [Blue] ~244 levels ~15360 states ~21160 transitions
pins2lts-mc-linux64( 2/ 8), 0.735: [Blue] ~484 levels ~30720 states ~42280 transitions
pins2lts-mc-linux64( 2/ 8), 1.123: [Blue] ~964 levels ~61440 states ~84520 transitions
pins2lts-mc-linux64( 2/ 8), 1.384: [Blue] ~1924 levels ~122880 states ~169000 transitions
pins2lts-mc-linux64( 2/ 8), 1.736: [Blue] ~3850 levels ~245760 states ~338488 transitions
pins2lts-mc-linux64( 6/ 8), 2.414: [Blue] ~4938 levels ~491520 states ~1146544 transitions
pins2lts-mc-linux64( 6/ 8), 3.024: [Blue] ~9498 levels ~983040 states ~2290192 transitions
pins2lts-mc-linux64( 1/ 8), 3.907: [Blue] ~10243 levels ~1966080 states ~3374312 transitions
pins2lts-mc-linux64( 1/ 8), 5.613: [Blue] ~10243 levels ~3932160 states ~6646888 transitions
pins2lts-mc-linux64( 1/ 8), 9.108: [Blue] ~10243 levels ~7864320 states ~13194616 transitions
pins2lts-mc-linux64( 1/ 8), 16.202: [Blue] ~10243 levels ~15728640 states ~26293544 transitions
pins2lts-mc-linux64( 4/ 8), 24.004: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 24.125:
pins2lts-mc-linux64( 0/ 8), 24.125: Explored 11731583 states 49748931 transitions, fanout: 4.241
pins2lts-mc-linux64( 0/ 8), 24.125: Total exploration time 24.010 sec (23.860 sec minimum, 23.927 sec on average)
pins2lts-mc-linux64( 0/ 8), 24.125: States per second: 488612, Transitions per second: 2072009
pins2lts-mc-linux64( 0/ 8), 24.125:
pins2lts-mc-linux64( 0/ 8), 24.125: State space has 24789201 states, 1402902 are accepting
pins2lts-mc-linux64( 0/ 8), 24.125: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 24.125: blue states: 11731583 (47.33%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 24.125: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 24.125: all-red states: 5753451 (23.21%), bogus 22 (0.00%)
pins2lts-mc-linux64( 0/ 8), 24.125:
pins2lts-mc-linux64( 0/ 8), 24.125: Total memory used for local state coloring: 74.8MB
pins2lts-mc-linux64( 0/ 8), 24.125:
pins2lts-mc-linux64( 0/ 8), 24.126: Queue width: 8B, total height: 4900146, memory: 37.39MB
pins2lts-mc-linux64( 0/ 8), 24.126: Tree memory: 445.1MB, 18.8 B/state, compr.: 20.0%
pins2lts-mc-linux64( 0/ 8), 24.126: Tree fill ratio (roots/leafs): 18.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 24.126: Stored 30 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 24.126: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 24.126: Est. total memory use: 482.5MB (~1061.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3599487805587848768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((((LTLAPp1==true)&&X((LTLAPp2==true)))||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3599487805587848768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp0==true))||((LTLAPp0==true)&&<>((((LTLAPp1==true)&&X((LTLAPp2==true)))||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
ITS-tools command line returned an error code 137
[2024-05-24 16:00:50] [INFO ] Flatten gal took : 124 ms
[2024-05-24 16:00:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality13738296431561179338.gal : 41 ms
[2024-05-24 16:00:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality13180196221838662841.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13738296431561179338.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13180196221838662841.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((X(X((G("(ERKPP_Phase3<2)"))||(("(ERKPP_Phase3<2)")&&(F((("(Raf_RasGTP>ERKPP)")&&(X("(Phase3>ERK_MEKPP)")))||(G("(Phase3>ERK_MEKPP)"...164
Formula 0 simplified : XX(F!"(ERKPP_Phase3<2)" & (!"(ERKPP_Phase3<2)" | G(F!"(Phase3>ERK_MEKPP)" & (!"(Raf_RasGTP>ERKPP)" | X!"(Phase3>ERK_MEKPP)"))))
Detected timeout of ITS tools.
[2024-05-24 16:21:44] [INFO ] Flatten gal took : 15 ms
[2024-05-24 16:21:44] [INFO ] Input system was already deterministic with 30 transitions.
[2024-05-24 16:21:44] [INFO ] Transformed 22 places.
[2024-05-24 16:21:44] [INFO ] Transformed 30 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 16:21:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality2619007378066347315.gal : 2 ms
[2024-05-24 16:21:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality6796340746202995523.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2619007378066347315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6796340746202995523.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((G("(ERKPP_Phase3<2)"))||(("(ERKPP_Phase3<2)")&&(F((("(Raf_RasGTP>ERKPP)")&&(X("(Phase3>ERK_MEKPP)")))||(G("(Phase3>ERK_MEKPP)"...164
Formula 0 simplified : XX(F!"(ERKPP_Phase3<2)" & (!"(ERKPP_Phase3<2)" | G(F!"(Phase3>ERK_MEKPP)" & (!"(Raf_RasGTP>ERKPP)" | X!"(Phase3>ERK_MEKPP)"))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 5125344 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15537200 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MAPK-PT-05120"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r241-tall-171649628600302"
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 ;