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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 97M
-rw-r--r-- 1 mcc users 6.2K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 112K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K 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 97M 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-N08P5-LTLFireability-00
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-01
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-02
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-03
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-04
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-05
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-06
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-07
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-08
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-09
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-10
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-11
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-12
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-13
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-14
FORMULA_NAME ResIsolation-PT-N08P5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717766442317

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-N08P5
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-07 13:20:45] [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 13:20:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 13:20:50] [INFO ] Load time of PNML (sax parser for PT used): 4818 ms
[2024-06-07 13:20:50] [INFO ] Transformed 426 places.
[2024-06-07 13:20:51] [INFO ] Transformed 74110 transitions.
[2024-06-07 13:20:51] [INFO ] Found NUPN structural information;
[2024-06-07 13:20:51] [INFO ] Parsed PT model containing 426 places and 74110 transitions and 1917704 arcs in 6127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ResIsolation-PT-N08P5-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P5-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 74110/74110 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 413 transition count 74110
Discarding 215 places :
Symmetric choice reduction at 1 with 215 rule applications. Total rules 228 place count 198 transition count 73895
Iterating global reduction 1 with 215 rules applied. Total rules applied 443 place count 198 transition count 73895
Ensure Unique test removed 773 transitions
Reduce isomorphic transitions removed 773 transitions.
Iterating post reduction 1 with 773 rules applied. Total rules applied 1216 place count 198 transition count 73122
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 1236 place count 178 transition count 73102
Iterating global reduction 2 with 20 rules applied. Total rules applied 1256 place count 178 transition count 73102
Applied a total of 1256 rules in 2777 ms. Remains 178 /426 variables (removed 248) and now considering 73102/74110 (removed 1008) transitions.
// Phase 1: matrix 73102 rows 178 cols
[2024-06-07 13:20:58] [INFO ] Computed 0 invariants in 2181 ms
[2024-06-07 13:20:59] [INFO ] Implicit Places using invariants in 4121 ms returned []
Implicit Place search using SMT only with invariants took 4167 ms to find 0 implicit places.
[2024-06-07 13:21:00] [INFO ] Invariant cache hit.
[2024-06-07 13:21:30] [INFO ] Performed 54205/73102 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 13:21:40] [INFO ] Dead Transitions using invariants and state equation in 40814 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 178/426 places, 73102/74110 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47775 ms. Remains : 178/426 places, 73102/74110 transitions.
Support contains 63 out of 178 places after structural reductions.
[2024-06-07 13:21:59] [INFO ] Flatten gal took : 17306 ms
[2024-06-07 13:22:15] [INFO ] Flatten gal took : 15529 ms
[2024-06-07 13:22:37] [INFO ] Input system was already deterministic with 73102 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8777 ms. (steps per millisecond=1 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=15 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 98765 steps, run timeout after 27003 ms. (steps per millisecond=3 ) properties seen :{1=1, 2=1, 10=1}
Probabilistic random walk after 98765 steps, saw 39450 distinct states, run finished after 27010 ms. (steps per millisecond=3 ) properties seen :3
Running SMT prover for 21 properties.
[2024-06-07 13:23:15] [INFO ] Invariant cache hit.
[2024-06-07 13:23:40] [INFO ] After 24641ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:16
[2024-06-07 13:23:41] [INFO ] After 24955ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :5 real:16
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-06-07 13:23:41] [INFO ] After 25381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :5 real:16
[2024-06-07 13:24:06] [INFO ] After 24631ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2024-06-07 13:24:06] [INFO ] After 24633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-06-07 13:24:06] [INFO ] After 25050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 63 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Graph (complete) has 1536 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.802 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 176 transition count 73048
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 92 place count 137 transition count 73048
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 22 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 156 place count 105 transition count 73016
Free-agglomeration rule applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 169 place count 105 transition count 73003
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 2 with 269 rules applied. Total rules applied 438 place count 92 transition count 72747
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 439 place count 91 transition count 72746
Applied a total of 439 rules in 15856 ms. Remains 91 /178 variables (removed 87) and now considering 72746/73102 (removed 356) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15861 ms. Remains : 91/178 places, 72746/73102 transitions.
FORMULA ResIsolation-PT-N08P5-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 60 stabilizing places and 73 stable transitions
Graph (complete) has 1536 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1591 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(G(p1))))))'
Support contains 20 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Applied a total of 0 rules in 869 ms. Remains 178 /178 variables (removed 0) and now considering 73102/73102 (removed 0) transitions.
[2024-06-07 13:24:24] [INFO ] Invariant cache hit.
[2024-06-07 13:24:42] [INFO ] Implicit Places using invariants in 17177 ms returned []
Implicit Place search using SMT only with invariants took 17187 ms to find 0 implicit places.
[2024-06-07 13:24:42] [INFO ] Invariant cache hit.
[2024-06-07 13:25:12] [INFO ] Performed 57704/73102 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 13:25:19] [INFO ] Dead Transitions using invariants and state equation in 37623 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55694 ms. Remains : 178/178 places, 73102/73102 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 332 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ResIsolation-PT-N08P5-LTLFireability-00 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: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (EQ s14 0) (EQ s36 0) (EQ s68 0) (EQ s76 0) (EQ s96 0) (EQ s117 0) (EQ s128 0) (EQ s136 0) (EQ s141 0) (EQ s152 0) (EQ s157 0) (EQ s168 0) (EQ s176...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 23920 steps with 0 reset in 10004 ms.
Product exploration timeout after 25000 steps with 0 reset in 10003 ms.
Computed a total of 60 stabilizing places and 73 stable transitions
Graph (complete) has 1536 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1360 ms
Computed a total of 60 stabilizing places and 73 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6790 ms. (steps per millisecond=1 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1140 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1186 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Finished probabilistic random walk after 8261 steps, run visited all 2 properties in 2206 ms. (steps per millisecond=3 )
Probabilistic random walk after 8261 steps, saw 5318 distinct states, run finished after 2209 ms. (steps per millisecond=3 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 224 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 243 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 20 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Applied a total of 0 rules in 1108 ms. Remains 178 /178 variables (removed 0) and now considering 73102/73102 (removed 0) transitions.
[2024-06-07 13:25:56] [INFO ] Invariant cache hit.
[2024-06-07 13:26:14] [INFO ] Implicit Places using invariants in 17564 ms returned []
Implicit Place search using SMT only with invariants took 17566 ms to find 0 implicit places.
[2024-06-07 13:26:14] [INFO ] Invariant cache hit.
[2024-06-07 13:26:44] [INFO ] Performed 41457/73102 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 13:26:59] [INFO ] Dead Transitions using invariants and state equation in 45549 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64240 ms. Remains : 178/178 places, 73102/73102 transitions.
Computed a total of 60 stabilizing places and 73 stable transitions
Graph (complete) has 1536 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1380 ms
Computed a total of 60 stabilizing places and 73 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6630 ms. (steps per millisecond=1 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1556 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1071 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Finished probabilistic random walk after 8261 steps, run visited all 2 properties in 2363 ms. (steps per millisecond=3 )
Probabilistic random walk after 8261 steps, saw 5318 distinct states, run finished after 2369 ms. (steps per millisecond=3 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 208 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 238 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration timeout after 22830 steps with 0 reset in 10002 ms.
Product exploration timeout after 23390 steps with 0 reset in 10004 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 20 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Graph (complete) has 1536 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.910 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 176 transition count 73100
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 36 place count 176 transition count 73113
Deduced a syphon composed of 48 places in 85 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 49 place count 176 transition count 73113
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 69 place count 156 transition count 73093
Deduced a syphon composed of 28 places in 79 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 89 place count 156 transition count 73093
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 48 places in 20 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 156 transition count 73094
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 155 transition count 73092
Deduced a syphon composed of 47 places in 19 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 155 transition count 73092
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 50 places in 19 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 155 transition count 73131
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 152 transition count 73125
Deduced a syphon composed of 47 places in 19 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 152 transition count 73125
Deduced a syphon composed of 47 places in 19 ms
Applied a total of 120 rules in 12872 ms. Remains 152 /178 variables (removed 26) and now considering 73125/73102 (removed -23) transitions.
// Phase 1: matrix 73125 rows 152 cols
[2024-06-07 13:27:51] [INFO ] Computed 0 invariants in 3308 ms
[2024-06-07 13:28:21] [INFO ] Performed 59079/73125 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 13:28:29] [INFO ] Dead Transitions using invariants and state equation in 40840 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/178 places, 73125/73102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53718 ms. Remains : 152/178 places, 73125/73102 transitions.
Built C files in :
/tmp/ltsmin17963929371483659592
[2024-06-07 13:28:31] [INFO ] Built C files in 1937ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17963929371483659592
Running compilation step : cd /tmp/ltsmin17963929371483659592;'/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/ltsmin17963929371483659592;'/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/ltsmin17963929371483659592;'/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 20 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Applied a total of 0 rules in 732 ms. Remains 178 /178 variables (removed 0) and now considering 73102/73102 (removed 0) transitions.
// Phase 1: matrix 73102 rows 178 cols
[2024-06-07 13:28:37] [INFO ] Computed 0 invariants in 1777 ms
[2024-06-07 13:28:53] [INFO ] Implicit Places using invariants in 18647 ms returned []
Implicit Place search using SMT only with invariants took 18648 ms to find 0 implicit places.
[2024-06-07 13:28:54] [INFO ] Invariant cache hit.
[2024-06-07 13:29:24] [INFO ] Performed 54136/73102 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 13:29:33] [INFO ] Dead Transitions using invariants and state equation in 39459 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58842 ms. Remains : 178/178 places, 73102/73102 transitions.
Built C files in :
/tmp/ltsmin14536771803470294999
[2024-06-07 13:29:35] [INFO ] Built C files in 1718ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14536771803470294999
Running compilation step : cd /tmp/ltsmin14536771803470294999;'/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/ltsmin14536771803470294999;'/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/ltsmin14536771803470294999;'/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 13:30:06] [INFO ] Flatten gal took : 16245 ms
[2024-06-07 13:30:22] [INFO ] Flatten gal took : 16273 ms
[2024-06-07 13:30:24] [INFO ] Time to serialize gal into /tmp/LTL12057653421875651945.gal : 2179 ms
[2024-06-07 13:30:24] [INFO ] Time to serialize properties into /tmp/LTL13023654530182329171.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/LTL12057653421875651945.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6999458496947730206.hoa' '-atoms' '/tmp/LTL13023654530182329171.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...319
Detected timeout of ITS tools.
[2024-06-07 13:31:20] [INFO ] Flatten gal took : 17253 ms
[2024-06-07 13:31:35] [INFO ] Flatten gal took : 14752 ms
[2024-06-07 13:31:37] [INFO ] Time to serialize gal into /tmp/LTL1906723215885735524.gal : 2175 ms
[2024-06-07 13:31:37] [INFO ] Time to serialize properties into /tmp/LTL8066115877652764604.ltl : 219 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/LTL1906723215885735524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8066115877652764604.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Detected timeout of ITS tools.
[2024-06-07 13:32:14] [INFO ] Flatten gal took : 19762 ms
[2024-06-07 13:32:14] [INFO ] Applying decomposition
[2024-06-07 13:32:29] [INFO ] Flatten gal took : 15761 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/graph1901405854921514669.txt' '-o' '/tmp/graph1901405854921514669.bin' '-w' '/tmp/graph1901405854921514669.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1901405854921514669.bin' '-l' '-1' '-v' '-w' '/tmp/graph1901405854921514669.weights' '-q' '0' '-e' '0.001'
[2024-06-07 13:33:13] [INFO ] Decomposing Gal with order
[2024-06-07 13:33:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 13:33:56] [INFO ] Removed a total of 1020396 redundant transitions.
[2024-06-07 13:33:58] [INFO ] Flatten gal took : 36068 ms
[2024-06-07 13:34:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 10059 ms.
[2024-06-07 13:34:14] [INFO ] Time to serialize gal into /tmp/LTL17234087240173536919.gal : 865 ms
[2024-06-07 13:34:14] [INFO ] Time to serialize properties into /tmp/LTL644469577099671176.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/LTL17234087240173536919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL644469577099671176.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...254
Read 1 LTL properties
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4920108766275393551
[2024-06-07 13:34:35] [INFO ] Built C files in 5142ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4920108766275393551
Running compilation step : cd /tmp/ltsmin4920108766275393551;'/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/ltsmin4920108766275393551;'/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/ltsmin4920108766275393551;'/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-N08P5-LTLFireability-00 finished in 614938 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((F(p0)&&F(G(!p1)))))'
Support contains 13 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Applied a total of 0 rules in 1777 ms. Remains 178 /178 variables (removed 0) and now considering 73102/73102 (removed 0) transitions.
[2024-06-07 13:34:41] [INFO ] Invariant cache hit.
[2024-06-07 13:35:01] [INFO ] Implicit Places using invariants in 20594 ms returned []
Implicit Place search using SMT only with invariants took 20624 ms to find 0 implicit places.
[2024-06-07 13:35:01] [INFO ] Invariant cache hit.
[2024-06-07 13:35:31] [INFO ] Performed 40134/73102 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 13:35:51] [INFO ] Dead Transitions using invariants and state equation in 50162 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72594 ms. Remains : 178/178 places, 73102/73102 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : ResIsolation-PT-N08P5-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s26 0) (EQ s48 0) (EQ s68 0) (EQ s88 0) (EQ s108 0) (EQ s120 0) (EQ s128 0) (EQ s136 0) (EQ s144 0) (EQ s152 0) (EQ s160 0) (EQ s168 0) (EQ s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 13420 steps with 0 reset in 10007 ms.
Stack based approach found an accepted trace after 153 steps with 0 reset with depth 154 and stack size 154 in 84 ms.
FORMULA ResIsolation-PT-N08P5-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P5-LTLFireability-01 finished in 83726 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)) U (p2 U p3)) U p1)))'
Support contains 34 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Applied a total of 0 rules in 593 ms. Remains 178 /178 variables (removed 0) and now considering 73102/73102 (removed 0) transitions.
[2024-06-07 13:36:03] [INFO ] Invariant cache hit.
[2024-06-07 13:36:14] [INFO ] Implicit Places using invariants in 11665 ms returned []
Implicit Place search using SMT only with invariants took 11668 ms to find 0 implicit places.
[2024-06-07 13:36:14] [INFO ] Invariant cache hit.
[2024-06-07 13:36:45] [INFO ] Performed 34678/73102 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 13:37:15] [INFO ] Dead Transitions using invariants and state equation in 60109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72379 ms. Remains : 178/178 places, 73102/73102 transitions.
Stuttering acceptance computed with spot in 437 ms :[(NOT p1), (NOT p1), true, (NOT p3), (NOT p3), (NOT p1), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : ResIsolation-PT-N08P5-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p3)) (AND (NOT p3) p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={0} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2 p0), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s26 1) (EQ s45 1) (EQ s65 1) (EQ s85 1) (EQ s108 1) (EQ s119 1) (EQ s127 1) (EQ s136 1) (EQ s144 1) (EQ s151 1) (EQ s160 1) (EQ s168 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 7 ms.
FORMULA ResIsolation-PT-N08P5-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P5-LTLFireability-02 finished in 73251 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))'
Support contains 13 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Graph (complete) has 1536 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.507 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 175 transition count 73064
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 140 transition count 73064
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 71 place count 140 transition count 73051
Deduced a syphon composed of 13 places in 87 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 97 place count 127 transition count 73051
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 31 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 135 place count 108 transition count 73032
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 21 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 141 place count 105 transition count 73040
Applied a total of 141 rules in 11819 ms. Remains 105 /178 variables (removed 73) and now considering 73040/73102 (removed 62) transitions.
// Phase 1: matrix 73040 rows 105 cols
[2024-06-07 13:37:29] [INFO ] Computed 0 invariants in 2100 ms
[2024-06-07 13:37:45] [INFO ] Implicit Places using invariants in 17870 ms returned []
Implicit Place search using SMT only with invariants took 17872 ms to find 0 implicit places.
[2024-06-07 13:37:45] [INFO ] Invariant cache hit.
[2024-06-07 13:38:15] [INFO ] Performed 53257/73040 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 13:38:28] [INFO ] Dead Transitions using invariants and state equation in 42654 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/178 places, 73040/73102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72353 ms. Remains : 105/178 places, 73040/73102 transitions.
Stuttering acceptance computed with spot in 46 ms :[p0]
Running random walk in product with property : ResIsolation-PT-N08P5-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s11 1) (NEQ s22 1) (NEQ s33 1) (NEQ s44 1) (NEQ s56 1) (NEQ s62 1) (NEQ s68 1) (NEQ s74 1) (NEQ s80 1) (NEQ s86 1) (NEQ s92 1) (NEQ s98 1) (NE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 13220 steps with 0 reset in 10004 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 14 ms.
FORMULA ResIsolation-PT-N08P5-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P5-LTLFireability-05 finished in 82681 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(F(!p0)))'
Support contains 13 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Applied a total of 0 rules in 914 ms. Remains 178 /178 variables (removed 0) and now considering 73102/73102 (removed 0) transitions.
// Phase 1: matrix 73102 rows 178 cols
[2024-06-07 13:38:41] [INFO ] Computed 0 invariants in 1651 ms
[2024-06-07 13:39:01] [INFO ] Implicit Places using invariants in 21883 ms returned []
Implicit Place search using SMT only with invariants took 21886 ms to find 0 implicit places.
[2024-06-07 13:39:01] [INFO ] Invariant cache hit.
[2024-06-07 13:39:31] [INFO ] Performed 40586/73102 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 13:39:55] [INFO ] Dead Transitions using invariants and state equation in 54077 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76883 ms. Remains : 178/178 places, 73102/73102 transitions.
Stuttering acceptance computed with spot in 80 ms :[p0, p0]
Running random walk in product with property : ResIsolation-PT-N08P5-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s26 1) (NEQ s48 1) (NEQ s68 1) (NEQ s88 1) (NEQ s108 1) (NEQ s120 1) (NEQ s128 1) (NEQ s136 1) (NEQ s144 1) (NEQ s152 1) (NEQ s160 1) (NEQ s16...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 13820 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 135 steps with 0 reset with depth 136 and stack size 136 in 53 ms.
FORMULA ResIsolation-PT-N08P5-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P5-LTLFireability-06 finished in 87416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 21 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Graph (trivial) has 113 edges and 178 vertex of which 6 / 178 are part of one of the 2 SCC in 41 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1530 edges and 174 vertex of which 172 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.654 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 171 transition count 73060
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 136 transition count 73060
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 72 place count 136 transition count 73045
Deduced a syphon composed of 15 places in 123 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 102 place count 121 transition count 73045
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 48 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 136 place count 104 transition count 73028
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 27 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 142 place count 101 transition count 73036
Applied a total of 142 rules in 23747 ms. Remains 101 /178 variables (removed 77) and now considering 73036/73102 (removed 66) transitions.
[2024-06-07 13:40:29] [INFO ] Flow matrix only has 73035 transitions (discarded 1 similar events)
// Phase 1: matrix 73035 rows 101 cols
[2024-06-07 13:40:31] [INFO ] Computed 0 invariants in 1874 ms
[2024-06-07 13:40:50] [INFO ] Implicit Places using invariants in 20610 ms returned []
Implicit Place search using SMT only with invariants took 20612 ms to find 0 implicit places.
[2024-06-07 13:40:50] [INFO ] Flow matrix only has 73035 transitions (discarded 1 similar events)
[2024-06-07 13:40:50] [INFO ] Invariant cache hit.
[2024-06-07 13:41:20] [INFO ] Performed 35352/73036 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 13:41:50] [INFO ] Dead Transitions using invariants and state equation in 60123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/178 places, 73036/73102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104490 ms. Remains : 101/178 places, 73036/73102 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N08P5-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s20 1) (EQ s32 1) (EQ s43 1) (EQ s53 1) (EQ s60 1) (EQ s66 1) (EQ s71 1) (EQ s76 1) (EQ s83 1) (EQ s89 1) (EQ s94 1) (EQ s100 1)), p...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 15 ms.
FORMULA ResIsolation-PT-N08P5-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P5-LTLFireability-07 finished in 104887 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&&(!p0||F(G(!p2))))))))'
Support contains 20 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Applied a total of 0 rules in 1142 ms. Remains 178 /178 variables (removed 0) and now considering 73102/73102 (removed 0) transitions.
// Phase 1: matrix 73102 rows 178 cols
[2024-06-07 13:41:54] [INFO ] Computed 0 invariants in 1947 ms
[2024-06-07 13:42:11] [INFO ] Implicit Places using invariants in 19043 ms returned []
Implicit Place search using SMT only with invariants took 19045 ms to find 0 implicit places.
[2024-06-07 13:42:11] [INFO ] Invariant cache hit.
[2024-06-07 13:42:41] [INFO ] Performed 46710/73102 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 13:42:55] [INFO ] Dead Transitions using invariants and state equation in 44900 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65093 ms. Remains : 178/178 places, 73102/73102 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR p1 (AND p0 p2)), (OR p1 (AND p0 p2)), true, (OR p1 (AND p0 p2)), (OR (AND p1 p2) (AND p0 p2)), p2]
Running random walk in product with property : ResIsolation-PT-N08P5-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s26 1) (EQ s46 1) (EQ s66 1) (EQ s88 1) (EQ s108 1) (EQ s119 1) (EQ s128 1) (EQ s135 1) (EQ s144 1) (EQ s151 1) (EQ s159 1) (EQ s167 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 20560 steps with 0 reset in 10003 ms.
Product exploration timeout after 22690 steps with 0 reset in 10006 ms.
Computed a total of 60 stabilizing places and 73 stable transitions
Graph (complete) has 1536 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1509 ms
Computed a total of 60 stabilizing places and 73 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (OR (NOT p1) p0))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 143 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 247 ms :[(OR p1 (AND p0 p2)), true, (OR p1 (AND p0 p2)), (OR (AND p1 p2) (AND p0 p2)), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8230 ms. (steps per millisecond=1 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1605 ms. (steps per millisecond=6 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1373 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3123 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1616 ms. (steps per millisecond=6 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2240 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1256 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1777 ms. (steps per millisecond=5 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1216 ms. (steps per millisecond=8 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 190981 steps, run timeout after 66002 ms. (steps per millisecond=2 ) properties seen :{3=1, 4=1, 6=1, 7=1}
Probabilistic random walk after 190981 steps, saw 49941 distinct states, run finished after 66003 ms. (steps per millisecond=2 ) properties seen :4
Running SMT prover for 4 properties.
[2024-06-07 13:44:48] [INFO ] Invariant cache hit.
[2024-06-07 13:45:13] [INFO ] After 24736ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:2
[2024-06-07 13:45:16] [INFO ] After 27787ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-06-07 13:45:16] [INFO ] After 27936ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:2
[2024-06-07 13:45:41] [INFO ] After 24924ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-06-07 13:45:41] [INFO ] After 24925ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-06-07 13:45:41] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Graph (complete) has 1536 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.655 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 176 transition count 73039
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 110 place count 128 transition count 73039
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 21 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 174 place count 96 transition count 73007
Free-agglomeration rule applied 28 times.
Iterating global reduction 2 with 28 rules applied. Total rules applied 202 place count 96 transition count 72979
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 17664 transitions
Reduce isomorphic transitions removed 17664 transitions.
Iterating post reduction 2 with 17692 rules applied. Total rules applied 17894 place count 68 transition count 55315
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17895 place count 67 transition count 55314
Applied a total of 17895 rules in 52488 ms. Remains 67 /178 variables (removed 111) and now considering 55314/73102 (removed 17788) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52493 ms. Remains : 67/178 places, 55314/73102 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (OR (NOT p1) p0))), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (G (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND p0 (NOT p1) p2)), (F (AND p0 p2)), (F p2)]
Knowledge based reduction with 14 factoid took 510 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR p0 p1), true, (OR p0 p1), (OR p0 (AND p1 p2)), p2]
Stuttering acceptance computed with spot in 264 ms :[(OR p0 p1), true, (OR p0 p1), (OR p0 (AND p1 p2)), p2]
Support contains 20 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Graph (complete) has 1536 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.765 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 175 transition count 73064
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 140 transition count 73064
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 71 place count 140 transition count 73051
Deduced a syphon composed of 13 places in 76 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 97 place count 127 transition count 73051
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 27 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 135 place count 108 transition count 73032
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 18 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 141 place count 105 transition count 73040
Applied a total of 141 rules in 9329 ms. Remains 105 /178 variables (removed 73) and now considering 73040/73102 (removed 62) transitions.
// Phase 1: matrix 73040 rows 105 cols
[2024-06-07 13:46:46] [INFO ] Computed 0 invariants in 1958 ms
[2024-06-07 13:47:03] [INFO ] Implicit Places using invariants in 19080 ms returned []
Implicit Place search using SMT only with invariants took 19096 ms to find 0 implicit places.
[2024-06-07 13:47:04] [INFO ] Invariant cache hit.
[2024-06-07 13:47:34] [INFO ] Performed 52610/73040 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 13:47:45] [INFO ] Dead Transitions using invariants and state equation in 41099 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/178 places, 73040/73102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69531 ms. Remains : 105/178 places, 73040/73102 transitions.
Computed a total of 10 stabilizing places and 34 stable transitions
Computed a total of 10 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (OR p0 (NOT p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X (OR p0 (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 124 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR p0 p1), true, (OR p0 p1), (OR p0 (AND p1 p2)), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10515 ms. (steps per millisecond=0 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4925 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1670 ms. (steps per millisecond=5 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1704 ms. (steps per millisecond=5 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2373 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 2536 ms. (steps per millisecond=3 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2937 ms. (steps per millisecond=3 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 330529 steps, run timeout after 78001 ms. (steps per millisecond=4 ) properties seen :{3=1, 4=1, 5=1}
Probabilistic random walk after 330529 steps, saw 57177 distinct states, run finished after 78002 ms. (steps per millisecond=4 ) properties seen :3
Running SMT prover for 3 properties.
[2024-06-07 13:49:32] [INFO ] Invariant cache hit.
[2024-06-07 13:49:56] [INFO ] After 24381ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-06-07 13:49:57] [INFO ] After 25538ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-06-07 13:49:57] [INFO ] After 25610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2024-06-07 13:50:22] [INFO ] After 24945ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-07 13:50:22] [INFO ] After 24947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-06-07 13:50:22] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 20 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 73040/73040 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 105 transition count 73031
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 21 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 25 place count 97 transition count 73023
Free-agglomeration rule applied 28 times.
Iterating global reduction 1 with 28 rules applied. Total rules applied 53 place count 97 transition count 72995
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 17664 transitions
Reduce isomorphic transitions removed 17664 transitions.
Iterating post reduction 1 with 17692 rules applied. Total rules applied 17745 place count 69 transition count 55331
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 17746 place count 69 transition count 55331
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17747 place count 68 transition count 55330
Iterating global reduction 2 with 1 rules applied. Total rules applied 17748 place count 68 transition count 55330
Applied a total of 17748 rules in 52372 ms. Remains 68 /105 variables (removed 37) and now considering 55330/73040 (removed 17710) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52377 ms. Remains : 68/105 places, 55330/73040 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (OR p0 (NOT p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X (OR p0 (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F p2)]
Knowledge based reduction with 13 factoid took 338 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR p0 p1), true, (OR p0 p1), (OR p0 (AND p1 p2)), p2]
Stuttering acceptance computed with spot in 247 ms :[(OR p0 p1), true, (OR p0 p1), (OR p0 (AND p1 p2)), p2]
Stuttering acceptance computed with spot in 249 ms :[(OR p0 p1), true, (OR p0 p1), (OR p0 (AND p1 p2)), p2]
Product exploration timeout after 18880 steps with 0 reset in 10002 ms.
Product exploration timeout after 21870 steps with 0 reset in 10003 ms.
Built C files in :
/tmp/ltsmin17773561999631933583
[2024-06-07 13:51:36] [INFO ] Too many transitions (73040) to apply POR reductions. Disabling POR matrices.
[2024-06-07 13:51:38] [INFO ] Built C files in 2232ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17773561999631933583
Running compilation step : cd /tmp/ltsmin17773561999631933583;'/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/ltsmin17773561999631933583;'/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/ltsmin17773561999631933583;'/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 20 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 73040/73040 transitions.
Applied a total of 0 rules in 2857 ms. Remains 105 /105 variables (removed 0) and now considering 73040/73040 (removed 0) transitions.
[2024-06-07 13:51:45] [INFO ] Invariant cache hit.
[2024-06-07 13:52:00] [INFO ] Implicit Places using invariants in 15618 ms returned []
Implicit Place search using SMT only with invariants took 15620 ms to find 0 implicit places.
[2024-06-07 13:52:00] [INFO ] Invariant cache hit.
[2024-06-07 13:52:30] [INFO ] Performed 36026/73040 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 13:52:55] [INFO ] Dead Transitions using invariants and state equation in 55158 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73643 ms. Remains : 105/105 places, 73040/73040 transitions.
Built C files in :
/tmp/ltsmin10397444989860930470
[2024-06-07 13:52:55] [INFO ] Too many transitions (73040) to apply POR reductions. Disabling POR matrices.
[2024-06-07 13:52:57] [INFO ] Built C files in 1979ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10397444989860930470
Running compilation step : cd /tmp/ltsmin10397444989860930470;'/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/ltsmin10397444989860930470;'/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/ltsmin10397444989860930470;'/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 13:53:38] [INFO ] Flatten gal took : 18715 ms
[2024-06-07 13:53:55] [INFO ] Flatten gal took : 16638 ms
[2024-06-07 13:53:56] [INFO ] Time to serialize gal into /tmp/LTL17223639573816503770.gal : 1594 ms
[2024-06-07 13:53:56] [INFO ] Time to serialize properties into /tmp/LTL12375540989869020147.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/LTL17223639573816503770.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14830384063044553083.hoa' '-atoms' '/tmp/LTL12375540989869020147.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...320
Detected timeout of ITS tools.
[2024-06-07 13:54:46] [INFO ] Flatten gal took : 17654 ms
[2024-06-07 13:55:01] [INFO ] Flatten gal took : 15461 ms
[2024-06-07 13:55:03] [INFO ] Time to serialize gal into /tmp/LTL13357065829064237849.gal : 1749 ms
[2024-06-07 13:55:03] [INFO ] Time to serialize properties into /tmp/LTL1465988319499324080.ltl : 3 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/LTL13357065829064237849.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1465988319499324080.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2024-06-07 13:55:37] [INFO ] Flatten gal took : 16970 ms
[2024-06-07 13:55:37] [INFO ] Applying decomposition
[2024-06-07 13:55:53] [INFO ] Flatten gal took : 15615 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/graph15162328068307415285.txt' '-o' '/tmp/graph15162328068307415285.bin' '-w' '/tmp/graph15162328068307415285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15162328068307415285.bin' '-l' '-1' '-v' '-w' '/tmp/graph15162328068307415285.weights' '-q' '0' '-e' '0.001'
[2024-06-07 13:56:52] [INFO ] Decomposing Gal with order
[2024-06-07 13:56:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 13:57:48] [INFO ] Removed a total of 984258 redundant transitions.
[2024-06-07 13:57:51] [INFO ] Flatten gal took : 37484 ms
[2024-06-07 13:58:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 11239 ms.
[2024-06-07 13:58:07] [INFO ] Time to serialize gal into /tmp/LTL16901691464976488528.gal : 804 ms
[2024-06-07 13:58:07] [INFO ] Time to serialize properties into /tmp/LTL13151882853739921699.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/LTL16901691464976488528.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13151882853739921699.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/ltsmin1626488074694258633
[2024-06-07 13:58:25] [INFO ] Built C files in 2342ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1626488074694258633
Running compilation step : cd /tmp/ltsmin1626488074694258633;'/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/ltsmin1626488074694258633;'/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/ltsmin1626488074694258633;'/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-N08P5-LTLFireability-08 finished in 997436 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(((!p1 U p2)&&p0)))))'
Support contains 21 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Applied a total of 0 rules in 1120 ms. Remains 178 /178 variables (removed 0) and now considering 73102/73102 (removed 0) transitions.
// Phase 1: matrix 73102 rows 178 cols
[2024-06-07 13:58:31] [INFO ] Computed 0 invariants in 1785 ms
[2024-06-07 13:58:49] [INFO ] Implicit Places using invariants in 19880 ms returned []
Implicit Place search using SMT only with invariants took 19892 ms to find 0 implicit places.
[2024-06-07 13:58:49] [INFO ] Invariant cache hit.
[2024-06-07 13:59:19] [INFO ] Performed 26156/73102 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 13:59:49] [INFO ] Dead Transitions using invariants and state equation in 60137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81166 ms. Remains : 178/178 places, 73102/73102 transitions.
Stuttering acceptance computed with spot in 895 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : ResIsolation-PT-N08P5-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s26 1) (EQ s48 1) (EQ s68 1) (EQ s82 1) (EQ s108 1) (EQ s120 1) (EQ s126 1) (EQ s134 1) (EQ s142 1) (EQ s152 1) (EQ s160 1) (EQ s166 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 6 ms.
FORMULA ResIsolation-PT-N08P5-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P5-LTLFireability-09 finished in 82646 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) U (p0||X(!p1)))))'
Support contains 21 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Applied a total of 0 rules in 1057 ms. Remains 178 /178 variables (removed 0) and now considering 73102/73102 (removed 0) transitions.
[2024-06-07 13:59:52] [INFO ] Invariant cache hit.
[2024-06-07 14:00:11] [INFO ] Implicit Places using invariants in 19631 ms returned []
Implicit Place search using SMT only with invariants took 19634 ms to find 0 implicit places.
[2024-06-07 14:00:12] [INFO ] Invariant cache hit.
[2024-06-07 14:00:42] [INFO ] Performed 45516/73102 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 14:01:02] [INFO ] Dead Transitions using invariants and state equation in 50228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70924 ms. Remains : 178/178 places, 73102/73102 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P5-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s23 1) (EQ s45 1) (EQ s65 1) (EQ s85 1) (EQ s108 1) (EQ s120 1) (EQ s127 1) (EQ s135 1) (EQ s144 1) (EQ s151 1) (EQ s160 1) (EQ s168 1) (EQ s1...], nbAcceptance=1, 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 timeout after 21240 steps with 0 reset in 10005 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 7 ms.
FORMULA ResIsolation-PT-N08P5-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ResIsolation-PT-N08P5-LTLFireability-10 finished in 81758 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)||G(p1))))'
Support contains 24 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Graph (trivial) has 117 edges and 178 vertex of which 12 / 178 are part of one of the 4 SCC in 10 ms
Free SCC test removed 8 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1524 edges and 170 vertex of which 168 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.631 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 167 transition count 73058
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 134 transition count 73058
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 68 place count 134 transition count 73045
Deduced a syphon composed of 13 places in 120 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 94 place count 121 transition count 73045
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 29 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 124 place count 106 transition count 73030
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 18 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 103 transition count 73038
Applied a total of 130 rules in 9968 ms. Remains 103 /178 variables (removed 75) and now considering 73038/73102 (removed 64) transitions.
[2024-06-07 14:01:22] [INFO ] Flow matrix only has 73035 transitions (discarded 3 similar events)
// Phase 1: matrix 73035 rows 103 cols
[2024-06-07 14:01:24] [INFO ] Computed 0 invariants in 1684 ms
[2024-06-07 14:01:39] [INFO ] Implicit Places using invariants in 16642 ms returned []
Implicit Place search using SMT only with invariants took 16650 ms to find 0 implicit places.
[2024-06-07 14:01:39] [INFO ] Flow matrix only has 73035 transitions (discarded 3 similar events)
[2024-06-07 14:01:39] [INFO ] Invariant cache hit.
[2024-06-07 14:02:09] [INFO ] Performed 25794/73038 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 14:02:39] [INFO ] Dead Transitions using invariants and state equation in 60117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/178 places, 73038/73102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86740 ms. Remains : 103/178 places, 73038/73102 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResIsolation-PT-N08P5-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s17 1) (EQ s34 1) (EQ s40 1) (EQ s58 1) (EQ s62 1) (EQ s69 1) (EQ s75 1) (EQ s79 1) (EQ s84 1) (EQ s92 1) (EQ s96 1) (EQ s101 1)), ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 13280 steps with 0 reset in 10006 ms.
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 10 ms.
FORMULA ResIsolation-PT-N08P5-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P5-LTLFireability-11 finished in 100174 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(G(p1)))||F(p2))&&p0)))'
Support contains 24 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Applied a total of 0 rules in 902 ms. Remains 178 /178 variables (removed 0) and now considering 73102/73102 (removed 0) transitions.
// Phase 1: matrix 73102 rows 178 cols
[2024-06-07 14:02:55] [INFO ] Computed 0 invariants in 1818 ms
[2024-06-07 14:03:14] [INFO ] Implicit Places using invariants in 20721 ms returned []
Implicit Place search using SMT only with invariants took 20724 ms to find 0 implicit places.
[2024-06-07 14:03:14] [INFO ] Invariant cache hit.
[2024-06-07 14:03:44] [INFO ] Performed 41282/73102 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 14:04:03] [INFO ] Dead Transitions using invariants and state equation in 48819 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70452 ms. Remains : 178/178 places, 73102/73102 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ResIsolation-PT-N08P5-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(OR (EQ s23 0) (EQ s48 0) (EQ s65 0) (EQ s88 0) (EQ s108 0) (EQ s120 0) (EQ s127 0) (EQ s136 0) (EQ s143 0) (EQ s152 0) (EQ s159 0) (EQ s168 0) (EQ s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA ResIsolation-PT-N08P5-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P5-LTLFireability-12 finished in 71042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(p1) U (X(G(p1))||(X(p1)&&F(!p0)&&G(p2))))))))'
Support contains 26 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Applied a total of 0 rules in 877 ms. Remains 178 /178 variables (removed 0) and now considering 73102/73102 (removed 0) transitions.
[2024-06-07 14:04:04] [INFO ] Invariant cache hit.
[2024-06-07 14:04:20] [INFO ] Implicit Places using invariants in 15154 ms returned []
Implicit Place search using SMT only with invariants took 15160 ms to find 0 implicit places.
[2024-06-07 14:04:20] [INFO ] Invariant cache hit.
[2024-06-07 14:04:50] [INFO ] Performed 53735/73102 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 14:05:00] [INFO ] Dead Transitions using invariants and state equation in 40092 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56133 ms. Remains : 178/178 places, 73102/73102 transitions.
Stuttering acceptance computed with spot in 524 ms :[true, (OR (NOT p2) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N08P5-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 9}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 8}, { cond=(NOT p2), acceptance={} source=7 dest: 9}, { cond=(AND p0 p2), acceptance={} source=7 dest: 10}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=(AND p2 p1), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 9}], [{ cond=(NOT p1), acceptance={} source=9 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 9}, { cond=(AND p0 p2 p1), acceptance={} source=9 dest: 10}], [{ cond=(NOT p1), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=10 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 9}]], initial=6, aps=[p2:(AND (EQ s20 1) (EQ s42 1) (EQ s68 1) (EQ s82 1) (EQ s108 1) (EQ s120 1) (EQ s128 1) (EQ s136 1) (EQ s142 1) (EQ s150 1) (EQ s158 1) (EQ s166 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], 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 timeout after 31090 steps with 0 reset in 10004 ms.
Product exploration timeout after 33340 steps with 0 reset in 10001 ms.
Computed a total of 60 stabilizing places and 73 stable transitions
Graph (complete) has 1536 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1618 ms
Computed a total of 60 stabilizing places and 73 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 11 states, 32 edges and 3 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 508 ms :[true, (OR (NOT p2) p0), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7064 ms. (steps per millisecond=1 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1180 ms. (steps per millisecond=8 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1131 ms. (steps per millisecond=8 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1324 ms. (steps per millisecond=7 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1189 ms. (steps per millisecond=8 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1089 ms. (steps per millisecond=9 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1222 ms. (steps per millisecond=8 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1905 ms. (steps per millisecond=5 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1753 ms. (steps per millisecond=5 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4924 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1898 ms. (steps per millisecond=5 ) properties (out of 12) seen :0
Interrupted Best-First random walk after 9122 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 9577 steps, including 2 resets, run timeout after 5419 ms. (steps per millisecond=1 ) properties seen 0
Interrupted probabilistic random walk after 322814 steps, run timeout after 105001 ms. (steps per millisecond=3 ) properties seen :{3=1, 6=1, 11=1}
Probabilistic random walk after 322814 steps, saw 64830 distinct states, run finished after 105001 ms. (steps per millisecond=3 ) properties seen :3
Running SMT prover for 9 properties.
[2024-06-07 14:07:44] [INFO ] Invariant cache hit.
[2024-06-07 14:08:09] [INFO ] After 24872ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2024-06-07 14:08:09] [INFO ] After 24993ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:8
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-06-07 14:08:09] [INFO ] After 25176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:8
[2024-06-07 14:08:35] [INFO ] After 24814ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-07 14:08:35] [INFO ] After 24815ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-06-07 14:08:35] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Graph (complete) has 1536 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.699 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 176 transition count 73042
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 104 place count 131 transition count 73042
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 19 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 168 place count 99 transition count 73010
Free-agglomeration rule applied 26 times.
Iterating global reduction 2 with 26 rules applied. Total rules applied 194 place count 99 transition count 72984
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 8960 transitions
Reduce isomorphic transitions removed 8960 transitions.
Iterating post reduction 2 with 8986 rules applied. Total rules applied 9180 place count 73 transition count 64024
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9181 place count 72 transition count 64023
Applied a total of 9181 rules in 44692 ms. Remains 72 /178 variables (removed 106) and now considering 64023/73102 (removed 9079) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44696 ms. Remains : 72/178 places, 64023/73102 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 329 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 610 ms :[true, (OR (NOT p2) p0), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 607 ms :[true, (OR (NOT p2) p0), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 26 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Applied a total of 0 rules in 916 ms. Remains 178 /178 variables (removed 0) and now considering 73102/73102 (removed 0) transitions.
[2024-06-07 14:09:22] [INFO ] Invariant cache hit.
[2024-06-07 14:09:38] [INFO ] Implicit Places using invariants in 16496 ms returned []
Implicit Place search using SMT only with invariants took 16498 ms to find 0 implicit places.
[2024-06-07 14:09:38] [INFO ] Invariant cache hit.
[2024-06-07 14:10:09] [INFO ] Performed 43293/73102 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 14:10:27] [INFO ] Dead Transitions using invariants and state equation in 48803 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66226 ms. Remains : 178/178 places, 73102/73102 transitions.
Computed a total of 60 stabilizing places and 73 stable transitions
Graph (complete) has 1536 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1320 ms
Computed a total of 60 stabilizing places and 73 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 493 ms :[true, (OR (NOT p2) p0), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7579 ms. (steps per millisecond=1 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1256 ms. (steps per millisecond=7 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1207 ms. (steps per millisecond=8 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1589 ms. (steps per millisecond=6 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1147 ms. (steps per millisecond=8 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1949 ms. (steps per millisecond=5 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1289 ms. (steps per millisecond=7 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1032 ms. (steps per millisecond=9 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3361 ms. (steps per millisecond=2 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1137 ms. (steps per millisecond=8 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1222 ms. (steps per millisecond=8 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1159 ms. (steps per millisecond=8 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1036 ms. (steps per millisecond=9 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 247330 steps, run timeout after 72002 ms. (steps per millisecond=3 ) properties seen :{3=1, 6=1, 11=1}
Probabilistic random walk after 247330 steps, saw 56473 distinct states, run finished after 72002 ms. (steps per millisecond=3 ) properties seen :3
Running SMT prover for 9 properties.
[2024-06-07 14:12:07] [INFO ] Invariant cache hit.
[2024-06-07 14:12:33] [INFO ] After 25193ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2024-06-07 14:12:33] [INFO ] After 25321ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:8
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-06-07 14:12:33] [INFO ] After 25450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:8
[2024-06-07 14:12:58] [INFO ] After 24826ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-07 14:12:58] [INFO ] After 24827ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-06-07 14:12:58] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Graph (complete) has 1536 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.516 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 176 transition count 73042
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 104 place count 131 transition count 73042
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 17 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 168 place count 99 transition count 73010
Free-agglomeration rule applied 26 times.
Iterating global reduction 2 with 26 rules applied. Total rules applied 194 place count 99 transition count 72984
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 8960 transitions
Reduce isomorphic transitions removed 8960 transitions.
Iterating post reduction 2 with 8986 rules applied. Total rules applied 9180 place count 73 transition count 64024
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9181 place count 72 transition count 64023
Applied a total of 9181 rules in 42933 ms. Remains 72 /178 variables (removed 106) and now considering 64023/73102 (removed 9079) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42936 ms. Remains : 72/178 places, 64023/73102 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), true]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 221 ms. Reduced automaton from 11 states, 30 edges and 3 AP (stutter sensitive) to 11 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 738 ms :[true, (OR (NOT p2) p0), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 630 ms :[true, (OR (NOT p2) p0), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 726 ms :[true, (OR (NOT p2) p0), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration timeout after 22620 steps with 0 reset in 10001 ms.
Product exploration timeout after 23470 steps with 0 reset in 10004 ms.
Applying partial POR strategy [true, true, true, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 599 ms :[true, (OR (NOT p2) p0), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 26 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Graph (complete) has 1536 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.819 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 176 transition count 73100
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 33 place count 176 transition count 73113
Deduced a syphon composed of 45 places in 92 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 46 place count 176 transition count 73113
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 66 place count 156 transition count 73093
Deduced a syphon composed of 25 places in 79 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 86 place count 156 transition count 73093
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 45 places in 19 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 106 place count 156 transition count 73094
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 155 transition count 73092
Deduced a syphon composed of 44 places in 19 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 155 transition count 73092
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 47 places in 20 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 111 place count 155 transition count 73131
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 152 transition count 73125
Deduced a syphon composed of 44 places in 20 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 152 transition count 73125
Deduced a syphon composed of 44 places in 20 ms
Applied a total of 117 rules in 13151 ms. Remains 152 /178 variables (removed 26) and now considering 73125/73102 (removed -23) transitions.
// Phase 1: matrix 73125 rows 152 cols
[2024-06-07 14:14:21] [INFO ] Computed 0 invariants in 3099 ms
[2024-06-07 14:14:51] [INFO ] Performed 56044/73125 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 14:15:00] [INFO ] Dead Transitions using invariants and state equation in 42333 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/178 places, 73125/73102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55488 ms. Remains : 152/178 places, 73125/73102 transitions.
Built C files in :
/tmp/ltsmin17104282546573990468
[2024-06-07 14:15:02] [INFO ] Built C files in 1762ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17104282546573990468
Running compilation step : cd /tmp/ltsmin17104282546573990468;'/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/ltsmin17104282546573990468;'/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/ltsmin17104282546573990468;'/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 26 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 73102/73102 transitions.
Applied a total of 0 rules in 1080 ms. Remains 178 /178 variables (removed 0) and now considering 73102/73102 (removed 0) transitions.
// Phase 1: matrix 73102 rows 178 cols
[2024-06-07 14:15:09] [INFO ] Computed 0 invariants in 1897 ms
[2024-06-07 14:15:25] [INFO ] Implicit Places using invariants in 17931 ms returned []
Implicit Place search using SMT only with invariants took 17939 ms to find 0 implicit places.
[2024-06-07 14:15:25] [INFO ] Invariant cache hit.
[2024-06-07 14:15:55] [INFO ] Performed 40325/73102 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2024-06-07 14:16:15] [INFO ] Dead Transitions using invariants and state equation in 49903 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68930 ms. Remains : 178/178 places, 73102/73102 transitions.
Built C files in :
/tmp/ltsmin6137483114036340407
[2024-06-07 14:16:17] [INFO ] Built C files in 2518ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6137483114036340407
Running compilation step : cd /tmp/ltsmin6137483114036340407;'/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/ltsmin6137483114036340407;'/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/ltsmin6137483114036340407;'/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 14:16:51] [INFO ] Flatten gal took : 17334 ms
[2024-06-07 14:17:08] [INFO ] Flatten gal took : 17015 ms
[2024-06-07 14:17:10] [INFO ] Time to serialize gal into /tmp/LTL2659802959247583860.gal : 1851 ms
[2024-06-07 14:17:10] [INFO ] Time to serialize properties into /tmp/LTL14707280576832824478.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/LTL2659802959247583860.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5148703204023428020.hoa' '-atoms' '/tmp/LTL14707280576832824478.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
Detected timeout of ITS tools.
[2024-06-07 14:18:02] [INFO ] Flatten gal took : 17915 ms
[2024-06-07 14:18:19] [INFO ] Flatten gal took : 16170 ms
[2024-06-07 14:18:21] [INFO ] Time to serialize gal into /tmp/LTL3150382981396312899.gal : 2446 ms
[2024-06-07 14:18:21] [INFO ] Time to serialize properties into /tmp/LTL18255846592686253332.ltl : 3 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/LTL3150382981396312899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18255846592686253332.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Detected timeout of ITS tools.
[2024-06-07 14:18:55] [INFO ] Flatten gal took : 17292 ms
[2024-06-07 14:18:55] [INFO ] Applying decomposition
[2024-06-07 14:19:10] [INFO ] Flatten gal took : 15293 ms
[2024-06-07 14:20:04] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6866571053308666484.txt' '-o' '/tmp/graph6866571053308666484.bin' '-w' '/tmp/graph6866571053308666484.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:663)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:341)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-06-07 14:20:32] [INFO ] Flatten gal took : 26862 ms
[2024-06-07 14:20:34] [INFO ] Time to serialize gal into /tmp/LTL1749265916309256634.gal : 2056 ms
[2024-06-07 14:20:34] [INFO ] Time to serialize properties into /tmp/LTL6839063835419859152.ltl : 15 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/LTL1749265916309256634.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6839063835419859152.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 149888 kB
After kill :
MemTotal: 16393216 kB
MemFree: 1420056 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-N08P5"
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-N08P5, 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-171774451500023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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