Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r165-tall-167838849900091.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Echo-PT-d03r05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-tall-167838849900091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 14:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 14:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 716K Mar 5 18:22 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 Echo-PT-d03r05-LTLCardinality-00
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-01
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-02
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-03
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-04
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-05
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-06
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-07
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-08
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-09
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-10
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-11
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-12
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-13
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-14
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679430682934

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d03r05
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-21 20:31:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 20:31:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 20:31:24] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2023-03-21 20:31:24] [INFO ] Transformed 1445 places.
[2023-03-21 20:31:24] [INFO ] Transformed 1190 transitions.
[2023-03-21 20:31:24] [INFO ] Found NUPN structural information;
[2023-03-21 20:31:24] [INFO ] Parsed PT model containing 1445 places and 1190 transitions and 8260 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA Echo-PT-d03r05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 1445 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1445/1445 places, 1190/1190 transitions.
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 1321 transition count 1190
Applied a total of 124 rules in 108 ms. Remains 1321 /1445 variables (removed 124) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1321 cols
[2023-03-21 20:31:26] [INFO ] Computed 601 place invariants in 1546 ms
[2023-03-21 20:31:43] [INFO ] Implicit Places using invariants in 18303 ms returned []
[2023-03-21 20:31:43] [INFO ] Invariant cache hit.
[2023-03-21 20:31:55] [INFO ] Implicit Places using invariants and state equation in 12586 ms returned []
Implicit Place search using SMT with State Equation took 30918 ms to find 0 implicit places.
[2023-03-21 20:31:55] [INFO ] Invariant cache hit.
[2023-03-21 20:32:55] [INFO ] Performed 1/1190 'is it Dead' test of which 0 returned DEAD in 57 seconds.
[2023-03-21 20:32:55] [INFO ] Dead Transitions using invariants and state equation in 60031 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1321/1445 places, 1190/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91060 ms. Remains : 1321/1445 places, 1190/1190 transitions.
Support contains 27 out of 1321 places after structural reductions.
[2023-03-21 20:32:56] [INFO ] Flatten gal took : 190 ms
[2023-03-21 20:32:56] [INFO ] Flatten gal took : 106 ms
[2023-03-21 20:32:56] [INFO ] Input system was already deterministic with 1190 transitions.
Finished random walk after 1351 steps, including 5 resets, run visited all 14 properties in 111 ms. (steps per millisecond=12 )
Computed a total of 1321 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1321 transition count 1190
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Graph (complete) has 4731 edges and 1321 vertex of which 1313 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.13 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 254 ms. Remains 1312 /1321 variables (removed 9) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2023-03-21 20:32:58] [INFO ] Computed 594 place invariants in 1620 ms
[2023-03-21 20:33:13] [INFO ] Implicit Places using invariants in 16427 ms returned [615, 716, 737, 742, 763, 864]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 16435 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1306/1321 places, 1188/1190 transitions.
Applied a total of 0 rules in 62 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16754 ms. Remains : 1306/1321 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s601 0) (NEQ s1082 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 322 steps with 2 reset in 10 ms.
FORMULA Echo-PT-d03r05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLCardinality-00 finished in 16976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U G(!p1))))'
Support contains 3 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1320 transition count 1190
Applied a total of 1 rules in 29 ms. Remains 1320 /1321 variables (removed 1) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2023-03-21 20:33:15] [INFO ] Computed 600 place invariants in 1765 ms
[2023-03-21 20:33:30] [INFO ] Implicit Places using invariants in 16645 ms returned []
[2023-03-21 20:33:30] [INFO ] Invariant cache hit.
[2023-03-21 20:36:10] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 20:36:10] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 20:36:10] [INFO ] Implicit Places using invariants and state equation in 160033 ms returned []
Implicit Place search using SMT with State Equation took 176682 ms to find 0 implicit places.
[2023-03-21 20:36:10] [INFO ] Invariant cache hit.
[2023-03-21 20:36:18] [INFO ] Dead Transitions using invariants and state equation in 8092 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1320/1321 places, 1190/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184804 ms. Remains : 1320/1321 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), p1]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 3}, { cond=p1, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(OR (EQ s1308 0) (EQ s1234 1)), p0:(EQ s267 1)], 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]]
Stuttering criterion allowed to conclude after 250 steps with 0 reset in 9 ms.
FORMULA Echo-PT-d03r05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLCardinality-02 finished in 185054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((G((!p2||F(p3)))||p1)))))'
Support contains 8 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1320 transition count 1190
Applied a total of 1 rules in 30 ms. Remains 1320 /1321 variables (removed 1) and now considering 1190/1190 (removed 0) transitions.
[2023-03-21 20:36:19] [INFO ] Invariant cache hit.
[2023-03-21 20:36:34] [INFO ] Implicit Places using invariants in 15302 ms returned []
[2023-03-21 20:36:34] [INFO ] Invariant cache hit.
[2023-03-21 20:39:14] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 20:39:14] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 20:39:14] [INFO ] Implicit Places using invariants and state equation in 160030 ms returned []
Implicit Place search using SMT with State Equation took 175337 ms to find 0 implicit places.
[2023-03-21 20:39:14] [INFO ] Invariant cache hit.
[2023-03-21 20:39:22] [INFO ] Dead Transitions using invariants and state equation in 8263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1320/1321 places, 1190/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183634 ms. Remains : 1320/1321 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s558 0) (EQ s1290 1) (NOT (OR (EQ s732 0) (EQ s104 1)))), p1:(OR (EQ s1200 0) (EQ s522 1)), p2:(OR (EQ s1050 0) (EQ s29 1)), p3:(OR (EQ s1200 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33282 reset in 896 ms.
Product exploration explored 100000 steps with 33411 reset in 833 ms.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2 p3), (X p1), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1053 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2 (NOT p1)), (AND p0 (NOT p3) p2 (NOT p1)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Finished Best-First random walk after 9802 steps, including 2 resets, run visited all 3 properties in 54 ms. (steps per millisecond=181 )
Knowledge obtained : [(AND p0 p1 p2 p3), (X p1), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND p0 (NOT p3) p2 (NOT p1))), (F (AND (NOT p3) (NOT p2) (NOT p1))), (F (AND (NOT p3) p2)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p3) p2 (NOT p1))), (F (AND p0 (NOT p3) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p3) (NOT p1))), (F (AND (NOT p3) (NOT p2)))]
Knowledge based reduction with 14 factoid took 1264 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2 (NOT p1)), (AND p0 (NOT p3) p2 (NOT p1)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2 (NOT p1)), (AND p0 (NOT p3) p2 (NOT p1)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Support contains 8 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 21 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-21 20:39:28] [INFO ] Invariant cache hit.
[2023-03-21 20:39:45] [INFO ] Implicit Places using invariants in 16294 ms returned []
[2023-03-21 20:39:45] [INFO ] Invariant cache hit.
[2023-03-21 20:42:25] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 20:42:25] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 20:42:25] [INFO ] Implicit Places using invariants and state equation in 160038 ms returned []
Implicit Place search using SMT with State Equation took 176333 ms to find 0 implicit places.
[2023-03-21 20:42:25] [INFO ] Invariant cache hit.
[2023-03-21 20:42:33] [INFO ] Dead Transitions using invariants and state equation in 8142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184525 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p3 p2 p1), (X p1), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 897 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 10) seen :7
Finished Best-First random walk after 607 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=202 )
Knowledge obtained : [(AND p0 p3 p2 p1), (X p1), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND p2 (NOT p3))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) p2 (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 14 factoid took 1221 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Product exploration explored 100000 steps with 33225 reset in 750 ms.
Product exploration explored 100000 steps with 33375 reset in 799 ms.
Applying partial POR strategy [false, true, false, true, true, true, false, true]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Support contains 8 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Graph (complete) has 4723 edges and 1320 vertex of which 1313 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.9 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 106 ms. Remains 1313 /1320 variables (removed 7) and now considering 1189/1190 (removed 1) transitions.
[2023-03-21 20:42:39] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 1189 rows 1313 cols
[2023-03-21 20:42:41] [INFO ] Computed 594 place invariants in 1636 ms
[2023-03-21 20:43:41] [INFO ] Performed 0/1189 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-21 20:43:41] [INFO ] Dead Transitions using invariants and state equation in 61653 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1313/1320 places, 1189/1190 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61884 ms. Remains : 1313/1320 places, 1189/1190 transitions.
Built C files in :
/tmp/ltsmin7341415143644485023
[2023-03-21 20:43:41] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7341415143644485023
Running compilation step : cd /tmp/ltsmin7341415143644485023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2823 ms.
Running link step : cd /tmp/ltsmin7341415143644485023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin7341415143644485023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9621248205259540183.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 28 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2023-03-21 20:43:58] [INFO ] Computed 600 place invariants in 1713 ms
[2023-03-21 20:44:14] [INFO ] Implicit Places using invariants in 17649 ms returned []
[2023-03-21 20:44:14] [INFO ] Invariant cache hit.
[2023-03-21 20:46:54] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 20:46:54] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 20:46:54] [INFO ] Implicit Places using invariants and state equation in 160021 ms returned []
Implicit Place search using SMT with State Equation took 177672 ms to find 0 implicit places.
[2023-03-21 20:46:54] [INFO ] Invariant cache hit.
[2023-03-21 20:47:02] [INFO ] Dead Transitions using invariants and state equation in 8024 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185726 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Built C files in :
/tmp/ltsmin14831722418117445141
[2023-03-21 20:47:02] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14831722418117445141
Running compilation step : cd /tmp/ltsmin14831722418117445141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2595 ms.
Running link step : cd /tmp/ltsmin14831722418117445141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14831722418117445141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13394210940978795475.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-21 20:47:17] [INFO ] Flatten gal took : 74 ms
[2023-03-21 20:47:17] [INFO ] Flatten gal took : 75 ms
[2023-03-21 20:47:17] [INFO ] Time to serialize gal into /tmp/LTL3528737385595013757.gal : 14 ms
[2023-03-21 20:47:17] [INFO ] Time to serialize properties into /tmp/LTL6835112495301343504.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3528737385595013757.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8530340634786395906.hoa' '-atoms' '/tmp/LTL6835112495301343504.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6835112495301343504.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8530340634786395906.hoa
Detected timeout of ITS tools.
[2023-03-21 20:47:32] [INFO ] Flatten gal took : 69 ms
[2023-03-21 20:47:32] [INFO ] Flatten gal took : 70 ms
[2023-03-21 20:47:32] [INFO ] Time to serialize gal into /tmp/LTL18175717530259539054.gal : 10 ms
[2023-03-21 20:47:32] [INFO ] Time to serialize properties into /tmp/LTL9304989954088372108.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18175717530259539054.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9304989954088372108.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(((p238==0)||(p970==1))||(!((p412==0)||(p1104==1))))")U(X(("((p880==0)||(p202==1))")||(G((!("((p730==0)||(p1029==1))"))||(F("((...185
Formula 0 simplified : F(!"(((p238==0)||(p970==1))||(!((p412==0)||(p1104==1))))" R X(!"((p880==0)||(p202==1))" & F("((p730==0)||(p1029==1))" & G!"((p880==0...172
Detected timeout of ITS tools.
[2023-03-21 20:47:47] [INFO ] Flatten gal took : 60 ms
[2023-03-21 20:47:47] [INFO ] Applying decomposition
[2023-03-21 20:47:47] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13853080901880810588.txt' '-o' '/tmp/graph13853080901880810588.bin' '-w' '/tmp/graph13853080901880810588.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13853080901880810588.bin' '-l' '-1' '-v' '-w' '/tmp/graph13853080901880810588.weights' '-q' '0' '-e' '0.001'
[2023-03-21 20:47:48] [INFO ] Decomposing Gal with order
[2023-03-21 20:47:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 20:47:48] [INFO ] Removed a total of 1923 redundant transitions.
[2023-03-21 20:47:48] [INFO ] Flatten gal took : 219 ms
[2023-03-21 20:47:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 261 labels/synchronizations in 72 ms.
[2023-03-21 20:47:48] [INFO ] Time to serialize gal into /tmp/LTL8578547339158550344.gal : 22 ms
[2023-03-21 20:47:48] [INFO ] Time to serialize properties into /tmp/LTL4716317197959370313.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8578547339158550344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4716317197959370313.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(((i1.u12.p238==0)||(i3.i1.u30.p970==1))||(!((i3.i1.u78.p412==0)||(i8.i1.u80.p1104==1))))")U(X(("((i0.i1.u19.p880==0)||(i6.i0.u...276
Formula 0 simplified : F(!"(((i1.u12.p238==0)||(i3.i1.u30.p970==1))||(!((i3.i1.u78.p412==0)||(i8.i1.u80.p1104==1))))" R X(!"((i0.i1.u19.p880==0)||(i6.i0.u8...263
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9574220990358790386
[2023-03-21 20:48:03] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9574220990358790386
Running compilation step : cd /tmp/ltsmin9574220990358790386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2811 ms.
Running link step : cd /tmp/ltsmin9574220990358790386;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9574220990358790386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U X(([]((!(LTLAPp2==true)||<>((LTLAPp3==true))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Echo-PT-d03r05-LTLCardinality-04 finished in 719785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 4 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1320 transition count 1190
Applied a total of 1 rules in 29 ms. Remains 1320 /1321 variables (removed 1) and now considering 1190/1190 (removed 0) transitions.
[2023-03-21 20:48:18] [INFO ] Invariant cache hit.
[2023-03-21 20:48:35] [INFO ] Implicit Places using invariants in 16401 ms returned []
[2023-03-21 20:48:35] [INFO ] Invariant cache hit.
[2023-03-21 20:51:15] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 20:51:15] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 20:51:15] [INFO ] Implicit Places using invariants and state equation in 160038 ms returned []
Implicit Place search using SMT with State Equation took 176441 ms to find 0 implicit places.
[2023-03-21 20:51:15] [INFO ] Invariant cache hit.
[2023-03-21 20:51:23] [INFO ] Dead Transitions using invariants and state equation in 8400 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1320/1321 places, 1190/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184873 ms. Remains : 1320/1321 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s164 0) (EQ s240 1)), p0:(OR (EQ s1237 0) (EQ s655 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 902 ms.
Product exploration explored 100000 steps with 50000 reset in 906 ms.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 8 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r05-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r05-LTLCardinality-05 finished in 187452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1320 transition count 1190
Applied a total of 1 rules in 29 ms. Remains 1320 /1321 variables (removed 1) and now considering 1190/1190 (removed 0) transitions.
[2023-03-21 20:51:26] [INFO ] Invariant cache hit.
[2023-03-21 20:51:43] [INFO ] Implicit Places using invariants in 17003 ms returned []
[2023-03-21 20:51:43] [INFO ] Invariant cache hit.
[2023-03-21 20:54:23] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-21 20:54:23] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-21 20:54:23] [INFO ] Implicit Places using invariants and state equation in 160025 ms returned []
Implicit Place search using SMT with State Equation took 177033 ms to find 0 implicit places.
[2023-03-21 20:54:23] [INFO ] Invariant cache hit.
[2023-03-21 20:54:31] [INFO ] Dead Transitions using invariants and state equation in 8351 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1320/1321 places, 1190/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185414 ms. Remains : 1320/1321 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s471 0) (NEQ s271 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r05-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLCardinality-06 finished in 185549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Applied a total of 0 rules in 21 ms. Remains 1321 /1321 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1321 cols
[2023-03-21 20:54:33] [INFO ] Computed 601 place invariants in 1432 ms
[2023-03-21 20:54:50] [INFO ] Implicit Places using invariants in 18839 ms returned []
[2023-03-21 20:54:50] [INFO ] Invariant cache hit.
[2023-03-21 20:55:02] [INFO ] Implicit Places using invariants and state equation in 11977 ms returned []
Implicit Place search using SMT with State Equation took 30818 ms to find 0 implicit places.
[2023-03-21 20:55:02] [INFO ] Invariant cache hit.
[2023-03-21 20:56:02] [INFO ] Performed 1/1190 'is it Dead' test of which 0 returned DEAD in 57 seconds.
[2023-03-21 20:56:02] [INFO ] Dead Transitions using invariants and state equation in 60015 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90854 ms. Remains : 1321/1321 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s830 0) (EQ s470 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 919 ms.
Product exploration explored 100000 steps with 50000 reset in 954 ms.
Computed a total of 1321 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1321 transition count 1190
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r05-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r05-LTLCardinality-09 finished in 93298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Graph (complete) has 4731 edges and 1321 vertex of which 1313 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.9 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 46 ms. Remains 1312 /1321 variables (removed 9) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2023-03-21 20:56:06] [INFO ] Computed 594 place invariants in 1627 ms
[2023-03-21 20:56:19] [INFO ] Implicit Places using invariants in 14661 ms returned [716, 737, 742, 763, 864]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 14665 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1307/1321 places, 1188/1190 transitions.
Applied a total of 0 rules in 37 ms. Remains 1307 /1307 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14748 ms. Remains : 1307/1321 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s868 0) (NEQ s919 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 300 steps with 1 reset in 5 ms.
FORMULA Echo-PT-d03r05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLCardinality-11 finished in 14856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Graph (complete) has 4731 edges and 1321 vertex of which 1313 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 38 ms. Remains 1312 /1321 variables (removed 9) and now considering 1188/1190 (removed 2) transitions.
[2023-03-21 20:56:19] [INFO ] Invariant cache hit.
[2023-03-21 20:56:31] [INFO ] Implicit Places using invariants in 11665 ms returned [615, 716, 737, 742, 763, 864]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 11667 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1306/1321 places, 1188/1190 transitions.
Applied a total of 0 rules in 35 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11740 ms. Remains : 1306/1321 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s557 0) (EQ s876 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 401 reset in 1371 ms.
Product exploration explored 100000 steps with 401 reset in 1376 ms.
Computed a total of 1306 stabilizing places and 1188 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1306 transition count 1188
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 720 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=65 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 2 out of 1306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1306/1306 places, 1188/1188 transitions.
Applied a total of 0 rules in 36 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
// Phase 1: matrix 1188 rows 1306 cols
[2023-03-21 20:56:36] [INFO ] Computed 588 place invariants in 1391 ms
[2023-03-21 20:59:16] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-21 20:59:16] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-21 20:59:16] [INFO ] Implicit Places using invariants in 161415 ms returned []
[2023-03-21 20:59:16] [INFO ] Invariant cache hit.
[2023-03-21 21:01:56] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-21 21:01:56] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-21 21:01:56] [INFO ] Implicit Places using invariants and state equation in 160024 ms returned []
Implicit Place search using SMT with State Equation took 321440 ms to find 0 implicit places.
[2023-03-21 21:01:56] [INFO ] Redundant transitions in 116 ms returned []
[2023-03-21 21:01:56] [INFO ] Invariant cache hit.
[2023-03-21 21:02:56] [INFO ] Performed 890/1188 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-21 21:02:56] [INFO ] Dead Transitions using invariants and state equation in 60017 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 381620 ms. Remains : 1306/1306 places, 1188/1188 transitions.
Computed a total of 1306 stabilizing places and 1188 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1306 transition count 1188
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Finished random walk after 141 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=35 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 401 reset in 1236 ms.
Product exploration explored 100000 steps with 401 reset in 1348 ms.
Built C files in :
/tmp/ltsmin7795092274473199127
[2023-03-21 21:03:00] [INFO ] Computing symmetric may disable matrix : 1188 transitions.
[2023-03-21 21:03:00] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 21:03:00] [INFO ] Computing symmetric may enable matrix : 1188 transitions.
[2023-03-21 21:03:00] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 21:03:00] [INFO ] Computing Do-Not-Accords matrix : 1188 transitions.
[2023-03-21 21:03:00] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 21:03:00] [INFO ] Built C files in 299ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7795092274473199127
Running compilation step : cd /tmp/ltsmin7795092274473199127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7795092274473199127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7795092274473199127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 2 out of 1306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1306/1306 places, 1188/1188 transitions.
Applied a total of 0 rules in 47 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
[2023-03-21 21:03:04] [INFO ] Invariant cache hit.
[2023-03-21 21:03:19] [INFO ] Implicit Places using invariants in 15331 ms returned []
[2023-03-21 21:03:19] [INFO ] Invariant cache hit.
[2023-03-21 21:05:59] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-21 21:05:59] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-21 21:05:59] [INFO ] Implicit Places using invariants and state equation in 160024 ms returned []
Implicit Place search using SMT with State Equation took 175358 ms to find 0 implicit places.
[2023-03-21 21:05:59] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-21 21:05:59] [INFO ] Invariant cache hit.
[2023-03-21 21:06:59] [INFO ] Performed 890/1188 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-21 21:06:59] [INFO ] Dead Transitions using invariants and state equation in 60019 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235452 ms. Remains : 1306/1306 places, 1188/1188 transitions.
Built C files in :
/tmp/ltsmin960354382003935710
[2023-03-21 21:06:59] [INFO ] Computing symmetric may disable matrix : 1188 transitions.
[2023-03-21 21:06:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 21:06:59] [INFO ] Computing symmetric may enable matrix : 1188 transitions.
[2023-03-21 21:06:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 21:06:59] [INFO ] Computing Do-Not-Accords matrix : 1188 transitions.
[2023-03-21 21:06:59] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 21:06:59] [INFO ] Built C files in 260ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin960354382003935710
Running compilation step : cd /tmp/ltsmin960354382003935710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin960354382003935710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin960354382003935710;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-21 21:07:02] [INFO ] Flatten gal took : 55 ms
[2023-03-21 21:07:02] [INFO ] Flatten gal took : 54 ms
[2023-03-21 21:07:02] [INFO ] Time to serialize gal into /tmp/LTL8301094592815544441.gal : 9 ms
[2023-03-21 21:07:02] [INFO ] Time to serialize properties into /tmp/LTL14178516039916356719.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8301094592815544441.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14935568839162399515.hoa' '-atoms' '/tmp/LTL14178516039916356719.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14178516039916356719.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14935568839162399515.hoa
Detected timeout of ITS tools.
[2023-03-21 21:07:18] [INFO ] Flatten gal took : 50 ms
[2023-03-21 21:07:18] [INFO ] Flatten gal took : 50 ms
[2023-03-21 21:07:18] [INFO ] Time to serialize gal into /tmp/LTL5015750776750631315.gal : 9 ms
[2023-03-21 21:07:18] [INFO ] Time to serialize properties into /tmp/LTL18149994998048269015.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5015750776750631315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18149994998048269015.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p239==0)||(p570==1))"))))
Formula 0 simplified : GF!"((p239==0)||(p570==1))"
Detected timeout of ITS tools.
[2023-03-21 21:07:33] [INFO ] Flatten gal took : 50 ms
[2023-03-21 21:07:33] [INFO ] Applying decomposition
[2023-03-21 21:07:33] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7737727333937799948.txt' '-o' '/tmp/graph7737727333937799948.bin' '-w' '/tmp/graph7737727333937799948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7737727333937799948.bin' '-l' '-1' '-v' '-w' '/tmp/graph7737727333937799948.weights' '-q' '0' '-e' '0.001'
[2023-03-21 21:07:33] [INFO ] Decomposing Gal with order
[2023-03-21 21:07:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 21:07:33] [INFO ] Removed a total of 1979 redundant transitions.
[2023-03-21 21:07:33] [INFO ] Flatten gal took : 103 ms
[2023-03-21 21:07:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 460 labels/synchronizations in 68 ms.
[2023-03-21 21:07:33] [INFO ] Time to serialize gal into /tmp/LTL4189017055163920329.gal : 19 ms
[2023-03-21 21:07:33] [INFO ] Time to serialize properties into /tmp/LTL9102991085600989906.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4189017055163920329.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9102991085600989906.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((i0.u1.p239==0)||(i4.i0.u46.p570==1))"))))
Formula 0 simplified : GF!"((i0.u1.p239==0)||(i4.i0.u46.p570==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12598766920039812959
[2023-03-21 21:07:48] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12598766920039812959
Running compilation step : cd /tmp/ltsmin12598766920039812959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2537 ms.
Running link step : cd /tmp/ltsmin12598766920039812959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12598766920039812959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Echo-PT-d03r05-LTLCardinality-13 finished in 703988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Graph (complete) has 4731 edges and 1321 vertex of which 1313 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 41 ms. Remains 1312 /1321 variables (removed 9) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2023-03-21 21:08:05] [INFO ] Computed 594 place invariants in 1496 ms
[2023-03-21 21:08:18] [INFO ] Implicit Places using invariants in 14832 ms returned [615, 716, 737, 742, 763, 864]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 14836 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1306/1321 places, 1188/1190 transitions.
Applied a total of 0 rules in 41 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14919 ms. Remains : 1306/1321 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1109 0) (EQ s779 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1722 steps with 20 reset in 29 ms.
FORMULA Echo-PT-d03r05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLCardinality-15 finished in 15034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((G((!p2||F(p3)))||p1)))))'
Found a Lengthening insensitive property : Echo-PT-d03r05-LTLCardinality-04
Stuttering acceptance computed with spot in 338 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Support contains 8 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Graph (complete) has 4731 edges and 1321 vertex of which 1313 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 40 ms. Remains 1312 /1321 variables (removed 9) and now considering 1188/1190 (removed 2) transitions.
[2023-03-21 21:08:19] [INFO ] Invariant cache hit.
[2023-03-21 21:08:33] [INFO ] Implicit Places using invariants in 13587 ms returned [615, 716, 737, 742, 763, 864]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 13594 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1306/1321 places, 1188/1190 transitions.
Applied a total of 0 rules in 36 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 13670 ms. Remains : 1306/1321 places, 1188/1190 transitions.
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s556 0) (EQ s1276 1) (NOT (OR (EQ s728 0) (EQ s104 1)))), p1:(OR (EQ s1186 0) (EQ s520 1)), p2:(OR (EQ s1036 0) (EQ s29 1)), p3:(OR (EQ s1186 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33314 reset in 836 ms.
Product exploration explored 100000 steps with 33346 reset in 906 ms.
Computed a total of 1306 stabilizing places and 1188 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1306 transition count 1188
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2 p3), (X p1), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 864 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2 (NOT p1)), (AND p0 (NOT p3) p2 (NOT p1)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Finished Best-First random walk after 2116 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=192 )
Knowledge obtained : [(AND p0 p1 p2 p3), (X p1), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND p0 (NOT p3) p2 (NOT p1))), (F (AND (NOT p3) (NOT p2) (NOT p1))), (F (AND (NOT p3) p2)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p3) p2 (NOT p1))), (F (AND p0 (NOT p3) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p3) (NOT p1))), (F (AND (NOT p3) (NOT p2)))]
Knowledge based reduction with 14 factoid took 1466 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2 (NOT p1)), (AND p0 (NOT p3) p2 (NOT p1)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2 (NOT p1)), (AND p0 (NOT p3) p2 (NOT p1)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Support contains 8 out of 1306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1306/1306 places, 1188/1188 transitions.
Applied a total of 0 rules in 23 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
// Phase 1: matrix 1188 rows 1306 cols
[2023-03-21 21:08:40] [INFO ] Computed 588 place invariants in 1485 ms
[2023-03-21 21:11:20] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-21 21:11:20] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-21 21:11:20] [INFO ] Implicit Places using invariants in 161509 ms returned []
[2023-03-21 21:11:20] [INFO ] Invariant cache hit.
[2023-03-21 21:14:00] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-21 21:14:00] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-21 21:14:00] [INFO ] Implicit Places using invariants and state equation in 160036 ms returned []
Implicit Place search using SMT with State Equation took 321546 ms to find 0 implicit places.
[2023-03-21 21:14:00] [INFO ] Invariant cache hit.
[2023-03-21 21:15:00] [INFO ] Performed 890/1188 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-21 21:15:00] [INFO ] Dead Transitions using invariants and state equation in 60021 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 381591 ms. Remains : 1306/1306 places, 1188/1188 transitions.
Computed a total of 1306 stabilizing places and 1188 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1306 transition count 1188
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p3 p2 p1), (X p1), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 935 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Finished random walk after 922 steps, including 3 resets, run visited all 10 properties in 24 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND p0 p3 p2 p1), (X p1), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND p2 (NOT p3))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) p2 (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 14 factoid took 1149 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Product exploration explored 100000 steps with 33189 reset in 843 ms.
Product exploration explored 100000 steps with 33429 reset in 890 ms.
Applying partial POR strategy [false, true, false, true, true, true, false, true]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Support contains 8 out of 1306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1306/1306 places, 1188/1188 transitions.
Applied a total of 0 rules in 33 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
[2023-03-21 21:15:06] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-21 21:15:06] [INFO ] Invariant cache hit.
[2023-03-21 21:16:06] [INFO ] Performed 890/1188 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-21 21:16:06] [INFO ] Dead Transitions using invariants and state equation in 60018 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60084 ms. Remains : 1306/1306 places, 1188/1188 transitions.
Built C files in :
/tmp/ltsmin12909123138323626231
[2023-03-21 21:16:06] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12909123138323626231
Running compilation step : cd /tmp/ltsmin12909123138323626231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2756 ms.
Running link step : cd /tmp/ltsmin12909123138323626231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12909123138323626231;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased274179811173501023.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 1306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1306/1306 places, 1188/1188 transitions.
Applied a total of 0 rules in 22 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
[2023-03-21 21:16:21] [INFO ] Invariant cache hit.
[2023-03-21 21:16:38] [INFO ] Implicit Places using invariants in 16693 ms returned []
[2023-03-21 21:16:38] [INFO ] Invariant cache hit.
[2023-03-21 21:19:18] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-21 21:19:18] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-21 21:19:18] [INFO ] Implicit Places using invariants and state equation in 160039 ms returned []
Implicit Place search using SMT with State Equation took 176737 ms to find 0 implicit places.
[2023-03-21 21:19:18] [INFO ] Invariant cache hit.
[2023-03-21 21:20:18] [INFO ] Performed 890/1188 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-21 21:20:18] [INFO ] Dead Transitions using invariants and state equation in 60026 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236785 ms. Remains : 1306/1306 places, 1188/1188 transitions.
Built C files in :
/tmp/ltsmin11431696453545636019
[2023-03-21 21:20:19] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11431696453545636019
Running compilation step : cd /tmp/ltsmin11431696453545636019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2716 ms.
Running link step : cd /tmp/ltsmin11431696453545636019;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11431696453545636019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14546647567033264872.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-21 21:20:34] [INFO ] Flatten gal took : 49 ms
[2023-03-21 21:20:34] [INFO ] Flatten gal took : 49 ms
[2023-03-21 21:20:34] [INFO ] Time to serialize gal into /tmp/LTL17425877437656684113.gal : 10 ms
[2023-03-21 21:20:34] [INFO ] Time to serialize properties into /tmp/LTL11894394845865061048.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17425877437656684113.gal' '-t' 'CGAL' '-hoa' '/tmp/aut375163085477999871.hoa' '-atoms' '/tmp/LTL11894394845865061048.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11894394845865061048.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut375163085477999871.hoa
Detected timeout of ITS tools.
[2023-03-21 21:20:49] [INFO ] Flatten gal took : 50 ms
[2023-03-21 21:20:49] [INFO ] Flatten gal took : 50 ms
[2023-03-21 21:20:49] [INFO ] Time to serialize gal into /tmp/LTL8962857387559387082.gal : 13 ms
[2023-03-21 21:20:49] [INFO ] Time to serialize properties into /tmp/LTL10616895883566535139.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8962857387559387082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10616895883566535139.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(((p238==0)||(p970==1))||(!((p412==0)||(p1104==1))))")U(X(("((p880==0)||(p202==1))")||(G((!("((p730==0)||(p1029==1))"))||(F("((...185
Formula 0 simplified : F(!"(((p238==0)||(p970==1))||(!((p412==0)||(p1104==1))))" R X(!"((p880==0)||(p202==1))" & F("((p730==0)||(p1029==1))" & G!"((p880==0...172
Detected timeout of ITS tools.
[2023-03-21 21:21:04] [INFO ] Flatten gal took : 51 ms
[2023-03-21 21:21:04] [INFO ] Applying decomposition
[2023-03-21 21:21:04] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9767693118544810185.txt' '-o' '/tmp/graph9767693118544810185.bin' '-w' '/tmp/graph9767693118544810185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9767693118544810185.bin' '-l' '-1' '-v' '-w' '/tmp/graph9767693118544810185.weights' '-q' '0' '-e' '0.001'
[2023-03-21 21:21:04] [INFO ] Decomposing Gal with order
[2023-03-21 21:21:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 21:21:04] [INFO ] Removed a total of 1938 redundant transitions.
[2023-03-21 21:21:04] [INFO ] Flatten gal took : 142 ms
[2023-03-21 21:21:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 367 labels/synchronizations in 52 ms.
[2023-03-21 21:21:05] [INFO ] Time to serialize gal into /tmp/LTL7886823961419348535.gal : 15 ms
[2023-03-21 21:21:05] [INFO ] Time to serialize properties into /tmp/LTL4880930354613042437.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7886823961419348535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4880930354613042437.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(((i6.u12.p238==0)||(i3.i0.i1.u26.p970==1))||(!((i7.u30.p412==0)||(i3.i0.i1.u93.p1104==1))))")U(X(("((i0.u60.p880==0)||(i1.u67....272
Formula 0 simplified : F(!"(((i6.u12.p238==0)||(i3.i0.i1.u26.p970==1))||(!((i7.u30.p412==0)||(i3.i0.i1.u93.p1104==1))))" R X(!"((i0.u60.p880==0)||(i1.u67.p...259
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6851950811583592901
[2023-03-21 21:21:20] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6851950811583592901
Running compilation step : cd /tmp/ltsmin6851950811583592901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin6851950811583592901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin6851950811583592901;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 Echo-PT-d03r05-LTLCardinality-04 finished in 784130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-21 21:21:24] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12001247328893392135
[2023-03-21 21:21:24] [INFO ] Computing symmetric may disable matrix : 1190 transitions.
[2023-03-21 21:21:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 21:21:24] [INFO ] Computing symmetric may enable matrix : 1190 transitions.
[2023-03-21 21:21:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 21:21:24] [INFO ] Applying decomposition
[2023-03-21 21:21:24] [INFO ] Flatten gal took : 53 ms
[2023-03-21 21:21:24] [INFO ] Computing Do-Not-Accords matrix : 1190 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7629987415068920766.txt' '-o' '/tmp/graph7629987415068920766.bin' '-w' '/tmp/graph7629987415068920766.weights'
[2023-03-21 21:21:24] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7629987415068920766.bin' '-l' '-1' '-v' '-w' '/tmp/graph7629987415068920766.weights' '-q' '0' '-e' '0.001'
[2023-03-21 21:21:24] [INFO ] Decomposing Gal with order
[2023-03-21 21:21:24] [INFO ] Built C files in 280ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12001247328893392135
Running compilation step : cd /tmp/ltsmin12001247328893392135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-21 21:21:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-21 21:21:24] [INFO ] Removed a total of 1979 redundant transitions.
[2023-03-21 21:21:24] [INFO ] Flatten gal took : 106 ms
[2023-03-21 21:21:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 417 labels/synchronizations in 35 ms.
[2023-03-21 21:21:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality10434609237033410033.gal : 19 ms
[2023-03-21 21:21:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality2055903302961048131.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10434609237033410033.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2055903302961048131.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((G(("(((i1.i0.u2.p238==0)||(i3.i1.u27.p970==1))||(!((i8.u82.p412==0)||(i6.i0.u39.p1104==1))))")U(X(("((i0.i1.u16.p880==0)||(i7.i2.u8...280
Formula 0 simplified : F(!"(((i1.i0.u2.p238==0)||(i3.i1.u27.p970==1))||(!((i8.u82.p412==0)||(i6.i0.u39.p1104==1))))" R X(!"((i0.i1.u16.p880==0)||(i7.i2.u80...267
Compilation finished in 5212 ms.
Running link step : cd /tmp/ltsmin12001247328893392135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin12001247328893392135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true) U X(([]((!(LTLAPp2==true)||<>((LTLAPp3==true))))||(LTLAPp1==true)))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6573284 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14543680 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d03r05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Echo-PT-d03r05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r165-tall-167838849900091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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