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.r222-tall-165286025300475.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 ShieldPPPs-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025300475
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 6.4K Apr 30 03:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 03:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 03:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 30 03:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 528K May 10 09:34 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 ShieldPPPs-PT-030B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652998375816

Running Version 202205111006
[2022-05-19 22:12:56] [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-19 22:12:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 22:12:57] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2022-05-19 22:12:57] [INFO ] Transformed 2043 places.
[2022-05-19 22:12:57] [INFO ] Transformed 1893 transitions.
[2022-05-19 22:12:57] [INFO ] Found NUPN structural information;
[2022-05-19 22:12:57] [INFO ] Parsed PT model containing 2043 places and 1893 transitions in 336 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 2043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Discarding 205 places :
Symmetric choice reduction at 0 with 205 rule applications. Total rules 205 place count 1838 transition count 1688
Iterating global reduction 0 with 205 rules applied. Total rules applied 410 place count 1838 transition count 1688
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 411 place count 1837 transition count 1687
Iterating global reduction 0 with 1 rules applied. Total rules applied 412 place count 1837 transition count 1687
Applied a total of 412 rules in 615 ms. Remains 1837 /2043 variables (removed 206) and now considering 1687/1893 (removed 206) transitions.
// Phase 1: matrix 1687 rows 1837 cols
[2022-05-19 22:12:58] [INFO ] Computed 331 place invariants in 37 ms
[2022-05-19 22:12:58] [INFO ] Implicit Places using invariants in 796 ms returned []
// Phase 1: matrix 1687 rows 1837 cols
[2022-05-19 22:12:58] [INFO ] Computed 331 place invariants in 9 ms
[2022-05-19 22:13:00] [INFO ] Implicit Places using invariants and state equation in 1676 ms returned []
Implicit Place search using SMT with State Equation took 2499 ms to find 0 implicit places.
// Phase 1: matrix 1687 rows 1837 cols
[2022-05-19 22:13:00] [INFO ] Computed 331 place invariants in 13 ms
[2022-05-19 22:13:01] [INFO ] Dead Transitions using invariants and state equation in 912 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1837/2043 places, 1687/1893 transitions.
Finished structural reductions, in 1 iterations. Remains : 1837/2043 places, 1687/1893 transitions.
Support contains 23 out of 1837 places after structural reductions.
[2022-05-19 22:13:01] [INFO ] Flatten gal took : 209 ms
[2022-05-19 22:13:01] [INFO ] Flatten gal took : 82 ms
[2022-05-19 22:13:02] [INFO ] Input system was already deterministic with 1687 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1687 rows 1837 cols
[2022-05-19 22:13:02] [INFO ] Computed 331 place invariants in 14 ms
[2022-05-19 22:13:02] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 22:13:03] [INFO ] [Nat]Absence check using 331 positive place invariants in 97 ms returned sat
[2022-05-19 22:13:03] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 362 stabilizing places and 362 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 2 out of 1837 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1837/1837 places, 1687/1687 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1832 transition count 1682
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1832 transition count 1682
Applied a total of 10 rules in 127 ms. Remains 1832 /1837 variables (removed 5) and now considering 1682/1687 (removed 5) transitions.
// Phase 1: matrix 1682 rows 1832 cols
[2022-05-19 22:13:03] [INFO ] Computed 331 place invariants in 13 ms
[2022-05-19 22:13:04] [INFO ] Implicit Places using invariants in 548 ms returned []
// Phase 1: matrix 1682 rows 1832 cols
[2022-05-19 22:13:04] [INFO ] Computed 331 place invariants in 5 ms
[2022-05-19 22:13:05] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2106 ms to find 0 implicit places.
// Phase 1: matrix 1682 rows 1832 cols
[2022-05-19 22:13:05] [INFO ] Computed 331 place invariants in 16 ms
[2022-05-19 22:13:06] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1832/1837 places, 1682/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 1832/1837 places, 1682/1687 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s1778 0) (EQ s1396 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 8 steps with 0 reset in 4 ms.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-00 finished in 3465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((!(p0 U G(p1))||p2))||G(p0)))))'
Support contains 6 out of 1837 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1837/1837 places, 1687/1687 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1833 transition count 1683
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1833 transition count 1683
Applied a total of 8 rules in 122 ms. Remains 1833 /1837 variables (removed 4) and now considering 1683/1687 (removed 4) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:13:07] [INFO ] Computed 331 place invariants in 11 ms
[2022-05-19 22:13:07] [INFO ] Implicit Places using invariants in 574 ms returned []
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:13:07] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 22:13:09] [INFO ] Implicit Places using invariants and state equation in 1700 ms returned []
Implicit Place search using SMT with State Equation took 2276 ms to find 0 implicit places.
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:13:09] [INFO ] Computed 331 place invariants in 11 ms
[2022-05-19 22:13:10] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1833/1837 places, 1683/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 1833/1837 places, 1683/1687 transitions.
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND p2 p1), acceptance={} source=6 dest: 3}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s1454 0) (EQ s153 1)), p2:(AND (EQ s1128 0) (EQ s646 1)), p1:(OR (EQ s850 0) (EQ s649 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20031 reset in 606 ms.
Product exploration explored 100000 steps with 20056 reset in 604 ms.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 7 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:13:12] [INFO ] Computed 331 place invariants in 7 ms
[2022-05-19 22:13:12] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 22:13:12] [INFO ] [Nat]Absence check using 331 positive place invariants in 105 ms returned sat
[2022-05-19 22:13:13] [INFO ] After 735ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 22:13:14] [INFO ] Deduced a trap composed of 27 places in 382 ms of which 5 ms to minimize.
[2022-05-19 22:13:14] [INFO ] Deduced a trap composed of 19 places in 363 ms of which 2 ms to minimize.
[2022-05-19 22:13:14] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 1 ms to minimize.
[2022-05-19 22:13:15] [INFO ] Deduced a trap composed of 24 places in 344 ms of which 2 ms to minimize.
[2022-05-19 22:13:15] [INFO ] Deduced a trap composed of 27 places in 353 ms of which 1 ms to minimize.
[2022-05-19 22:13:16] [INFO ] Deduced a trap composed of 27 places in 353 ms of which 1 ms to minimize.
[2022-05-19 22:13:16] [INFO ] Deduced a trap composed of 19 places in 357 ms of which 1 ms to minimize.
[2022-05-19 22:13:17] [INFO ] Deduced a trap composed of 30 places in 330 ms of which 1 ms to minimize.
[2022-05-19 22:13:17] [INFO ] Deduced a trap composed of 43 places in 339 ms of which 1 ms to minimize.
[2022-05-19 22:13:17] [INFO ] Deduced a trap composed of 24 places in 332 ms of which 1 ms to minimize.
[2022-05-19 22:13:18] [INFO ] Deduced a trap composed of 22 places in 326 ms of which 1 ms to minimize.
[2022-05-19 22:13:18] [INFO ] Deduced a trap composed of 20 places in 327 ms of which 1 ms to minimize.
[2022-05-19 22:13:18] [INFO ] Deduced a trap composed of 31 places in 327 ms of which 1 ms to minimize.
[2022-05-19 22:13:19] [INFO ] Deduced a trap composed of 33 places in 336 ms of which 1 ms to minimize.
[2022-05-19 22:13:19] [INFO ] Deduced a trap composed of 28 places in 337 ms of which 1 ms to minimize.
[2022-05-19 22:13:20] [INFO ] Deduced a trap composed of 24 places in 313 ms of which 1 ms to minimize.
[2022-05-19 22:13:20] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 1 ms to minimize.
[2022-05-19 22:13:20] [INFO ] Deduced a trap composed of 33 places in 304 ms of which 1 ms to minimize.
[2022-05-19 22:13:21] [INFO ] Deduced a trap composed of 32 places in 304 ms of which 1 ms to minimize.
[2022-05-19 22:13:21] [INFO ] Deduced a trap composed of 28 places in 335 ms of which 1 ms to minimize.
[2022-05-19 22:13:21] [INFO ] Deduced a trap composed of 48 places in 295 ms of which 1 ms to minimize.
[2022-05-19 22:13:22] [INFO ] Deduced a trap composed of 44 places in 296 ms of which 2 ms to minimize.
[2022-05-19 22:13:22] [INFO ] Deduced a trap composed of 30 places in 290 ms of which 1 ms to minimize.
[2022-05-19 22:13:23] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 0 ms to minimize.
[2022-05-19 22:13:23] [INFO ] Deduced a trap composed of 26 places in 287 ms of which 1 ms to minimize.
[2022-05-19 22:13:23] [INFO ] Deduced a trap composed of 35 places in 294 ms of which 1 ms to minimize.
[2022-05-19 22:13:24] [INFO ] Deduced a trap composed of 41 places in 278 ms of which 2 ms to minimize.
[2022-05-19 22:13:24] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 0 ms to minimize.
[2022-05-19 22:13:24] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 1 ms to minimize.
[2022-05-19 22:13:24] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 1 ms to minimize.
[2022-05-19 22:13:25] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 1 ms to minimize.
[2022-05-19 22:13:25] [INFO ] Deduced a trap composed of 36 places in 237 ms of which 1 ms to minimize.
[2022-05-19 22:13:25] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 1 ms to minimize.
[2022-05-19 22:13:26] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 1 ms to minimize.
[2022-05-19 22:13:26] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 1 ms to minimize.
[2022-05-19 22:13:26] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 1 ms to minimize.
[2022-05-19 22:13:26] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 12964 ms
[2022-05-19 22:13:26] [INFO ] After 13762ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2022-05-19 22:13:26] [INFO ] After 14157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 6 out of 1833 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1833 transition count 1473
Reduce places removed 210 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 212 rules applied. Total rules applied 422 place count 1623 transition count 1471
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 424 place count 1621 transition count 1471
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 424 place count 1621 transition count 1322
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 722 place count 1472 transition count 1322
Performed 537 Post agglomeration using F-continuation condition.Transition count delta: 537
Deduced a syphon composed of 537 places in 1 ms
Reduce places removed 537 places and 0 transitions.
Iterating global reduction 3 with 1074 rules applied. Total rules applied 1796 place count 935 transition count 785
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 265 times.
Drop transitions removed 265 transitions
Iterating global reduction 3 with 265 rules applied. Total rules applied 2061 place count 935 transition count 785
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2062 place count 934 transition count 784
Applied a total of 2062 rules in 591 ms. Remains 934 /1833 variables (removed 899) and now considering 784/1683 (removed 899) transitions.
Finished structural reductions, in 1 iterations. Remains : 934/1833 places, 784/1683 transitions.
Finished random walk after 1426 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=109 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (AND p0 p2)), (F (AND (NOT p0) p1 p2)), (F (NOT p0)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 4 factoid took 371 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 7 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Support contains 6 out of 1833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Applied a total of 0 rules in 77 ms. Remains 1833 /1833 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:13:28] [INFO ] Computed 331 place invariants in 12 ms
[2022-05-19 22:13:28] [INFO ] Implicit Places using invariants in 530 ms returned []
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:13:28] [INFO ] Computed 331 place invariants in 12 ms
[2022-05-19 22:13:30] [INFO ] Implicit Places using invariants and state equation in 1623 ms returned []
Implicit Place search using SMT with State Equation took 2154 ms to find 0 implicit places.
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:13:30] [INFO ] Computed 331 place invariants in 9 ms
[2022-05-19 22:13:31] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1833/1833 places, 1683/1683 transitions.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 7 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:13:32] [INFO ] Computed 331 place invariants in 6 ms
[2022-05-19 22:13:32] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 22:13:32] [INFO ] [Nat]Absence check using 331 positive place invariants in 100 ms returned sat
[2022-05-19 22:13:33] [INFO ] After 799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 22:13:33] [INFO ] Deduced a trap composed of 23 places in 379 ms of which 1 ms to minimize.
[2022-05-19 22:13:34] [INFO ] Deduced a trap composed of 35 places in 361 ms of which 1 ms to minimize.
[2022-05-19 22:13:34] [INFO ] Deduced a trap composed of 24 places in 343 ms of which 1 ms to minimize.
[2022-05-19 22:13:35] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 1 ms to minimize.
[2022-05-19 22:13:35] [INFO ] Deduced a trap composed of 24 places in 353 ms of which 1 ms to minimize.
[2022-05-19 22:13:36] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 1 ms to minimize.
[2022-05-19 22:13:36] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 1 ms to minimize.
[2022-05-19 22:13:36] [INFO ] Deduced a trap composed of 32 places in 333 ms of which 1 ms to minimize.
[2022-05-19 22:13:37] [INFO ] Deduced a trap composed of 30 places in 333 ms of which 1 ms to minimize.
[2022-05-19 22:13:37] [INFO ] Deduced a trap composed of 19 places in 357 ms of which 1 ms to minimize.
[2022-05-19 22:13:38] [INFO ] Deduced a trap composed of 19 places in 338 ms of which 1 ms to minimize.
[2022-05-19 22:13:38] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 1 ms to minimize.
[2022-05-19 22:13:38] [INFO ] Deduced a trap composed of 34 places in 293 ms of which 1 ms to minimize.
[2022-05-19 22:13:39] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 1 ms to minimize.
[2022-05-19 22:13:39] [INFO ] Deduced a trap composed of 27 places in 285 ms of which 1 ms to minimize.
[2022-05-19 22:13:39] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 1 ms to minimize.
[2022-05-19 22:13:40] [INFO ] Deduced a trap composed of 24 places in 301 ms of which 1 ms to minimize.
[2022-05-19 22:13:40] [INFO ] Deduced a trap composed of 50 places in 303 ms of which 1 ms to minimize.
[2022-05-19 22:13:40] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 1 ms to minimize.
[2022-05-19 22:13:41] [INFO ] Deduced a trap composed of 35 places in 255 ms of which 1 ms to minimize.
[2022-05-19 22:13:41] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 1 ms to minimize.
[2022-05-19 22:13:41] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 1 ms to minimize.
[2022-05-19 22:13:42] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 1 ms to minimize.
[2022-05-19 22:13:42] [INFO ] Deduced a trap composed of 33 places in 265 ms of which 1 ms to minimize.
[2022-05-19 22:13:42] [INFO ] Deduced a trap composed of 28 places in 253 ms of which 0 ms to minimize.
[2022-05-19 22:13:43] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 0 ms to minimize.
[2022-05-19 22:13:43] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 1 ms to minimize.
[2022-05-19 22:13:43] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 0 ms to minimize.
[2022-05-19 22:13:44] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 2 ms to minimize.
[2022-05-19 22:13:44] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 1 ms to minimize.
[2022-05-19 22:13:44] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 0 ms to minimize.
[2022-05-19 22:13:44] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 1 ms to minimize.
[2022-05-19 22:13:45] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 1 ms to minimize.
[2022-05-19 22:13:45] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 1 ms to minimize.
[2022-05-19 22:13:45] [INFO ] Deduced a trap composed of 41 places in 249 ms of which 1 ms to minimize.
[2022-05-19 22:13:46] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 1 ms to minimize.
[2022-05-19 22:13:46] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 1 ms to minimize.
[2022-05-19 22:13:46] [INFO ] Deduced a trap composed of 101 places in 259 ms of which 1 ms to minimize.
[2022-05-19 22:13:46] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 1 ms to minimize.
[2022-05-19 22:13:47] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 13464 ms
[2022-05-19 22:13:47] [INFO ] After 14333ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2022-05-19 22:13:47] [INFO ] After 14743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 6 out of 1833 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1833 transition count 1473
Reduce places removed 210 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 212 rules applied. Total rules applied 422 place count 1623 transition count 1471
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 424 place count 1621 transition count 1471
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 424 place count 1621 transition count 1322
Deduced a syphon composed of 149 places in 3 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 722 place count 1472 transition count 1322
Performed 537 Post agglomeration using F-continuation condition.Transition count delta: 537
Deduced a syphon composed of 537 places in 1 ms
Reduce places removed 537 places and 0 transitions.
Iterating global reduction 3 with 1074 rules applied. Total rules applied 1796 place count 935 transition count 785
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 265 times.
Drop transitions removed 265 transitions
Iterating global reduction 3 with 265 rules applied. Total rules applied 2061 place count 935 transition count 785
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2062 place count 934 transition count 784
Applied a total of 2062 rules in 262 ms. Remains 934 /1833 variables (removed 899) and now considering 784/1683 (removed 899) transitions.
Finished structural reductions, in 1 iterations. Remains : 934/1833 places, 784/1683 transitions.
Finished random walk after 1070 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=118 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (AND p2 p0)), (F (AND p1 p2 (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p2) p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 p2))]
Knowledge based reduction with 4 factoid took 352 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 7 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 382 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Product exploration explored 100000 steps with 19988 reset in 524 ms.
Product exploration explored 100000 steps with 20013 reset in 516 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Support contains 6 out of 1833 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Performed 211 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1833 transition count 1683
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 60 Pre rules applied. Total rules applied 211 place count 1833 transition count 1684
Deduced a syphon composed of 271 places in 2 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 271 place count 1833 transition count 1684
Performed 627 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 898 places in 2 ms
Iterating global reduction 1 with 627 rules applied. Total rules applied 898 place count 1833 transition count 1684
Renaming transitions due to excessive name length > 1024 char.
Discarding 211 places :
Symmetric choice reduction at 1 with 211 rule applications. Total rules 1109 place count 1622 transition count 1473
Deduced a syphon composed of 687 places in 1 ms
Iterating global reduction 1 with 211 rules applied. Total rules applied 1320 place count 1622 transition count 1473
Deduced a syphon composed of 687 places in 1 ms
Applied a total of 1320 rules in 679 ms. Remains 1622 /1833 variables (removed 211) and now considering 1473/1683 (removed 210) transitions.
[2022-05-19 22:13:50] [INFO ] Redundant transitions in 103 ms returned []
// Phase 1: matrix 1473 rows 1622 cols
[2022-05-19 22:13:50] [INFO ] Computed 331 place invariants in 16 ms
[2022-05-19 22:13:51] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1622/1833 places, 1473/1683 transitions.
Finished structural reductions, in 1 iterations. Remains : 1622/1833 places, 1473/1683 transitions.
Product exploration explored 100000 steps with 20098 reset in 2550 ms.
Product exploration explored 100000 steps with 20002 reset in 2491 ms.
Built C files in :
/tmp/ltsmin11183367135345221310
[2022-05-19 22:13:56] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11183367135345221310
Running compilation step : cd /tmp/ltsmin11183367135345221310;'/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/ltsmin11183367135345221310;'/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/ltsmin11183367135345221310;'/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 6 out of 1833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Applied a total of 0 rules in 51 ms. Remains 1833 /1833 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:13:59] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 22:14:00] [INFO ] Implicit Places using invariants in 558 ms returned []
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:14:00] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 22:14:01] [INFO ] Implicit Places using invariants and state equation in 1488 ms returned []
Implicit Place search using SMT with State Equation took 2048 ms to find 0 implicit places.
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:14:01] [INFO ] Computed 331 place invariants in 13 ms
[2022-05-19 22:14:02] [INFO ] Dead Transitions using invariants and state equation in 842 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1833/1833 places, 1683/1683 transitions.
Built C files in :
/tmp/ltsmin11287430894244479081
[2022-05-19 22:14:02] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11287430894244479081
Running compilation step : cd /tmp/ltsmin11287430894244479081;'/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 2996 ms.
Running link step : cd /tmp/ltsmin11287430894244479081;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11287430894244479081;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6182227028848584164.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 22:14:18] [INFO ] Flatten gal took : 64 ms
[2022-05-19 22:14:18] [INFO ] Flatten gal took : 62 ms
[2022-05-19 22:14:18] [INFO ] Time to serialize gal into /tmp/LTL11044013283460595855.gal : 13 ms
[2022-05-19 22:14:18] [INFO ] Time to serialize properties into /tmp/LTL12631057856707149878.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/LTL11044013283460595855.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12631057856707149878.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/LTL1104401...268
Read 1 LTL properties
Checking formula 0 : !((X(X((G((!(("((p1617==0)||(p167==1))")U(G("((p942==0)||(p719==1))"))))||("((p1254==0)&&(p716==1))")))||(G("((p1617==0)||(p167==1))")...160
Formula 0 simplified : !XX(G("((p1254==0)&&(p716==1))" | !("((p1617==0)||(p167==1))" U G"((p942==0)||(p719==1))")) | G"((p1617==0)||(p167==1))")
Detected timeout of ITS tools.
[2022-05-19 22:14:33] [INFO ] Flatten gal took : 59 ms
[2022-05-19 22:14:33] [INFO ] Applying decomposition
[2022-05-19 22:14:33] [INFO ] Flatten gal took : 56 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/graph8689693416772331829.txt' '-o' '/tmp/graph8689693416772331829.bin' '-w' '/tmp/graph8689693416772331829.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8689693416772331829.bin' '-l' '-1' '-v' '-w' '/tmp/graph8689693416772331829.weights' '-q' '0' '-e' '0.001'
[2022-05-19 22:14:33] [INFO ] Decomposing Gal with order
[2022-05-19 22:14:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 22:14:33] [INFO ] Removed a total of 270 redundant transitions.
[2022-05-19 22:14:33] [INFO ] Flatten gal took : 165 ms
[2022-05-19 22:14:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2022-05-19 22:14:33] [INFO ] Time to serialize gal into /tmp/LTL12271357954681491708.gal : 24 ms
[2022-05-19 22:14:33] [INFO ] Time to serialize properties into /tmp/LTL12936015498822097258.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/LTL12271357954681491708.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12936015498822097258.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/LTL1227135...247
Read 1 LTL properties
Checking formula 0 : !((X(X((G((!(("((i23.i0.i0.u571.p1617==0)||(i2.u62.p167==1))")U(G("((i13.u332.p942==0)||(i10.i3.i0.u255.p719==1))"))))||("((i18.u440.p...252
Formula 0 simplified : !XX(G("((i18.u440.p1254==0)&&(i10.i3.i0.u254.p716==1))" | !("((i23.i0.i0.u571.p1617==0)||(i2.u62.p167==1))" U G"((i13.u332.p942==0)|...236
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12357486976659129295
[2022-05-19 22:14:49] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12357486976659129295
Running compilation step : cd /tmp/ltsmin12357486976659129295;'/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/ltsmin12357486976659129295;'/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/ltsmin12357486976659129295;'/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)
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-01 finished in 105188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 1837 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1837/1837 places, 1687/1687 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1833 transition count 1683
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1833 transition count 1683
Applied a total of 8 rules in 107 ms. Remains 1833 /1837 variables (removed 4) and now considering 1683/1687 (removed 4) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:14:52] [INFO ] Computed 331 place invariants in 8 ms
[2022-05-19 22:14:52] [INFO ] Implicit Places using invariants in 538 ms returned []
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:14:52] [INFO ] Computed 331 place invariants in 7 ms
[2022-05-19 22:14:54] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2292 ms to find 0 implicit places.
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:14:54] [INFO ] Computed 331 place invariants in 11 ms
[2022-05-19 22:14:55] [INFO ] Dead Transitions using invariants and state equation in 929 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1833/1837 places, 1683/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 1833/1837 places, 1683/1687 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-02 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 s1434 0) (EQ s1708 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 1197 steps with 0 reset in 9 ms.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-02 finished in 3607 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F(p1))&&p0))))'
Support contains 3 out of 1837 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1837/1837 places, 1687/1687 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1836 transition count 1476
Reduce places removed 210 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 211 rules applied. Total rules applied 421 place count 1626 transition count 1475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 422 place count 1625 transition count 1475
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 422 place count 1625 transition count 1325
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 722 place count 1475 transition count 1325
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 727 place count 1470 transition count 1320
Iterating global reduction 3 with 5 rules applied. Total rules applied 732 place count 1470 transition count 1320
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 732 place count 1470 transition count 1319
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 734 place count 1469 transition count 1319
Performed 536 Post agglomeration using F-continuation condition.Transition count delta: 536
Deduced a syphon composed of 536 places in 0 ms
Reduce places removed 536 places and 0 transitions.
Iterating global reduction 3 with 1072 rules applied. Total rules applied 1806 place count 933 transition count 783
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1808 place count 931 transition count 781
Applied a total of 1808 rules in 305 ms. Remains 931 /1837 variables (removed 906) and now considering 781/1687 (removed 906) transitions.
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 22:14:55] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 22:14:56] [INFO ] Implicit Places using invariants in 395 ms returned []
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 22:14:56] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 22:14:57] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
[2022-05-19 22:14:57] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 781 rows 931 cols
[2022-05-19 22:14:57] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 22:14:57] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 931/1837 places, 781/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 931/1837 places, 781/1687 transitions.
Stuttering acceptance computed with spot in 1219 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s395 0) (EQ s395 1)) (OR (EQ s637 0) (EQ s746 1))), p1:(OR (EQ s637 0) (EQ s746 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6037 steps with 2 reset in 56 ms.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-13 finished in 3208 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(X(p0))&&p1))))'
Support contains 3 out of 1837 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1837/1837 places, 1687/1687 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1833 transition count 1683
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1833 transition count 1683
Applied a total of 8 rules in 120 ms. Remains 1833 /1837 variables (removed 4) and now considering 1683/1687 (removed 4) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:14:59] [INFO ] Computed 331 place invariants in 10 ms
[2022-05-19 22:14:59] [INFO ] Implicit Places using invariants in 593 ms returned []
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:14:59] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 22:15:01] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned []
Implicit Place search using SMT with State Equation took 2230 ms to find 0 implicit places.
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:15:01] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 22:15:02] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1833/1837 places, 1683/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 1833/1837 places, 1683/1687 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s708 0) (EQ s742 1)), p1:(EQ s1568 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]]
Stuttering criterion allowed to conclude after 4581 steps with 0 reset in 35 ms.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-14 finished in 3417 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1837 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1837/1837 places, 1687/1687 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1833 transition count 1683
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1833 transition count 1683
Applied a total of 8 rules in 123 ms. Remains 1833 /1837 variables (removed 4) and now considering 1683/1687 (removed 4) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:15:02] [INFO ] Computed 331 place invariants in 9 ms
[2022-05-19 22:15:03] [INFO ] Implicit Places using invariants in 588 ms returned []
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:15:03] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 22:15:04] [INFO ] Implicit Places using invariants and state equation in 1654 ms returned []
Implicit Place search using SMT with State Equation took 2243 ms to find 0 implicit places.
// Phase 1: matrix 1683 rows 1833 cols
[2022-05-19 22:15:04] [INFO ] Computed 331 place invariants in 6 ms
[2022-05-19 22:15:05] [INFO ] Dead Transitions using invariants and state equation in 945 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1833/1837 places, 1683/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 1833/1837 places, 1683/1687 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-15 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 s33 0) (EQ s1513 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 1026 ms.
Product exploration explored 100000 steps with 50000 reset in 994 ms.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Detected a total of 360/1833 stabilizing places and 360/1683 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
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 65 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-15 finished in 5515 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((!(p0 U G(p1))||p2))||G(p0)))))'
Found a SL insensitive property : ShieldPPPs-PT-030B-LTLCardinality-01
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Support contains 6 out of 1837 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1837/1837 places, 1687/1687 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1836 transition count 1476
Reduce places removed 210 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 212 rules applied. Total rules applied 422 place count 1626 transition count 1474
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 424 place count 1624 transition count 1474
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 424 place count 1624 transition count 1325
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 722 place count 1475 transition count 1325
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 726 place count 1471 transition count 1321
Iterating global reduction 3 with 4 rules applied. Total rules applied 730 place count 1471 transition count 1321
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 730 place count 1471 transition count 1320
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 732 place count 1470 transition count 1320
Performed 534 Post agglomeration using F-continuation condition.Transition count delta: 534
Deduced a syphon composed of 534 places in 1 ms
Reduce places removed 534 places and 0 transitions.
Iterating global reduction 3 with 1068 rules applied. Total rules applied 1800 place count 936 transition count 786
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1802 place count 934 transition count 784
Applied a total of 1802 rules in 298 ms. Remains 934 /1837 variables (removed 903) and now considering 784/1687 (removed 903) transitions.
// Phase 1: matrix 784 rows 934 cols
[2022-05-19 22:15:08] [INFO ] Computed 331 place invariants in 7 ms
[2022-05-19 22:15:08] [INFO ] Implicit Places using invariants in 364 ms returned []
// Phase 1: matrix 784 rows 934 cols
[2022-05-19 22:15:08] [INFO ] Computed 331 place invariants in 1 ms
[2022-05-19 22:15:09] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
// Phase 1: matrix 784 rows 934 cols
[2022-05-19 22:15:09] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 22:15:10] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 934/1837 places, 784/1687 transitions.
Finished structural reductions, in 1 iterations. Remains : 934/1837 places, 784/1687 transitions.
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND p2 p1), acceptance={} source=6 dest: 3}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s739 0) (EQ s65 1)), p2:(AND (EQ s567 0) (EQ s317 1)), p1:(OR (EQ s428 0) (EQ s320 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19979 reset in 658 ms.
Product exploration explored 100000 steps with 19988 reset in 756 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 7 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 784 rows 934 cols
[2022-05-19 22:15:12] [INFO ] Computed 331 place invariants in 3 ms
[2022-05-19 22:15:12] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 22:15:12] [INFO ] [Nat]Absence check using 331 positive place invariants in 45 ms returned sat
[2022-05-19 22:15:12] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 22:15:12] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2022-05-19 22:15:12] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2022-05-19 22:15:12] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2022-05-19 22:15:13] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2022-05-19 22:15:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 400 ms
[2022-05-19 22:15:13] [INFO ] After 733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-05-19 22:15:13] [INFO ] After 934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 934 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 934/934 places, 784/784 transitions.
Partial Free-agglomeration rule applied 186 times.
Drop transitions removed 186 transitions
Iterating global reduction 0 with 186 rules applied. Total rules applied 186 place count 934 transition count 784
Applied a total of 186 rules in 41 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 934/934 places, 784/784 transitions.
Finished random walk after 2313 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=100 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (AND p0 p2)), (F (AND (NOT p0) p1 p2)), (F (NOT p0)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p1 p2))]
Knowledge based reduction with 4 factoid took 350 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 7 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Support contains 6 out of 934 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 24 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
// Phase 1: matrix 784 rows 934 cols
[2022-05-19 22:15:14] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 22:15:14] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 784 rows 934 cols
[2022-05-19 22:15:14] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 22:15:15] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
// Phase 1: matrix 784 rows 934 cols
[2022-05-19 22:15:15] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 22:15:15] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 934/934 places, 784/784 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 7 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 784 rows 934 cols
[2022-05-19 22:15:16] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 22:15:16] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 22:15:16] [INFO ] [Nat]Absence check using 331 positive place invariants in 52 ms returned sat
[2022-05-19 22:15:16] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 22:15:16] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2022-05-19 22:15:16] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2022-05-19 22:15:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2022-05-19 22:15:17] [INFO ] After 522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-19 22:15:17] [INFO ] After 723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 934 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 934/934 places, 784/784 transitions.
Partial Free-agglomeration rule applied 186 times.
Drop transitions removed 186 transitions
Iterating global reduction 0 with 186 rules applied. Total rules applied 186 place count 934 transition count 784
Applied a total of 186 rules in 41 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 934/934 places, 784/784 transitions.
Finished random walk after 1572 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=92 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (AND p2 p0)), (F (AND p1 p2 (NOT p0))), (F (NOT p0)), (F (NOT (AND (NOT p2) p0))), (F (AND p1 (NOT p2) (NOT p0))), (F (AND p1 p2))]
Knowledge based reduction with 4 factoid took 410 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 7 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 402 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 641 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Product exploration explored 100000 steps with 19950 reset in 683 ms.
Product exploration explored 100000 steps with 19978 reset in 761 ms.
Applying partial POR strategy [false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1, (AND p1 (NOT p2)), (AND p1 (NOT p0) p2), (AND p1 p2)]
Support contains 6 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 19 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2022-05-19 22:15:20] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 784 rows 934 cols
[2022-05-19 22:15:20] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 22:15:21] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 934/934 places, 784/784 transitions.
Product exploration explored 100000 steps with 20043 reset in 2995 ms.
Product exploration explored 100000 steps with 20119 reset in 3118 ms.
Built C files in :
/tmp/ltsmin5975518498309251033
[2022-05-19 22:15:27] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5975518498309251033
Running compilation step : cd /tmp/ltsmin5975518498309251033;'/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 1326 ms.
Running link step : cd /tmp/ltsmin5975518498309251033;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5975518498309251033;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased400023676128726195.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 934 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 22 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
// Phase 1: matrix 784 rows 934 cols
[2022-05-19 22:15:42] [INFO ] Computed 331 place invariants in 2 ms
[2022-05-19 22:15:42] [INFO ] Implicit Places using invariants in 401 ms returned []
// Phase 1: matrix 784 rows 934 cols
[2022-05-19 22:15:42] [INFO ] Computed 331 place invariants in 1 ms
[2022-05-19 22:15:43] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
// Phase 1: matrix 784 rows 934 cols
[2022-05-19 22:15:43] [INFO ] Computed 331 place invariants in 4 ms
[2022-05-19 22:15:44] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 934/934 places, 784/784 transitions.
Built C files in :
/tmp/ltsmin15340488932808824864
[2022-05-19 22:15:44] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15340488932808824864
Running compilation step : cd /tmp/ltsmin15340488932808824864;'/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 1257 ms.
Running link step : cd /tmp/ltsmin15340488932808824864;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15340488932808824864;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8411863838335542288.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 22:15:59] [INFO ] Flatten gal took : 29 ms
[2022-05-19 22:15:59] [INFO ] Flatten gal took : 27 ms
[2022-05-19 22:15:59] [INFO ] Time to serialize gal into /tmp/LTL9810710746680319010.gal : 4 ms
[2022-05-19 22:15:59] [INFO ] Time to serialize properties into /tmp/LTL17612711865443372608.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/LTL9810710746680319010.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17612711865443372608.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/LTL9810710...267
Read 1 LTL properties
Checking formula 0 : !((X(X((G((!(("((p1617==0)||(p167==1))")U(G("((p942==0)||(p719==1))"))))||("((p1254==0)&&(p716==1))")))||(G("((p1617==0)||(p167==1))")...160
Formula 0 simplified : !XX(G("((p1254==0)&&(p716==1))" | !("((p1617==0)||(p167==1))" U G"((p942==0)||(p719==1))")) | G"((p1617==0)||(p167==1))")
Detected timeout of ITS tools.
[2022-05-19 22:16:14] [INFO ] Flatten gal took : 26 ms
[2022-05-19 22:16:14] [INFO ] Applying decomposition
[2022-05-19 22:16:14] [INFO ] Flatten gal took : 27 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/graph3748611084065936305.txt' '-o' '/tmp/graph3748611084065936305.bin' '-w' '/tmp/graph3748611084065936305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3748611084065936305.bin' '-l' '-1' '-v' '-w' '/tmp/graph3748611084065936305.weights' '-q' '0' '-e' '0.001'
[2022-05-19 22:16:14] [INFO ] Decomposing Gal with order
[2022-05-19 22:16:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 22:16:14] [INFO ] Removed a total of 181 redundant transitions.
[2022-05-19 22:16:14] [INFO ] Flatten gal took : 46 ms
[2022-05-19 22:16:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 364 labels/synchronizations in 13 ms.
[2022-05-19 22:16:14] [INFO ] Time to serialize gal into /tmp/LTL18432731045024143542.gal : 7 ms
[2022-05-19 22:16:15] [INFO ] Time to serialize properties into /tmp/LTL8485074763394921204.ltl : 1125 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/LTL18432731045024143542.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8485074763394921204.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/LTL1843273...246
Read 1 LTL properties
Checking formula 0 : !((X(X((G((!(("((i23.i2.u263.p1617==0)||(i2.i0.u31.p167==1))")U(G("((i13.i1.u152.p942==0)||(i10.i1.u114.p719==1))"))))||("((i18.i0.u20...252
Formula 0 simplified : !XX(G("((i18.i0.u201.p1254==0)&&(i10.i1.u112.p716==1))" | !("((i23.i2.u263.p1617==0)||(i2.i0.u31.p167==1))" U G"((i13.i1.u152.p942==...236
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8010378800114809250
[2022-05-19 22:16:30] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8010378800114809250
Running compilation step : cd /tmp/ltsmin8010378800114809250;'/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 1273 ms.
Running link step : cd /tmp/ltsmin8010378800114809250;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8010378800114809250;'/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(([]((!((LTLAPp0==true) U []((LTLAPp1==true)))||(LTLAPp2==true)))||[]((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-01 finished in 98063 ms.
[2022-05-19 22:16:45] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2144220292024580870
[2022-05-19 22:16:45] [INFO ] Too many transitions (1687) to apply POR reductions. Disabling POR matrices.
[2022-05-19 22:16:45] [INFO ] Applying decomposition
[2022-05-19 22:16:45] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2144220292024580870
Running compilation step : cd /tmp/ltsmin2144220292024580870;'/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'
[2022-05-19 22:16:46] [INFO ] Flatten gal took : 45 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/graph10905573104437401762.txt' '-o' '/tmp/graph10905573104437401762.bin' '-w' '/tmp/graph10905573104437401762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10905573104437401762.bin' '-l' '-1' '-v' '-w' '/tmp/graph10905573104437401762.weights' '-q' '0' '-e' '0.001'
[2022-05-19 22:16:46] [INFO ] Decomposing Gal with order
[2022-05-19 22:16:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 22:16:46] [INFO ] Removed a total of 270 redundant transitions.
[2022-05-19 22:16:46] [INFO ] Flatten gal took : 81 ms
[2022-05-19 22:16:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-19 22:16:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality13394038571009198541.gal : 14 ms
[2022-05-19 22:16:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality10292221530455708531.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/LTLCardinality13394038571009198541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10292221530455708531.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...269
Read 1 LTL properties
Checking formula 0 : !((X(X((G((!(("((i23.i0.i1.u577.p1617==0)||(i2.i0.i0.u63.p167==1))")U(G("((i13.i2.i1.u338.p942==0)||(i10.i1.i0.u258.p719==1))"))))||("...270
Formula 0 simplified : !XX(G("((i18.u447.p1254==0)&&(i10.i1.i0.u257.p716==1))" | !("((i23.i0.i1.u577.p1617==0)||(i2.i0.i0.u63.p167==1))" U G"((i13.i2.i1.u3...254
Compilation finished in 3324 ms.
Running link step : cd /tmp/ltsmin2144220292024580870;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2144220292024580870;'/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(([]((!((LTLAPp0==true) U []((LTLAPp1==true)))||(LTLAPp2==true)))||[]((LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 22:38:04] [INFO ] Applying decomposition
[2022-05-19 22:38:05] [INFO ] Flatten gal took : 451 ms
[2022-05-19 22:38:05] [INFO ] Decomposing Gal with order
[2022-05-19 22:38:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 22:38:07] [INFO ] Removed a total of 180 redundant transitions.
[2022-05-19 22:38:07] [INFO ] Flatten gal took : 493 ms
[2022-05-19 22:38:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 360 labels/synchronizations in 201 ms.
[2022-05-19 22:38:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality13825643955335885735.gal : 100 ms
[2022-05-19 22:38:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality1724483399502388391.ltl : 2 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/LTLCardinality13825643955335885735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1724483399502388391.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...268
Read 1 LTL properties
Checking formula 0 : !((X(X((G((!(("((i0.i0.i0.i0.i0.i0.i1.i0.i0.u532.p1617==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...701
Formula 0 simplified : !XX(G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u418.p1254==0)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...685
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: LTL layer: formula: X(X(([]((!((LTLAPp0==true) U []((LTLAPp1==true)))||(LTLAPp2==true)))||[]((LTLAPp0==true)))))
pins2lts-mc-linux64( 0/ 8), 0.023: "X(X(([]((!((LTLAPp0==true) U []((LTLAPp1==true)))||(LTLAPp2==true)))||[]((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.050: buchi has 7 states
pins2lts-mc-linux64( 0/ 8), 0.061: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.310: DFS-FIFO for weak LTL, using special progress label 1691
pins2lts-mc-linux64( 0/ 8), 0.310: There are 1692 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.310: State length is 1838, there are 1701 groups
pins2lts-mc-linux64( 0/ 8), 0.310: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.310: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.310: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.310: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.464: ~1 levels ~960 states ~4712 transitions
pins2lts-mc-linux64( 2/ 8), 0.590: ~1 levels ~1920 states ~11080 transitions
pins2lts-mc-linux64( 2/ 8), 0.900: ~1 levels ~3840 states ~23272 transitions
pins2lts-mc-linux64( 2/ 8), 1.461: ~1 levels ~7680 states ~50936 transitions
pins2lts-mc-linux64( 2/ 8), 2.525: ~1 levels ~15360 states ~111448 transitions
pins2lts-mc-linux64( 5/ 8), 4.626: ~1 levels ~30720 states ~249328 transitions
pins2lts-mc-linux64( 5/ 8), 8.590: ~1 levels ~61440 states ~498080 transitions
pins2lts-mc-linux64( 4/ 8), 16.773: ~1 levels ~122880 states ~1036984 transitions
pins2lts-mc-linux64( 3/ 8), 32.692: ~1 levels ~245760 states ~2344576 transitions
pins2lts-mc-linux64( 4/ 8), 64.071: ~1 levels ~491520 states ~4499672 transitions
pins2lts-mc-linux64( 4/ 8), 129.535: ~1 levels ~983040 states ~9405192 transitions
pins2lts-mc-linux64( 5/ 8), 279.685: ~1 levels ~1966080 states ~20783216 transitions
pins2lts-mc-linux64( 3/ 8), 548.532: ~1 levels ~3932160 states ~45179568 transitions
pins2lts-mc-linux64( 4/ 8), 1091.006: ~1 levels ~7864320 states ~87315208 transitions
pins2lts-mc-linux64( 7/ 8), 1763.928: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1764.012:
pins2lts-mc-linux64( 0/ 8), 1764.012: mean standard work distribution: 1.9% (states) 2.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 1764.012:
pins2lts-mc-linux64( 0/ 8), 1764.012: Explored 12206084 states 149617272 transitions, fanout: 12.258
pins2lts-mc-linux64( 0/ 8), 1764.013: Total exploration time 1763.700 sec (1763.640 sec minimum, 1763.661 sec on average)
pins2lts-mc-linux64( 0/ 8), 1764.013: States per second: 6921, Transitions per second: 84831
pins2lts-mc-linux64( 0/ 8), 1764.013:
pins2lts-mc-linux64( 0/ 8), 1764.013: Progress states detected: 29188102
pins2lts-mc-linux64( 0/ 8), 1764.013: Redundant explorations: -58.1814
pins2lts-mc-linux64( 0/ 8), 1764.013:
pins2lts-mc-linux64( 0/ 8), 1764.013: Queue width: 8B, total height: 25699958, memory: 196.08MB
pins2lts-mc-linux64( 0/ 8), 1764.013: Tree memory: 478.7MB, 17.2 B/state, compr.: 0.2%
pins2lts-mc-linux64( 0/ 8), 1764.013: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1764.014: Stored 1779 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1764.029: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1764.032: Est. total memory use: 674.8MB (~1220.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2144220292024580870;'/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(([]((!((LTLAPp0==true) U []((LTLAPp1==true)))||(LTLAPp2==true)))||[]((LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2144220292024580870;'/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(([]((!((LTLAPp0==true) U []((LTLAPp1==true)))||(LTLAPp2==true)))||[]((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-19 22:59:29] [INFO ] Flatten gal took : 312 ms
[2022-05-19 22:59:31] [INFO ] Input system was already deterministic with 1687 transitions.
[2022-05-19 22:59:31] [INFO ] Transformed 1837 places.
[2022-05-19 22:59:31] [INFO ] Transformed 1687 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-19 22:59:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality4465382855606229965.gal : 19 ms
[2022-05-19 22:59:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality2041603006544385261.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/LTLCardinality4465382855606229965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2041603006544385261.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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/LTLCardina...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((G((!(("((p1617==0)||(p167==1))")U(G("((p942==0)||(p719==1))"))))||("((p1254==0)&&(p716==1))")))||(G("((p1617==0)||(p167==1))")...160
Formula 0 simplified : !XX(G("((p1254==0)&&(p716==1))" | !("((p1617==0)||(p167==1))" U G"((p942==0)||(p719==1))")) | G"((p1617==0)||(p167==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
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldPPPs-PT-030B"
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 ShieldPPPs-PT-030B, 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 r222-tall-165286025300475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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