Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110300411.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
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 r078-tall-165260110300411
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 8.3K Apr 29 11:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 29 11:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 29 11:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 11:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 716K May 10 09:33 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 1652674715714

Running Version 202205111006
[2022-05-16 04:18:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 04:18:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 04:18:37] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2022-05-16 04:18:37] [INFO ] Transformed 1445 places.
[2022-05-16 04:18:37] [INFO ] Transformed 1190 transitions.
[2022-05-16 04:18:37] [INFO ] Found NUPN structural information;
[2022-05-16 04:18:37] [INFO ] Parsed PT model containing 1445 places and 1190 transitions in 308 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Echo-PT-d03r05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 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 120 ms. Remains 1321 /1445 variables (removed 124) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1321 cols
[2022-05-16 04:18:38] [INFO ] Computed 601 place invariants in 1515 ms
[2022-05-16 04:18:54] [INFO ] Implicit Places using invariants in 16619 ms returned []
// Phase 1: matrix 1190 rows 1321 cols
[2022-05-16 04:18:55] [INFO ] Computed 601 place invariants in 1369 ms
[2022-05-16 04:19:09] [INFO ] Implicit Places using invariants and state equation in 15138 ms returned []
Implicit Place search using SMT with State Equation took 31786 ms to find 0 implicit places.
// Phase 1: matrix 1190 rows 1321 cols
[2022-05-16 04:19:10] [INFO ] Computed 601 place invariants in 1288 ms
[2022-05-16 04:20:10] [INFO ] Performed 1040/1190 'is it Dead' test of which 0 returned DEAD in 57 seconds.
[2022-05-16 04:20:10] [INFO ] Dead Transitions using invariants and state equation in 61331 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1321/1445 places, 1190/1190 transitions.
Finished structural reductions, in 1 iterations. Remains : 1321/1445 places, 1190/1190 transitions.
Support contains 18 out of 1321 places after structural reductions.
[2022-05-16 04:20:10] [INFO ] Flatten gal took : 206 ms
[2022-05-16 04:20:11] [INFO ] Flatten gal took : 121 ms
[2022-05-16 04:20:11] [INFO ] Input system was already deterministic with 1190 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1190 rows 1321 cols
[2022-05-16 04:20:13] [INFO ] Computed 601 place invariants in 1375 ms
[2022-05-16 04:20:13] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA Echo-PT-d03r05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(F(X(F(p1))))&&p0))||F(p2))))'
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 49 ms. Remains 1320 /1321 variables (removed 1) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2022-05-16 04:20:15] [INFO ] Computed 600 place invariants in 1709 ms
[2022-05-16 04:20:29] [INFO ] Implicit Places using invariants in 16076 ms returned []
// Phase 1: matrix 1190 rows 1320 cols
[2022-05-16 04:20:31] [INFO ] Computed 600 place invariants in 1664 ms
[2022-05-16 04:23:11] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2022-05-16 04:23:11] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2022-05-16 04:23:11] [INFO ] Implicit Places using invariants and state equation in 161691 ms returned []
Implicit Place search using SMT with State Equation took 177770 ms to find 0 implicit places.
// Phase 1: matrix 1190 rows 1320 cols
[2022-05-16 04:23:12] [INFO ] Computed 600 place invariants in 1620 ms
[2022-05-16 04:23:20] [INFO ] Dead Transitions using invariants and state equation in 8836 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1320/1321 places, 1190/1190 transitions.
Finished structural reductions, in 1 iterations. Remains : 1320/1321 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s1083 0) (EQ s1220 1)), p1:(AND (EQ s113 0) (EQ s1103 1)), p0:(AND (EQ s113 0) (EQ s1103 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 336 steps with 1 reset in 15 ms.
FORMULA Echo-PT-d03r05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLCardinality-00 finished in 187024 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(X(p0)))||G((G(X(p1))&&p2)))))'
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 48 ms. Remains 1320 /1321 variables (removed 1) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2022-05-16 04:23:22] [INFO ] Computed 600 place invariants in 1811 ms
[2022-05-16 04:23:36] [INFO ] Implicit Places using invariants in 15965 ms returned []
// Phase 1: matrix 1190 rows 1320 cols
[2022-05-16 04:23:38] [INFO ] Computed 600 place invariants in 1659 ms
[2022-05-16 04:26:18] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2022-05-16 04:26:18] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2022-05-16 04:26:18] [INFO ] Implicit Places using invariants and state equation in 161680 ms returned []
Implicit Place search using SMT with State Equation took 177647 ms to find 0 implicit places.
// Phase 1: matrix 1190 rows 1320 cols
[2022-05-16 04:26:19] [INFO ] Computed 600 place invariants in 1689 ms
[2022-05-16 04:26:27] [INFO ] Dead Transitions using invariants and state equation in 8970 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1320/1321 places, 1190/1190 transitions.
Finished structural reductions, in 1 iterations. Remains : 1320/1321 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (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=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=1 dest: 0}, { cond=(AND p2 p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=5 dest: 1}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(EQ s268 1), p0:(EQ s601 1), p1:(OR (EQ s1283 0) (EQ s917 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d03r05-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLCardinality-06 finished in 186980 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(F(F(G(X(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.22 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 135 ms. Remains 1312 /1321 variables (removed 9) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2022-05-16 04:26:29] [INFO ] Computed 594 place invariants in 1482 ms
[2022-05-16 04:26:43] [INFO ] Implicit Places using invariants in 15909 ms returned [615, 716, 737, 742, 763, 864]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 15916 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 81 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1306/1321 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s917 0) (EQ s196 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 1296 ms.
Product exploration explored 100000 steps with 401 reset in 1326 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 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=4 )
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 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 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 54 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
// Phase 1: matrix 1188 rows 1306 cols
[2022-05-16 04:26:48] [INFO ] Computed 588 place invariants in 1366 ms
[2022-05-16 04:29:28] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 04:29:28] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 04:29:28] [INFO ] Implicit Places using invariants in 161392 ms returned []
// Phase 1: matrix 1188 rows 1306 cols
[2022-05-16 04:29:29] [INFO ] Computed 588 place invariants in 1348 ms
[2022-05-16 04:32:09] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 04:32:09] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 04:32:09] [INFO ] Implicit Places using invariants and state equation in 161383 ms returned []
Implicit Place search using SMT with State Equation took 322778 ms to find 0 implicit places.
[2022-05-16 04:32:10] [INFO ] Redundant transitions in 80 ms returned []
// Phase 1: matrix 1188 rows 1306 cols
[2022-05-16 04:32:11] [INFO ] Computed 588 place invariants in 1329 ms
[2022-05-16 04:33:11] [INFO ] Performed 993/1188 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2022-05-16 04:33:11] [INFO ] Dead Transitions using invariants and state equation in 61345 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 309 steps, including 1 resets, run visited all 1 properties in 13 ms. (steps per millisecond=23 )
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 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 401 reset in 1213 ms.
Product exploration explored 100000 steps with 401 reset in 1330 ms.
Built C files in :
/tmp/ltsmin7618146084554365937
[2022-05-16 04:33:14] [INFO ] Computing symmetric may disable matrix : 1188 transitions.
[2022-05-16 04:33:14] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 04:33:14] [INFO ] Computing symmetric may enable matrix : 1188 transitions.
[2022-05-16 04:33:14] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 04:33:15] [INFO ] Computing Do-Not-Accords matrix : 1188 transitions.
[2022-05-16 04:33:15] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 04:33:15] [INFO ] Built C files in 316ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7618146084554365937
Running compilation step : cd /tmp/ltsmin7618146084554365937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7618146084554365937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7618146084554365937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
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 71 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
// Phase 1: matrix 1188 rows 1306 cols
[2022-05-16 04:33:19] [INFO ] Computed 588 place invariants in 1383 ms
[2022-05-16 04:35:59] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 04:35:59] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 04:35:59] [INFO ] Implicit Places using invariants in 161395 ms returned []
// Phase 1: matrix 1188 rows 1306 cols
[2022-05-16 04:36:01] [INFO ] Computed 588 place invariants in 1351 ms
[2022-05-16 04:38:41] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2022-05-16 04:38:41] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2022-05-16 04:38:41] [INFO ] Implicit Places using invariants and state equation in 161377 ms returned []
Implicit Place search using SMT with State Equation took 322772 ms to find 0 implicit places.
[2022-05-16 04:38:41] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1188 rows 1306 cols
[2022-05-16 04:38:42] [INFO ] Computed 588 place invariants in 1310 ms
[2022-05-16 04:39:42] [INFO ] Performed 993/1188 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2022-05-16 04:39:42] [INFO ] Dead Transitions using invariants and state equation in 61325 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1306/1306 places, 1188/1188 transitions.
Built C files in :
/tmp/ltsmin12156532971111351859
[2022-05-16 04:39:42] [INFO ] Computing symmetric may disable matrix : 1188 transitions.
[2022-05-16 04:39:42] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 04:39:42] [INFO ] Computing symmetric may enable matrix : 1188 transitions.
[2022-05-16 04:39:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 04:39:42] [INFO ] Computing Do-Not-Accords matrix : 1188 transitions.
[2022-05-16 04:39:42] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 04:39:42] [INFO ] Built C files in 170ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12156532971111351859
Running compilation step : cd /tmp/ltsmin12156532971111351859;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12156532971111351859;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12156532971111351859;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 04:39:45] [INFO ] Flatten gal took : 112 ms
[2022-05-16 04:39:46] [INFO ] Flatten gal took : 81 ms
[2022-05-16 04:39:46] [INFO ] Time to serialize gal into /tmp/LTL14472999442525722668.gal : 15 ms
[2022-05-16 04:39:46] [INFO ] Time to serialize properties into /tmp/LTL6671170053002744667.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14472999442525722668.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6671170053002744667.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1447299...267
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X(F(F(G(X(G("((p611==0)||(p1196==1))")))))))))))
Formula 0 simplified : !XFXXFGXG"((p611==0)||(p1196==1))"
Detected timeout of ITS tools.
[2022-05-16 04:40:01] [INFO ] Flatten gal took : 90 ms
[2022-05-16 04:40:01] [INFO ] Applying decomposition
[2022-05-16 04:40:01] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7197348452135520676.txt' '-o' '/tmp/graph7197348452135520676.bin' '-w' '/tmp/graph7197348452135520676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7197348452135520676.bin' '-l' '-1' '-v' '-w' '/tmp/graph7197348452135520676.weights' '-q' '0' '-e' '0.001'
[2022-05-16 04:40:01] [INFO ] Decomposing Gal with order
[2022-05-16 04:40:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 04:40:01] [INFO ] Removed a total of 1943 redundant transitions.
[2022-05-16 04:40:01] [INFO ] Flatten gal took : 245 ms
[2022-05-16 04:40:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 393 labels/synchronizations in 71 ms.
[2022-05-16 04:40:02] [INFO ] Time to serialize gal into /tmp/LTL5674845715099183629.gal : 21 ms
[2022-05-16 04:40:02] [INFO ] Time to serialize properties into /tmp/LTL1863604611161734698.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5674845715099183629.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1863604611161734698.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5674845...245
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X(F(F(G(X(G("((i8.u52.p611==0)||(i7.i1.u51.p1196==1))")))))))))))
Formula 0 simplified : !XFXXFGXG"((i8.u52.p611==0)||(i7.i1.u51.p1196==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9834151959588295867
[2022-05-16 04:40:17] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9834151959588295867
Running compilation step : cd /tmp/ltsmin9834151959588295867;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2532 ms.
Running link step : cd /tmp/ltsmin9834151959588295867;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin9834151959588295867;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(X(<>(<>([](X([]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Echo-PT-d03r05-LTLCardinality-07 finished in 844749 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(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.
Applied a total of 0 rules in 32 ms. Remains 1321 /1321 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1321 cols
[2022-05-16 04:40:33] [INFO ] Computed 601 place invariants in 1306 ms
[2022-05-16 04:40:48] [INFO ] Implicit Places using invariants in 15799 ms returned []
// Phase 1: matrix 1190 rows 1321 cols
[2022-05-16 04:40:49] [INFO ] Computed 601 place invariants in 1293 ms
[2022-05-16 04:43:29] [INFO ] Performed 464/1321 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2022-05-16 04:43:29] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2022-05-16 04:43:29] [INFO ] Implicit Places using invariants and state equation in 161319 ms returned []
Implicit Place search using SMT with State Equation took 177123 ms to find 0 implicit places.
// Phase 1: matrix 1190 rows 1321 cols
[2022-05-16 04:43:30] [INFO ] Computed 601 place invariants in 1242 ms
[2022-05-16 04:44:30] [INFO ] Performed 1040/1190 'is it Dead' test of which 0 returned DEAD in 57 seconds.
[2022-05-16 04:44:30] [INFO ] Dead Transitions using invariants and state equation in 61267 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1321/1321 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s620 0) (EQ s1244 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 147 steps with 0 reset in 5 ms.
FORMULA Echo-PT-d03r05-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLCardinality-12 finished in 238545 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 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 40 ms. Remains 1312 /1321 variables (removed 9) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2022-05-16 04:44:32] [INFO ] Computed 594 place invariants in 1425 ms
[2022-05-16 04:44:47] [INFO ] Implicit Places using invariants in 16176 ms returned [615, 716, 737, 742, 763, 864]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 16177 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 37 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1306/1321 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-14 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:(OR (AND (NEQ s807 0) (NEQ s427 1)) (AND (NEQ s155 0) (NEQ s594 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 8921 steps with 80 reset in 180 ms.
FORMULA Echo-PT-d03r05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLCardinality-14 finished in 16513 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 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 25 ms. Remains 1320 /1321 variables (removed 1) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2022-05-16 04:44:48] [INFO ] Computed 600 place invariants in 1578 ms
[2022-05-16 04:45:06] [INFO ] Implicit Places using invariants in 19428 ms returned []
// Phase 1: matrix 1190 rows 1320 cols
[2022-05-16 04:45:08] [INFO ] Computed 600 place invariants in 1619 ms
[2022-05-16 04:47:48] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2022-05-16 04:47:48] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2022-05-16 04:47:48] [INFO ] Implicit Places using invariants and state equation in 161640 ms returned []
Implicit Place search using SMT with State Equation took 181071 ms to find 0 implicit places.
// Phase 1: matrix 1190 rows 1320 cols
[2022-05-16 04:47:50] [INFO ] Computed 600 place invariants in 1636 ms
[2022-05-16 04:47:57] [INFO ] Dead Transitions using invariants and state equation in 8719 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1320/1321 places, 1190/1190 transitions.
Finished structural reductions, in 1 iterations. Remains : 1320/1321 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s356 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1235 ms.
Product exploration explored 100000 steps with 50000 reset in 1218 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 : [p0, (X p0), true, (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 93 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d03r05-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r05-LTLCardinality-15 finished in 192866 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(F(F(G(X(G(p0))))))))))'
[2022-05-16 04:48:00] [INFO ] Flatten gal took : 71 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10810982531941608989
[2022-05-16 04:48:00] [INFO ] Computing symmetric may disable matrix : 1190 transitions.
[2022-05-16 04:48:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 04:48:00] [INFO ] Computing symmetric may enable matrix : 1190 transitions.
[2022-05-16 04:48:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 04:48:00] [INFO ] Applying decomposition
[2022-05-16 04:48:00] [INFO ] Flatten gal took : 72 ms
[2022-05-16 04:48:00] [INFO ] Computing Do-Not-Accords matrix : 1190 transitions.
[2022-05-16 04:48:00] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 04:48:00] [INFO ] Built C files in 199ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10810982531941608989
Running compilation step : cd /tmp/ltsmin10810982531941608989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9885154240907859017.txt' '-o' '/tmp/graph9885154240907859017.bin' '-w' '/tmp/graph9885154240907859017.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9885154240907859017.bin' '-l' '-1' '-v' '-w' '/tmp/graph9885154240907859017.weights' '-q' '0' '-e' '0.001'
[2022-05-16 04:48:00] [INFO ] Decomposing Gal with order
[2022-05-16 04:48:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 04:48:00] [INFO ] Removed a total of 1934 redundant transitions.
[2022-05-16 04:48:00] [INFO ] Flatten gal took : 135 ms
[2022-05-16 04:48:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 369 labels/synchronizations in 58 ms.
[2022-05-16 04:48:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality4784232610219967493.gal : 15 ms
[2022-05-16 04:48:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality2251083378161259556.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4784232610219967493.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2251083378161259556.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...267
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X(F(F(G(X(G("((i4.u56.p611==0)||(i9.i1.u55.p1196==1))")))))))))))
Formula 0 simplified : !XFXXFGXG"((i4.u56.p611==0)||(i9.i1.u55.p1196==1))"
Compilation finished in 4532 ms.
Running link step : cd /tmp/ltsmin10810982531941608989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin10810982531941608989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(X(<>(<>([](X([]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.077: LTL layer: formula: X(<>(X(X(<>(<>([](X([]((LTLAPp0==true))))))))))
pins2lts-mc-linux64( 4/ 8), 0.077: "X(<>(X(X(<>(<>([](X([]((LTLAPp0==true))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.078: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.101: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.103: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.102: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.103: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.237: There are 1192 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.238: State length is 1322, there are 1194 groups
pins2lts-mc-linux64( 0/ 8), 0.238: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.238: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.238: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.238: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.875: [Blue] ~120 levels ~960 states ~63024 transitions
pins2lts-mc-linux64( 4/ 8), 1.022: [Blue] ~240 levels ~1920 states ~92840 transitions
pins2lts-mc-linux64( 1/ 8), 1.144: [Blue] ~249 levels ~3840 states ~85168 transitions
pins2lts-mc-linux64( 3/ 8), 1.374: [Blue] ~249 levels ~7680 states ~103800 transitions
pins2lts-mc-linux64( 4/ 8), 1.819: [Blue] ~251 levels ~15360 states ~136128 transitions
pins2lts-mc-linux64( 4/ 8), 2.762: [Blue] ~251 levels ~30720 states ~190376 transitions
pins2lts-mc-linux64( 4/ 8), 4.604: [Blue] ~251 levels ~61440 states ~322856 transitions
pins2lts-mc-linux64( 3/ 8), 8.253: [Blue] ~249 levels ~122880 states ~630624 transitions
pins2lts-mc-linux64( 3/ 8), 15.400: [Blue] ~249 levels ~245760 states ~1283088 transitions
pins2lts-mc-linux64( 4/ 8), 29.646: [Blue] ~251 levels ~491520 states ~2448048 transitions
pins2lts-mc-linux64( 3/ 8), 57.899: [Blue] ~249 levels ~983040 states ~5680056 transitions
pins2lts-mc-linux64( 3/ 8), 113.154: [Blue] ~249 levels ~1966080 states ~11594400 transitions
pins2lts-mc-linux64( 3/ 8), 224.826: [Blue] ~249 levels ~3932160 states ~24594288 transitions
pins2lts-mc-linux64( 6/ 8), 449.167: [Blue] ~249 levels ~7864320 states ~49182112 transitions
pins2lts-mc-linux64( 6/ 8), 906.094: [Blue] ~249 levels ~15728640 states ~106189064 transitions
pins2lts-mc-linux64( 7/ 8), 1347.444: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1349.604:
pins2lts-mc-linux64( 0/ 8), 1349.604: Explored 21356209 states 155594671 transitions, fanout: 7.286
pins2lts-mc-linux64( 0/ 8), 1349.611: Total exploration time 1349.340 sec (1348.770 sec minimum, 1349.048 sec on average)
pins2lts-mc-linux64( 0/ 8), 1349.611: States per second: 15827, Transitions per second: 115312
pins2lts-mc-linux64( 0/ 8), 1349.611:
pins2lts-mc-linux64( 0/ 8), 1349.611: State space has 21379967 states, 1669268 are accepting
pins2lts-mc-linux64( 0/ 8), 1349.611: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1349.611: blue states: 21356209 (99.89%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1349.611: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1349.611: all-red states: 1669268 (7.81%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1349.612:
pins2lts-mc-linux64( 0/ 8), 1349.612: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1349.612:
pins2lts-mc-linux64( 0/ 8), 1349.612: Queue width: 8B, total height: 1989, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 1349.612: Tree memory: 419.1MB, 20.6 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 1349.612: Tree fill ratio (roots/leafs): 15.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1349.613: Stored 1383 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1349.631: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1349.632: Est. total memory use: 419.1MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10810982531941608989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(X(<>(<>([](X([]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10810982531941608989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(X(<>(<>([](X([]((LTLAPp0==true))))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-16 05:17:52] [INFO ] Applying decomposition
[2022-05-16 05:17:52] [INFO ] Flatten gal took : 483 ms
[2022-05-16 05:17:53] [INFO ] Decomposing Gal with order
[2022-05-16 05:17:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 05:17:53] [INFO ] Removed a total of 4680 redundant transitions.
[2022-05-16 05:17:54] [INFO ] Flatten gal took : 1360 ms
[2022-05-16 05:17:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 116 ms.
[2022-05-16 05:17:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality5375482854325024187.gal : 205 ms
[2022-05-16 05:17:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality3724897962193961916.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5375482854325024187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3724897962193961916.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...267
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X(F(F(G(X(G("((u612.p611==0)||(u65.p1196==1))")))))))))))
Formula 0 simplified : !XFXXFGXG"((u612.p611==0)||(u65.p1196==1))"

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-4028"
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 r078-tall-165260110300411"
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 ;