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.r175-smll-171636279800042.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 ERK-PT-100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636279800042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 21:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 11 21:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 11 21:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-100000-LTLCardinality-00
FORMULA_NAME ERK-PT-100000-LTLCardinality-01
FORMULA_NAME ERK-PT-100000-LTLCardinality-02
FORMULA_NAME ERK-PT-100000-LTLCardinality-03
FORMULA_NAME ERK-PT-100000-LTLCardinality-04
FORMULA_NAME ERK-PT-100000-LTLCardinality-05
FORMULA_NAME ERK-PT-100000-LTLCardinality-06
FORMULA_NAME ERK-PT-100000-LTLCardinality-07
FORMULA_NAME ERK-PT-100000-LTLCardinality-08
FORMULA_NAME ERK-PT-100000-LTLCardinality-09
FORMULA_NAME ERK-PT-100000-LTLCardinality-10
FORMULA_NAME ERK-PT-100000-LTLCardinality-11
FORMULA_NAME ERK-PT-100000-LTLCardinality-12
FORMULA_NAME ERK-PT-100000-LTLCardinality-13
FORMULA_NAME ERK-PT-100000-LTLCardinality-14
FORMULA_NAME ERK-PT-100000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716502094883

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=ERK-PT-100000
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-23 22:08:17] [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-23 22:08:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 22:08:18] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-05-23 22:08:18] [INFO ] Transformed 11 places.
[2024-05-23 22:08:18] [INFO ] Transformed 11 transitions.
[2024-05-23 22:08:18] [INFO ] Parsed PT model containing 11 places and 11 transitions and 34 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ERK-PT-100000-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ERK-PT-100000-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 21 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2024-05-23 22:08:18] [INFO ] Computed 5 invariants in 5 ms
[2024-05-23 22:08:18] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-23 22:08:18] [INFO ] Invariant cache hit.
[2024-05-23 22:08:18] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-23 22:08:18] [INFO ] Invariant cache hit.
[2024-05-23 22:08:18] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 11/11 places, 11/11 transitions.
Support contains 10 out of 11 places after structural reductions.
[2024-05-23 22:08:19] [INFO ] Flatten gal took : 29 ms
[2024-05-23 22:08:19] [INFO ] Flatten gal took : 9 ms
[2024-05-23 22:08:19] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 135 ms. (steps per millisecond=740 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=8 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 20) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) 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 15) seen :0
Running SMT prover for 15 properties.
[2024-05-23 22:08:20] [INFO ] Invariant cache hit.
[2024-05-23 22:08:20] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-23 22:08:20] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-23 22:08:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-23 22:08:20] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2024-05-23 22:08:20] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-23 22:08:20] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 6 properties in 26003 ms.
Support contains 9 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 8 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 11/11 places, 11/11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=2564 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 190421 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190421 steps, saw 115666 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-23 22:08:50] [INFO ] Invariant cache hit.
[2024-05-23 22:08:50] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-23 22:08:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-23 22:08:50] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-23 22:08:50] [INFO ] After 66ms 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-23 22:08:50] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 16000 ms.
Support contains 9 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 11/11 places, 11/11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-23 22:09:06] [INFO ] Invariant cache hit.
[2024-05-23 22:09:06] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 22:09:06] [INFO ] Invariant cache hit.
[2024-05-23 22:09:06] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-23 22:09:06] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 22:09:06] [INFO ] Invariant cache hit.
[2024-05-23 22:09:06] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Running SMT prover for 8 properties.
[2024-05-23 22:09:06] [INFO ] Invariant cache hit.
[2024-05-23 22:09:06] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-23 22:09:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-23 22:09:06] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-23 22:09:06] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-23 22:09:06] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA ERK-PT-100000-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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&&F(p1)))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-23 22:09:06] [INFO ] Invariant cache hit.
[2024-05-23 22:09:06] [INFO ] Implicit Places using invariants in 37 ms returned [0, 7, 10]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 8/11 places, 11/11 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 310 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 2 s0), p1:(GT s0 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ERK-PT-100000-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLCardinality-01 finished in 420 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' '!((p0 U G(!p1)))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 5 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-23 22:09:07] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 22:09:07] [INFO ] Implicit Places using invariants in 33 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/11 places, 10/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41 ms. Remains : 9/11 places, 10/11 transitions.
Stuttering acceptance computed with spot in 87 ms :[p1, true, p1]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT 2 s0), p0:(LEQ s8 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 320 ms.
Product exploration explored 100000 steps with 0 reset in 247 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 320 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[p1, true, p1]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=6666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 9 cols
[2024-05-23 22:09:08] [INFO ] Computed 4 invariants in 0 ms
[2024-05-23 22:09:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 22:09:08] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 22:09:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 22:09:08] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 22:09:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 22:09:08] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-23 22:09:08] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-23 22:09:08] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 299380 steps, including 0 resets, run visited all 1 properties in 288 ms. (steps per millisecond=1039 )
Parikh walk visited 3 properties in 1631 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p1), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) p1))
Knowledge based reduction with 8 factoid took 422 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ERK-PT-100000-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ERK-PT-100000-LTLCardinality-02 finished in 3556 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' '!(((p0 U (p1 U G(p2)))&&G(F(!p1))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 9 transition count 10
Applied a total of 4 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 9 cols
[2024-05-23 22:09:10] [INFO ] Computed 4 invariants in 1 ms
[2024-05-23 22:09:10] [INFO ] Implicit Places using invariants in 27 ms returned [0, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/11 places, 10/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30 ms. Remains : 7/11 places, 10/11 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p2) p1), true, (NOT p2), (NOT p2), (NOT p2), p1, p1]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}, { cond=(OR p2 p1 p0), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ s3 s2), p1:(GT 3 s3), p0:(OR (LEQ 3 s3) (LEQ s2 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLCardinality-03 finished in 384 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 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 9 transition count 10
Applied a total of 5 rules in 3 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
[2024-05-23 22:09:11] [INFO ] Flow matrix only has 9 transitions (discarded 1 similar events)
// Phase 1: matrix 9 rows 9 cols
[2024-05-23 22:09:11] [INFO ] Computed 4 invariants in 0 ms
[2024-05-23 22:09:11] [INFO ] Implicit Places using invariants in 33 ms returned [0, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/11 places, 10/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39 ms. Remains : 7/11 places, 10/11 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s5 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 297 ms.
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA ERK-PT-100000-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ERK-PT-100000-LTLCardinality-04 finished in 386 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((p0||X(F((F(p2)&&p1))))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2024-05-23 22:09:11] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 22:09:11] [INFO ] Implicit Places using invariants in 27 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s3 s7), p2:(GT 2 s5), p1:(AND (LEQ s0 s3) (LEQ s3 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 273 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 p2 (NOT p1)), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ERK-PT-100000-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ERK-PT-100000-LTLCardinality-06 finished in 669 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)||F(p1))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-23 22:09:12] [INFO ] Invariant cache hit.
[2024-05-23 22:09:12] [INFO ] Implicit Places using invariants in 28 ms returned [0, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 9/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 9/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT s5 s7), p0:(LEQ s5 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 224 ms.
Product exploration explored 100000 steps with 0 reset in 161 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 99 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=7142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 404910 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 404910 steps, saw 248901 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 11 rows 9 cols
[2024-05-23 22:09:16] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 22:09:16] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 22:09:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 22:09:16] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-23 22:09:16] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-23 22:09:16] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6001 ms.
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 11/11 transitions.
Graph (trivial) has 2 edges and 9 vertex of which 2 / 9 are part of one of the 1 SCC in 14 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 8 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 7 transition count 8
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 7 transition count 7
Applied a total of 4 rules in 19 ms. Remains 7 /9 variables (removed 2) and now considering 7/11 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 7/9 places, 7/11 transitions.
Incomplete random walk after 100001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=6666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) 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
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 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 642205 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 642205 steps, saw 213052 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7 rows 7 cols
[2024-05-23 22:09:25] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 22:09:25] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 22:09:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 22:09:25] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 22:09:25] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-23 22:09:25] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 400001 steps, including 0 resets, run visited all 1 properties in 329 ms. (steps per millisecond=1215 )
Parikh walk visited 4 properties in 5424 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ERK-PT-100000-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ERK-PT-100000-LTLCardinality-10 finished in 18957 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)))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 9 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 8 transition count 8
Applied a total of 8 rules in 3 ms. Remains 8 /11 variables (removed 3) and now considering 8/11 (removed 3) transitions.
[2024-05-23 22:09:31] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 8 cols
[2024-05-23 22:09:31] [INFO ] Computed 4 invariants in 1 ms
[2024-05-23 22:09:31] [INFO ] Implicit Places using invariants in 27 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/11 places, 8/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33 ms. Remains : 6/11 places, 8/11 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 92 ms.
Product exploration explored 100000 steps with 0 reset in 109 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 100003 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=8333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2422535 steps, run visited all 1 properties in 2208 ms. (steps per millisecond=1097 )
Probabilistic random walk after 2422535 steps, saw 1571944 distinct states, run finished after 2208 ms. (steps per millisecond=1097 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 22:09:34] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 6 cols
[2024-05-23 22:09:34] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 22:09:34] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 22:09:34] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2024-05-23 22:09:34] [INFO ] Invariant cache hit.
[2024-05-23 22:09:34] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-23 22:09:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 22:09:34] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2024-05-23 22:09:34] [INFO ] Invariant cache hit.
[2024-05-23 22:09:34] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 6/6 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=8333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2422535 steps, run visited all 1 properties in 2522 ms. (steps per millisecond=960 )
Probabilistic random walk after 2422535 steps, saw 1571944 distinct states, run finished after 2522 ms. (steps per millisecond=960 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 0 reset in 99 ms.
Built C files in :
/tmp/ltsmin13148302785312577135
[2024-05-23 22:09:37] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2024-05-23 22:09:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:09:37] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2024-05-23 22:09:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:09:37] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2024-05-23 22:09:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:09:37] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13148302785312577135
Running compilation step : cd /tmp/ltsmin13148302785312577135;'/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 269 ms.
Running link step : cd /tmp/ltsmin13148302785312577135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin13148302785312577135;'/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/stateBased13449785733273662601.hoa' '--buchi-type=spotba'
LTSmin run took 4940 ms.
FORMULA ERK-PT-100000-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ERK-PT-100000-LTLCardinality-11 finished in 11598 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(X((p1||G(p2))))))))'
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2024-05-23 22:09:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 22:09:42] [INFO ] Implicit Places using invariants in 34 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT s0 s4), p1:(LEQ s9 s2), p2:(LEQ s5 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 107 ms.
Product exploration explored 100000 steps with 0 reset in 177 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=6666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 2561123 steps, run timeout after 3001 ms. (steps per millisecond=853 ) properties seen :{1=1, 2=1, 3=1}
Probabilistic random walk after 2561123 steps, saw 1539461 distinct states, run finished after 3004 ms. (steps per millisecond=852 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 10 cols
[2024-05-23 22:09:46] [INFO ] Computed 4 invariants in 1 ms
[2024-05-23 22:09:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 22:09:46] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 22:09:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 22:09:46] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 22:09:46] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-23 22:09:46] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 397506 steps, including 0 resets, run visited all 1 properties in 436 ms. (steps per millisecond=911 )
Parikh walk visited 1 properties in 438 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Support contains 6 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-23 22:09:48] [INFO ] Invariant cache hit.
[2024-05-23 22:09:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 22:09:48] [INFO ] Invariant cache hit.
[2024-05-23 22:09:48] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-23 22:09:48] [INFO ] Invariant cache hit.
[2024-05-23 22:09:48] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 10/10 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=6250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 2795915 steps, run timeout after 3001 ms. (steps per millisecond=931 ) properties seen :{1=1, 2=1, 3=1}
Probabilistic random walk after 2795915 steps, saw 1618918 distinct states, run finished after 3001 ms. (steps per millisecond=931 ) properties seen :3
Running SMT prover for 1 properties.
[2024-05-23 22:09:51] [INFO ] Invariant cache hit.
[2024-05-23 22:09:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 22:09:51] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 22:09:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 22:09:51] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 22:09:51] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-23 22:09:51] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 397455 steps, including 0 resets, run visited all 1 properties in 456 ms. (steps per millisecond=871 )
Parikh walk visited 1 properties in 455 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), true]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Product exploration explored 100000 steps with 0 reset in 131 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Support contains 6 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-23 22:09:53] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 22:09:53] [INFO ] Invariant cache hit.
[2024-05-23 22:09:53] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39 ms. Remains : 10/10 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin4677982247123423195
[2024-05-23 22:09:53] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4677982247123423195
Running compilation step : cd /tmp/ltsmin4677982247123423195;'/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 93 ms.
Running link step : cd /tmp/ltsmin4677982247123423195;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4677982247123423195;'/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/stateBased7503801385640359506.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-23 22:10:08] [INFO ] Invariant cache hit.
[2024-05-23 22:10:08] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-23 22:10:08] [INFO ] Invariant cache hit.
[2024-05-23 22:10:08] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-23 22:10:08] [INFO ] Invariant cache hit.
[2024-05-23 22:10:08] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 10/10 places, 11/11 transitions.
Built C files in :
/tmp/ltsmin8820014518863959504
[2024-05-23 22:10:08] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8820014518863959504
Running compilation step : cd /tmp/ltsmin8820014518863959504;'/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 95 ms.
Running link step : cd /tmp/ltsmin8820014518863959504;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8820014518863959504;'/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/stateBased13777086911563480295.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 22:10:24] [INFO ] Flatten gal took : 3 ms
[2024-05-23 22:10:24] [INFO ] Flatten gal took : 3 ms
[2024-05-23 22:10:24] [INFO ] Time to serialize gal into /tmp/LTL14592617011089382080.gal : 1 ms
[2024-05-23 22:10:24] [INFO ] Time to serialize properties into /tmp/LTL256788926830178230.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/LTL14592617011089382080.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10485533735336714318.hoa' '-atoms' '/tmp/LTL256788926830178230.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/LTL256788926830178230.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10485533735336714318.hoa
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2024-05-23 22:10:24] [INFO ] Flatten gal took : 3 ms
[2024-05-23 22:10:24] [INFO ] Flatten gal took : 3 ms
[2024-05-23 22:10:24] [INFO ] Time to serialize gal into /tmp/LTL17087396868441551612.gal : 1 ms
[2024-05-23 22:10:24] [INFO ] Time to serialize properties into /tmp/LTL4217730395804970734.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/LTL17087396868441551612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4217730395804970734.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...276
Read 1 LTL properties
Checking formula 0 : !((G(("(Raf1Star>MEKPP_ERK)")||(X(X(X(("(RP<=Raf1Star_RKIP)")||(G("(Raf1Star_RKIP_ERKPP<=ERKPP)")))))))))
Formula 0 simplified : F(!"(Raf1Star>MEKPP_ERK)" & XXX(!"(RP<=Raf1Star_RKIP)" & F!"(Raf1Star_RKIP_ERKPP<=ERKPP)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2024-05-23 22:10:24] [INFO ] Flatten gal took : 3 ms
[2024-05-23 22:10:24] [INFO ] Applying decomposition
[2024-05-23 22:10:24] [INFO ] Flatten gal took : 2 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/graph16389506099847396407.txt' '-o' '/tmp/graph16389506099847396407.bin' '-w' '/tmp/graph16389506099847396407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16389506099847396407.bin' '-l' '-1' '-v' '-w' '/tmp/graph16389506099847396407.weights' '-q' '0' '-e' '0.001'
[2024-05-23 22:10:24] [INFO ] Decomposing Gal with order
[2024-05-23 22:10:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 22:10:24] [INFO ] Flatten gal took : 38 ms
[2024-05-23 22:10:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 39 ms.
[2024-05-23 22:10:24] [INFO ] Time to serialize gal into /tmp/LTL10473962718744556839.gal : 1 ms
[2024-05-23 22:10:24] [INFO ] Time to serialize properties into /tmp/LTL10986366226673005950.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/LTL10473962718744556839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10986366226673005950.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 : !((G(("(gu1.Raf1Star>gu1.MEKPP_ERK)")||(X(X(X(("(gu2.RP<=gu2.Raf1Star_RKIP)")||(G("(gu0.Raf1Star_RKIP_ERKPP<=gu0.ERKPP)")))))))))
Formula 0 simplified : F(!"(gu1.Raf1Star>gu1.MEKPP_ERK)" & XXX(!"(gu2.RP<=gu2.Raf1Star_RKIP)" & F!"(gu0.Raf1Star_RKIP_ERKPP<=gu0.ERKPP)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Built C files in :
/tmp/ltsmin3833474380928096171
[2024-05-23 22:10:24] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3833474380928096171
Running compilation step : cd /tmp/ltsmin3833474380928096171;'/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/ltsmin3833474380928096171;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3833474380928096171;'/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' '[](((LTLAPp0==true)||X(X(X(((LTLAPp1==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ERK-PT-100000-LTLCardinality-12 finished in 56790 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)&&(p1 U X(p2)))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2024-05-23 22:10:39] [INFO ] Computed 5 invariants in 3 ms
[2024-05-23 22:10:39] [INFO ] Implicit Places using invariants in 41 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 10/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 10/11 places, 11/11 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p0), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 3}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(OR (LEQ s7 s1) (LEQ 3 s7)), p1:(LEQ 3 s0), p2:(LEQ s7 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 148 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (OR (NOT p0) (NOT p2)))))]
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (NOT p2))]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=6250 ) properties (out of 5) 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 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 11 rows 10 cols
[2024-05-23 22:10:40] [INFO ] Computed 4 invariants in 2 ms
[2024-05-23 22:10:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 22:10:40] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-23 22:10:40] [INFO ] After 33ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 22:10:40] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 22:10:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 22:10:40] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 22:10:40] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-23 22:10:40] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 200001 steps, including 0 resets, run visited all 1 properties in 197 ms. (steps per millisecond=1015 )
Parikh walk visited 2 properties in 2196 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (OR (NOT p0) (NOT p2))))), (F (OR (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 p0 (NOT p2))), (F (NOT (AND p0 p2))), (F (AND (NOT p1) p0 (NOT p2)))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 7 factoid took 333 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ERK-PT-100000-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ERK-PT-100000-LTLCardinality-13 finished in 3911 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 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 9 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 8 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 6 transition count 7
Applied a total of 9 rules in 7 ms. Remains 6 /11 variables (removed 5) and now considering 7/11 (removed 4) transitions.
[2024-05-23 22:10:43] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2024-05-23 22:10:43] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 22:10:43] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 22:10:43] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-23 22:10:43] [INFO ] Invariant cache hit.
[2024-05-23 22:10:43] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-23 22:10:43] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 22:10:43] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-23 22:10:43] [INFO ] Invariant cache hit.
[2024-05-23 22:10:43] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/11 places, 7/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 6/11 places, 7/11 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ERK-PT-100000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 0 reset in 87 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=5882 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3047979 steps, run timeout after 3001 ms. (steps per millisecond=1015 ) properties seen :{}
Probabilistic random walk after 3047979 steps, saw 924762 distinct states, run finished after 3006 ms. (steps per millisecond=1013 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 22:10:46] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-23 22:10:46] [INFO ] Invariant cache hit.
[2024-05-23 22:10:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 22:10:46] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 22:10:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 22:10:46] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 22:10:46] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-23 22:10:47] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 99998 steps, including 0 resets, run visited all 1 properties in 85 ms. (steps per millisecond=1176 )
Parikh walk visited 1 properties in 85 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-23 22:10:47] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-23 22:10:47] [INFO ] Invariant cache hit.
[2024-05-23 22:10:47] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-23 22:10:47] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-23 22:10:47] [INFO ] Invariant cache hit.
[2024-05-23 22:10:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-23 22:10:47] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 22:10:47] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-23 22:10:47] [INFO ] Invariant cache hit.
[2024-05-23 22:10:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 6/6 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 100001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=7142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3937838 steps, run timeout after 3001 ms. (steps per millisecond=1312 ) properties seen :{}
Probabilistic random walk after 3937838 steps, saw 1184332 distinct states, run finished after 3001 ms. (steps per millisecond=1312 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 22:10:50] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2024-05-23 22:10:50] [INFO ] Invariant cache hit.
[2024-05-23 22:10:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 22:10:50] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 22:10:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 22:10:50] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 22:10:50] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-23 22:10:50] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 99998 steps, including 0 resets, run visited all 1 properties in 111 ms. (steps per millisecond=900 )
Parikh walk visited 1 properties in 114 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 0 reset in 86 ms.
Built C files in :
/tmp/ltsmin1490149613564922745
[2024-05-23 22:10:51] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2024-05-23 22:10:51] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:10:51] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2024-05-23 22:10:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:10:51] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2024-05-23 22:10:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:10:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1490149613564922745
Running compilation step : cd /tmp/ltsmin1490149613564922745;'/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 94 ms.
Running link step : cd /tmp/ltsmin1490149613564922745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1490149613564922745;'/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/stateBased4384599222778799294.hoa' '--buchi-type=spotba'
LTSmin run took 5894 ms.
FORMULA ERK-PT-100000-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ERK-PT-100000-LTLCardinality-14 finished in 13660 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(X((p1||G(p2))))))))'
[2024-05-23 22:10:57] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6755051824118153411
[2024-05-23 22:10:57] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2024-05-23 22:10:57] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:10:57] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2024-05-23 22:10:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:10:57] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2024-05-23 22:10:57] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 22:10:57] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6755051824118153411
Running compilation step : cd /tmp/ltsmin6755051824118153411;'/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'
[2024-05-23 22:10:57] [INFO ] Applying decomposition
[2024-05-23 22:10:57] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8511850280405805348.txt' '-o' '/tmp/graph8511850280405805348.bin' '-w' '/tmp/graph8511850280405805348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8511850280405805348.bin' '-l' '-1' '-v' '-w' '/tmp/graph8511850280405805348.weights' '-q' '0' '-e' '0.001'
[2024-05-23 22:10:57] [INFO ] Decomposing Gal with order
[2024-05-23 22:10:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 22:10:57] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-23 22:10:57] [INFO ] Flatten gal took : 5 ms
[2024-05-23 22:10:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-23 22:10:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality17270016044792090478.gal : 1 ms
[2024-05-23 22:10:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality10256264023860661562.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/LTLCardinality17270016044792090478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10256264023860661562.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 : !((G(("(gu0.Raf1Star>gu0.MEKPP_ERK)")||(X(X(X(("(gi2.gu3.RP<=gi2.gu3.Raf1Star_RKIP)")||(G("(gu1.Raf1Star_RKIP_ERKPP<=gu1.ERKPP)"))))))...158
Formula 0 simplified : F(!"(gu0.Raf1Star>gu0.MEKPP_ERK)" & XXX(!"(gi2.gu3.RP<=gi2.gu3.Raf1Star_RKIP)" & F!"(gu1.Raf1Star_RKIP_ERKPP<=gu1.ERKPP)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
[2024-05-23 22:10:57] [INFO ] Flatten gal took : 2 ms
[2024-05-23 22:10:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality4883856809893950402.gal : 1 ms
[2024-05-23 22:10:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality8455760826680834923.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/LTLCardinality4883856809893950402.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8455760826680834923.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...297
Read 1 LTL properties
Checking formula 0 : !((G(("(Raf1Star>MEKPP_ERK)")||(X(X(X(("(RP<=Raf1Star_RKIP)")||(G("(Raf1Star_RKIP_ERKPP<=ERKPP)")))))))))
Formula 0 simplified : F(!"(Raf1Star>MEKPP_ERK)" & XXX(!"(RP<=Raf1Star_RKIP)" & F!"(Raf1Star_RKIP_ERKPP<=ERKPP)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
Compilation finished in 139 ms.
Running link step : cd /tmp/ltsmin6755051824118153411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2024-05-23 22:10:57] [INFO ] Flatten gal took : 2 ms
[2024-05-23 22:10:57] [INFO ] Input system was already deterministic with 11 transitions.
[2024-05-23 22:10:57] [INFO ] Transformed 11 places.
[2024-05-23 22:10:57] [INFO ] Transformed 11 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 22:10:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality15015970489983219337.gal : 1 ms
[2024-05-23 22:10:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality7188993886766365062.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/LTLCardinality15015970489983219337.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7188993886766365062.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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(Raf1Star>MEKPP_ERK)")||(X(X(X(("(RP<=Raf1Star_RKIP)")||(G("(Raf1Star_RKIP_ERKPP<=ERKPP)")))))))))
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin6755051824118153411;'/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' '[](((LTLAPp0==true)||X(X(X(((LTLAPp1==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
Formula 0 simplified : F(!"(Raf1Star>MEKPP_ERK)" & XXX(!"(RP<=Raf1Star_RKIP)" & F!"(Raf1Star_RKIP_ERKPP<=ERKPP)"))
terminate called after throwing an instance of 'char const*'
ITS-tools command line returned an error code 134
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: LTL layer: formula: [](((LTLAPp0==true)||X(X(X(((LTLAPp1==true)||[]((LTLAPp2==true))))))))
pins2lts-mc-linux64( 0/ 8), 0.009: "[](((LTLAPp0==true)||X(X(X(((LTLAPp1==true)||[]((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.009: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.020: buchi has 10 states
pins2lts-mc-linux64( 0/ 8), 0.021: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.053: DFS-FIFO for weak LTL, using special progress label 15
pins2lts-mc-linux64( 0/ 8), 0.053: There are 16 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.053: State length is 12, there are 38 groups
pins2lts-mc-linux64( 0/ 8), 0.053: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.053: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.053: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.053: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.136: ~1 levels ~960 states ~6360 transitions
pins2lts-mc-linux64( 5/ 8), 0.150: ~1 levels ~1920 states ~11128 transitions
pins2lts-mc-linux64( 5/ 8), 0.167: ~1 levels ~3840 states ~24000 transitions
pins2lts-mc-linux64( 5/ 8), 0.211: ~1 levels ~7680 states ~50640 transitions
pins2lts-mc-linux64( 3/ 8), 0.327: ~1 levels ~15360 states ~105208 transitions
pins2lts-mc-linux64( 3/ 8), 0.531: ~1 levels ~30720 states ~221200 transitions
pins2lts-mc-linux64( 3/ 8), 0.872: ~1 levels ~61440 states ~450000 transitions
pins2lts-mc-linux64( 3/ 8), 1.501: ~1 levels ~122880 states ~937048 transitions
pins2lts-mc-linux64( 3/ 8), 2.543: ~1 levels ~245760 states ~1930024 transitions
pins2lts-mc-linux64( 3/ 8), 3.973: ~1 levels ~491520 states ~3959808 transitions
pins2lts-mc-linux64( 3/ 8), 5.751: ~1 levels ~983040 states ~8122952 transitions
pins2lts-mc-linux64( 3/ 8), 8.117: ~1 levels ~1966080 states ~16699352 transitions
pins2lts-mc-linux64( 3/ 8), 12.574: ~1 levels ~3932160 states ~34294072 transitions
pins2lts-mc-linux64( 3/ 8), 21.726: ~1 levels ~7864320 states ~70204352 transitions
pins2lts-mc-linux64( 7/ 8), 40.680: ~1 levels ~15728640 states ~141418328 transitions
pins2lts-mc-linux64( 7/ 8), 78.935: ~1 levels ~31457280 states ~288238472 transitions
pins2lts-mc-linux64( 7/ 8), 157.744: ~1 levels ~62914560 states ~583959504 transitions
pins2lts-mc-linux64( 7/ 8), 331.893: ~1 levels ~125829120 states ~1187156760 transitions
pins2lts-mc-linux64( 6/ 8), 411.626: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 411.697:
pins2lts-mc-linux64( 0/ 8), 411.697: mean standard work distribution: 6.0% (states) 4.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 411.697:
pins2lts-mc-linux64( 0/ 8), 411.697: Explored 129305499 states 1288199357 transitions, fanout: 9.962
pins2lts-mc-linux64( 0/ 8), 411.697: Total exploration time 411.620 sec (411.580 sec minimum, 411.599 sec on average)
pins2lts-mc-linux64( 0/ 8), 411.697: States per second: 314138, Transitions per second: 3129584
pins2lts-mc-linux64( 0/ 8), 411.697:
pins2lts-mc-linux64( 0/ 8), 411.697: Progress states detected: 134217041
pins2lts-mc-linux64( 0/ 8), 411.697: Redundant explorations: -3.6596
pins2lts-mc-linux64( 0/ 8), 411.697:
pins2lts-mc-linux64( 0/ 8), 411.697: Queue width: 8B, total height: 10213742, memory: 77.92MB
pins2lts-mc-linux64( 0/ 8), 411.697: Tree memory: 1069.4MB, 8.4 B/state, compr.: 16.7%
pins2lts-mc-linux64( 0/ 8), 411.697: Tree fill ratio (roots/leafs): 99.0%/17.0%
pins2lts-mc-linux64( 0/ 8), 411.697: Stored 11 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 411.698: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 411.698: Est. total memory use: 1147.3MB (~1101.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6755051824118153411;'/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' '[](((LTLAPp0==true)||X(X(X(((LTLAPp1==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6755051824118153411;'/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' '[](((LTLAPp0==true)||X(X(X(((LTLAPp1==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)
Total runtime 571414 ms.

BK_STOP 1716502670476

--------------------
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="ERK-PT-100000"
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 ERK-PT-100000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-smll-171636279800042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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