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.r649-smll-171774451500033.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 ResIsolation-PT-N09P2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r649-smll-171774451500033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 5.8K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 21M Jun 7 06:26 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 ResIsolation-PT-N09P2-LTLFireability-00
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-01
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-02
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-03
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-04
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-05
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-06
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-07
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-08
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-09
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-10
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-11
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-12
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-13
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-14
FORMULA_NAME ResIsolation-PT-N09P2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717777453387

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResIsolation-PT-N09P2
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-07 16:24:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 16:24:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 16:24:17] [INFO ] Load time of PNML (sax parser for PT used): 1732 ms
[2024-06-07 16:24:17] [INFO ] Transformed 338 places.
[2024-06-07 16:24:18] [INFO ] Transformed 18735 transitions.
[2024-06-07 16:24:18] [INFO ] Found NUPN structural information;
[2024-06-07 16:24:18] [INFO ] Parsed PT model containing 338 places and 18735 transitions and 406120 arcs in 2020 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ResIsolation-PT-N09P2-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N09P2-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N09P2-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N09P2-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 338 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 18735/18735 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 327 transition count 18735
Discarding 184 places :
Symmetric choice reduction at 1 with 184 rule applications. Total rules 195 place count 143 transition count 18551
Iterating global reduction 1 with 184 rules applied. Total rules applied 379 place count 143 transition count 18551
Ensure Unique test removed 1541 transitions
Reduce isomorphic transitions removed 1541 transitions.
Iterating post reduction 1 with 1541 rules applied. Total rules applied 1920 place count 143 transition count 17010
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1939 place count 124 transition count 16991
Iterating global reduction 2 with 19 rules applied. Total rules applied 1958 place count 124 transition count 16991
Applied a total of 1958 rules in 629 ms. Remains 124 /338 variables (removed 214) and now considering 16991/18735 (removed 1744) transitions.
// Phase 1: matrix 16991 rows 124 cols
[2024-06-07 16:24:19] [INFO ] Computed 0 invariants in 541 ms
[2024-06-07 16:24:20] [INFO ] Implicit Places using invariants in 989 ms returned []
Implicit Place search using SMT only with invariants took 1078 ms to find 0 implicit places.
[2024-06-07 16:24:20] [INFO ] Invariant cache hit.
[2024-06-07 16:24:30] [INFO ] Dead Transitions using invariants and state equation in 10290 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/338 places, 16991/18735 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12014 ms. Remains : 124/338 places, 16991/18735 transitions.
Support contains 46 out of 124 places after structural reductions.
[2024-06-07 16:24:35] [INFO ] Flatten gal took : 4072 ms
[2024-06-07 16:24:38] [INFO ] Flatten gal took : 3462 ms
[2024-06-07 16:24:44] [INFO ] Input system was already deterministic with 16991 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1397 ms. (steps per millisecond=7 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 46121 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 46121 steps, saw 23594 distinct states, run finished after 3003 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 25 properties.
[2024-06-07 16:24:49] [INFO ] Invariant cache hit.
[2024-06-07 16:24:50] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:24
[2024-06-07 16:25:13] [INFO ] After 22557ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :23
[2024-06-07 16:25:16] [INFO ] After 24856ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :23
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-06-07 16:25:16] [INFO ] After 25205ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :23
Fused 25 Parikh solutions to 19 different solutions.
Parikh walk visited 20 properties in 514 ms.
Support contains 20 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Graph (complete) has 1022 edges and 124 vertex of which 122 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.146 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 122 transition count 16953
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 62 place count 97 transition count 16953
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 4 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 120 place count 68 transition count 16924
Free-agglomeration rule applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 130 place count 68 transition count 16914
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 3072 transitions
Reduce isomorphic transitions removed 3072 transitions.
Iterating post reduction 2 with 3082 rules applied. Total rules applied 3212 place count 58 transition count 13842
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3213 place count 58 transition count 13841
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3214 place count 57 transition count 13840
Applied a total of 3214 rules in 14275 ms. Remains 57 /124 variables (removed 67) and now considering 13840/16991 (removed 3151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14277 ms. Remains : 57/124 places, 13840/16991 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2092 ms. (steps per millisecond=4 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 13840 rows 57 cols
[2024-06-07 16:25:33] [INFO ] Computed 11 invariants in 221 ms
[2024-06-07 16:25:33] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-07 16:25:40] [INFO ] After 6831ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-06-07 16:25:40] [INFO ] After 7462ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 400 ms.
[2024-06-07 16:25:41] [INFO ] After 7922ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2024-06-07 16:25:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2024-06-07 16:25:48] [INFO ] After 6860ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-07 16:25:49] [INFO ] After 7996ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 863 ms.
[2024-06-07 16:25:50] [INFO ] After 8899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=2 )
Parikh walk visited 2 properties in 30 ms.
Computed a total of 42 stabilizing places and 53 stable transitions
Graph (complete) has 1022 edges and 124 vertex of which 122 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.405 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) U p1)))'
Support contains 26 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Applied a total of 0 rules in 101 ms. Remains 124 /124 variables (removed 0) and now considering 16991/16991 (removed 0) transitions.
// Phase 1: matrix 16991 rows 124 cols
[2024-06-07 16:25:51] [INFO ] Computed 0 invariants in 476 ms
[2024-06-07 16:25:53] [INFO ] Implicit Places using invariants in 2514 ms returned []
Implicit Place search using SMT only with invariants took 2515 ms to find 0 implicit places.
[2024-06-07 16:25:53] [INFO ] Invariant cache hit.
[2024-06-07 16:26:03] [INFO ] Dead Transitions using invariants and state equation in 9881 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12505 ms. Remains : 124/124 places, 16991/16991 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 365 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N09P2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NOT (OR (AND (EQ s12 1) (EQ s46 1) (EQ s58 1) (EQ s63 1) (EQ s74 1) (EQ s79 1) (EQ s87 1) (EQ s95 1) (EQ s103 1) (EQ s114 1) (EQ s119 1)) (AND (E...], 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 4 ms.
FORMULA ResIsolation-PT-N09P2-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N09P2-LTLFireability-00 finished in 13034 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&&G((p1||X(p2)))&&X(G(p3)))))'
Support contains 20 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Applied a total of 0 rules in 117 ms. Remains 124 /124 variables (removed 0) and now considering 16991/16991 (removed 0) transitions.
[2024-06-07 16:26:04] [INFO ] Invariant cache hit.
[2024-06-07 16:26:07] [INFO ] Implicit Places using invariants in 3102 ms returned []
Implicit Place search using SMT only with invariants took 3104 ms to find 0 implicit places.
[2024-06-07 16:26:07] [INFO ] Invariant cache hit.
[2024-06-07 16:26:18] [INFO ] Dead Transitions using invariants and state equation in 10849 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14076 ms. Remains : 124/124 places, 16991/16991 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, (OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : ResIsolation-PT-N09P2-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 0}, { cond=(AND p1 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2 p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s24 0) (EQ s46 0) (EQ s55 0) (EQ s63 0) (EQ s74 0) (EQ s82 0) (EQ s87 0) (EQ s95 0) (EQ s103 0) (EQ s111 0) (EQ s119 0)), p1:(AND (EQ s24 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ResIsolation-PT-N09P2-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N09P2-LTLFireability-01 finished in 14451 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 U G(p1)) U !((p0 U p2)&&X(p0)))||p0)))'
Support contains 21 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Applied a total of 0 rules in 124 ms. Remains 124 /124 variables (removed 0) and now considering 16991/16991 (removed 0) transitions.
[2024-06-07 16:26:18] [INFO ] Invariant cache hit.
[2024-06-07 16:26:21] [INFO ] Implicit Places using invariants in 2305 ms returned []
Implicit Place search using SMT only with invariants took 2307 ms to find 0 implicit places.
[2024-06-07 16:26:21] [INFO ] Invariant cache hit.
[2024-06-07 16:26:30] [INFO ] Dead Transitions using invariants and state equation in 9820 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12258 ms. Remains : 124/124 places, 16991/16991 transitions.
Stuttering acceptance computed with spot in 418 ms :[false, false, p0, (AND p0 p2), (AND (NOT p1) p0), true, (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : ResIsolation-PT-N09P2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p0 p2), acceptance={} source=3 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=6 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=p0, acceptance={} source=7 dest: 9}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 8}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=10 dest: 8}]], initial=0, aps=[p0:(AND (EQ s24 1) (EQ s46 1) (EQ s58 1) (EQ s66 1) (EQ s74 1) (EQ s82 1) (EQ s90 1) (EQ s98 1) (EQ s106 1) (EQ s114 1) (EQ s122 1)), p2:(AND (EQ s24 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1999 ms.
Product exploration explored 100000 steps with 50000 reset in 1607 ms.
Computed a total of 42 stabilizing places and 53 stable transitions
Graph (complete) has 1022 edges and 124 vertex of which 122 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.251 ms
Computed a total of 42 stabilizing places and 53 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 23 ms. Reduced automaton from 11 states, 23 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N09P2-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N09P2-LTLFireability-02 finished in 16785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(F(p1) U p2)&&F(p3))))'
Support contains 22 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Graph (trivial) has 68 edges and 124 vertex of which 3 / 124 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1019 edges and 122 vertex of which 120 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.465 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 119 transition count 16974
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 107 transition count 16974
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 26 place count 107 transition count 16963
Deduced a syphon composed of 11 places in 17 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 48 place count 96 transition count 16963
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 6 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 82 place count 79 transition count 16946
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 76 transition count 16954
Applied a total of 88 rules in 20765 ms. Remains 76 /124 variables (removed 48) and now considering 16954/16991 (removed 37) transitions.
// Phase 1: matrix 16954 rows 76 cols
[2024-06-07 16:26:56] [INFO ] Computed 0 invariants in 441 ms
[2024-06-07 16:26:58] [INFO ] Implicit Places using invariants in 2628 ms returned []
Implicit Place search using SMT only with invariants took 2633 ms to find 0 implicit places.
[2024-06-07 16:26:58] [INFO ] Invariant cache hit.
[2024-06-07 16:27:08] [INFO ] Dead Transitions using invariants and state equation in 9852 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/124 places, 16954/16991 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33253 ms. Remains : 76/124 places, 16954/16991 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : ResIsolation-PT-N09P2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s24 1) (EQ s29 1) (EQ s34 1) (EQ s40 1) (EQ s46 1) (EQ s50 1) (EQ s56 1) (EQ s63 1) (EQ s67 1) (EQ s75 1)), p2:(AND (EQ s12 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA ResIsolation-PT-N09P2-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N09P2-LTLFireability-03 finished in 33548 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 11 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Graph (trivial) has 79 edges and 124 vertex of which 15 / 124 are part of one of the 5 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 1007 edges and 114 vertex of which 112 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.82 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 111 transition count 16964
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 97 transition count 16964
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 97 transition count 16953
Deduced a syphon composed of 11 places in 15 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 86 transition count 16953
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 78 place count 73 transition count 16940
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 70 transition count 16948
Applied a total of 84 rules in 43914 ms. Remains 70 /124 variables (removed 54) and now considering 16948/16991 (removed 43) transitions.
[2024-06-07 16:27:52] [INFO ] Flow matrix only has 16944 transitions (discarded 4 similar events)
// Phase 1: matrix 16944 rows 70 cols
[2024-06-07 16:27:53] [INFO ] Computed 0 invariants in 250 ms
[2024-06-07 16:27:56] [INFO ] Implicit Places using invariants in 3180 ms returned []
Implicit Place search using SMT only with invariants took 3189 ms to find 0 implicit places.
[2024-06-07 16:27:56] [INFO ] Flow matrix only has 16944 transitions (discarded 4 similar events)
[2024-06-07 16:27:56] [INFO ] Invariant cache hit.
[2024-06-07 16:28:06] [INFO ] Dead Transitions using invariants and state equation in 10534 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/124 places, 16948/16991 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57649 ms. Remains : 70/124 places, 16948/16991 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N09P2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s22 1) (EQ s26 1) (EQ s31 1) (EQ s36 1) (EQ s41 1) (EQ s47 1) (EQ s52 1) (EQ s58 1) (EQ s64 1) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 8189 ms.
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA ResIsolation-PT-N09P2-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N09P2-LTLFireability-05 finished in 65949 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&&X((!p0 U ((!p1&&X(p1))||G(!p0)||X(G(p1)))))))))'
Support contains 17 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Applied a total of 0 rules in 111 ms. Remains 124 /124 variables (removed 0) and now considering 16991/16991 (removed 0) transitions.
// Phase 1: matrix 16991 rows 124 cols
[2024-06-07 16:28:15] [INFO ] Computed 0 invariants in 382 ms
[2024-06-07 16:28:18] [INFO ] Implicit Places using invariants in 3477 ms returned []
Implicit Place search using SMT only with invariants took 3478 ms to find 0 implicit places.
[2024-06-07 16:28:18] [INFO ] Invariant cache hit.
[2024-06-07 16:28:28] [INFO ] Dead Transitions using invariants and state equation in 9760 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13351 ms. Remains : 124/124 places, 16991/16991 transitions.
Stuttering acceptance computed with spot in 273 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ResIsolation-PT-N09P2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s24 1) (EQ s46 1) (EQ s56 1) (EQ s66 1) (EQ s72 1) (EQ s80 1) (EQ s90 1) (EQ s98 1) (EQ s106 1) (EQ s112 1) (EQ s122 1)), p1:(AND (EQ s24 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6017 ms.
Product exploration explored 100000 steps with 0 reset in 6381 ms.
Computed a total of 42 stabilizing places and 53 stable transitions
Graph (complete) has 1022 edges and 124 vertex of which 122 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.230 ms
Computed a total of 42 stabilizing places and 53 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 146 ms. Reduced automaton from 7 states, 21 edges and 2 AP (stutter sensitive) to 7 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1314 ms. (steps per millisecond=7 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 85541 steps, run timeout after 6001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 85541 steps, saw 30200 distinct states, run finished after 6002 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 5 properties.
[2024-06-07 16:28:50] [INFO ] Invariant cache hit.
[2024-06-07 16:28:58] [INFO ] After 7647ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:3
[2024-06-07 16:28:59] [INFO ] After 8566ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 661 ms.
[2024-06-07 16:28:59] [INFO ] After 9305ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:3
[2024-06-07 16:29:09] [INFO ] After 9314ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-06-07 16:29:13] [INFO ] After 13612ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 2445 ms.
[2024-06-07 16:29:16] [INFO ] After 16149ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 67 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=6 )
Parikh walk visited 4 properties in 39 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 526 ms. Reduced automaton from 7 states, 21 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 286 ms :[p0, p0, p0, p0, p0]
Support contains 17 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Applied a total of 0 rules in 174 ms. Remains 124 /124 variables (removed 0) and now considering 16991/16991 (removed 0) transitions.
[2024-06-07 16:29:17] [INFO ] Invariant cache hit.
[2024-06-07 16:29:20] [INFO ] Implicit Places using invariants in 3476 ms returned []
Implicit Place search using SMT only with invariants took 3477 ms to find 0 implicit places.
[2024-06-07 16:29:20] [INFO ] Invariant cache hit.
[2024-06-07 16:29:29] [INFO ] Dead Transitions using invariants and state equation in 9015 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12670 ms. Remains : 124/124 places, 16991/16991 transitions.
Computed a total of 42 stabilizing places and 53 stable transitions
Graph (complete) has 1022 edges and 124 vertex of which 122 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.229 ms
Computed a total of 42 stabilizing places and 53 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[p0, p0, p0, p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1174 ms. (steps per millisecond=8 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 42391 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 42391 steps, saw 22313 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-07 16:29:35] [INFO ] Invariant cache hit.
[2024-06-07 16:29:43] [INFO ] After 8221ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-06-07 16:29:44] [INFO ] After 8970ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 431 ms.
[2024-06-07 16:29:44] [INFO ] After 9463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2024-06-07 16:29:53] [INFO ] After 8687ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-07 16:29:55] [INFO ] After 10903ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1202 ms.
[2024-06-07 16:29:57] [INFO ] After 12169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 67 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=8 )
Parikh walk visited 3 properties in 27 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 192 ms :[p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 188 ms :[p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 0 reset in 5821 ms.
Product exploration explored 100000 steps with 0 reset in 5612 ms.
Built C files in :
/tmp/ltsmin12005506294201911588
[2024-06-07 16:30:10] [INFO ] Built C files in 548ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12005506294201911588
Running compilation step : cd /tmp/ltsmin12005506294201911588;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12005506294201911588;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12005506294201911588;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 17 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Applied a total of 0 rules in 123 ms. Remains 124 /124 variables (removed 0) and now considering 16991/16991 (removed 0) transitions.
[2024-06-07 16:30:13] [INFO ] Invariant cache hit.
[2024-06-07 16:30:15] [INFO ] Implicit Places using invariants in 2455 ms returned []
Implicit Place search using SMT only with invariants took 2457 ms to find 0 implicit places.
[2024-06-07 16:30:15] [INFO ] Invariant cache hit.
[2024-06-07 16:30:27] [INFO ] Dead Transitions using invariants and state equation in 11313 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13895 ms. Remains : 124/124 places, 16991/16991 transitions.
Built C files in :
/tmp/ltsmin1501741126310159538
[2024-06-07 16:30:27] [INFO ] Built C files in 419ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1501741126310159538
Running compilation step : cd /tmp/ltsmin1501741126310159538;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1501741126310159538;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1501741126310159538;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 16:30:36] [INFO ] Flatten gal took : 3167 ms
[2024-06-07 16:30:39] [INFO ] Flatten gal took : 3052 ms
[2024-06-07 16:30:39] [INFO ] Time to serialize gal into /tmp/LTL11301526180755052952.gal : 422 ms
[2024-06-07 16:30:39] [INFO ] Time to serialize properties into /tmp/LTL517707195548527700.prop : 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/LTL11301526180755052952.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15016675151854570070.hoa' '-atoms' '/tmp/LTL517707195548527700.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/LTL517707195548527700.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15016675151854570070.hoa
Detected timeout of ITS tools.
[2024-06-07 16:31:00] [INFO ] Flatten gal took : 3275 ms
[2024-06-07 16:31:03] [INFO ] Flatten gal took : 2907 ms
[2024-06-07 16:31:03] [INFO ] Time to serialize gal into /tmp/LTL15594784853458992535.gal : 325 ms
[2024-06-07 16:31:03] [INFO ] Time to serialize properties into /tmp/LTL16508782915227681545.ltl : 2 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/LTL15594784853458992535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16508782915227681545.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(F((X((!("(((((p38==1)&&(p76==1))&&((p103==1)&&(p135==1)))&&(((p159==1)&&(p187==1))&&((p219==1)&&(p247==1))))&&(((p275==1)&&(p299=...919
Formula 0 simplified : FG(!"(((((p38!=1)||(p76!=1))||((p103!=1)||(p135!=1)))||(((p159!=1)||(p187!=1))||((p219!=1)||(p247!=1))))||(((p275!=1)||(p299!=1))||(...747
Detected timeout of ITS tools.
[2024-06-07 16:31:21] [INFO ] Flatten gal took : 3047 ms
[2024-06-07 16:31:21] [INFO ] Applying decomposition
[2024-06-07 16:31:24] [INFO ] Flatten gal took : 2899 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/graph13948136064413679154.txt' '-o' '/tmp/graph13948136064413679154.bin' '-w' '/tmp/graph13948136064413679154.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13948136064413679154.bin' '-l' '-1' '-v' '-w' '/tmp/graph13948136064413679154.weights' '-q' '0' '-e' '0.001'
[2024-06-07 16:31:32] [INFO ] Decomposing Gal with order
[2024-06-07 16:31:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 16:31:41] [INFO ] Removed a total of 192776 redundant transitions.
[2024-06-07 16:31:42] [INFO ] Flatten gal took : 7637 ms
[2024-06-07 16:31:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 1641 ms.
[2024-06-07 16:31:45] [INFO ] Time to serialize gal into /tmp/LTL17737748929329735170.gal : 205 ms
[2024-06-07 16:31:45] [INFO ] Time to serialize properties into /tmp/LTL12879214349952964684.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/LTL17737748929329735170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12879214349952964684.ltl' '-c' '-stutter-deadlock'

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...256
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1972409545460224172
[2024-06-07 16:32:00] [INFO ] Built C files in 406ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1972409545460224172
Running compilation step : cd /tmp/ltsmin1972409545460224172;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1972409545460224172;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1972409545460224172;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ResIsolation-PT-N09P2-LTLFireability-06 finished in 228603 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 11 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Graph (complete) has 1022 edges and 124 vertex of which 122 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.81 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 121 transition count 16974
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 107 transition count 16974
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 107 transition count 16963
Deduced a syphon composed of 11 places in 10 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 96 transition count 16963
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 87 place count 78 transition count 16945
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 75 transition count 16953
Applied a total of 93 rules in 4788 ms. Remains 75 /124 variables (removed 49) and now considering 16953/16991 (removed 38) transitions.
// Phase 1: matrix 16953 rows 75 cols
[2024-06-07 16:32:08] [INFO ] Computed 0 invariants in 266 ms
[2024-06-07 16:32:11] [INFO ] Implicit Places using invariants in 3348 ms returned []
Implicit Place search using SMT only with invariants took 3354 ms to find 0 implicit places.
[2024-06-07 16:32:11] [INFO ] Invariant cache hit.
[2024-06-07 16:32:20] [INFO ] Dead Transitions using invariants and state equation in 8655 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/124 places, 16953/16991 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16801 ms. Remains : 75/124 places, 16953/16991 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N09P2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s22 1) (EQ s27 1) (EQ s32 1) (EQ s38 1) (EQ s44 1) (EQ s50 1) (EQ s56 1) (EQ s62 1) (EQ s68 1) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 8256 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA ResIsolation-PT-N09P2-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N09P2-LTLFireability-07 finished in 25164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((F(p1)&&p0)))||F(p2))))'
Support contains 21 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Applied a total of 0 rules in 100 ms. Remains 124 /124 variables (removed 0) and now considering 16991/16991 (removed 0) transitions.
// Phase 1: matrix 16991 rows 124 cols
[2024-06-07 16:32:29] [INFO ] Computed 0 invariants in 288 ms
[2024-06-07 16:32:31] [INFO ] Implicit Places using invariants in 2708 ms returned []
Implicit Place search using SMT only with invariants took 2713 ms to find 0 implicit places.
[2024-06-07 16:32:31] [INFO ] Invariant cache hit.
[2024-06-07 16:32:40] [INFO ] Dead Transitions using invariants and state equation in 9250 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12070 ms. Remains : 124/124 places, 16991/16991 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ResIsolation-PT-N09P2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (NEQ s12 1) (NEQ s34 1) (NEQ s55 1) (NEQ s63 1) (NEQ s74 1) (NEQ s79 1) (NEQ s87 1) (NEQ s95 1) (NEQ s106 1) (NEQ s114 1) (NEQ s119 1)), p0:(AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1140 ms.
Product exploration explored 100000 steps with 50000 reset in 1159 ms.
Computed a total of 42 stabilizing places and 53 stable transitions
Graph (complete) has 1022 edges and 124 vertex of which 122 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.221 ms
Computed a total of 42 stabilizing places and 53 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N09P2-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N09P2-LTLFireability-09 finished in 14973 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(X(X(F((!(G(p0) U !p1)&&p2))))))'
Support contains 19 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Applied a total of 0 rules in 109 ms. Remains 124 /124 variables (removed 0) and now considering 16991/16991 (removed 0) transitions.
[2024-06-07 16:32:43] [INFO ] Invariant cache hit.
[2024-06-07 16:32:46] [INFO ] Implicit Places using invariants in 2589 ms returned []
Implicit Place search using SMT only with invariants took 2594 ms to find 0 implicit places.
[2024-06-07 16:32:46] [INFO ] Invariant cache hit.
[2024-06-07 16:32:56] [INFO ] Dead Transitions using invariants and state equation in 10015 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12723 ms. Remains : 124/124 places, 16991/16991 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : ResIsolation-PT-N09P2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p2 p0 p1), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND p0 (NOT p1))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s18 0) (EQ s40 0) (EQ s56 0) (EQ s66 0) (EQ s72 0) (EQ s82 0) (EQ s88 0) (EQ s98 0) (EQ s104 0) (EQ s112 0) (EQ s120 0)), p1:(AND (EQ s24 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6179 ms.
Stack based approach found an accepted trace after 49 steps with 0 reset with depth 50 and stack size 50 in 3 ms.
FORMULA ResIsolation-PT-N09P2-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N09P2-LTLFireability-10 finished in 19187 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)))'
Support contains 11 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Applied a total of 0 rules in 119 ms. Remains 124 /124 variables (removed 0) and now considering 16991/16991 (removed 0) transitions.
[2024-06-07 16:33:03] [INFO ] Invariant cache hit.
[2024-06-07 16:33:07] [INFO ] Implicit Places using invariants in 3978 ms returned []
Implicit Place search using SMT only with invariants took 3984 ms to find 0 implicit places.
[2024-06-07 16:33:07] [INFO ] Invariant cache hit.
[2024-06-07 16:33:15] [INFO ] Dead Transitions using invariants and state equation in 8835 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12941 ms. Remains : 124/124 places, 16991/16991 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N09P2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s24 1) (EQ s46 1) (EQ s55 1) (EQ s63 1) (EQ s74 1) (EQ s82 1) (EQ s90 1) (EQ s98 1) (EQ s103 1) (EQ s111 1) (EQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResIsolation-PT-N09P2-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N09P2-LTLFireability-11 finished in 13094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 17 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Applied a total of 0 rules in 106 ms. Remains 124 /124 variables (removed 0) and now considering 16991/16991 (removed 0) transitions.
[2024-06-07 16:33:16] [INFO ] Invariant cache hit.
[2024-06-07 16:33:18] [INFO ] Implicit Places using invariants in 2342 ms returned []
Implicit Place search using SMT only with invariants took 2360 ms to find 0 implicit places.
[2024-06-07 16:33:18] [INFO ] Invariant cache hit.
[2024-06-07 16:33:28] [INFO ] Dead Transitions using invariants and state equation in 9830 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12306 ms. Remains : 124/124 places, 16991/16991 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N09P2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s24 1) (EQ s46 1) (EQ s58 1) (EQ s64 1) (EQ s74 1) (EQ s80 1) (EQ s90 1) (EQ s98 1) (EQ s104 1) (EQ s112 1) (EQ s122 1) (OR (EQ s24 0) (EQ s39...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 5766 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 4 ms.
FORMULA ResIsolation-PT-N09P2-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N09P2-LTLFireability-12 finished in 18253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 11 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Applied a total of 0 rules in 120 ms. Remains 124 /124 variables (removed 0) and now considering 16991/16991 (removed 0) transitions.
[2024-06-07 16:33:34] [INFO ] Invariant cache hit.
[2024-06-07 16:33:37] [INFO ] Implicit Places using invariants in 3465 ms returned []
Implicit Place search using SMT only with invariants took 3466 ms to find 0 implicit places.
[2024-06-07 16:33:37] [INFO ] Invariant cache hit.
[2024-06-07 16:33:48] [INFO ] Dead Transitions using invariants and state equation in 10613 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14202 ms. Remains : 124/124 places, 16991/16991 transitions.
Stuttering acceptance computed with spot in 318 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N09P2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(OR (EQ s17 0) (EQ s39 0) (EQ s56 0) (EQ s66 0) (EQ s74 0) (EQ s82 0) (EQ s88 0) (EQ s96 0) (EQ s106 0) (EQ s114 0) (EQ s122 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6213 ms.
Product exploration explored 100000 steps with 0 reset in 5922 ms.
Computed a total of 42 stabilizing places and 53 stable transitions
Graph (complete) has 1022 edges and 124 vertex of which 122 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.223 ms
Computed a total of 42 stabilizing places and 53 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 875 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 48141 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 48141 steps, saw 24263 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-07 16:34:05] [INFO ] Invariant cache hit.
[2024-06-07 16:34:05] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 16:34:13] [INFO ] After 8051ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 16:34:14] [INFO ] After 8763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 416 ms.
[2024-06-07 16:34:15] [INFO ] After 9219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 69 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Applied a total of 0 rules in 121 ms. Remains 124 /124 variables (removed 0) and now considering 16991/16991 (removed 0) transitions.
[2024-06-07 16:34:15] [INFO ] Invariant cache hit.
[2024-06-07 16:34:19] [INFO ] Implicit Places using invariants in 3792 ms returned []
Implicit Place search using SMT only with invariants took 3794 ms to find 0 implicit places.
[2024-06-07 16:34:19] [INFO ] Invariant cache hit.
[2024-06-07 16:34:28] [INFO ] Dead Transitions using invariants and state equation in 8545 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12465 ms. Remains : 124/124 places, 16991/16991 transitions.
Computed a total of 42 stabilizing places and 53 stable transitions
Graph (complete) has 1022 edges and 124 vertex of which 122 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.223 ms
Computed a total of 42 stabilizing places and 53 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 692 ms. (steps per millisecond=14 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 47921 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47921 steps, saw 24192 distinct states, run finished after 3002 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-07 16:34:32] [INFO ] Invariant cache hit.
[2024-06-07 16:34:32] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 16:34:40] [INFO ] After 7851ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 16:34:41] [INFO ] After 8563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 402 ms.
[2024-06-07 16:34:41] [INFO ] After 9002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 69 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 317 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 5781 ms.
Product exploration explored 100000 steps with 0 reset in 5839 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Graph (trivial) has 75 edges and 124 vertex of which 9 / 124 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1013 edges and 118 vertex of which 116 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.81 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 116 transition count 16983
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 16 place count 116 transition count 16994
Deduced a syphon composed of 25 places in 15 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 27 place count 116 transition count 16994
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 108 transition count 16986
Deduced a syphon composed of 17 places in 15 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 108 transition count 16986
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 35 places in 5 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 61 place count 108 transition count 16987
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 105 transition count 16983
Deduced a syphon composed of 32 places in 5 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 105 transition count 16983
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 35 places in 6 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 105 transition count 17020
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 102 transition count 17014
Deduced a syphon composed of 32 places in 5 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 102 transition count 17014
Deduced a syphon composed of 32 places in 5 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 102 transition count 17013
Deduced a syphon composed of 32 places in 4 ms
Applied a total of 77 rules in 89821 ms. Remains 102 /124 variables (removed 22) and now considering 17013/16991 (removed -22) transitions.
[2024-06-07 16:36:24] [INFO ] Flow matrix only has 17011 transitions (discarded 2 similar events)
// Phase 1: matrix 17011 rows 102 cols
[2024-06-07 16:36:24] [INFO ] Computed 0 invariants in 321 ms
[2024-06-07 16:36:33] [INFO ] Dead Transitions using invariants and state equation in 9410 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/124 places, 17013/16991 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99234 ms. Remains : 102/124 places, 17013/16991 transitions.
Built C files in :
/tmp/ltsmin15372559996977988019
[2024-06-07 16:36:34] [INFO ] Built C files in 382ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15372559996977988019
Running compilation step : cd /tmp/ltsmin15372559996977988019;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15372559996977988019;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15372559996977988019;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 11 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Applied a total of 0 rules in 127 ms. Remains 124 /124 variables (removed 0) and now considering 16991/16991 (removed 0) transitions.
// Phase 1: matrix 16991 rows 124 cols
[2024-06-07 16:36:37] [INFO ] Computed 0 invariants in 283 ms
[2024-06-07 16:36:41] [INFO ] Implicit Places using invariants in 3735 ms returned []
Implicit Place search using SMT only with invariants took 3737 ms to find 0 implicit places.
[2024-06-07 16:36:41] [INFO ] Invariant cache hit.
[2024-06-07 16:36:50] [INFO ] Dead Transitions using invariants and state equation in 8960 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12825 ms. Remains : 124/124 places, 16991/16991 transitions.
Built C files in :
/tmp/ltsmin15840245194494700132
[2024-06-07 16:36:50] [INFO ] Built C files in 340ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15840245194494700132
Running compilation step : cd /tmp/ltsmin15840245194494700132;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15840245194494700132;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15840245194494700132;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-06-07 16:36:59] [INFO ] Flatten gal took : 3332 ms
[2024-06-07 16:37:02] [INFO ] Flatten gal took : 3023 ms
[2024-06-07 16:37:02] [INFO ] Time to serialize gal into /tmp/LTL17325189248096801144.gal : 330 ms
[2024-06-07 16:37:02] [INFO ] Time to serialize properties into /tmp/LTL4726309100456679299.prop : 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/LTL17325189248096801144.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1837321650710741666.hoa' '-atoms' '/tmp/LTL4726309100456679299.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/LTL4726309100456679299.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1837321650710741666.hoa
Detected timeout of ITS tools.
[2024-06-07 16:37:22] [INFO ] Flatten gal took : 2980 ms
[2024-06-07 16:37:25] [INFO ] Flatten gal took : 2854 ms
[2024-06-07 16:37:25] [INFO ] Time to serialize gal into /tmp/LTL17669093326600948090.gal : 379 ms
[2024-06-07 16:37:25] [INFO ] Time to serialize properties into /tmp/LTL11415502538911673599.ltl : 2 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/LTL17669093326600948090.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11415502538911673599.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(G("(((((p28==0)||(p66==0))||((p103==0)||(p135==0)))||(((p163==0)||(p191==0))||((p215==0)||(p243==0))))||(((p275==0)||(p30...183
Formula 0 simplified : XXXXXF!"(((((p28==0)||(p66==0))||((p103==0)||(p135==0)))||(((p163==0)||(p191==0))||((p215==0)||(p243==0))))||(((p275==0)||(p303==0))...169
Detected timeout of ITS tools.
[2024-06-07 16:37:44] [INFO ] Flatten gal took : 2911 ms
[2024-06-07 16:37:44] [INFO ] Applying decomposition
[2024-06-07 16:37:46] [INFO ] Flatten gal took : 2919 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/graph8491687277737524280.txt' '-o' '/tmp/graph8491687277737524280.bin' '-w' '/tmp/graph8491687277737524280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8491687277737524280.bin' '-l' '-1' '-v' '-w' '/tmp/graph8491687277737524280.weights' '-q' '0' '-e' '0.001'
[2024-06-07 16:37:54] [INFO ] Decomposing Gal with order
[2024-06-07 16:37:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 16:38:00] [INFO ] Removed a total of 191786 redundant transitions.
[2024-06-07 16:38:01] [INFO ] Flatten gal took : 4955 ms
[2024-06-07 16:38:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 1295 ms.
[2024-06-07 16:38:03] [INFO ] Time to serialize gal into /tmp/LTL13752654207500942458.gal : 122 ms
[2024-06-07 16:38:03] [INFO ] Time to serialize properties into /tmp/LTL11938442677700891069.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/LTL13752654207500942458.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11938442677700891069.ltl' '-c' '-stutter-deadlock'

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...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(G("(((((i3.u20.p28==0)||(u12.p66==0))||((i3.u19.p103==0)||(i3.u19.p135==0)))||(((i3.u21.p163==0)||(i3.u23.p191==0))||((i3...257
Formula 0 simplified : XXXXXF!"(((((i3.u20.p28==0)||(u12.p66==0))||((i3.u19.p103==0)||(i3.u19.p135==0)))||(((i3.u21.p163==0)||(i3.u23.p191==0))||((i3.u19.p...243
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2753371747973046864
[2024-06-07 16:38:18] [INFO ] Built C files in 357ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2753371747973046864
Running compilation step : cd /tmp/ltsmin2753371747973046864;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2753371747973046864;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2753371747973046864;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ResIsolation-PT-N09P2-LTLFireability-14 finished in 287262 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&&X((!p0 U ((!p1&&X(p1))||G(!p0)||X(G(p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Found a Lengthening insensitive property : ResIsolation-PT-N09P2-LTLFireability-14
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 11 out of 124 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 124/124 places, 16991/16991 transitions.
Graph (trivial) has 75 edges and 124 vertex of which 9 / 124 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1013 edges and 118 vertex of which 116 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.126 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 115 transition count 16968
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 30 place count 101 transition count 16968
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 30 place count 101 transition count 16955
Deduced a syphon composed of 13 places in 14 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 56 place count 88 transition count 16955
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 7 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 86 place count 73 transition count 16940
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 92 place count 70 transition count 16948
Applied a total of 92 rules in 2189 ms. Remains 70 /124 variables (removed 54) and now considering 16948/16991 (removed 43) transitions.
[2024-06-07 16:38:24] [INFO ] Flow matrix only has 16946 transitions (discarded 2 similar events)
// Phase 1: matrix 16946 rows 70 cols
[2024-06-07 16:38:24] [INFO ] Computed 0 invariants in 175 ms
[2024-06-07 16:38:28] [INFO ] Implicit Places using invariants in 4487 ms returned []
Implicit Place search using SMT only with invariants took 4488 ms to find 0 implicit places.
[2024-06-07 16:38:28] [INFO ] Flow matrix only has 16946 transitions (discarded 2 similar events)
[2024-06-07 16:38:28] [INFO ] Invariant cache hit.
[2024-06-07 16:38:40] [INFO ] Dead Transitions using invariants and state equation in 12191 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 70/124 places, 16948/16991 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 18871 ms. Remains : 70/124 places, 16948/16991 transitions.
Running random walk in product with property : ResIsolation-PT-N09P2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(OR (EQ s5 0) (EQ s15 0) (EQ s23 0) (EQ s29 0) (EQ s35 0) (EQ s41 0) (EQ s45 0) (EQ s50 0) (EQ s57 0) (EQ s63 0) (EQ s69 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 6779 ms.
Product exploration explored 100000 steps with 0 reset in 4261 ms.
Computed a total of 8 stabilizing places and 30 stable transitions
Computed a total of 8 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 7 states, 8 edges and 1 AP (stutter sensitive) to 7 states, 8 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1325 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 113327 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113327 steps, saw 20323 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-07 16:38:57] [INFO ] Flow matrix only has 16946 transitions (discarded 2 similar events)
[2024-06-07 16:38:57] [INFO ] Invariant cache hit.
[2024-06-07 16:38:57] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-07 16:39:04] [INFO ] After 6926ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 135948 kB
After kill :
MemTotal: 16393216 kB
MemFree: 148096 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ResIsolation-PT-N09P2"
export BK_EXAMINATION="LTLFireability"
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 ResIsolation-PT-N09P2, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r649-smll-171774451500033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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